./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db687a7-8499-48a2-ba03-998712c40009/bin/uautomizer-vX5HgA9Q3a/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db687a7-8499-48a2-ba03-998712c40009/bin/uautomizer-vX5HgA9Q3a/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db687a7-8499-48a2-ba03-998712c40009/bin/uautomizer-vX5HgA9Q3a/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db687a7-8499-48a2-ba03-998712c40009/bin/uautomizer-vX5HgA9Q3a/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db687a7-8499-48a2-ba03-998712c40009/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db687a7-8499-48a2-ba03-998712c40009/bin/uautomizer-vX5HgA9Q3a --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6fbcf05da5228307460c10a1ab2d8431ff74359811f7e2c9b55e8eaa9db8f14c --- 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-b5237d8 [2022-11-21 13:45:06,088 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-21 13:45:06,091 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-21 13:45:06,137 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-21 13:45:06,138 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-21 13:45:06,142 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-21 13:45:06,145 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-21 13:45:06,148 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-21 13:45:06,151 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-21 13:45:06,157 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-21 13:45:06,159 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-21 13:45:06,161 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-21 13:45:06,161 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-21 13:45:06,164 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-21 13:45:06,166 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-21 13:45:06,168 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-21 13:45:06,170 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-21 13:45:06,171 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-21 13:45:06,173 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-21 13:45:06,180 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-21 13:45:06,182 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-21 13:45:06,184 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-21 13:45:06,186 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-21 13:45:06,187 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-21 13:45:06,198 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-21 13:45:06,198 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-21 13:45:06,199 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-21 13:45:06,201 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-21 13:45:06,202 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-21 13:45:06,204 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-21 13:45:06,205 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-21 13:45:06,206 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-21 13:45:06,208 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-21 13:45:06,209 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-21 13:45:06,211 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-21 13:45:06,211 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-21 13:45:06,212 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-21 13:45:06,213 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-21 13:45:06,213 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-21 13:45:06,214 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-21 13:45:06,216 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-21 13:45:06,217 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db687a7-8499-48a2-ba03-998712c40009/bin/uautomizer-vX5HgA9Q3a/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-21 13:45:06,260 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-21 13:45:06,261 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-21 13:45:06,262 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-21 13:45:06,262 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-21 13:45:06,263 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-21 13:45:06,264 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-21 13:45:06,265 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-21 13:45:06,265 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-21 13:45:06,266 INFO L138 SettingsManager]: * Use SBE=true [2022-11-21 13:45:06,266 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-21 13:45:06,267 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-21 13:45:06,268 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-21 13:45:06,268 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-21 13:45:06,269 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-21 13:45:06,269 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-21 13:45:06,269 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-21 13:45:06,270 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-21 13:45:06,270 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-21 13:45:06,270 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-21 13:45:06,271 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-21 13:45:06,271 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-21 13:45:06,271 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:45:06,272 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-21 13:45:06,272 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-21 13:45:06,272 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-21 13:45:06,273 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-21 13:45:06,273 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-21 13:45:06,273 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-21 13:45:06,274 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-21 13:45:06,275 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-21 13:45:06,275 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_5db687a7-8499-48a2-ba03-998712c40009/bin/uautomizer-vX5HgA9Q3a/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_5db687a7-8499-48a2-ba03-998712c40009/bin/uautomizer-vX5HgA9Q3a 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 ! call(reach_error())) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6fbcf05da5228307460c10a1ab2d8431ff74359811f7e2c9b55e8eaa9db8f14c [2022-11-21 13:45:06,607 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-21 13:45:06,648 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-21 13:45:06,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-21 13:45:06,653 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-21 13:45:06,654 INFO L275 PluginConnector]: CDTParser initialized [2022-11-21 13:45:06,655 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db687a7-8499-48a2-ba03-998712c40009/bin/uautomizer-vX5HgA9Q3a/../../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i [2022-11-21 13:45:09,822 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-21 13:45:10,621 INFO L351 CDTParser]: Found 1 translation units. [2022-11-21 13:45:10,622 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i [2022-11-21 13:45:10,697 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db687a7-8499-48a2-ba03-998712c40009/bin/uautomizer-vX5HgA9Q3a/data/9f9728c62/dfadc64db9964e438d58d9663f6055d4/FLAG43aaa8fd2 [2022-11-21 13:45:10,718 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db687a7-8499-48a2-ba03-998712c40009/bin/uautomizer-vX5HgA9Q3a/data/9f9728c62/dfadc64db9964e438d58d9663f6055d4 [2022-11-21 13:45:10,722 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-21 13:45:10,724 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-21 13:45:10,729 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-21 13:45:10,730 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-21 13:45:10,734 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-21 13:45:10,735 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:45:10" (1/1) ... [2022-11-21 13:45:10,737 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@632dea6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:10, skipping insertion in model container [2022-11-21 13:45:10,737 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.11 01:45:10" (1/1) ... [2022-11-21 13:45:10,747 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-21 13:45:10,936 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-21 13:45:14,246 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307309,307322] [2022-11-21 13:45:14,251 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307454,307467] [2022-11-21 13:45:14,252 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307600,307613] [2022-11-21 13:45:14,252 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307765,307778] [2022-11-21 13:45:14,253 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307923,307936] [2022-11-21 13:45:14,254 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308081,308094] [2022-11-21 13:45:14,254 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308239,308252] [2022-11-21 13:45:14,255 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308399,308412] [2022-11-21 13:45:14,256 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308558,308571] [2022-11-21 13:45:14,256 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308697,308710] [2022-11-21 13:45:14,257 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308839,308852] [2022-11-21 13:45:14,258 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308988,309001] [2022-11-21 13:45:14,258 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309127,309140] [2022-11-21 13:45:14,259 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309282,309295] [2022-11-21 13:45:14,260 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309442,309455] [2022-11-21 13:45:14,260 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309593,309606] [2022-11-21 13:45:14,261 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309744,309757] [2022-11-21 13:45:14,262 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309896,309909] [2022-11-21 13:45:14,263 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310045,310058] [2022-11-21 13:45:14,263 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310193,310206] [2022-11-21 13:45:14,264 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310350,310363] [2022-11-21 13:45:14,264 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310499,310512] [2022-11-21 13:45:14,265 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310655,310668] [2022-11-21 13:45:14,266 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310808,310821] [2022-11-21 13:45:14,267 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310954,310967] [2022-11-21 13:45:14,269 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311097,311110] [2022-11-21 13:45:14,270 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311249,311262] [2022-11-21 13:45:14,271 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311395,311408] [2022-11-21 13:45:14,272 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311540,311553] [2022-11-21 13:45:14,272 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311694,311707] [2022-11-21 13:45:14,273 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311845,311858] [2022-11-21 13:45:14,275 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312000,312013] [2022-11-21 13:45:14,276 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312152,312165] [2022-11-21 13:45:14,277 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312307,312320] [2022-11-21 13:45:14,279 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312471,312484] [2022-11-21 13:45:14,281 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312627,312640] [2022-11-21 13:45:14,282 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312791,312804] [2022-11-21 13:45:14,283 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312933,312946] [2022-11-21 13:45:14,284 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313091,313104] [2022-11-21 13:45:14,285 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313258,313271] [2022-11-21 13:45:14,286 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313417,313430] [2022-11-21 13:45:14,287 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313576,313589] [2022-11-21 13:45:14,288 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313725,313738] [2022-11-21 13:45:14,326 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313872,313885] [2022-11-21 13:45:14,326 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314011,314024] [2022-11-21 13:45:14,327 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314174,314187] [2022-11-21 13:45:14,328 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314340,314353] [2022-11-21 13:45:14,328 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314504,314517] [2022-11-21 13:45:14,329 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314669,314682] [2022-11-21 13:45:14,329 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314834,314847] [2022-11-21 13:45:14,330 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315000,315013] [2022-11-21 13:45:14,330 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315165,315178] [2022-11-21 13:45:14,330 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315332,315345] [2022-11-21 13:45:14,331 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315492,315505] [2022-11-21 13:45:14,331 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315654,315667] [2022-11-21 13:45:14,332 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315813,315826] [2022-11-21 13:45:14,332 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315959,315972] [2022-11-21 13:45:14,333 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316102,316115] [2022-11-21 13:45:14,338 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316246,316259] [2022-11-21 13:45:14,340 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316389,316402] [2022-11-21 13:45:14,341 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316533,316546] [2022-11-21 13:45:14,342 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316674,316687] [2022-11-21 13:45:14,342 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316812,316825] [2022-11-21 13:45:14,343 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316970,316983] [2022-11-21 13:45:14,344 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317129,317142] [2022-11-21 13:45:14,344 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317285,317298] [2022-11-21 13:45:14,345 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317434,317447] [2022-11-21 13:45:14,346 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317586,317599] [2022-11-21 13:45:14,346 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317737,317750] [2022-11-21 13:45:14,347 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317886,317899] [2022-11-21 13:45:14,347 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318038,318051] [2022-11-21 13:45:14,348 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318186,318199] [2022-11-21 13:45:14,349 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318339,318352] [2022-11-21 13:45:14,350 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318490,318503] [2022-11-21 13:45:14,351 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318640,318653] [2022-11-21 13:45:14,352 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318787,318800] [2022-11-21 13:45:14,353 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318938,318951] [2022-11-21 13:45:14,353 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319089,319102] [2022-11-21 13:45:14,355 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319237,319250] [2022-11-21 13:45:14,356 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319403,319416] [2022-11-21 13:45:14,357 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319572,319585] [2022-11-21 13:45:14,357 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319739,319752] [2022-11-21 13:45:14,358 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319907,319920] [2022-11-21 13:45:14,358 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320057,320070] [2022-11-21 13:45:14,359 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320204,320217] [2022-11-21 13:45:14,359 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320365,320378] [2022-11-21 13:45:14,360 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320535,320548] [2022-11-21 13:45:14,361 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320697,320710] [2022-11-21 13:45:14,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:45:14,429 INFO L203 MainTranslator]: Completed pre-run [2022-11-21 13:45:14,810 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307309,307322] [2022-11-21 13:45:14,810 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307454,307467] [2022-11-21 13:45:14,812 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307600,307613] [2022-11-21 13:45:14,813 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307765,307778] [2022-11-21 13:45:14,819 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[307923,307936] [2022-11-21 13:45:14,819 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308081,308094] [2022-11-21 13:45:14,820 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308239,308252] [2022-11-21 13:45:14,821 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308399,308412] [2022-11-21 13:45:14,821 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308558,308571] [2022-11-21 13:45:14,822 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308697,308710] [2022-11-21 13:45:14,823 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308839,308852] [2022-11-21 13:45:14,824 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[308988,309001] [2022-11-21 13:45:14,824 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309127,309140] [2022-11-21 13:45:14,825 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309282,309295] [2022-11-21 13:45:14,825 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309442,309455] [2022-11-21 13:45:14,826 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309593,309606] [2022-11-21 13:45:14,826 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309744,309757] [2022-11-21 13:45:14,827 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[309896,309909] [2022-11-21 13:45:14,827 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310045,310058] [2022-11-21 13:45:14,828 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310193,310206] [2022-11-21 13:45:14,829 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310350,310363] [2022-11-21 13:45:14,829 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310499,310512] [2022-11-21 13:45:14,830 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310655,310668] [2022-11-21 13:45:14,831 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310808,310821] [2022-11-21 13:45:14,834 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[310954,310967] [2022-11-21 13:45:14,834 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311097,311110] [2022-11-21 13:45:14,836 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311249,311262] [2022-11-21 13:45:14,836 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311395,311408] [2022-11-21 13:45:14,837 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311540,311553] [2022-11-21 13:45:14,837 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311694,311707] [2022-11-21 13:45:14,838 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[311845,311858] [2022-11-21 13:45:14,838 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312000,312013] [2022-11-21 13:45:14,840 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312152,312165] [2022-11-21 13:45:14,841 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312307,312320] [2022-11-21 13:45:14,841 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312471,312484] [2022-11-21 13:45:14,842 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312627,312640] [2022-11-21 13:45:14,842 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312791,312804] [2022-11-21 13:45:14,843 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[312933,312946] [2022-11-21 13:45:14,843 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313091,313104] [2022-11-21 13:45:14,844 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313258,313271] [2022-11-21 13:45:14,845 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313417,313430] [2022-11-21 13:45:14,846 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313576,313589] [2022-11-21 13:45:14,847 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313725,313738] [2022-11-21 13:45:14,848 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[313872,313885] [2022-11-21 13:45:14,854 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314011,314024] [2022-11-21 13:45:14,855 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314174,314187] [2022-11-21 13:45:14,856 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314340,314353] [2022-11-21 13:45:14,856 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314504,314517] [2022-11-21 13:45:14,857 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314669,314682] [2022-11-21 13:45:14,858 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[314834,314847] [2022-11-21 13:45:14,859 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315000,315013] [2022-11-21 13:45:14,859 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315165,315178] [2022-11-21 13:45:14,860 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315332,315345] [2022-11-21 13:45:14,861 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315492,315505] [2022-11-21 13:45:14,862 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315654,315667] [2022-11-21 13:45:14,862 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315813,315826] [2022-11-21 13:45:14,863 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[315959,315972] [2022-11-21 13:45:14,863 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316102,316115] [2022-11-21 13:45:14,864 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316246,316259] [2022-11-21 13:45:14,865 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316389,316402] [2022-11-21 13:45:14,866 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316533,316546] [2022-11-21 13:45:14,866 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316674,316687] [2022-11-21 13:45:14,868 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316812,316825] [2022-11-21 13:45:14,869 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[316970,316983] [2022-11-21 13:45:14,873 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317129,317142] [2022-11-21 13:45:14,875 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317285,317298] [2022-11-21 13:45:14,875 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317434,317447] [2022-11-21 13:45:14,876 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317586,317599] [2022-11-21 13:45:14,883 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317737,317750] [2022-11-21 13:45:14,884 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[317886,317899] [2022-11-21 13:45:14,886 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318038,318051] [2022-11-21 13:45:14,886 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318186,318199] [2022-11-21 13:45:14,887 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318339,318352] [2022-11-21 13:45:14,892 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318490,318503] [2022-11-21 13:45:14,894 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318640,318653] [2022-11-21 13:45:14,895 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318787,318800] [2022-11-21 13:45:14,895 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[318938,318951] [2022-11-21 13:45:14,896 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319089,319102] [2022-11-21 13:45:14,897 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319237,319250] [2022-11-21 13:45:14,898 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319403,319416] [2022-11-21 13:45:14,899 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319572,319585] [2022-11-21 13:45:14,899 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319739,319752] [2022-11-21 13:45:14,900 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[319907,319920] [2022-11-21 13:45:14,900 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320057,320070] [2022-11-21 13:45:14,901 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320204,320217] [2022-11-21 13:45:14,902 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320365,320378] [2022-11-21 13:45:14,902 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320535,320548] [2022-11-21 13:45:14,903 WARN L237 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_5db687a7-8499-48a2-ba03-998712c40009/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i[320697,320710] [2022-11-21 13:45:14,907 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-21 13:45:15,178 INFO L208 MainTranslator]: Completed translation [2022-11-21 13:45:15,178 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:15 WrapperNode [2022-11-21 13:45:15,178 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-21 13:45:15,180 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-21 13:45:15,180 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-21 13:45:15,180 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-21 13:45:15,188 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:15" (1/1) ... [2022-11-21 13:45:15,295 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:15" (1/1) ... [2022-11-21 13:45:15,485 INFO L138 Inliner]: procedures = 592, calls = 1907, calls flagged for inlining = 263, calls inlined = 169, statements flattened = 3305 [2022-11-21 13:45:15,486 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-21 13:45:15,487 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-21 13:45:15,487 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-21 13:45:15,487 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-21 13:45:15,497 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:15" (1/1) ... [2022-11-21 13:45:15,497 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:15" (1/1) ... [2022-11-21 13:45:15,526 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:15" (1/1) ... [2022-11-21 13:45:15,526 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:15" (1/1) ... [2022-11-21 13:45:15,613 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:15" (1/1) ... [2022-11-21 13:45:15,622 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:15" (1/1) ... [2022-11-21 13:45:15,706 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:15" (1/1) ... [2022-11-21 13:45:15,721 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:15" (1/1) ... [2022-11-21 13:45:15,757 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-21 13:45:15,760 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-21 13:45:15,760 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-21 13:45:15,761 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-21 13:45:15,762 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:15" (1/1) ... [2022-11-21 13:45:15,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-21 13:45:15,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db687a7-8499-48a2-ba03-998712c40009/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:45:15,797 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db687a7-8499-48a2-ba03-998712c40009/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-21 13:45:15,825 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db687a7-8499-48a2-ba03-998712c40009/bin/uautomizer-vX5HgA9Q3a/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-21 13:45:15,846 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-11-21 13:45:15,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-11-21 13:45:15,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-21 13:45:15,847 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-21 13:45:15,847 INFO L130 BoogieDeclarations]: Found specification of procedure recover_from_urb_loss [2022-11-21 13:45:15,847 INFO L138 BoogieDeclarations]: Found implementation of procedure recover_from_urb_loss [2022-11-21 13:45:15,847 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_control_urb [2022-11-21 13:45:15,847 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_control_urb [2022-11-21 13:45:15,848 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-21 13:45:15,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-21 13:45:15,848 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-11-21 13:45:15,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-11-21 13:45:15,848 INFO L130 BoogieDeclarations]: Found specification of procedure __might_sleep [2022-11-21 13:45:15,848 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_sleep [2022-11-21 13:45:15,849 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_get_interface [2022-11-21 13:45:15,849 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_get_interface [2022-11-21 13:45:15,849 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-11-21 13:45:15,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-11-21 13:45:15,851 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2022-11-21 13:45:15,851 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2022-11-21 13:45:15,851 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-11-21 13:45:15,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-11-21 13:45:15,852 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-11-21 13:45:15,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-11-21 13:45:15,852 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_ioctl [2022-11-21 13:45:15,852 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_ioctl [2022-11-21 13:45:15,852 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-11-21 13:45:15,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-11-21 13:45:15,853 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_iuspin_of_wdm_device [2022-11-21 13:45:15,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_iuspin_of_wdm_device [2022-11-21 13:45:15,853 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-11-21 13:45:15,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-11-21 13:45:15,853 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-11-21 13:45:15,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-11-21 13:45:15,854 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-21 13:45:15,854 INFO L130 BoogieDeclarations]: Found specification of procedure cancel_work_sync [2022-11-21 13:45:15,854 INFO L138 BoogieDeclarations]: Found implementation of procedure cancel_work_sync [2022-11-21 13:45:15,854 INFO L130 BoogieDeclarations]: Found specification of procedure list_del [2022-11-21 13:45:15,854 INFO L138 BoogieDeclarations]: Found implementation of procedure list_del [2022-11-21 13:45:15,854 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-11-21 13:45:15,855 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-11-21 13:45:15,855 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-11-21 13:45:15,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-11-21 13:45:15,855 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock [2022-11-21 13:45:15,855 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock [2022-11-21 13:45:15,855 INFO L130 BoogieDeclarations]: Found specification of procedure schedule [2022-11-21 13:45:15,856 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule [2022-11-21 13:45:15,856 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-11-21 13:45:15,856 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-11-21 13:45:15,856 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~int~TO~int [2022-11-21 13:45:15,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~int~TO~int [2022-11-21 13:45:15,857 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-21 13:45:15,857 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-11-21 13:45:15,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-11-21 13:45:15,857 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-11-21 13:45:15,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-11-21 13:45:15,858 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irq_111 [2022-11-21 13:45:15,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irq_111 [2022-11-21 13:45:15,858 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-11-21 13:45:15,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-11-21 13:45:15,858 INFO L130 BoogieDeclarations]: Found specification of procedure usb_autopm_put_interface [2022-11-21 13:45:15,858 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_autopm_put_interface [2022-11-21 13:45:15,859 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-21 13:45:15,859 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-11-21 13:45:15,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-11-21 13:45:15,859 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2022-11-21 13:45:15,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2022-11-21 13:45:15,859 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-11-21 13:45:15,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-11-21 13:45:15,860 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-11-21 13:45:15,860 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-11-21 13:45:15,861 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_wlock_of_wdm_device [2022-11-21 13:45:15,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_wlock_of_wdm_device [2022-11-21 13:45:15,865 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-11-21 13:45:15,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-11-21 13:45:15,866 INFO L130 BoogieDeclarations]: Found specification of procedure kill_urbs [2022-11-21 13:45:15,866 INFO L138 BoogieDeclarations]: Found implementation of procedure kill_urbs [2022-11-21 13:45:15,866 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait_event [2022-11-21 13:45:15,866 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait_event [2022-11-21 13:45:15,866 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-11-21 13:45:15,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-11-21 13:45:15,867 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2022-11-21 13:45:15,869 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2022-11-21 13:45:15,870 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-11-21 13:45:15,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-11-21 13:45:15,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-21 13:45:15,870 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_iuspin_of_wdm_device [2022-11-21 13:45:15,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_iuspin_of_wdm_device [2022-11-21 13:45:15,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-21 13:45:15,871 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-11-21 13:45:15,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-11-21 13:45:15,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-21 13:45:15,871 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2022-11-21 13:45:15,871 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2022-11-21 13:45:15,871 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2022-11-21 13:45:15,871 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2022-11-21 13:45:15,872 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-11-21 13:45:15,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-11-21 13:45:15,872 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-11-21 13:45:15,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-11-21 13:45:15,872 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_find_device [2022-11-21 13:45:15,872 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_find_device [2022-11-21 13:45:15,872 INFO L130 BoogieDeclarations]: Found specification of procedure set_bit [2022-11-21 13:45:15,873 INFO L138 BoogieDeclarations]: Found implementation of procedure set_bit [2022-11-21 13:45:15,873 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2022-11-21 13:45:15,873 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2022-11-21 13:45:15,873 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2022-11-21 13:45:15,873 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2022-11-21 13:45:15,873 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-21 13:45:15,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-21 13:45:15,874 INFO L130 BoogieDeclarations]: Found specification of procedure usb_translate_errors [2022-11-21 13:45:15,874 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_translate_errors [2022-11-21 13:45:15,874 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-21 13:45:15,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-21 13:45:15,874 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-11-21 13:45:15,875 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-11-21 13:45:15,875 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_create [2022-11-21 13:45:15,875 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_create [2022-11-21 13:45:15,876 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_128 [2022-11-21 13:45:15,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_128 [2022-11-21 13:45:15,876 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-11-21 13:45:15,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-11-21 13:45:15,876 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_free_urb [2022-11-21 13:45:15,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_free_urb [2022-11-21 13:45:15,877 INFO L130 BoogieDeclarations]: Found specification of procedure clear_wdm_read_flag [2022-11-21 13:45:15,877 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_wdm_read_flag [2022-11-21 13:45:15,877 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-11-21 13:45:15,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-11-21 13:45:15,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-21 13:45:15,878 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-11-21 13:45:15,878 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-11-21 13:45:15,878 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-11-21 13:45:15,878 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-11-21 13:45:15,878 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_disconnect [2022-11-21 13:45:15,878 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_disconnect [2022-11-21 13:45:15,878 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-21 13:45:15,879 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-21 13:45:15,879 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_wdm_mutex [2022-11-21 13:45:15,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_wdm_mutex [2022-11-21 13:45:15,879 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-11-21 13:45:15,879 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-11-21 13:45:15,879 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2022-11-21 13:45:15,879 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2022-11-21 13:45:15,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-11-21 13:45:15,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-11-21 13:45:15,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_rlock_of_wdm_device [2022-11-21 13:45:15,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_rlock_of_wdm_device [2022-11-21 13:45:15,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-11-21 13:45:15,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-11-21 13:45:15,880 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-11-21 13:45:15,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-11-21 13:45:15,881 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-11-21 13:45:15,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-11-21 13:45:15,881 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_alloc_urb [2022-11-21 13:45:15,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_alloc_urb [2022-11-21 13:45:15,881 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-11-21 13:45:15,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-11-21 13:45:15,882 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-11-21 13:45:15,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-11-21 13:45:15,882 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-11-21 13:45:15,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-11-21 13:45:15,882 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-11-21 13:45:15,882 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-11-21 13:45:15,883 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-11-21 13:45:15,883 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-11-21 13:45:15,883 INFO L130 BoogieDeclarations]: Found specification of procedure constant_test_bit [2022-11-21 13:45:15,883 INFO L138 BoogieDeclarations]: Found implementation of procedure constant_test_bit [2022-11-21 13:45:15,883 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_wdm_mutex [2022-11-21 13:45:15,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_wdm_mutex [2022-11-21 13:45:15,883 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-11-21 13:45:15,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-11-21 13:45:15,884 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-21 13:45:15,884 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-21 13:45:15,884 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-11-21 13:45:15,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-11-21 13:45:15,884 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-21 13:45:15,884 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-11-21 13:45:15,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-11-21 13:45:15,885 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-21 13:45:15,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-21 13:45:15,885 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_95 [2022-11-21 13:45:15,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_95 [2022-11-21 13:45:15,885 INFO L130 BoogieDeclarations]: Found specification of procedure wdm_resume [2022-11-21 13:45:15,885 INFO L138 BoogieDeclarations]: Found implementation of procedure wdm_resume [2022-11-21 13:45:15,886 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-11-21 13:45:15,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-11-21 13:45:15,886 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_96 [2022-11-21 13:45:15,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_96 [2022-11-21 13:45:15,886 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_rlock_of_wdm_device [2022-11-21 13:45:15,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_rlock_of_wdm_device [2022-11-21 13:45:15,886 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2022-11-21 13:45:15,887 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2022-11-21 13:45:15,887 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-11-21 13:45:15,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-11-21 13:45:15,887 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-11-21 13:45:15,887 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-11-21 13:45:15,887 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock [2022-11-21 13:45:15,887 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock [2022-11-21 13:45:15,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-21 13:45:15,888 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_wlock_of_wdm_device [2022-11-21 13:45:15,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_wlock_of_wdm_device [2022-11-21 13:45:15,888 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_irq_110 [2022-11-21 13:45:15,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_irq_110 [2022-11-21 13:45:16,665 INFO L235 CfgBuilder]: Building ICFG [2022-11-21 13:45:16,669 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-21 13:45:16,808 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-21 13:45:23,256 INFO L276 CfgBuilder]: Performing block encoding [2022-11-21 13:45:23,271 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-21 13:45:23,271 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-21 13:45:23,275 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:45:23 BoogieIcfgContainer [2022-11-21 13:45:23,275 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-21 13:45:23,278 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-21 13:45:23,278 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-21 13:45:23,281 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-21 13:45:23,281 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.11 01:45:10" (1/3) ... [2022-11-21 13:45:23,282 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b27263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:45:23, skipping insertion in model container [2022-11-21 13:45:23,282 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.11 01:45:15" (2/3) ... [2022-11-21 13:45:23,283 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b27263 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.11 01:45:23, skipping insertion in model container [2022-11-21 13:45:23,283 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.11 01:45:23" (3/3) ... [2022-11-21 13:45:23,284 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--usb--class--cdc-wdm.ko.cil.i [2022-11-21 13:45:23,304 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-21 13:45:23,304 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-11-21 13:45:23,384 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-21 13:45:23,388 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;@a5e2344, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-21 13:45:23,389 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2022-11-21 13:45:23,398 INFO L276 IsEmpty]: Start isEmpty. Operand has 1342 states, 833 states have (on average 1.2472989195678272) internal successors, (1039), 885 states have internal predecessors, (1039), 384 states have call successors, (384), 95 states have call predecessors, (384), 94 states have return successors, (379), 377 states have call predecessors, (379), 379 states have call successors, (379) [2022-11-21 13:45:23,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-21 13:45:23,409 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:23,410 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 13:45:23,411 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-21 13:45:23,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:23,416 INFO L85 PathProgramCache]: Analyzing trace with hash 294201463, now seen corresponding path program 1 times [2022-11-21 13:45:23,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:23,427 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219976411] [2022-11-21 13:45:23,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:23,428 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:24,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:45:24,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:24,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 13:45:24,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:24,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 13:45:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:24,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 13:45:24,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:24,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 13:45:24,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:24,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-21 13:45:24,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:24,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 13:45:24,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:24,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:45:24,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:24,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-21 13:45:24,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:24,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-21 13:45:24,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:24,817 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-21 13:45:24,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:24,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219976411] [2022-11-21 13:45:24,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219976411] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:24,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:24,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:45:24,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816594408] [2022-11-21 13:45:24,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:24,830 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:45:24,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:24,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:45:24,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:45:24,873 INFO L87 Difference]: Start difference. First operand has 1342 states, 833 states have (on average 1.2472989195678272) internal successors, (1039), 885 states have internal predecessors, (1039), 384 states have call successors, (384), 95 states have call predecessors, (384), 94 states have return successors, (379), 377 states have call predecessors, (379), 379 states have call successors, (379) Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-21 13:45:30,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:30,106 INFO L93 Difference]: Finished difference Result 2621 states and 3668 transitions. [2022-11-21 13:45:30,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:45:30,108 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 71 [2022-11-21 13:45:30,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:30,133 INFO L225 Difference]: With dead ends: 2621 [2022-11-21 13:45:30,133 INFO L226 Difference]: Without dead ends: 1324 [2022-11-21 13:45:30,149 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:45:30,152 INFO L413 NwaCegarLoop]: 978 mSDtfsCounter, 2271 mSDsluCounter, 1687 mSDsCounter, 0 mSdLazyCounter, 2319 mSolverCounterSat, 1298 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2508 SdHoareTripleChecker+Valid, 2665 SdHoareTripleChecker+Invalid, 3617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1298 IncrementalHoareTripleChecker+Valid, 2319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:30,153 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2508 Valid, 2665 Invalid, 3617 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1298 Valid, 2319 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-11-21 13:45:30,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2022-11-21 13:45:30,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 1324. [2022-11-21 13:45:30,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1324 states, 823 states have (on average 1.2041312272174969) internal successors, (991), 870 states have internal predecessors, (991), 379 states have call successors, (379), 94 states have call predecessors, (379), 93 states have return successors, (377), 375 states have call predecessors, (377), 377 states have call successors, (377) [2022-11-21 13:45:30,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1324 states to 1324 states and 1747 transitions. [2022-11-21 13:45:30,329 INFO L78 Accepts]: Start accepts. Automaton has 1324 states and 1747 transitions. Word has length 71 [2022-11-21 13:45:30,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:30,331 INFO L495 AbstractCegarLoop]: Abstraction has 1324 states and 1747 transitions. [2022-11-21 13:45:30,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-21 13:45:30,331 INFO L276 IsEmpty]: Start isEmpty. Operand 1324 states and 1747 transitions. [2022-11-21 13:45:30,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-21 13:45:30,334 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:30,335 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 13:45:30,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-21 13:45:30,335 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-21 13:45:30,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:30,336 INFO L85 PathProgramCache]: Analyzing trace with hash -578055067, now seen corresponding path program 1 times [2022-11-21 13:45:30,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:30,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [462764690] [2022-11-21 13:45:30,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:30,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:30,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:30,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:45:30,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:30,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 13:45:30,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:30,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 13:45:30,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:30,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 13:45:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:30,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 13:45:30,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:30,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-21 13:45:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:31,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 13:45:31,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:31,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:45:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:31,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-21 13:45:31,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:31,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-21 13:45:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:31,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-21 13:45:31,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:31,053 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-21 13:45:31,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:31,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [462764690] [2022-11-21 13:45:31,054 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [462764690] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:31,054 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:31,054 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:45:31,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199597409] [2022-11-21 13:45:31,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:31,056 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:45:31,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:31,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:45:31,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:45:31,058 INFO L87 Difference]: Start difference. First operand 1324 states and 1747 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-21 13:45:36,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:36,296 INFO L93 Difference]: Finished difference Result 1324 states and 1747 transitions. [2022-11-21 13:45:36,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:45:36,296 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 77 [2022-11-21 13:45:36,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:36,307 INFO L225 Difference]: With dead ends: 1324 [2022-11-21 13:45:36,307 INFO L226 Difference]: Without dead ends: 1322 [2022-11-21 13:45:36,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:45:36,312 INFO L413 NwaCegarLoop]: 966 mSDtfsCounter, 2237 mSDsluCounter, 1667 mSDsCounter, 0 mSdLazyCounter, 2297 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2471 SdHoareTripleChecker+Valid, 2633 SdHoareTripleChecker+Invalid, 3585 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 2297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:36,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2471 Valid, 2633 Invalid, 3585 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1288 Valid, 2297 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-11-21 13:45:36,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1322 states. [2022-11-21 13:45:36,396 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1322 to 1322. [2022-11-21 13:45:36,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1322 states, 822 states have (on average 1.20316301703163) internal successors, (989), 868 states have internal predecessors, (989), 379 states have call successors, (379), 94 states have call predecessors, (379), 93 states have return successors, (377), 375 states have call predecessors, (377), 377 states have call successors, (377) [2022-11-21 13:45:36,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1322 states to 1322 states and 1745 transitions. [2022-11-21 13:45:36,409 INFO L78 Accepts]: Start accepts. Automaton has 1322 states and 1745 transitions. Word has length 77 [2022-11-21 13:45:36,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:36,410 INFO L495 AbstractCegarLoop]: Abstraction has 1322 states and 1745 transitions. [2022-11-21 13:45:36,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-21 13:45:36,410 INFO L276 IsEmpty]: Start isEmpty. Operand 1322 states and 1745 transitions. [2022-11-21 13:45:36,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-21 13:45:36,412 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:36,412 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 13:45:36,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-21 13:45:36,413 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-21 13:45:36,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:36,413 INFO L85 PathProgramCache]: Analyzing trace with hash -1278688754, now seen corresponding path program 1 times [2022-11-21 13:45:36,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:36,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [853495643] [2022-11-21 13:45:36,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:36,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:36,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:36,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:45:36,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:36,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 13:45:36,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:36,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 13:45:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:36,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 13:45:36,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:36,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 13:45:36,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:36,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-21 13:45:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:36,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 13:45:36,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:36,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:45:36,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:37,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-21 13:45:37,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:37,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-21 13:45:37,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:37,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-21 13:45:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:37,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-21 13:45:37,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:37,035 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-21 13:45:37,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:37,035 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [853495643] [2022-11-21 13:45:37,035 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [853495643] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:37,036 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:37,036 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:45:37,036 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725038725] [2022-11-21 13:45:37,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:37,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:45:37,037 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:37,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:45:37,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:45:37,038 INFO L87 Difference]: Start difference. First operand 1322 states and 1745 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-21 13:45:41,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:41,643 INFO L93 Difference]: Finished difference Result 1322 states and 1745 transitions. [2022-11-21 13:45:41,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:45:41,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2022-11-21 13:45:41,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:41,653 INFO L225 Difference]: With dead ends: 1322 [2022-11-21 13:45:41,654 INFO L226 Difference]: Without dead ends: 1320 [2022-11-21 13:45:41,655 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:45:41,656 INFO L413 NwaCegarLoop]: 966 mSDtfsCounter, 2231 mSDsluCounter, 1667 mSDsCounter, 0 mSdLazyCounter, 2293 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2464 SdHoareTripleChecker+Valid, 2633 SdHoareTripleChecker+Invalid, 3581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 2293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:41,657 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2464 Valid, 2633 Invalid, 3581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 2293 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-11-21 13:45:41,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2022-11-21 13:45:41,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1320. [2022-11-21 13:45:41,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1320 states, 821 states have (on average 1.202192448233861) internal successors, (987), 866 states have internal predecessors, (987), 379 states have call successors, (379), 94 states have call predecessors, (379), 93 states have return successors, (377), 375 states have call predecessors, (377), 377 states have call successors, (377) [2022-11-21 13:45:41,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1320 states to 1320 states and 1743 transitions. [2022-11-21 13:45:41,798 INFO L78 Accepts]: Start accepts. Automaton has 1320 states and 1743 transitions. Word has length 83 [2022-11-21 13:45:41,799 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:41,799 INFO L495 AbstractCegarLoop]: Abstraction has 1320 states and 1743 transitions. [2022-11-21 13:45:41,799 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-21 13:45:41,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1320 states and 1743 transitions. [2022-11-21 13:45:41,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-21 13:45:41,801 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:41,802 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 13:45:41,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-21 13:45:41,802 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-21 13:45:41,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:41,803 INFO L85 PathProgramCache]: Analyzing trace with hash 641482088, now seen corresponding path program 1 times [2022-11-21 13:45:41,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:41,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938613848] [2022-11-21 13:45:41,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:41,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:41,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:42,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:45:42,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:42,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 13:45:42,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:42,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 13:45:42,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:42,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 13:45:42,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:42,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 13:45:42,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:42,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-21 13:45:42,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:42,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 13:45:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:42,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:45:42,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:42,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-21 13:45:42,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:42,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-21 13:45:42,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:42,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-21 13:45:42,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:42,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-21 13:45:42,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:42,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-21 13:45:42,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:42,278 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-21 13:45:42,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:42,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938613848] [2022-11-21 13:45:42,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938613848] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:42,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:42,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:45:42,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [685777214] [2022-11-21 13:45:42,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:42,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:45:42,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:42,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:45:42,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:45:42,282 INFO L87 Difference]: Start difference. First operand 1320 states and 1743 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-21 13:45:46,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:46,968 INFO L93 Difference]: Finished difference Result 1320 states and 1743 transitions. [2022-11-21 13:45:46,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:45:46,970 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 89 [2022-11-21 13:45:46,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:46,977 INFO L225 Difference]: With dead ends: 1320 [2022-11-21 13:45:46,978 INFO L226 Difference]: Without dead ends: 1318 [2022-11-21 13:45:46,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:45:46,979 INFO L413 NwaCegarLoop]: 966 mSDtfsCounter, 2225 mSDsluCounter, 1667 mSDsCounter, 0 mSdLazyCounter, 2289 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2457 SdHoareTripleChecker+Valid, 2633 SdHoareTripleChecker+Invalid, 3577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 2289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:46,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2457 Valid, 2633 Invalid, 3577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 2289 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-11-21 13:45:46,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1318 states. [2022-11-21 13:45:47,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1318 to 1318. [2022-11-21 13:45:47,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1318 states, 820 states have (on average 1.201219512195122) internal successors, (985), 864 states have internal predecessors, (985), 379 states have call successors, (379), 94 states have call predecessors, (379), 93 states have return successors, (377), 375 states have call predecessors, (377), 377 states have call successors, (377) [2022-11-21 13:45:47,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1318 states to 1318 states and 1741 transitions. [2022-11-21 13:45:47,108 INFO L78 Accepts]: Start accepts. Automaton has 1318 states and 1741 transitions. Word has length 89 [2022-11-21 13:45:47,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:47,108 INFO L495 AbstractCegarLoop]: Abstraction has 1318 states and 1741 transitions. [2022-11-21 13:45:47,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-21 13:45:47,109 INFO L276 IsEmpty]: Start isEmpty. Operand 1318 states and 1741 transitions. [2022-11-21 13:45:47,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-21 13:45:47,111 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:47,112 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 13:45:47,112 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-21 13:45:47,112 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-21 13:45:47,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:47,113 INFO L85 PathProgramCache]: Analyzing trace with hash -847579998, now seen corresponding path program 1 times [2022-11-21 13:45:47,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:47,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919438391] [2022-11-21 13:45:47,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:47,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:47,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:47,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:45:47,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:47,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 13:45:47,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:47,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 13:45:47,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:47,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 13:45:47,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:47,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 13:45:47,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:47,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-21 13:45:47,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:47,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 13:45:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:47,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:45:47,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:47,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-21 13:45:47,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:47,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-21 13:45:47,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:47,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-21 13:45:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:47,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-21 13:45:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:47,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-21 13:45:47,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:47,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-21 13:45:47,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:47,675 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-21 13:45:47,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:47,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919438391] [2022-11-21 13:45:47,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919438391] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:47,676 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:47,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:45:47,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [226930351] [2022-11-21 13:45:47,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:47,678 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:45:47,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:47,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:45:47,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:45:47,679 INFO L87 Difference]: Start difference. First operand 1318 states and 1741 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-21 13:45:52,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:52,115 INFO L93 Difference]: Finished difference Result 1318 states and 1741 transitions. [2022-11-21 13:45:52,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:45:52,115 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 95 [2022-11-21 13:45:52,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:52,126 INFO L225 Difference]: With dead ends: 1318 [2022-11-21 13:45:52,126 INFO L226 Difference]: Without dead ends: 1316 [2022-11-21 13:45:52,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:45:52,129 INFO L413 NwaCegarLoop]: 966 mSDtfsCounter, 2219 mSDsluCounter, 1667 mSDsCounter, 0 mSdLazyCounter, 2285 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2450 SdHoareTripleChecker+Valid, 2633 SdHoareTripleChecker+Invalid, 3573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 2285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:52,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2450 Valid, 2633 Invalid, 3573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 2285 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-11-21 13:45:52,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1316 states. [2022-11-21 13:45:52,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1316 to 1316. [2022-11-21 13:45:52,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1316 states, 819 states have (on average 1.2002442002442002) internal successors, (983), 862 states have internal predecessors, (983), 379 states have call successors, (379), 94 states have call predecessors, (379), 93 states have return successors, (377), 375 states have call predecessors, (377), 377 states have call successors, (377) [2022-11-21 13:45:52,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1316 states to 1316 states and 1739 transitions. [2022-11-21 13:45:52,280 INFO L78 Accepts]: Start accepts. Automaton has 1316 states and 1739 transitions. Word has length 95 [2022-11-21 13:45:52,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:52,281 INFO L495 AbstractCegarLoop]: Abstraction has 1316 states and 1739 transitions. [2022-11-21 13:45:52,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-21 13:45:52,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1316 states and 1739 transitions. [2022-11-21 13:45:52,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-21 13:45:52,283 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:52,284 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 13:45:52,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-21 13:45:52,284 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-21 13:45:52,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:52,285 INFO L85 PathProgramCache]: Analyzing trace with hash -884048786, now seen corresponding path program 1 times [2022-11-21 13:45:52,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:52,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1337004525] [2022-11-21 13:45:52,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:52,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:52,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:52,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:45:52,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:52,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 13:45:52,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:52,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 13:45:52,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:52,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 13:45:52,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:52,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 13:45:52,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:52,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-21 13:45:52,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:52,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 13:45:52,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:52,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:45:52,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:52,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-21 13:45:52,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:52,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-21 13:45:52,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:52,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-21 13:45:52,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:52,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-21 13:45:52,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:52,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-21 13:45:52,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:52,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-21 13:45:52,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:52,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-21 13:45:52,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:52,820 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-21 13:45:52,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:52,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1337004525] [2022-11-21 13:45:52,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1337004525] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:52,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:52,822 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:45:52,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1305195635] [2022-11-21 13:45:52,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:52,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:45:52,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:52,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:45:52,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:45:52,825 INFO L87 Difference]: Start difference. First operand 1316 states and 1739 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-21 13:45:57,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:45:57,749 INFO L93 Difference]: Finished difference Result 1316 states and 1739 transitions. [2022-11-21 13:45:57,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:45:57,750 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 101 [2022-11-21 13:45:57,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:45:57,758 INFO L225 Difference]: With dead ends: 1316 [2022-11-21 13:45:57,758 INFO L226 Difference]: Without dead ends: 1314 [2022-11-21 13:45:57,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:45:57,760 INFO L413 NwaCegarLoop]: 966 mSDtfsCounter, 2213 mSDsluCounter, 1667 mSDsCounter, 0 mSdLazyCounter, 2281 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2443 SdHoareTripleChecker+Valid, 2633 SdHoareTripleChecker+Invalid, 3569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 2281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-11-21 13:45:57,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2443 Valid, 2633 Invalid, 3569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 2281 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-11-21 13:45:57,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1314 states. [2022-11-21 13:45:57,870 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1314 to 1314. [2022-11-21 13:45:57,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1314 states, 818 states have (on average 1.1992665036674817) internal successors, (981), 860 states have internal predecessors, (981), 379 states have call successors, (379), 94 states have call predecessors, (379), 93 states have return successors, (377), 375 states have call predecessors, (377), 377 states have call successors, (377) [2022-11-21 13:45:57,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1314 states to 1314 states and 1737 transitions. [2022-11-21 13:45:57,881 INFO L78 Accepts]: Start accepts. Automaton has 1314 states and 1737 transitions. Word has length 101 [2022-11-21 13:45:57,882 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:45:57,882 INFO L495 AbstractCegarLoop]: Abstraction has 1314 states and 1737 transitions. [2022-11-21 13:45:57,882 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-21 13:45:57,882 INFO L276 IsEmpty]: Start isEmpty. Operand 1314 states and 1737 transitions. [2022-11-21 13:45:57,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-11-21 13:45:57,884 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:45:57,884 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 13:45:57,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-21 13:45:57,885 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-21 13:45:57,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:45:57,885 INFO L85 PathProgramCache]: Analyzing trace with hash -272865763, now seen corresponding path program 1 times [2022-11-21 13:45:57,886 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:45:57,886 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011439258] [2022-11-21 13:45:57,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:45:57,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:45:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:58,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:45:58,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:58,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 13:45:58,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:58,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 13:45:58,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:58,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 13:45:58,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:58,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 13:45:58,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:58,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-21 13:45:58,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:58,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 13:45:58,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:58,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:45:58,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:58,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-21 13:45:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:58,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-21 13:45:58,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:58,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-21 13:45:58,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:58,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-21 13:45:58,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:58,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-21 13:45:58,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:58,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-21 13:45:58,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:58,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-21 13:45:58,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:58,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-21 13:45:58,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:45:58,419 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-21 13:45:58,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:45:58,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011439258] [2022-11-21 13:45:58,420 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011439258] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:45:58,420 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:45:58,420 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:45:58,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005176206] [2022-11-21 13:45:58,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:45:58,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:45:58,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:45:58,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:45:58,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:45:58,422 INFO L87 Difference]: Start difference. First operand 1314 states and 1737 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-21 13:46:03,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:46:03,299 INFO L93 Difference]: Finished difference Result 1314 states and 1737 transitions. [2022-11-21 13:46:03,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:46:03,300 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 107 [2022-11-21 13:46:03,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:46:03,309 INFO L225 Difference]: With dead ends: 1314 [2022-11-21 13:46:03,309 INFO L226 Difference]: Without dead ends: 1312 [2022-11-21 13:46:03,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:46:03,313 INFO L413 NwaCegarLoop]: 966 mSDtfsCounter, 2207 mSDsluCounter, 1667 mSDsCounter, 0 mSdLazyCounter, 2277 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2436 SdHoareTripleChecker+Valid, 2633 SdHoareTripleChecker+Invalid, 3565 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 2277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-11-21 13:46:03,314 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2436 Valid, 2633 Invalid, 3565 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 2277 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-11-21 13:46:03,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1312 states. [2022-11-21 13:46:03,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1312 to 1312. [2022-11-21 13:46:03,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1312 states, 817 states have (on average 1.1982864137086904) internal successors, (979), 858 states have internal predecessors, (979), 379 states have call successors, (379), 94 states have call predecessors, (379), 93 states have return successors, (377), 375 states have call predecessors, (377), 377 states have call successors, (377) [2022-11-21 13:46:03,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1312 states to 1312 states and 1735 transitions. [2022-11-21 13:46:03,426 INFO L78 Accepts]: Start accepts. Automaton has 1312 states and 1735 transitions. Word has length 107 [2022-11-21 13:46:03,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:46:03,427 INFO L495 AbstractCegarLoop]: Abstraction has 1312 states and 1735 transitions. [2022-11-21 13:46:03,427 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-21 13:46:03,427 INFO L276 IsEmpty]: Start isEmpty. Operand 1312 states and 1735 transitions. [2022-11-21 13:46:03,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-21 13:46:03,429 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:46:03,429 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 13:46:03,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-21 13:46:03,430 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-21 13:46:03,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:46:03,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1036751059, now seen corresponding path program 1 times [2022-11-21 13:46:03,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:46:03,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216445733] [2022-11-21 13:46:03,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:46:03,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:46:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:03,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:46:03,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:03,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 13:46:03,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:03,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 13:46:03,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:03,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 13:46:03,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:03,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 13:46:03,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:03,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-21 13:46:03,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:03,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 13:46:03,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:03,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:46:03,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:03,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-21 13:46:03,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:03,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-21 13:46:03,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:03,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-21 13:46:03,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:03,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-21 13:46:03,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:03,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-21 13:46:03,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:03,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-21 13:46:03,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:03,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-21 13:46:03,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:03,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-21 13:46:03,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:03,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-21 13:46:03,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:03,976 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-21 13:46:03,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:46:03,977 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216445733] [2022-11-21 13:46:03,977 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [216445733] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:46:03,977 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:46:03,977 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:46:03,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [631786469] [2022-11-21 13:46:03,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:46:03,978 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:46:03,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:46:03,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:46:03,979 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:46:03,980 INFO L87 Difference]: Start difference. First operand 1312 states and 1735 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-21 13:46:08,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:46:08,447 INFO L93 Difference]: Finished difference Result 1312 states and 1735 transitions. [2022-11-21 13:46:08,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:46:08,458 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 113 [2022-11-21 13:46:08,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:46:08,466 INFO L225 Difference]: With dead ends: 1312 [2022-11-21 13:46:08,466 INFO L226 Difference]: Without dead ends: 1310 [2022-11-21 13:46:08,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:46:08,469 INFO L413 NwaCegarLoop]: 966 mSDtfsCounter, 2205 mSDsluCounter, 1667 mSDsCounter, 0 mSdLazyCounter, 2269 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2433 SdHoareTripleChecker+Valid, 2633 SdHoareTripleChecker+Invalid, 3557 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 2269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:46:08,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2433 Valid, 2633 Invalid, 3557 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 2269 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-11-21 13:46:08,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1310 states. [2022-11-21 13:46:08,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1310 to 1310. [2022-11-21 13:46:08,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1310 states, 816 states have (on average 1.1973039215686274) internal successors, (977), 856 states have internal predecessors, (977), 379 states have call successors, (379), 94 states have call predecessors, (379), 93 states have return successors, (377), 375 states have call predecessors, (377), 377 states have call successors, (377) [2022-11-21 13:46:08,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1310 states to 1310 states and 1733 transitions. [2022-11-21 13:46:08,614 INFO L78 Accepts]: Start accepts. Automaton has 1310 states and 1733 transitions. Word has length 113 [2022-11-21 13:46:08,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:46:08,615 INFO L495 AbstractCegarLoop]: Abstraction has 1310 states and 1733 transitions. [2022-11-21 13:46:08,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-21 13:46:08,615 INFO L276 IsEmpty]: Start isEmpty. Operand 1310 states and 1733 transitions. [2022-11-21 13:46:08,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-11-21 13:46:08,620 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:46:08,620 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:46:08,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-21 13:46:08,620 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-21 13:46:08,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:46:08,621 INFO L85 PathProgramCache]: Analyzing trace with hash -1157282543, now seen corresponding path program 1 times [2022-11-21 13:46:08,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:46:08,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2127144183] [2022-11-21 13:46:08,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:46:08,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:46:08,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:09,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:46:09,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:09,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 13:46:09,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:09,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 13:46:09,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:09,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 13:46:09,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:09,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-21 13:46:09,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:09,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:46:09,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:09,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:46:09,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:09,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:46:09,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:09,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-21 13:46:09,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:09,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:46:09,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:09,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:46:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:09,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:46:09,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:09,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-21 13:46:09,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:09,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:46:09,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:09,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:46:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:09,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:46:09,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:09,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-21 13:46:09,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:09,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:46:09,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:09,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:46:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:09,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:46:09,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:09,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-21 13:46:09,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:09,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:46:09,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:09,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:46:09,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:09,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:46:09,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:09,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-21 13:46:09,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:09,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-21 13:46:09,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:09,332 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-11-21 13:46:09,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:46:09,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2127144183] [2022-11-21 13:46:09,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2127144183] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:46:09,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:46:09,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:46:09,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746444337] [2022-11-21 13:46:09,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:46:09,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:46:09,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:46:09,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:46:09,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:46:09,336 INFO L87 Difference]: Start difference. First operand 1310 states and 1733 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-21 13:46:14,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:46:14,962 INFO L93 Difference]: Finished difference Result 2438 states and 3207 transitions. [2022-11-21 13:46:14,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-21 13:46:14,963 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 155 [2022-11-21 13:46:14,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:46:14,975 INFO L225 Difference]: With dead ends: 2438 [2022-11-21 13:46:14,975 INFO L226 Difference]: Without dead ends: 1320 [2022-11-21 13:46:14,980 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-11-21 13:46:14,984 INFO L413 NwaCegarLoop]: 716 mSDtfsCounter, 2601 mSDsluCounter, 1390 mSDsCounter, 0 mSdLazyCounter, 2006 mSolverCounterSat, 1752 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2842 SdHoareTripleChecker+Valid, 2106 SdHoareTripleChecker+Invalid, 3758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1752 IncrementalHoareTripleChecker+Valid, 2006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:46:14,984 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2842 Valid, 2106 Invalid, 3758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1752 Valid, 2006 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-11-21 13:46:14,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2022-11-21 13:46:15,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1306. [2022-11-21 13:46:15,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1306 states, 813 states have (on average 1.1955719557195572) internal successors, (972), 852 states have internal predecessors, (972), 379 states have call successors, (379), 94 states have call predecessors, (379), 93 states have return successors, (377), 375 states have call predecessors, (377), 377 states have call successors, (377) [2022-11-21 13:46:15,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 1728 transitions. [2022-11-21 13:46:15,135 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 1728 transitions. Word has length 155 [2022-11-21 13:46:15,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:46:15,136 INFO L495 AbstractCegarLoop]: Abstraction has 1306 states and 1728 transitions. [2022-11-21 13:46:15,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (14), 4 states have call predecessors, (14), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-21 13:46:15,136 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1728 transitions. [2022-11-21 13:46:15,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-11-21 13:46:15,138 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:46:15,138 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 13:46:15,138 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-21 13:46:15,139 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-21 13:46:15,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:46:15,139 INFO L85 PathProgramCache]: Analyzing trace with hash -114512042, now seen corresponding path program 1 times [2022-11-21 13:46:15,139 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:46:15,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299148321] [2022-11-21 13:46:15,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:46:15,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:46:15,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:15,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:46:15,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:15,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 13:46:15,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:15,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 13:46:15,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:15,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 13:46:15,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:15,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 13:46:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:15,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-21 13:46:15,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:15,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 13:46:15,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:15,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:46:15,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:15,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-21 13:46:15,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:15,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-21 13:46:15,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:15,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-21 13:46:15,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:15,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-21 13:46:15,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:15,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-21 13:46:15,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:15,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-21 13:46:15,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:15,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-21 13:46:15,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:15,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-21 13:46:15,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:15,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-21 13:46:15,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:15,788 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-21 13:46:15,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:46:15,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299148321] [2022-11-21 13:46:15,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299148321] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:46:15,789 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:46:15,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:46:15,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1323243650] [2022-11-21 13:46:15,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:46:15,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:46:15,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:46:15,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:46:15,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:46:15,792 INFO L87 Difference]: Start difference. First operand 1306 states and 1728 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-21 13:46:20,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:46:20,467 INFO L93 Difference]: Finished difference Result 1306 states and 1728 transitions. [2022-11-21 13:46:20,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:46:20,468 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 115 [2022-11-21 13:46:20,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:46:20,475 INFO L225 Difference]: With dead ends: 1306 [2022-11-21 13:46:20,476 INFO L226 Difference]: Without dead ends: 1304 [2022-11-21 13:46:20,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:46:20,477 INFO L413 NwaCegarLoop]: 961 mSDtfsCounter, 2188 mSDsluCounter, 1653 mSDsCounter, 0 mSdLazyCounter, 2268 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2416 SdHoareTripleChecker+Valid, 2614 SdHoareTripleChecker+Invalid, 3556 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 2268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-11-21 13:46:20,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2416 Valid, 2614 Invalid, 3556 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 2268 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-11-21 13:46:20,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1304 states. [2022-11-21 13:46:20,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1304 to 1304. [2022-11-21 13:46:20,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1304 states, 812 states have (on average 1.1945812807881773) internal successors, (970), 850 states have internal predecessors, (970), 379 states have call successors, (379), 94 states have call predecessors, (379), 93 states have return successors, (377), 375 states have call predecessors, (377), 377 states have call successors, (377) [2022-11-21 13:46:20,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1304 states to 1304 states and 1726 transitions. [2022-11-21 13:46:20,637 INFO L78 Accepts]: Start accepts. Automaton has 1304 states and 1726 transitions. Word has length 115 [2022-11-21 13:46:20,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:46:20,638 INFO L495 AbstractCegarLoop]: Abstraction has 1304 states and 1726 transitions. [2022-11-21 13:46:20,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-21 13:46:20,638 INFO L276 IsEmpty]: Start isEmpty. Operand 1304 states and 1726 transitions. [2022-11-21 13:46:20,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-11-21 13:46:20,641 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:46:20,642 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:46:20,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-21 13:46:20,642 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-21 13:46:20,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:46:20,643 INFO L85 PathProgramCache]: Analyzing trace with hash 1923335936, now seen corresponding path program 1 times [2022-11-21 13:46:20,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:46:20,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068658655] [2022-11-21 13:46:20,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:46:20,644 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:46:20,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:21,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:46:21,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:21,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 13:46:21,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:21,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 13:46:21,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:21,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 13:46:21,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:21,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-21 13:46:21,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:21,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:46:21,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:21,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:46:21,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:21,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:46:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:21,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-21 13:46:21,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:21,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:46:21,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:21,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:46:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:21,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:46:21,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:21,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-21 13:46:21,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:21,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:46:21,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:21,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:46:21,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:21,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:46:21,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:21,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-21 13:46:21,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:21,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:46:21,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:21,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:46:21,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:21,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:46:21,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:21,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-21 13:46:21,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:21,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:46:21,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:21,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:46:21,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:21,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:46:21,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:21,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-21 13:46:21,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:21,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-21 13:46:21,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:21,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-21 13:46:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:21,339 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2022-11-21 13:46:21,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:46:21,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068658655] [2022-11-21 13:46:21,340 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068658655] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-21 13:46:21,340 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [650566759] [2022-11-21 13:46:21,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:46:21,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:46:21,341 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db687a7-8499-48a2-ba03-998712c40009/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:46:21,345 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db687a7-8499-48a2-ba03-998712c40009/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:46:21,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db687a7-8499-48a2-ba03-998712c40009/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-21 13:46:22,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:22,249 INFO L263 TraceCheckSpWp]: Trace formula consists of 2326 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-21 13:46:22,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:46:22,362 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-11-21 13:46:22,363 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-21 13:46:22,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [650566759] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:46:22,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-21 13:46:22,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-11-21 13:46:22,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128834565] [2022-11-21 13:46:22,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:46:22,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-21 13:46:22,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:46:22,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-21 13:46:22,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:46:22,365 INFO L87 Difference]: Start difference. First operand 1304 states and 1726 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-21 13:46:22,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:46:22,601 INFO L93 Difference]: Finished difference Result 2465 states and 3235 transitions. [2022-11-21 13:46:22,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-21 13:46:22,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 161 [2022-11-21 13:46:22,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:46:22,611 INFO L225 Difference]: With dead ends: 2465 [2022-11-21 13:46:22,611 INFO L226 Difference]: Without dead ends: 1356 [2022-11-21 13:46:22,616 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:46:22,616 INFO L413 NwaCegarLoop]: 1783 mSDtfsCounter, 1704 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1704 SdHoareTripleChecker+Valid, 1850 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:46:22,617 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1704 Valid, 1850 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-21 13:46:22,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1356 states. [2022-11-21 13:46:22,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1356 to 1353. [2022-11-21 13:46:22,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1353 states, 841 states have (on average 1.1890606420927468) internal successors, (1000), 882 states have internal predecessors, (1000), 394 states have call successors, (394), 100 states have call predecessors, (394), 99 states have return successors, (392), 388 states have call predecessors, (392), 392 states have call successors, (392) [2022-11-21 13:46:22,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1353 states to 1353 states and 1786 transitions. [2022-11-21 13:46:22,801 INFO L78 Accepts]: Start accepts. Automaton has 1353 states and 1786 transitions. Word has length 161 [2022-11-21 13:46:22,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:46:22,804 INFO L495 AbstractCegarLoop]: Abstraction has 1353 states and 1786 transitions. [2022-11-21 13:46:22,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-21 13:46:22,806 INFO L276 IsEmpty]: Start isEmpty. Operand 1353 states and 1786 transitions. [2022-11-21 13:46:22,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-11-21 13:46:22,808 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:46:22,808 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 13:46:22,827 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db687a7-8499-48a2-ba03-998712c40009/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-21 13:46:23,019 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db687a7-8499-48a2-ba03-998712c40009/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:46:23,020 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-21 13:46:23,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:46:23,020 INFO L85 PathProgramCache]: Analyzing trace with hash -1110707788, now seen corresponding path program 1 times [2022-11-21 13:46:23,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:46:23,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037081846] [2022-11-21 13:46:23,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:46:23,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:46:23,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:23,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:46:23,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:23,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 13:46:23,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:23,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 13:46:23,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:23,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 13:46:23,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:23,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 13:46:23,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:23,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-21 13:46:23,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:23,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 13:46:23,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:23,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:46:23,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:23,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-21 13:46:23,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:23,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-21 13:46:23,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:23,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-21 13:46:23,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:23,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-21 13:46:23,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:23,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-21 13:46:23,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:23,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-21 13:46:23,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:23,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-21 13:46:23,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:23,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-21 13:46:23,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:23,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-21 13:46:23,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:23,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-21 13:46:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:23,490 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-21 13:46:23,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:46:23,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037081846] [2022-11-21 13:46:23,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1037081846] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:46:23,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:46:23,491 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:46:23,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636013301] [2022-11-21 13:46:23,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:46:23,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:46:23,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:46:23,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:46:23,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:46:23,493 INFO L87 Difference]: Start difference. First operand 1353 states and 1786 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-21 13:46:28,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:46:28,306 INFO L93 Difference]: Finished difference Result 1353 states and 1786 transitions. [2022-11-21 13:46:28,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:46:28,307 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 121 [2022-11-21 13:46:28,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:46:28,315 INFO L225 Difference]: With dead ends: 1353 [2022-11-21 13:46:28,315 INFO L226 Difference]: Without dead ends: 1351 [2022-11-21 13:46:28,316 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:46:28,317 INFO L413 NwaCegarLoop]: 956 mSDtfsCounter, 2179 mSDsluCounter, 1639 mSDsCounter, 0 mSdLazyCounter, 2263 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2406 SdHoareTripleChecker+Valid, 2595 SdHoareTripleChecker+Invalid, 3551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 2263 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-21 13:46:28,318 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2406 Valid, 2595 Invalid, 3551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 2263 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-11-21 13:46:28,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2022-11-21 13:46:28,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1351. [2022-11-21 13:46:28,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1351 states, 840 states have (on average 1.188095238095238) internal successors, (998), 880 states have internal predecessors, (998), 394 states have call successors, (394), 100 states have call predecessors, (394), 99 states have return successors, (392), 388 states have call predecessors, (392), 392 states have call successors, (392) [2022-11-21 13:46:28,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1351 states to 1351 states and 1784 transitions. [2022-11-21 13:46:28,462 INFO L78 Accepts]: Start accepts. Automaton has 1351 states and 1784 transitions. Word has length 121 [2022-11-21 13:46:28,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:46:28,463 INFO L495 AbstractCegarLoop]: Abstraction has 1351 states and 1784 transitions. [2022-11-21 13:46:28,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-21 13:46:28,464 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 1784 transitions. [2022-11-21 13:46:28,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-11-21 13:46:28,467 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:46:28,467 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 13:46:28,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-21 13:46:28,468 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-21 13:46:28,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:46:28,468 INFO L85 PathProgramCache]: Analyzing trace with hash 648688011, now seen corresponding path program 1 times [2022-11-21 13:46:28,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:46:28,469 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [917544756] [2022-11-21 13:46:28,469 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:46:28,469 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:46:28,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:29,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:46:29,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:29,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 13:46:29,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:29,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 13:46:29,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:29,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 13:46:29,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:29,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 13:46:29,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:29,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-21 13:46:29,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:29,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 13:46:29,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:29,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:46:29,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:29,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-21 13:46:29,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:29,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-21 13:46:29,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:29,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-21 13:46:29,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:29,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-21 13:46:29,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:29,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:46:29,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:29,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:46:29,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:29,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:46:29,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:29,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-21 13:46:29,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:29,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:46:29,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:29,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:46:29,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:29,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:46:29,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:29,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-21 13:46:29,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:29,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:46:29,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:29,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:46:29,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:29,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:46:29,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:29,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-21 13:46:29,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:29,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-21 13:46:29,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:29,625 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2022-11-21 13:46:29,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:46:29,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [917544756] [2022-11-21 13:46:29,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [917544756] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:46:29,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:46:29,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-21 13:46:29,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811032874] [2022-11-21 13:46:29,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:46:29,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-21 13:46:29,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:46:29,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-21 13:46:29,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-21 13:46:29,629 INFO L87 Difference]: Start difference. First operand 1351 states and 1784 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-21 13:46:37,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:46:37,642 INFO L93 Difference]: Finished difference Result 1584 states and 2027 transitions. [2022-11-21 13:46:37,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-21 13:46:37,642 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 153 [2022-11-21 13:46:37,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:46:37,651 INFO L225 Difference]: With dead ends: 1584 [2022-11-21 13:46:37,652 INFO L226 Difference]: Without dead ends: 1582 [2022-11-21 13:46:37,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2022-11-21 13:46:37,654 INFO L413 NwaCegarLoop]: 957 mSDtfsCounter, 2713 mSDsluCounter, 2873 mSDsCounter, 0 mSdLazyCounter, 4421 mSolverCounterSat, 1858 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2917 SdHoareTripleChecker+Valid, 3830 SdHoareTripleChecker+Invalid, 6279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1858 IncrementalHoareTripleChecker+Valid, 4421 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-11-21 13:46:37,655 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2917 Valid, 3830 Invalid, 6279 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1858 Valid, 4421 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2022-11-21 13:46:37,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1582 states. [2022-11-21 13:46:37,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1582 to 1554. [2022-11-21 13:46:37,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1554 states, 972 states have (on average 1.176954732510288) internal successors, (1144), 1012 states have internal predecessors, (1144), 426 states have call successors, (426), 139 states have call predecessors, (426), 138 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-11-21 13:46:37,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 1994 transitions. [2022-11-21 13:46:37,851 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 1994 transitions. Word has length 153 [2022-11-21 13:46:37,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:46:37,852 INFO L495 AbstractCegarLoop]: Abstraction has 1554 states and 1994 transitions. [2022-11-21 13:46:37,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (21), 6 states have call predecessors, (21), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-21 13:46:37,853 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 1994 transitions. [2022-11-21 13:46:37,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-11-21 13:46:37,855 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:46:37,855 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:46:37,856 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-21 13:46:37,856 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-21 13:46:37,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:46:37,857 INFO L85 PathProgramCache]: Analyzing trace with hash 856886975, now seen corresponding path program 1 times [2022-11-21 13:46:37,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:46:37,857 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1271777696] [2022-11-21 13:46:37,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:46:37,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:46:37,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:38,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:46:38,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:38,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 13:46:38,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:38,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 13:46:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:38,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 13:46:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:38,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-21 13:46:38,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:38,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:46:38,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:38,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:46:38,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:38,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:46:38,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:38,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-21 13:46:38,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:38,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:46:38,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:38,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:46:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:38,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:46:38,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:38,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-21 13:46:38,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:38,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:46:38,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:38,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:46:38,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:38,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:46:38,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:38,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-21 13:46:38,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:38,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:46:38,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:38,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:46:38,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:38,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:46:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:38,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-21 13:46:38,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:38,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:46:38,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:38,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:46:38,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:38,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:46:38,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:38,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-21 13:46:38,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:38,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-21 13:46:38,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:38,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-21 13:46:38,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:38,819 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-11-21 13:46:38,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:46:38,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1271777696] [2022-11-21 13:46:38,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1271777696] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:46:38,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:46:38,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-21 13:46:38,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132934258] [2022-11-21 13:46:38,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:46:38,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 13:46:38,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:46:38,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 13:46:38,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-21 13:46:38,824 INFO L87 Difference]: Start difference. First operand 1554 states and 1994 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-21 13:46:47,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:46:47,861 INFO L93 Difference]: Finished difference Result 3016 states and 3890 transitions. [2022-11-21 13:46:47,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 13:46:47,862 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 166 [2022-11-21 13:46:47,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:46:47,872 INFO L225 Difference]: With dead ends: 3016 [2022-11-21 13:46:47,872 INFO L226 Difference]: Without dead ends: 1568 [2022-11-21 13:46:47,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2022-11-21 13:46:47,878 INFO L413 NwaCegarLoop]: 956 mSDtfsCounter, 2563 mSDsluCounter, 3267 mSDsCounter, 0 mSdLazyCounter, 5025 mSolverCounterSat, 1740 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2797 SdHoareTripleChecker+Valid, 4223 SdHoareTripleChecker+Invalid, 6765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1740 IncrementalHoareTripleChecker+Valid, 5025 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2022-11-21 13:46:47,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2797 Valid, 4223 Invalid, 6765 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1740 Valid, 5025 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2022-11-21 13:46:47,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1568 states. [2022-11-21 13:46:48,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1568 to 1554. [2022-11-21 13:46:48,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1554 states, 972 states have (on average 1.1748971193415638) internal successors, (1142), 1012 states have internal predecessors, (1142), 426 states have call successors, (426), 139 states have call predecessors, (426), 138 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-11-21 13:46:48,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 1992 transitions. [2022-11-21 13:46:48,114 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 1992 transitions. Word has length 166 [2022-11-21 13:46:48,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:46:48,115 INFO L495 AbstractCegarLoop]: Abstraction has 1554 states and 1992 transitions. [2022-11-21 13:46:48,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-21 13:46:48,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 1992 transitions. [2022-11-21 13:46:48,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-11-21 13:46:48,118 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:46:48,119 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:46:48,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-21 13:46:48,119 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-21 13:46:48,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:46:48,120 INFO L85 PathProgramCache]: Analyzing trace with hash 856946557, now seen corresponding path program 1 times [2022-11-21 13:46:48,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:46:48,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352735556] [2022-11-21 13:46:48,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:46:48,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:46:48,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:48,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:46:48,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:48,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 13:46:48,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:48,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 13:46:48,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:48,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 13:46:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:48,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-21 13:46:48,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:48,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:46:48,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:48,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:46:48,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:48,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:46:48,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:48,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-21 13:46:48,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:48,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:46:48,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:48,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:46:48,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:48,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:46:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:48,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-21 13:46:48,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:48,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:46:48,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:48,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:46:48,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:48,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:46:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:48,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-21 13:46:48,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:48,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:46:48,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:48,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:46:48,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:48,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:46:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:48,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-21 13:46:48,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:48,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:46:48,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:48,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:46:48,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:48,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:46:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:48,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-21 13:46:48,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:48,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-21 13:46:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:48,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-11-21 13:46:48,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:48,838 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-11-21 13:46:48,838 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:46:48,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352735556] [2022-11-21 13:46:48,839 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352735556] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:46:48,839 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:46:48,839 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-21 13:46:48,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669472328] [2022-11-21 13:46:48,842 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:46:48,843 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-21 13:46:48,843 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:46:48,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-21 13:46:48,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-21 13:46:48,844 INFO L87 Difference]: Start difference. First operand 1554 states and 1992 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2022-11-21 13:46:56,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:46:56,488 INFO L93 Difference]: Finished difference Result 1568 states and 2016 transitions. [2022-11-21 13:46:56,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-21 13:46:56,489 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 166 [2022-11-21 13:46:56,492 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:46:56,501 INFO L225 Difference]: With dead ends: 1568 [2022-11-21 13:46:56,502 INFO L226 Difference]: Without dead ends: 1566 [2022-11-21 13:46:56,503 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-11-21 13:46:56,504 INFO L413 NwaCegarLoop]: 956 mSDtfsCounter, 1368 mSDsluCounter, 2802 mSDsCounter, 0 mSdLazyCounter, 3764 mSolverCounterSat, 1466 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1368 SdHoareTripleChecker+Valid, 3758 SdHoareTripleChecker+Invalid, 5230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1466 IncrementalHoareTripleChecker+Valid, 3764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.2s IncrementalHoareTripleChecker+Time [2022-11-21 13:46:56,504 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1368 Valid, 3758 Invalid, 5230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1466 Valid, 3764 Invalid, 0 Unknown, 0 Unchecked, 7.2s Time] [2022-11-21 13:46:56,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2022-11-21 13:46:56,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1552. [2022-11-21 13:46:56,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1552 states, 971 states have (on average 1.173017507723996) internal successors, (1139), 1010 states have internal predecessors, (1139), 426 states have call successors, (426), 139 states have call predecessors, (426), 138 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-11-21 13:46:56,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 1989 transitions. [2022-11-21 13:46:56,753 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 1989 transitions. Word has length 166 [2022-11-21 13:46:56,754 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:46:56,754 INFO L495 AbstractCegarLoop]: Abstraction has 1552 states and 1989 transitions. [2022-11-21 13:46:56,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2022-11-21 13:46:56,755 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 1989 transitions. [2022-11-21 13:46:56,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-11-21 13:46:56,758 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:46:56,758 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 13:46:56,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-21 13:46:56,758 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-21 13:46:56,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:46:56,759 INFO L85 PathProgramCache]: Analyzing trace with hash 1158823036, now seen corresponding path program 1 times [2022-11-21 13:46:56,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:46:56,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1077524439] [2022-11-21 13:46:56,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:46:56,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:46:56,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:57,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:46:57,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:57,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 13:46:57,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:57,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 13:46:57,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:57,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 13:46:57,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:57,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 13:46:57,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:57,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-21 13:46:57,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:57,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 13:46:57,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:57,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:46:57,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:57,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-21 13:46:57,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:57,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-21 13:46:57,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:57,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-21 13:46:57,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:57,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-21 13:46:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:57,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-21 13:46:57,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:57,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-21 13:46:57,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:57,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-21 13:46:57,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:57,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-21 13:46:57,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:57,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-21 13:46:57,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:57,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-21 13:46:57,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:57,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-21 13:46:57,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:46:57,331 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-21 13:46:57,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:46:57,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1077524439] [2022-11-21 13:46:57,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1077524439] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:46:57,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:46:57,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:46:57,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500449419] [2022-11-21 13:46:57,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:46:57,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:46:57,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:46:57,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:46:57,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:46:57,335 INFO L87 Difference]: Start difference. First operand 1552 states and 1989 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-21 13:47:02,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:47:02,274 INFO L93 Difference]: Finished difference Result 1552 states and 1989 transitions. [2022-11-21 13:47:02,274 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:47:02,274 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 127 [2022-11-21 13:47:02,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:47:02,281 INFO L225 Difference]: With dead ends: 1552 [2022-11-21 13:47:02,281 INFO L226 Difference]: Without dead ends: 1550 [2022-11-21 13:47:02,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:47:02,282 INFO L413 NwaCegarLoop]: 956 mSDtfsCounter, 2164 mSDsluCounter, 1639 mSDsCounter, 0 mSdLazyCounter, 2253 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2390 SdHoareTripleChecker+Valid, 2595 SdHoareTripleChecker+Invalid, 3541 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 2253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-21 13:47:02,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2390 Valid, 2595 Invalid, 3541 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 2253 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-11-21 13:47:02,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1550 states. [2022-11-21 13:47:02,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1550 to 1550. [2022-11-21 13:47:02,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1550 states, 970 states have (on average 1.1721649484536083) internal successors, (1137), 1008 states have internal predecessors, (1137), 426 states have call successors, (426), 139 states have call predecessors, (426), 138 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-11-21 13:47:02,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1550 states to 1550 states and 1987 transitions. [2022-11-21 13:47:02,514 INFO L78 Accepts]: Start accepts. Automaton has 1550 states and 1987 transitions. Word has length 127 [2022-11-21 13:47:02,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:47:02,514 INFO L495 AbstractCegarLoop]: Abstraction has 1550 states and 1987 transitions. [2022-11-21 13:47:02,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-21 13:47:02,515 INFO L276 IsEmpty]: Start isEmpty. Operand 1550 states and 1987 transitions. [2022-11-21 13:47:02,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 174 [2022-11-21 13:47:02,518 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:47:02,518 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:47:02,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-21 13:47:02,519 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-21 13:47:02,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:47:02,519 INFO L85 PathProgramCache]: Analyzing trace with hash -1521898695, now seen corresponding path program 1 times [2022-11-21 13:47:02,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:47:02,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1528651574] [2022-11-21 13:47:02,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:02,520 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:47:02,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:02,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:47:02,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:02,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 13:47:02,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:02,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 13:47:02,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:02,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 13:47:02,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:02,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-21 13:47:02,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:02,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:47:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:02,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:47:02,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:02,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:47:02,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:02,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-21 13:47:02,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:02,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:47:02,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:02,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:47:02,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:02,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:47:02,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:02,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-21 13:47:02,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:02,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:47:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:02,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:47:02,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:02,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:47:02,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:02,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-21 13:47:02,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:02,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:47:02,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:02,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:47:02,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:02,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:47:02,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:02,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-21 13:47:02,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:02,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:47:02,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:02,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:47:02,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:02,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:47:02,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:03,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-21 13:47:03,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:03,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-21 13:47:03,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:03,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-21 13:47:03,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:03,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:47:03,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:03,033 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-11-21 13:47:03,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:47:03,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1528651574] [2022-11-21 13:47:03,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1528651574] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:47:03,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:47:03,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:47:03,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009205764] [2022-11-21 13:47:03,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:47:03,036 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:47:03,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:47:03,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:47:03,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:47:03,037 INFO L87 Difference]: Start difference. First operand 1550 states and 1987 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-21 13:47:08,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:47:08,496 INFO L93 Difference]: Finished difference Result 3002 states and 3869 transitions. [2022-11-21 13:47:08,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:47:08,496 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 173 [2022-11-21 13:47:08,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:47:08,503 INFO L225 Difference]: With dead ends: 3002 [2022-11-21 13:47:08,503 INFO L226 Difference]: Without dead ends: 1558 [2022-11-21 13:47:08,508 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:47:08,508 INFO L413 NwaCegarLoop]: 956 mSDtfsCounter, 2520 mSDsluCounter, 1378 mSDsCounter, 0 mSdLazyCounter, 1748 mSolverCounterSat, 1742 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2754 SdHoareTripleChecker+Valid, 2334 SdHoareTripleChecker+Invalid, 3490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1742 IncrementalHoareTripleChecker+Valid, 1748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:47:08,509 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2754 Valid, 2334 Invalid, 3490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1742 Valid, 1748 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-11-21 13:47:08,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2022-11-21 13:47:08,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1544. [2022-11-21 13:47:08,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1544 states, 965 states have (on average 1.1689119170984457) internal successors, (1128), 1002 states have internal predecessors, (1128), 426 states have call successors, (426), 139 states have call predecessors, (426), 138 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-11-21 13:47:08,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1544 states to 1544 states and 1978 transitions. [2022-11-21 13:47:08,729 INFO L78 Accepts]: Start accepts. Automaton has 1544 states and 1978 transitions. Word has length 173 [2022-11-21 13:47:08,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:47:08,729 INFO L495 AbstractCegarLoop]: Abstraction has 1544 states and 1978 transitions. [2022-11-21 13:47:08,729 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 3 states have internal predecessors, (55), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-21 13:47:08,730 INFO L276 IsEmpty]: Start isEmpty. Operand 1544 states and 1978 transitions. [2022-11-21 13:47:08,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-11-21 13:47:08,732 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:47:08,732 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 13:47:08,733 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-21 13:47:08,734 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-21 13:47:08,734 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:47:08,734 INFO L85 PathProgramCache]: Analyzing trace with hash -2118584882, now seen corresponding path program 1 times [2022-11-21 13:47:08,734 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:47:08,735 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318955114] [2022-11-21 13:47:08,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:08,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:47:08,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:09,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:47:09,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:09,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 13:47:09,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:09,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 13:47:09,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:09,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 13:47:09,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:09,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 13:47:09,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:09,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-21 13:47:09,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:09,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 13:47:09,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:09,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:47:09,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:09,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-21 13:47:09,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:09,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-21 13:47:09,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:09,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-21 13:47:09,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:09,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-21 13:47:09,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:09,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:47:09,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:09,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:47:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:09,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:47:09,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:09,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-21 13:47:09,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:09,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:47:09,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:09,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:47:09,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:09,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:47:09,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:09,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-21 13:47:09,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:09,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:47:09,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:09,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:47:09,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:09,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:47:09,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:09,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-21 13:47:09,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:09,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-21 13:47:09,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:09,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-21 13:47:09,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:09,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:47:09,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:09,398 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2022-11-21 13:47:09,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:47:09,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318955114] [2022-11-21 13:47:09,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318955114] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:47:09,398 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:47:09,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-21 13:47:09,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761577706] [2022-11-21 13:47:09,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:47:09,399 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 13:47:09,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:47:09,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 13:47:09,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-21 13:47:09,400 INFO L87 Difference]: Start difference. First operand 1544 states and 1978 transitions. Second operand has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (23), 7 states have call predecessors, (23), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-21 13:47:16,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:47:16,966 INFO L93 Difference]: Finished difference Result 1586 states and 2026 transitions. [2022-11-21 13:47:16,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-21 13:47:16,966 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (23), 7 states have call predecessors, (23), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 164 [2022-11-21 13:47:16,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:47:16,975 INFO L225 Difference]: With dead ends: 1586 [2022-11-21 13:47:16,976 INFO L226 Difference]: Without dead ends: 1584 [2022-11-21 13:47:16,977 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=283, Unknown=0, NotChecked=0, Total=420 [2022-11-21 13:47:16,978 INFO L413 NwaCegarLoop]: 956 mSDtfsCounter, 2999 mSDsluCounter, 3274 mSDsCounter, 0 mSdLazyCounter, 4095 mSolverCounterSat, 2237 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3219 SdHoareTripleChecker+Valid, 4230 SdHoareTripleChecker+Invalid, 6332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2237 IncrementalHoareTripleChecker+Valid, 4095 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:47:16,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3219 Valid, 4230 Invalid, 6332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2237 Valid, 4095 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2022-11-21 13:47:16,982 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1584 states. [2022-11-21 13:47:17,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1584 to 1568. [2022-11-21 13:47:17,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1568 states, 983 states have (on average 1.167853509664293) internal successors, (1148), 1020 states have internal predecessors, (1148), 426 states have call successors, (426), 145 states have call predecessors, (426), 144 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-11-21 13:47:17,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1568 states to 1568 states and 1998 transitions. [2022-11-21 13:47:17,280 INFO L78 Accepts]: Start accepts. Automaton has 1568 states and 1998 transitions. Word has length 164 [2022-11-21 13:47:17,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:47:17,280 INFO L495 AbstractCegarLoop]: Abstraction has 1568 states and 1998 transitions. [2022-11-21 13:47:17,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.555555555555555) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (23), 7 states have call predecessors, (23), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-21 13:47:17,281 INFO L276 IsEmpty]: Start isEmpty. Operand 1568 states and 1998 transitions. [2022-11-21 13:47:17,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-11-21 13:47:17,283 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:47:17,284 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 13:47:17,284 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-21 13:47:17,284 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-21 13:47:17,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:47:17,285 INFO L85 PathProgramCache]: Analyzing trace with hash -1964220518, now seen corresponding path program 1 times [2022-11-21 13:47:17,285 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:47:17,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [667083087] [2022-11-21 13:47:17,285 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:17,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:47:17,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:17,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:47:17,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:17,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 13:47:17,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:17,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 13:47:17,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:17,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 13:47:17,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:17,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 13:47:17,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:17,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-21 13:47:17,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:17,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 13:47:17,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:17,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:47:17,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:17,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-21 13:47:17,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:17,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-21 13:47:17,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:17,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-21 13:47:17,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:17,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-21 13:47:17,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:17,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-21 13:47:17,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:17,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-21 13:47:17,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:17,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-21 13:47:17,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:17,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-21 13:47:17,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:17,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-21 13:47:17,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:17,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-21 13:47:17,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:17,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-21 13:47:17,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:17,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-21 13:47:17,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:17,768 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-21 13:47:17,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:47:17,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [667083087] [2022-11-21 13:47:17,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [667083087] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:47:17,769 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:47:17,769 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:47:17,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780475119] [2022-11-21 13:47:17,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:47:17,771 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:47:17,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:47:17,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:47:17,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:47:17,773 INFO L87 Difference]: Start difference. First operand 1568 states and 1998 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-11-21 13:47:22,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:47:22,678 INFO L93 Difference]: Finished difference Result 1568 states and 1998 transitions. [2022-11-21 13:47:22,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:47:22,679 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 133 [2022-11-21 13:47:22,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:47:22,688 INFO L225 Difference]: With dead ends: 1568 [2022-11-21 13:47:22,688 INFO L226 Difference]: Without dead ends: 1566 [2022-11-21 13:47:22,689 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:47:22,690 INFO L413 NwaCegarLoop]: 956 mSDtfsCounter, 2143 mSDsluCounter, 1639 mSDsCounter, 0 mSdLazyCounter, 2239 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2368 SdHoareTripleChecker+Valid, 2595 SdHoareTripleChecker+Invalid, 3527 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 2239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-21 13:47:22,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2368 Valid, 2595 Invalid, 3527 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 2239 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-11-21 13:47:22,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1566 states. [2022-11-21 13:47:22,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1566 to 1566. [2022-11-21 13:47:22,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1566 states, 982 states have (on average 1.1670061099796334) internal successors, (1146), 1018 states have internal predecessors, (1146), 426 states have call successors, (426), 145 states have call predecessors, (426), 144 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-11-21 13:47:22,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1566 states to 1566 states and 1996 transitions. [2022-11-21 13:47:22,964 INFO L78 Accepts]: Start accepts. Automaton has 1566 states and 1996 transitions. Word has length 133 [2022-11-21 13:47:22,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:47:22,964 INFO L495 AbstractCegarLoop]: Abstraction has 1566 states and 1996 transitions. [2022-11-21 13:47:22,964 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-11-21 13:47:22,965 INFO L276 IsEmpty]: Start isEmpty. Operand 1566 states and 1996 transitions. [2022-11-21 13:47:22,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-11-21 13:47:22,967 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:47:22,967 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 13:47:22,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-21 13:47:22,968 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-21 13:47:22,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:47:22,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1558718622, now seen corresponding path program 1 times [2022-11-21 13:47:22,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:47:22,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [77109143] [2022-11-21 13:47:22,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:22,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:47:23,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:23,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:47:23,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:23,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 13:47:23,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:23,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 13:47:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:23,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 13:47:23,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:23,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 13:47:23,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:23,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-21 13:47:23,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:23,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 13:47:23,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:23,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:47:23,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:23,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-21 13:47:23,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:23,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-21 13:47:23,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:23,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-21 13:47:23,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:23,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-21 13:47:23,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:23,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-21 13:47:23,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:23,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-21 13:47:23,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:23,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-21 13:47:23,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:23,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-21 13:47:23,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:23,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-21 13:47:23,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:23,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-21 13:47:23,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:23,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-21 13:47:23,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:23,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-21 13:47:23,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:23,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-21 13:47:23,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:23,402 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-21 13:47:23,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:47:23,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [77109143] [2022-11-21 13:47:23,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [77109143] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:47:23,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:47:23,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:47:23,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1636837109] [2022-11-21 13:47:23,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:47:23,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:47:23,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:47:23,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:47:23,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:47:23,404 INFO L87 Difference]: Start difference. First operand 1566 states and 1996 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-21 13:47:27,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:47:27,734 INFO L93 Difference]: Finished difference Result 1566 states and 1996 transitions. [2022-11-21 13:47:27,735 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:47:27,735 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 139 [2022-11-21 13:47:27,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:47:27,742 INFO L225 Difference]: With dead ends: 1566 [2022-11-21 13:47:27,742 INFO L226 Difference]: Without dead ends: 1564 [2022-11-21 13:47:27,743 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:47:27,744 INFO L413 NwaCegarLoop]: 956 mSDtfsCounter, 2137 mSDsluCounter, 1639 mSDsCounter, 0 mSdLazyCounter, 2235 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2361 SdHoareTripleChecker+Valid, 2595 SdHoareTripleChecker+Invalid, 3523 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 2235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-11-21 13:47:27,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2361 Valid, 2595 Invalid, 3523 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 2235 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-11-21 13:47:27,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1564 states. [2022-11-21 13:47:27,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1564 to 1564. [2022-11-21 13:47:27,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1564 states, 981 states have (on average 1.166156982670744) internal successors, (1144), 1016 states have internal predecessors, (1144), 426 states have call successors, (426), 145 states have call predecessors, (426), 144 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-11-21 13:47:27,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1564 states to 1564 states and 1994 transitions. [2022-11-21 13:47:27,922 INFO L78 Accepts]: Start accepts. Automaton has 1564 states and 1994 transitions. Word has length 139 [2022-11-21 13:47:27,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:47:27,923 INFO L495 AbstractCegarLoop]: Abstraction has 1564 states and 1994 transitions. [2022-11-21 13:47:27,923 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-21 13:47:27,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1564 states and 1994 transitions. [2022-11-21 13:47:27,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-11-21 13:47:27,925 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:47:27,926 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 13:47:27,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-21 13:47:27,926 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-21 13:47:27,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:47:27,927 INFO L85 PathProgramCache]: Analyzing trace with hash -537912584, now seen corresponding path program 1 times [2022-11-21 13:47:27,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:47:27,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236835496] [2022-11-21 13:47:27,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:27,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:47:27,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:28,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:47:28,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:28,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 13:47:28,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:28,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 13:47:28,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:28,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 13:47:28,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:28,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 13:47:28,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:28,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-21 13:47:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:28,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 13:47:28,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:28,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:47:28,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:28,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-21 13:47:28,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:28,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-21 13:47:28,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:28,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-21 13:47:28,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:28,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-21 13:47:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:28,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-21 13:47:28,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:28,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-21 13:47:28,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:28,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-21 13:47:28,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:28,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-21 13:47:28,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:28,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-21 13:47:28,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:28,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-21 13:47:28,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:28,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-21 13:47:28,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:28,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-21 13:47:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:28,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-21 13:47:28,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:28,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-21 13:47:28,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:28,367 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-21 13:47:28,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:47:28,367 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236835496] [2022-11-21 13:47:28,367 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236835496] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:47:28,368 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:47:28,368 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:47:28,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158574078] [2022-11-21 13:47:28,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:47:28,368 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:47:28,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:47:28,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:47:28,369 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:47:28,369 INFO L87 Difference]: Start difference. First operand 1564 states and 1994 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-21 13:47:33,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:47:33,022 INFO L93 Difference]: Finished difference Result 1564 states and 1994 transitions. [2022-11-21 13:47:33,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:47:33,022 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 145 [2022-11-21 13:47:33,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:47:33,029 INFO L225 Difference]: With dead ends: 1564 [2022-11-21 13:47:33,029 INFO L226 Difference]: Without dead ends: 1562 [2022-11-21 13:47:33,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:47:33,030 INFO L413 NwaCegarLoop]: 956 mSDtfsCounter, 2131 mSDsluCounter, 1639 mSDsCounter, 0 mSdLazyCounter, 2231 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2354 SdHoareTripleChecker+Valid, 2595 SdHoareTripleChecker+Invalid, 3519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 2231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:47:33,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2354 Valid, 2595 Invalid, 3519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 2231 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-11-21 13:47:33,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2022-11-21 13:47:33,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1562. [2022-11-21 13:47:33,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1562 states, 980 states have (on average 1.1653061224489796) internal successors, (1142), 1014 states have internal predecessors, (1142), 426 states have call successors, (426), 145 states have call predecessors, (426), 144 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-11-21 13:47:33,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1562 states to 1562 states and 1992 transitions. [2022-11-21 13:47:33,217 INFO L78 Accepts]: Start accepts. Automaton has 1562 states and 1992 transitions. Word has length 145 [2022-11-21 13:47:33,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:47:33,218 INFO L495 AbstractCegarLoop]: Abstraction has 1562 states and 1992 transitions. [2022-11-21 13:47:33,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-21 13:47:33,218 INFO L276 IsEmpty]: Start isEmpty. Operand 1562 states and 1992 transitions. [2022-11-21 13:47:33,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-11-21 13:47:33,221 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:47:33,221 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 13:47:33,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-21 13:47:33,222 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-21 13:47:33,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:47:33,222 INFO L85 PathProgramCache]: Analyzing trace with hash 6169930, now seen corresponding path program 1 times [2022-11-21 13:47:33,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:47:33,223 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259467985] [2022-11-21 13:47:33,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:33,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:47:33,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:33,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:47:33,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:33,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 13:47:33,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:33,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 13:47:33,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:33,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 13:47:33,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:33,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 13:47:33,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:33,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-21 13:47:33,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:33,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 13:47:33,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:33,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:47:33,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:33,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-21 13:47:33,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:33,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-21 13:47:33,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:33,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-21 13:47:33,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:33,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-21 13:47:33,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:33,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-21 13:47:33,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:33,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-21 13:47:33,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:33,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-21 13:47:33,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:33,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-21 13:47:33,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:33,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-21 13:47:33,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:33,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-21 13:47:33,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:33,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-21 13:47:33,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:33,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-21 13:47:33,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:33,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-21 13:47:33,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:33,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-21 13:47:33,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:33,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-21 13:47:33,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:33,736 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-21 13:47:33,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:47:33,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259467985] [2022-11-21 13:47:33,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259467985] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:47:33,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:47:33,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:47:33,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298863108] [2022-11-21 13:47:33,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:47:33,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:47:33,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:47:33,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:47:33,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:47:33,740 INFO L87 Difference]: Start difference. First operand 1562 states and 1992 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-11-21 13:47:38,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:47:38,460 INFO L93 Difference]: Finished difference Result 1562 states and 1992 transitions. [2022-11-21 13:47:38,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:47:38,464 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 151 [2022-11-21 13:47:38,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:47:38,471 INFO L225 Difference]: With dead ends: 1562 [2022-11-21 13:47:38,471 INFO L226 Difference]: Without dead ends: 1560 [2022-11-21 13:47:38,472 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:47:38,473 INFO L413 NwaCegarLoop]: 956 mSDtfsCounter, 2125 mSDsluCounter, 1639 mSDsCounter, 0 mSdLazyCounter, 2227 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2347 SdHoareTripleChecker+Valid, 2595 SdHoareTripleChecker+Invalid, 3515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 2227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:47:38,473 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2347 Valid, 2595 Invalid, 3515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 2227 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-11-21 13:47:38,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1560 states. [2022-11-21 13:47:38,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1560 to 1560. [2022-11-21 13:47:38,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1560 states, 979 states have (on average 1.1644535240040859) internal successors, (1140), 1012 states have internal predecessors, (1140), 426 states have call successors, (426), 145 states have call predecessors, (426), 144 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-11-21 13:47:38,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 1990 transitions. [2022-11-21 13:47:38,771 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 1990 transitions. Word has length 151 [2022-11-21 13:47:38,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:47:38,772 INFO L495 AbstractCegarLoop]: Abstraction has 1560 states and 1990 transitions. [2022-11-21 13:47:38,772 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-11-21 13:47:38,772 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 1990 transitions. [2022-11-21 13:47:38,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-11-21 13:47:38,776 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:47:38,777 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 13:47:38,777 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-21 13:47:38,777 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-21 13:47:38,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:47:38,778 INFO L85 PathProgramCache]: Analyzing trace with hash 842217014, now seen corresponding path program 1 times [2022-11-21 13:47:38,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:47:38,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1844975885] [2022-11-21 13:47:38,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:38,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:47:38,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:39,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:47:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:39,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 13:47:39,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:39,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 13:47:39,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:39,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 13:47:39,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:39,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 13:47:39,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:39,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-21 13:47:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:39,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 13:47:39,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:39,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:47:39,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:39,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-21 13:47:39,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:39,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-21 13:47:39,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:39,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-21 13:47:39,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:39,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-21 13:47:39,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:39,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:47:39,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:39,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:47:39,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:39,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:47:39,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:39,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-21 13:47:39,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:39,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:47:39,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:39,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:47:39,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:39,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:47:39,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:39,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-21 13:47:39,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:39,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:47:39,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:39,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:47:39,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:39,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:47:39,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:39,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-21 13:47:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:39,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-21 13:47:39,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:39,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-21 13:47:39,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:39,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:47:39,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:39,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-21 13:47:39,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:39,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:47:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:39,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:47:39,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:39,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:47:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:39,511 INFO L134 CoverageAnalysis]: Checked inductivity of 298 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 298 trivial. 0 not checked. [2022-11-21 13:47:39,512 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:47:39,512 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1844975885] [2022-11-21 13:47:39,512 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1844975885] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:47:39,512 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:47:39,512 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-21 13:47:39,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524960201] [2022-11-21 13:47:39,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:47:39,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 13:47:39,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:47:39,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 13:47:39,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:47:39,515 INFO L87 Difference]: Start difference. First operand 1560 states and 1990 transitions. Second operand has 10 states, 10 states have (on average 7.1) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (27), 8 states have call predecessors, (27), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-11-21 13:47:49,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:47:49,100 INFO L93 Difference]: Finished difference Result 1580 states and 2020 transitions. [2022-11-21 13:47:49,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-21 13:47:49,100 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (27), 8 states have call predecessors, (27), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 187 [2022-11-21 13:47:49,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:47:49,105 INFO L225 Difference]: With dead ends: 1580 [2022-11-21 13:47:49,105 INFO L226 Difference]: Without dead ends: 1578 [2022-11-21 13:47:49,106 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=183, Invalid=417, Unknown=0, NotChecked=0, Total=600 [2022-11-21 13:47:49,107 INFO L413 NwaCegarLoop]: 956 mSDtfsCounter, 2274 mSDsluCounter, 4436 mSDsCounter, 0 mSdLazyCounter, 5314 mSolverCounterSat, 2482 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2274 SdHoareTripleChecker+Valid, 5392 SdHoareTripleChecker+Invalid, 7796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2482 IncrementalHoareTripleChecker+Valid, 5314 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2022-11-21 13:47:49,107 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2274 Valid, 5392 Invalid, 7796 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2482 Valid, 5314 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2022-11-21 13:47:49,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1578 states. [2022-11-21 13:47:49,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1578 to 1560. [2022-11-21 13:47:49,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1560 states, 979 states have (on average 1.1624106230847804) internal successors, (1138), 1012 states have internal predecessors, (1138), 426 states have call successors, (426), 145 states have call predecessors, (426), 144 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-11-21 13:47:49,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1560 states to 1560 states and 1988 transitions. [2022-11-21 13:47:49,379 INFO L78 Accepts]: Start accepts. Automaton has 1560 states and 1988 transitions. Word has length 187 [2022-11-21 13:47:49,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:47:49,379 INFO L495 AbstractCegarLoop]: Abstraction has 1560 states and 1988 transitions. [2022-11-21 13:47:49,380 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.1) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (27), 8 states have call predecessors, (27), 2 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-11-21 13:47:49,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1560 states and 1988 transitions. [2022-11-21 13:47:49,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-11-21 13:47:49,383 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:47:49,384 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 13:47:49,384 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-21 13:47:49,384 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-21 13:47:49,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:47:49,385 INFO L85 PathProgramCache]: Analyzing trace with hash -921206041, now seen corresponding path program 1 times [2022-11-21 13:47:49,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:47:49,385 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1293161811] [2022-11-21 13:47:49,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:49,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:47:49,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:50,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:47:50,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:50,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 13:47:50,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:50,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 13:47:50,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:50,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 13:47:50,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:50,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 13:47:50,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:50,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-21 13:47:50,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:50,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 13:47:50,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:50,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:47:50,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:50,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-21 13:47:50,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:50,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-21 13:47:50,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:50,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-21 13:47:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:50,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-21 13:47:50,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:50,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-21 13:47:50,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:50,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-21 13:47:50,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:50,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-21 13:47:50,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:50,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-21 13:47:50,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:50,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-21 13:47:50,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:50,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-21 13:47:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:50,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-21 13:47:50,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:50,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-21 13:47:50,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:50,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-21 13:47:50,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:50,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-21 13:47:50,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:50,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-21 13:47:50,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:50,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-21 13:47:50,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:50,365 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-21 13:47:50,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:47:50,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1293161811] [2022-11-21 13:47:50,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1293161811] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:47:50,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:47:50,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:47:50,367 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1914060953] [2022-11-21 13:47:50,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:47:50,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:47:50,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:47:50,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:47:50,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:47:50,368 INFO L87 Difference]: Start difference. First operand 1560 states and 1988 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-11-21 13:47:55,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:47:55,806 INFO L93 Difference]: Finished difference Result 1560 states and 1988 transitions. [2022-11-21 13:47:55,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:47:55,807 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 157 [2022-11-21 13:47:55,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:47:55,813 INFO L225 Difference]: With dead ends: 1560 [2022-11-21 13:47:55,813 INFO L226 Difference]: Without dead ends: 1558 [2022-11-21 13:47:55,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:47:55,815 INFO L413 NwaCegarLoop]: 956 mSDtfsCounter, 2119 mSDsluCounter, 1639 mSDsCounter, 0 mSdLazyCounter, 2223 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2340 SdHoareTripleChecker+Valid, 2595 SdHoareTripleChecker+Invalid, 3511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 2223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-11-21 13:47:55,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2340 Valid, 2595 Invalid, 3511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 2223 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-11-21 13:47:55,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1558 states. [2022-11-21 13:47:56,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1558 to 1558. [2022-11-21 13:47:56,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1558 states, 978 states have (on average 1.1615541922290389) internal successors, (1136), 1010 states have internal predecessors, (1136), 426 states have call successors, (426), 145 states have call predecessors, (426), 144 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-11-21 13:47:56,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1558 states to 1558 states and 1986 transitions. [2022-11-21 13:47:56,153 INFO L78 Accepts]: Start accepts. Automaton has 1558 states and 1986 transitions. Word has length 157 [2022-11-21 13:47:56,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:47:56,153 INFO L495 AbstractCegarLoop]: Abstraction has 1558 states and 1986 transitions. [2022-11-21 13:47:56,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-11-21 13:47:56,154 INFO L276 IsEmpty]: Start isEmpty. Operand 1558 states and 1986 transitions. [2022-11-21 13:47:56,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-11-21 13:47:56,157 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:47:56,158 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 13:47:56,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-21 13:47:56,158 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-21 13:47:56,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:47:56,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1267910817, now seen corresponding path program 1 times [2022-11-21 13:47:56,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:47:56,159 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597675550] [2022-11-21 13:47:56,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:47:56,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:47:56,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:56,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:47:56,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:56,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 13:47:56,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:56,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 13:47:56,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:56,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 13:47:56,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:56,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 13:47:56,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:56,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-21 13:47:56,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:56,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 13:47:56,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:56,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:47:56,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:56,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-21 13:47:56,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:56,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-21 13:47:56,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:56,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-21 13:47:56,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:56,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-21 13:47:56,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:56,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-21 13:47:56,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:56,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-21 13:47:56,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:56,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-21 13:47:56,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:56,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-21 13:47:56,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:56,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-21 13:47:56,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:56,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-21 13:47:56,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:56,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-21 13:47:56,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:56,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-21 13:47:56,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:56,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-21 13:47:56,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:56,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-21 13:47:56,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:56,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-21 13:47:56,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:56,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-21 13:47:56,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:56,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-21 13:47:56,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:47:56,624 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-21 13:47:56,624 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:47:56,624 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597675550] [2022-11-21 13:47:56,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597675550] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:47:56,625 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:47:56,625 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:47:56,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [3077292] [2022-11-21 13:47:56,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:47:56,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:47:56,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:47:56,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:47:56,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:47:56,627 INFO L87 Difference]: Start difference. First operand 1558 states and 1986 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-11-21 13:48:01,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:01,614 INFO L93 Difference]: Finished difference Result 1558 states and 1986 transitions. [2022-11-21 13:48:01,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:48:01,615 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 163 [2022-11-21 13:48:01,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:01,620 INFO L225 Difference]: With dead ends: 1558 [2022-11-21 13:48:01,620 INFO L226 Difference]: Without dead ends: 1556 [2022-11-21 13:48:01,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:48:01,621 INFO L413 NwaCegarLoop]: 956 mSDtfsCounter, 2113 mSDsluCounter, 1639 mSDsCounter, 0 mSdLazyCounter, 2219 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2333 SdHoareTripleChecker+Valid, 2595 SdHoareTripleChecker+Invalid, 3507 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 2219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-11-21 13:48:01,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2333 Valid, 2595 Invalid, 3507 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 2219 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-11-21 13:48:01,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1556 states. [2022-11-21 13:48:01,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1556 to 1556. [2022-11-21 13:48:01,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1556 states, 977 states have (on average 1.1606960081883315) internal successors, (1134), 1008 states have internal predecessors, (1134), 426 states have call successors, (426), 145 states have call predecessors, (426), 144 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-11-21 13:48:01,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1556 states to 1556 states and 1984 transitions. [2022-11-21 13:48:01,952 INFO L78 Accepts]: Start accepts. Automaton has 1556 states and 1984 transitions. Word has length 163 [2022-11-21 13:48:01,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:01,953 INFO L495 AbstractCegarLoop]: Abstraction has 1556 states and 1984 transitions. [2022-11-21 13:48:01,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-11-21 13:48:01,954 INFO L276 IsEmpty]: Start isEmpty. Operand 1556 states and 1984 transitions. [2022-11-21 13:48:01,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-11-21 13:48:01,956 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:01,957 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 13:48:01,957 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-21 13:48:01,957 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-21 13:48:01,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:01,958 INFO L85 PathProgramCache]: Analyzing trace with hash -1023607097, now seen corresponding path program 1 times [2022-11-21 13:48:01,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:01,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137863584] [2022-11-21 13:48:01,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:01,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:02,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:02,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:48:02,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:02,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 13:48:02,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:02,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 13:48:02,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:02,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 13:48:02,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:02,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 13:48:02,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:02,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-21 13:48:02,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:02,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 13:48:02,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:02,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:48:02,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:02,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-21 13:48:02,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:02,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-21 13:48:02,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:02,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-21 13:48:02,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:02,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-21 13:48:02,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:02,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-21 13:48:02,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:02,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-21 13:48:02,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:02,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-21 13:48:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:02,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-21 13:48:02,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:02,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-21 13:48:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:02,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-21 13:48:02,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:02,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-21 13:48:02,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:02,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-21 13:48:02,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:02,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-21 13:48:02,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:02,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-21 13:48:02,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:02,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-21 13:48:02,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:02,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-21 13:48:02,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:02,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-21 13:48:02,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:02,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-21 13:48:02,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:02,447 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-21 13:48:02,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:02,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137863584] [2022-11-21 13:48:02,448 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137863584] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:48:02,448 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:48:02,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:48:02,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712063938] [2022-11-21 13:48:02,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:48:02,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:48:02,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:02,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:48:02,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:48:02,450 INFO L87 Difference]: Start difference. First operand 1556 states and 1984 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-11-21 13:48:07,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:07,091 INFO L93 Difference]: Finished difference Result 1556 states and 1984 transitions. [2022-11-21 13:48:07,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:48:07,091 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 169 [2022-11-21 13:48:07,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:07,096 INFO L225 Difference]: With dead ends: 1556 [2022-11-21 13:48:07,096 INFO L226 Difference]: Without dead ends: 1554 [2022-11-21 13:48:07,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:48:07,097 INFO L413 NwaCegarLoop]: 956 mSDtfsCounter, 2107 mSDsluCounter, 1639 mSDsCounter, 0 mSdLazyCounter, 2215 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2326 SdHoareTripleChecker+Valid, 2595 SdHoareTripleChecker+Invalid, 3503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 2215 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:48:07,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2326 Valid, 2595 Invalid, 3503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 2215 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-11-21 13:48:07,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1554 states. [2022-11-21 13:48:07,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1554 to 1554. [2022-11-21 13:48:07,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1554 states, 976 states have (on average 1.1598360655737705) internal successors, (1132), 1006 states have internal predecessors, (1132), 426 states have call successors, (426), 145 states have call predecessors, (426), 144 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-11-21 13:48:07,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1554 states to 1554 states and 1982 transitions. [2022-11-21 13:48:07,431 INFO L78 Accepts]: Start accepts. Automaton has 1554 states and 1982 transitions. Word has length 169 [2022-11-21 13:48:07,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:07,431 INFO L495 AbstractCegarLoop]: Abstraction has 1554 states and 1982 transitions. [2022-11-21 13:48:07,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-11-21 13:48:07,432 INFO L276 IsEmpty]: Start isEmpty. Operand 1554 states and 1982 transitions. [2022-11-21 13:48:07,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-11-21 13:48:07,434 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:07,435 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 13:48:07,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-21 13:48:07,435 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-21 13:48:07,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:07,436 INFO L85 PathProgramCache]: Analyzing trace with hash -449736144, now seen corresponding path program 1 times [2022-11-21 13:48:07,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:07,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300938443] [2022-11-21 13:48:07,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:07,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:07,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:07,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:48:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:07,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 13:48:07,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:07,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 13:48:07,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:07,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 13:48:07,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:07,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 13:48:07,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:07,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-21 13:48:07,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:07,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 13:48:07,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:07,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:48:07,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:07,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-21 13:48:07,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:07,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-21 13:48:07,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:07,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-21 13:48:07,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:07,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-21 13:48:07,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:07,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-21 13:48:07,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:07,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-21 13:48:07,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:07,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-21 13:48:07,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:07,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-21 13:48:07,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:07,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-21 13:48:07,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:07,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-21 13:48:07,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:07,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-21 13:48:07,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:07,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-21 13:48:07,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:07,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-21 13:48:07,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:07,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-21 13:48:07,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:07,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-21 13:48:07,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:07,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-21 13:48:07,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:07,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-21 13:48:07,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:07,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-21 13:48:07,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:07,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-11-21 13:48:07,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:07,934 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-21 13:48:07,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:07,934 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300938443] [2022-11-21 13:48:07,934 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300938443] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:48:07,934 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:48:07,935 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:48:07,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534570015] [2022-11-21 13:48:07,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:48:07,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:48:07,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:07,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:48:07,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:48:07,937 INFO L87 Difference]: Start difference. First operand 1554 states and 1982 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-11-21 13:48:12,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:12,748 INFO L93 Difference]: Finished difference Result 1554 states and 1982 transitions. [2022-11-21 13:48:12,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:48:12,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 175 [2022-11-21 13:48:12,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:12,753 INFO L225 Difference]: With dead ends: 1554 [2022-11-21 13:48:12,753 INFO L226 Difference]: Without dead ends: 1552 [2022-11-21 13:48:12,754 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:48:12,755 INFO L413 NwaCegarLoop]: 956 mSDtfsCounter, 2101 mSDsluCounter, 1639 mSDsCounter, 0 mSdLazyCounter, 2211 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2319 SdHoareTripleChecker+Valid, 2595 SdHoareTripleChecker+Invalid, 3499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 2211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-11-21 13:48:12,755 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2319 Valid, 2595 Invalid, 3499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 2211 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-11-21 13:48:12,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1552 states. [2022-11-21 13:48:13,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1552 to 1552. [2022-11-21 13:48:13,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1552 states, 975 states have (on average 1.158974358974359) internal successors, (1130), 1004 states have internal predecessors, (1130), 426 states have call successors, (426), 145 states have call predecessors, (426), 144 states have return successors, (424), 420 states have call predecessors, (424), 424 states have call successors, (424) [2022-11-21 13:48:13,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1552 states to 1552 states and 1980 transitions. [2022-11-21 13:48:13,030 INFO L78 Accepts]: Start accepts. Automaton has 1552 states and 1980 transitions. Word has length 175 [2022-11-21 13:48:13,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:13,030 INFO L495 AbstractCegarLoop]: Abstraction has 1552 states and 1980 transitions. [2022-11-21 13:48:13,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-11-21 13:48:13,030 INFO L276 IsEmpty]: Start isEmpty. Operand 1552 states and 1980 transitions. [2022-11-21 13:48:13,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2022-11-21 13:48:13,033 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:13,034 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 13:48:13,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-21 13:48:13,034 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-21 13:48:13,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:13,035 INFO L85 PathProgramCache]: Analyzing trace with hash 1074926895, now seen corresponding path program 1 times [2022-11-21 13:48:13,035 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:13,035 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1689780613] [2022-11-21 13:48:13,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:13,035 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:13,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:13,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:48:13,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:13,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 13:48:13,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:13,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 13:48:13,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:13,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 13:48:13,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:13,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 13:48:13,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:13,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-21 13:48:13,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:13,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 13:48:13,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:13,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:48:13,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:13,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-21 13:48:13,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:13,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-21 13:48:13,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:13,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-21 13:48:13,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:13,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-21 13:48:13,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:13,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:48:13,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:13,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:48:13,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:13,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:48:13,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:13,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-21 13:48:13,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:13,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:48:13,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:13,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:48:13,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:13,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:48:13,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:13,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-21 13:48:13,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:13,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:48:13,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:13,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:48:13,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:13,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:48:13,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:13,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-21 13:48:13,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:13,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-21 13:48:13,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:13,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-21 13:48:13,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:13,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:48:13,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:13,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-21 13:48:13,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:13,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:48:13,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:13,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:48:13,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:13,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:48:13,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:13,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-11-21 13:48:13,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:13,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:48:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:13,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:48:13,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:13,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:48:13,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:13,923 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2022-11-21 13:48:13,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:13,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1689780613] [2022-11-21 13:48:13,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1689780613] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:48:13,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:48:13,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-21 13:48:13,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168035827] [2022-11-21 13:48:13,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:48:13,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-21 13:48:13,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:13,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-21 13:48:13,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-21 13:48:13,926 INFO L87 Difference]: Start difference. First operand 1552 states and 1980 transitions. Second operand has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (31), 7 states have call predecessors, (31), 1 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2022-11-21 13:48:27,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:27,748 INFO L93 Difference]: Finished difference Result 3617 states and 4670 transitions. [2022-11-21 13:48:27,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-11-21 13:48:27,749 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (31), 7 states have call predecessors, (31), 1 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) Word has length 212 [2022-11-21 13:48:27,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:27,755 INFO L225 Difference]: With dead ends: 3617 [2022-11-21 13:48:27,756 INFO L226 Difference]: Without dead ends: 2680 [2022-11-21 13:48:27,759 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=144, Invalid=408, Unknown=0, NotChecked=0, Total=552 [2022-11-21 13:48:27,760 INFO L413 NwaCegarLoop]: 1433 mSDtfsCounter, 3999 mSDsluCounter, 4195 mSDsCounter, 0 mSdLazyCounter, 6951 mSolverCounterSat, 3715 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4224 SdHoareTripleChecker+Valid, 5628 SdHoareTripleChecker+Invalid, 10666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3715 IncrementalHoareTripleChecker+Valid, 6951 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.6s IncrementalHoareTripleChecker+Time [2022-11-21 13:48:27,761 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4224 Valid, 5628 Invalid, 10666 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3715 Valid, 6951 Invalid, 0 Unknown, 0 Unchecked, 12.6s Time] [2022-11-21 13:48:27,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2680 states. [2022-11-21 13:48:28,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2680 to 1927. [2022-11-21 13:48:28,148 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1927 states, 1225 states have (on average 1.1640816326530612) internal successors, (1426), 1263 states have internal predecessors, (1426), 507 states have call successors, (507), 189 states have call predecessors, (507), 188 states have return successors, (505), 495 states have call predecessors, (505), 505 states have call successors, (505) [2022-11-21 13:48:28,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1927 states to 1927 states and 2438 transitions. [2022-11-21 13:48:28,154 INFO L78 Accepts]: Start accepts. Automaton has 1927 states and 2438 transitions. Word has length 212 [2022-11-21 13:48:28,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:28,155 INFO L495 AbstractCegarLoop]: Abstraction has 1927 states and 2438 transitions. [2022-11-21 13:48:28,155 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.444444444444445) internal successors, (85), 4 states have internal predecessors, (85), 3 states have call successors, (31), 7 states have call predecessors, (31), 1 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2022-11-21 13:48:28,156 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 2438 transitions. [2022-11-21 13:48:28,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-11-21 13:48:28,159 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:28,159 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 13:48:28,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-21 13:48:28,160 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-21 13:48:28,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:28,160 INFO L85 PathProgramCache]: Analyzing trace with hash -2009724838, now seen corresponding path program 1 times [2022-11-21 13:48:28,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:28,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357237264] [2022-11-21 13:48:28,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:28,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:28,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:28,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:48:28,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:28,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 13:48:28,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:28,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 13:48:28,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:28,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 13:48:28,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:28,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 13:48:28,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:28,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-21 13:48:28,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:28,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 13:48:28,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:28,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:48:28,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:28,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-21 13:48:28,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:28,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-21 13:48:28,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:28,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-21 13:48:28,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:28,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-21 13:48:28,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:28,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-21 13:48:28,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:28,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-21 13:48:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:28,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-21 13:48:28,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:28,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-21 13:48:28,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:28,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-21 13:48:28,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:28,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-21 13:48:28,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:28,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-21 13:48:28,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:28,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-21 13:48:28,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:28,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-21 13:48:28,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:28,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-21 13:48:28,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:28,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-21 13:48:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:28,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-21 13:48:28,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:28,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-21 13:48:28,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:28,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-21 13:48:28,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:28,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-11-21 13:48:28,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:28,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-11-21 13:48:28,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:28,663 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-21 13:48:28,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:28,664 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357237264] [2022-11-21 13:48:28,664 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [357237264] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:48:28,664 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:48:28,664 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:48:28,665 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251570745] [2022-11-21 13:48:28,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:48:28,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:48:28,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:28,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:48:28,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:48:28,667 INFO L87 Difference]: Start difference. First operand 1927 states and 2438 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-11-21 13:48:33,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:33,457 INFO L93 Difference]: Finished difference Result 1927 states and 2438 transitions. [2022-11-21 13:48:33,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-21 13:48:33,458 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 181 [2022-11-21 13:48:33,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:33,464 INFO L225 Difference]: With dead ends: 1927 [2022-11-21 13:48:33,465 INFO L226 Difference]: Without dead ends: 1925 [2022-11-21 13:48:33,466 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:48:33,467 INFO L413 NwaCegarLoop]: 956 mSDtfsCounter, 2095 mSDsluCounter, 1639 mSDsCounter, 0 mSdLazyCounter, 2207 mSolverCounterSat, 1288 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2312 SdHoareTripleChecker+Valid, 2595 SdHoareTripleChecker+Invalid, 3495 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1288 IncrementalHoareTripleChecker+Valid, 2207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:48:33,467 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2312 Valid, 2595 Invalid, 3495 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1288 Valid, 2207 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-11-21 13:48:33,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states. [2022-11-21 13:48:33,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1925. [2022-11-21 13:48:33,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1224 states have (on average 1.1633986928104576) internal successors, (1424), 1261 states have internal predecessors, (1424), 507 states have call successors, (507), 189 states have call predecessors, (507), 188 states have return successors, (505), 495 states have call predecessors, (505), 505 states have call successors, (505) [2022-11-21 13:48:34,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 2436 transitions. [2022-11-21 13:48:34,001 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 2436 transitions. Word has length 181 [2022-11-21 13:48:34,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:34,001 INFO L495 AbstractCegarLoop]: Abstraction has 1925 states and 2436 transitions. [2022-11-21 13:48:34,001 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-11-21 13:48:34,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 2436 transitions. [2022-11-21 13:48:34,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-11-21 13:48:34,004 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:34,004 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 13:48:34,004 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-21 13:48:34,005 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-21 13:48:34,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:34,005 INFO L85 PathProgramCache]: Analyzing trace with hash -364375698, now seen corresponding path program 1 times [2022-11-21 13:48:34,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:34,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229873502] [2022-11-21 13:48:34,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:34,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:34,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:34,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:48:34,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:34,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 13:48:34,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:35,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 13:48:35,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:35,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 13:48:35,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:35,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 13:48:35,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:35,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-21 13:48:35,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:35,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 13:48:35,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:35,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:48:35,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:35,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-21 13:48:35,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:35,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-21 13:48:35,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:35,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-21 13:48:35,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:35,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-21 13:48:35,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:35,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:48:35,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:35,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:48:35,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:35,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:48:35,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:35,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-21 13:48:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:35,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:48:35,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:35,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:48:35,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:35,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:48:35,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:35,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-21 13:48:35,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:35,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:48:35,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:35,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:48:35,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:35,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:48:35,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:35,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-21 13:48:35,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:35,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-21 13:48:35,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:35,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-21 13:48:35,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:35,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:48:35,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:35,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-21 13:48:35,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:35,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:48:35,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:35,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:48:35,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:35,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:48:35,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:35,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-11-21 13:48:35,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:35,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:48:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:35,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:48:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:35,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:48:35,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:35,337 INFO L134 CoverageAnalysis]: Checked inductivity of 342 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2022-11-21 13:48:35,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:35,337 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229873502] [2022-11-21 13:48:35,338 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229873502] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:48:35,338 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:48:35,338 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-21 13:48:35,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607240001] [2022-11-21 13:48:35,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:48:35,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-21 13:48:35,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:35,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-21 13:48:35,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-11-21 13:48:35,340 INFO L87 Difference]: Start difference. First operand 1925 states and 2436 transitions. Second operand has 12 states, 12 states have (on average 7.25) internal successors, (87), 7 states have internal predecessors, (87), 4 states have call successors, (31), 7 states have call predecessors, (31), 1 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2022-11-21 13:48:52,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:48:52,770 INFO L93 Difference]: Finished difference Result 3935 states and 5060 transitions. [2022-11-21 13:48:52,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-21 13:48:52,771 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 7 states have internal predecessors, (87), 4 states have call successors, (31), 7 states have call predecessors, (31), 1 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) Word has length 214 [2022-11-21 13:48:52,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:48:52,780 INFO L225 Difference]: With dead ends: 3935 [2022-11-21 13:48:52,780 INFO L226 Difference]: Without dead ends: 2667 [2022-11-21 13:48:52,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 176 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=183, Invalid=747, Unknown=0, NotChecked=0, Total=930 [2022-11-21 13:48:52,785 INFO L413 NwaCegarLoop]: 1781 mSDtfsCounter, 4726 mSDsluCounter, 7764 mSDsCounter, 0 mSdLazyCounter, 9153 mSolverCounterSat, 4234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 14.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4806 SdHoareTripleChecker+Valid, 9545 SdHoareTripleChecker+Invalid, 13387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4234 IncrementalHoareTripleChecker+Valid, 9153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.7s IncrementalHoareTripleChecker+Time [2022-11-21 13:48:52,785 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4806 Valid, 9545 Invalid, 13387 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4234 Valid, 9153 Invalid, 0 Unknown, 0 Unchecked, 15.7s Time] [2022-11-21 13:48:52,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2667 states. [2022-11-21 13:48:53,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2667 to 1931. [2022-11-21 13:48:53,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1931 states, 1229 states have (on average 1.1635475996745321) internal successors, (1430), 1266 states have internal predecessors, (1430), 508 states have call successors, (508), 189 states have call predecessors, (508), 188 states have return successors, (506), 496 states have call predecessors, (506), 506 states have call successors, (506) [2022-11-21 13:48:53,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1931 states to 1931 states and 2444 transitions. [2022-11-21 13:48:53,509 INFO L78 Accepts]: Start accepts. Automaton has 1931 states and 2444 transitions. Word has length 214 [2022-11-21 13:48:53,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:48:53,509 INFO L495 AbstractCegarLoop]: Abstraction has 1931 states and 2444 transitions. [2022-11-21 13:48:53,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 7.25) internal successors, (87), 7 states have internal predecessors, (87), 4 states have call successors, (31), 7 states have call predecessors, (31), 1 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2022-11-21 13:48:53,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1931 states and 2444 transitions. [2022-11-21 13:48:53,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-11-21 13:48:53,513 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:48:53,513 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 13:48:53,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-11-21 13:48:53,514 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-21 13:48:53,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:48:53,514 INFO L85 PathProgramCache]: Analyzing trace with hash 1723661710, now seen corresponding path program 1 times [2022-11-21 13:48:53,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:48:53,514 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [205539751] [2022-11-21 13:48:53,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:48:53,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:48:53,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:54,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:48:54,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:54,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 13:48:54,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:54,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 13:48:54,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:54,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 13:48:54,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:54,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 13:48:54,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:54,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-21 13:48:54,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:54,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 13:48:54,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:54,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:48:54,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:54,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-21 13:48:54,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:54,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-21 13:48:54,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:54,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-21 13:48:54,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:54,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-21 13:48:54,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:54,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:48:54,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:54,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:48:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:54,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:48:54,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:54,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-21 13:48:54,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:54,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:48:54,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:54,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:48:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:54,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:48:54,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:54,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-21 13:48:54,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:54,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:48:54,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:54,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:48:54,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:54,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:48:54,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:54,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-21 13:48:54,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:54,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-21 13:48:54,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:54,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-21 13:48:54,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:54,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:48:54,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:54,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-21 13:48:54,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:54,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:48:54,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:54,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:48:54,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:54,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:48:54,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:54,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-11-21 13:48:54,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:54,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:48:54,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:54,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:48:54,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:54,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:48:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:48:54,289 INFO L134 CoverageAnalysis]: Checked inductivity of 343 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2022-11-21 13:48:54,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:48:54,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [205539751] [2022-11-21 13:48:54,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [205539751] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:48:54,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:48:54,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-21 13:48:54,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910201660] [2022-11-21 13:48:54,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:48:54,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 13:48:54,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:48:54,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 13:48:54,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:48:54,293 INFO L87 Difference]: Start difference. First operand 1931 states and 2444 transitions. Second operand has 10 states, 10 states have (on average 8.8) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-11-21 13:49:06,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:49:06,919 INFO L93 Difference]: Finished difference Result 1965 states and 2483 transitions. [2022-11-21 13:49:06,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-21 13:49:06,920 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 215 [2022-11-21 13:49:06,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:49:06,929 INFO L225 Difference]: With dead ends: 1965 [2022-11-21 13:49:06,929 INFO L226 Difference]: Without dead ends: 1963 [2022-11-21 13:49:06,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 113 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=180, Invalid=420, Unknown=0, NotChecked=0, Total=600 [2022-11-21 13:49:06,932 INFO L413 NwaCegarLoop]: 937 mSDtfsCounter, 2722 mSDsluCounter, 4370 mSDsCounter, 0 mSdLazyCounter, 5676 mSolverCounterSat, 2765 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2740 SdHoareTripleChecker+Valid, 5307 SdHoareTripleChecker+Invalid, 8441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2765 IncrementalHoareTripleChecker+Valid, 5676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.5s IncrementalHoareTripleChecker+Time [2022-11-21 13:49:06,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2740 Valid, 5307 Invalid, 8441 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2765 Valid, 5676 Invalid, 0 Unknown, 0 Unchecked, 11.5s Time] [2022-11-21 13:49:06,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1963 states. [2022-11-21 13:49:07,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1963 to 1935. [2022-11-21 13:49:07,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1935 states, 1232 states have (on average 1.1623376623376624) internal successors, (1432), 1269 states have internal predecessors, (1432), 508 states have call successors, (508), 190 states have call predecessors, (508), 189 states have return successors, (506), 496 states have call predecessors, (506), 506 states have call successors, (506) [2022-11-21 13:49:07,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1935 states to 1935 states and 2446 transitions. [2022-11-21 13:49:07,497 INFO L78 Accepts]: Start accepts. Automaton has 1935 states and 2446 transitions. Word has length 215 [2022-11-21 13:49:07,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:49:07,497 INFO L495 AbstractCegarLoop]: Abstraction has 1935 states and 2446 transitions. [2022-11-21 13:49:07,497 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (31), 8 states have call predecessors, (31), 2 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-11-21 13:49:07,497 INFO L276 IsEmpty]: Start isEmpty. Operand 1935 states and 2446 transitions. [2022-11-21 13:49:07,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-11-21 13:49:07,500 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:49:07,500 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 13:49:07,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-11-21 13:49:07,500 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ldv_linux_usb_urb_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-21 13:49:07,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:49:07,501 INFO L85 PathProgramCache]: Analyzing trace with hash 166596360, now seen corresponding path program 1 times [2022-11-21 13:49:07,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:49:07,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817129662] [2022-11-21 13:49:07,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:07,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:49:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:07,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:49:07,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:07,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 13:49:07,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:07,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 13:49:07,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:07,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 13:49:07,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:07,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 13:49:07,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:07,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-21 13:49:07,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:07,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 13:49:07,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:07,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:49:07,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:07,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-21 13:49:07,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:07,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-21 13:49:07,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:07,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-21 13:49:07,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:07,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-21 13:49:07,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:07,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-21 13:49:07,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:07,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-21 13:49:07,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:07,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-21 13:49:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:07,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-21 13:49:07,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:07,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-21 13:49:07,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:07,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-21 13:49:07,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:07,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-21 13:49:07,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:07,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-21 13:49:07,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:07,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-21 13:49:07,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:07,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-21 13:49:07,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:07,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-21 13:49:07,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:08,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-21 13:49:08,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:08,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-21 13:49:08,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:08,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-21 13:49:08,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:08,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-11-21 13:49:08,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:08,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-11-21 13:49:08,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:08,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-11-21 13:49:08,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:08,039 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-21 13:49:08,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:49:08,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817129662] [2022-11-21 13:49:08,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817129662] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:49:08,040 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:49:08,040 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-21 13:49:08,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947177705] [2022-11-21 13:49:08,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:49:08,041 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-21 13:49:08,041 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:49:08,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-21 13:49:08,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-21 13:49:08,042 INFO L87 Difference]: Start difference. First operand 1935 states and 2446 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-11-21 13:49:18,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:49:18,434 INFO L93 Difference]: Finished difference Result 3330 states and 4224 transitions. [2022-11-21 13:49:18,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-21 13:49:18,435 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 187 [2022-11-21 13:49:18,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:49:18,449 INFO L225 Difference]: With dead ends: 3330 [2022-11-21 13:49:18,449 INFO L226 Difference]: Without dead ends: 3172 [2022-11-21 13:49:18,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-21 13:49:18,453 INFO L413 NwaCegarLoop]: 1206 mSDtfsCounter, 2778 mSDsluCounter, 2334 mSDsCounter, 0 mSdLazyCounter, 4282 mSolverCounterSat, 2125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2991 SdHoareTripleChecker+Valid, 3540 SdHoareTripleChecker+Invalid, 6407 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2125 IncrementalHoareTripleChecker+Valid, 4282 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.0s IncrementalHoareTripleChecker+Time [2022-11-21 13:49:18,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2991 Valid, 3540 Invalid, 6407 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2125 Valid, 4282 Invalid, 0 Unknown, 0 Unchecked, 9.0s Time] [2022-11-21 13:49:18,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3172 states. [2022-11-21 13:49:19,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3172 to 3158. [2022-11-21 13:49:19,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3158 states, 2004 states have (on average 1.1621756487025947) internal successors, (2329), 2054 states have internal predecessors, (2329), 842 states have call successors, (842), 306 states have call predecessors, (842), 306 states have return successors, (854), 832 states have call predecessors, (854), 840 states have call successors, (854) [2022-11-21 13:49:19,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3158 states to 3158 states and 4025 transitions. [2022-11-21 13:49:19,211 INFO L78 Accepts]: Start accepts. Automaton has 3158 states and 4025 transitions. Word has length 187 [2022-11-21 13:49:19,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:49:19,211 INFO L495 AbstractCegarLoop]: Abstraction has 3158 states and 4025 transitions. [2022-11-21 13:49:19,211 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-11-21 13:49:19,211 INFO L276 IsEmpty]: Start isEmpty. Operand 3158 states and 4025 transitions. [2022-11-21 13:49:19,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-11-21 13:49:19,214 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:49:19,214 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:49:19,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-11-21 13:49:19,215 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-21 13:49:19,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:49:19,215 INFO L85 PathProgramCache]: Analyzing trace with hash 1978229172, now seen corresponding path program 1 times [2022-11-21 13:49:19,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:49:19,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103111958] [2022-11-21 13:49:19,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:19,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:49:19,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:19,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:49:19,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:19,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 13:49:19,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:19,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 13:49:19,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:19,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 13:49:19,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:19,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 13:49:19,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:19,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-21 13:49:19,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:19,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 13:49:19,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:19,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:49:19,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:19,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-21 13:49:19,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:19,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-21 13:49:19,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:19,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-21 13:49:19,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:19,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-21 13:49:19,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:19,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:49:19,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:19,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:49:19,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:19,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:49:19,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:19,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-21 13:49:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:19,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:49:19,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:19,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:49:19,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:19,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:49:19,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:19,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-21 13:49:19,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:19,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:49:19,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:19,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:49:19,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:19,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:49:19,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:19,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-21 13:49:19,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:20,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-21 13:49:20,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:20,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-21 13:49:20,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:20,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:49:20,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:20,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-21 13:49:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:20,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:49:20,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:20,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:49:20,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:20,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:49:20,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:20,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 184 [2022-11-21 13:49:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:20,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:49:20,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:20,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:49:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:20,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:49:20,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:20,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2022-11-21 13:49:20,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:20,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-11-21 13:49:20,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:20,104 INFO L134 CoverageAnalysis]: Checked inductivity of 345 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 343 trivial. 0 not checked. [2022-11-21 13:49:20,104 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:49:20,104 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103111958] [2022-11-21 13:49:20,105 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103111958] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:49:20,105 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:49:20,105 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-21 13:49:20,105 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2014215260] [2022-11-21 13:49:20,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:49:20,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 13:49:20,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:49:20,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 13:49:20,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:49:20,107 INFO L87 Difference]: Start difference. First operand 3158 states and 4025 transitions. Second operand has 10 states, 10 states have (on average 9.5) internal successors, (95), 5 states have internal predecessors, (95), 3 states have call successors, (33), 7 states have call predecessors, (33), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2022-11-21 13:49:32,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:49:32,280 INFO L93 Difference]: Finished difference Result 6086 states and 7921 transitions. [2022-11-21 13:49:32,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-21 13:49:32,284 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 5 states have internal predecessors, (95), 3 states have call successors, (33), 7 states have call predecessors, (33), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) Word has length 226 [2022-11-21 13:49:32,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:49:32,301 INFO L225 Difference]: With dead ends: 6086 [2022-11-21 13:49:32,301 INFO L226 Difference]: Without dead ends: 4016 [2022-11-21 13:49:32,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=294, Unknown=0, NotChecked=0, Total=380 [2022-11-21 13:49:32,308 INFO L413 NwaCegarLoop]: 1161 mSDtfsCounter, 3047 mSDsluCounter, 4685 mSDsCounter, 0 mSdLazyCounter, 6044 mSolverCounterSat, 3407 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3047 SdHoareTripleChecker+Valid, 5846 SdHoareTripleChecker+Invalid, 9451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3407 IncrementalHoareTripleChecker+Valid, 6044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2022-11-21 13:49:32,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3047 Valid, 5846 Invalid, 9451 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3407 Valid, 6044 Invalid, 0 Unknown, 0 Unchecked, 10.4s Time] [2022-11-21 13:49:32,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4016 states. [2022-11-21 13:49:33,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4016 to 3170. [2022-11-21 13:49:33,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3170 states, 2013 states have (on average 1.1614505712866368) internal successors, (2338), 2063 states have internal predecessors, (2338), 845 states have call successors, (845), 306 states have call predecessors, (845), 306 states have return successors, (857), 835 states have call predecessors, (857), 843 states have call successors, (857) [2022-11-21 13:49:33,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3170 states to 3170 states and 4040 transitions. [2022-11-21 13:49:33,383 INFO L78 Accepts]: Start accepts. Automaton has 3170 states and 4040 transitions. Word has length 226 [2022-11-21 13:49:33,383 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:49:33,384 INFO L495 AbstractCegarLoop]: Abstraction has 3170 states and 4040 transitions. [2022-11-21 13:49:33,384 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.5) internal successors, (95), 5 states have internal predecessors, (95), 3 states have call successors, (33), 7 states have call predecessors, (33), 1 states have return successors, (31), 3 states have call predecessors, (31), 3 states have call successors, (31) [2022-11-21 13:49:33,384 INFO L276 IsEmpty]: Start isEmpty. Operand 3170 states and 4040 transitions. [2022-11-21 13:49:33,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2022-11-21 13:49:33,387 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:49:33,387 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:49:33,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-11-21 13:49:33,388 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-21 13:49:33,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:49:33,388 INFO L85 PathProgramCache]: Analyzing trace with hash -936042028, now seen corresponding path program 1 times [2022-11-21 13:49:33,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:49:33,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586001452] [2022-11-21 13:49:33,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:33,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:49:33,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:34,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:49:34,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:34,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 13:49:34,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:34,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 13:49:34,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:34,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 13:49:34,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:34,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 13:49:34,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:34,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-21 13:49:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:34,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 13:49:34,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:34,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:49:34,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:34,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-21 13:49:34,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:34,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-21 13:49:34,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:34,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-21 13:49:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:34,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-21 13:49:34,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:34,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:49:34,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:34,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:49:34,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:34,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:49:34,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:34,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-21 13:49:34,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:34,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:49:34,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:34,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:49:34,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:34,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:49:34,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:34,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-21 13:49:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:34,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:49:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:34,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:49:34,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:34,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:49:34,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:34,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-21 13:49:34,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:34,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-21 13:49:34,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:34,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-21 13:49:34,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:34,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:49:34,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:34,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-21 13:49:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:34,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:49:34,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:34,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:49:34,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:34,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:49:34,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:34,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-11-21 13:49:34,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:34,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:49:34,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:34,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:49:34,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:34,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:49:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:34,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-11-21 13:49:34,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:34,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-11-21 13:49:34,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:34,343 INFO L134 CoverageAnalysis]: Checked inductivity of 344 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 342 trivial. 0 not checked. [2022-11-21 13:49:34,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:49:34,344 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586001452] [2022-11-21 13:49:34,344 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [586001452] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:49:34,344 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:49:34,344 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-21 13:49:34,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534956120] [2022-11-21 13:49:34,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:49:34,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 13:49:34,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:49:34,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 13:49:34,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:49:34,347 INFO L87 Difference]: Start difference. First operand 3170 states and 4040 transitions. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (33), 8 states have call predecessors, (33), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2022-11-21 13:49:46,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:49:46,647 INFO L93 Difference]: Finished difference Result 4684 states and 5978 transitions. [2022-11-21 13:49:46,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-11-21 13:49:46,647 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (33), 8 states have call predecessors, (33), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 225 [2022-11-21 13:49:46,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:49:46,662 INFO L225 Difference]: With dead ends: 4684 [2022-11-21 13:49:46,662 INFO L226 Difference]: Without dead ends: 4682 [2022-11-21 13:49:46,665 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=234, Invalid=522, Unknown=0, NotChecked=0, Total=756 [2022-11-21 13:49:46,665 INFO L413 NwaCegarLoop]: 1189 mSDtfsCounter, 4254 mSDsluCounter, 4750 mSDsCounter, 0 mSdLazyCounter, 5973 mSolverCounterSat, 3720 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4462 SdHoareTripleChecker+Valid, 5939 SdHoareTripleChecker+Invalid, 9693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3720 IncrementalHoareTripleChecker+Valid, 5973 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2022-11-21 13:49:46,666 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4462 Valid, 5939 Invalid, 9693 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3720 Valid, 5973 Invalid, 0 Unknown, 0 Unchecked, 10.4s Time] [2022-11-21 13:49:46,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4682 states. [2022-11-21 13:49:48,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4682 to 4626. [2022-11-21 13:49:48,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4626 states, 2939 states have (on average 1.1708063967335829) internal successors, (3441), 3017 states have internal predecessors, (3441), 1221 states have call successors, (1221), 466 states have call predecessors, (1221), 460 states have return successors, (1234), 1195 states have call predecessors, (1234), 1219 states have call successors, (1234) [2022-11-21 13:49:48,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4626 states to 4626 states and 5896 transitions. [2022-11-21 13:49:48,127 INFO L78 Accepts]: Start accepts. Automaton has 4626 states and 5896 transitions. Word has length 225 [2022-11-21 13:49:48,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:49:48,127 INFO L495 AbstractCegarLoop]: Abstraction has 4626 states and 5896 transitions. [2022-11-21 13:49:48,128 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (33), 8 states have call predecessors, (33), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2022-11-21 13:49:48,128 INFO L276 IsEmpty]: Start isEmpty. Operand 4626 states and 5896 transitions. [2022-11-21 13:49:48,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2022-11-21 13:49:48,130 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:49:48,131 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-21 13:49:48,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-11-21 13:49:48,131 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-21 13:49:48,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:49:48,132 INFO L85 PathProgramCache]: Analyzing trace with hash -1841089302, now seen corresponding path program 1 times [2022-11-21 13:49:48,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:49:48,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2120020030] [2022-11-21 13:49:48,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:49:48,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:49:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:48,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:49:48,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:48,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 13:49:48,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:48,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 13:49:48,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:48,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 13:49:48,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:48,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-21 13:49:48,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:48,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-21 13:49:48,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:48,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-21 13:49:48,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:48,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:49:48,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:48,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-21 13:49:48,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:48,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-21 13:49:48,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:48,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-21 13:49:48,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:48,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-21 13:49:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:48,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:49:48,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:48,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:49:48,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:48,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:49:48,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:48,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-21 13:49:48,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:48,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:49:48,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:48,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:49:48,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:48,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:49:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:48,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-21 13:49:48,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:48,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:49:48,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:48,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:49:48,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:48,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:49:48,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:48,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-21 13:49:48,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:48,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-21 13:49:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:48,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-21 13:49:48,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:48,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:49:48,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:48,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-11-21 13:49:48,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:48,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:49:48,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:48,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:49:48,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:48,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:49:48,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:48,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-11-21 13:49:48,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:48,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:49:48,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:48,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:49:48,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:48,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:49:48,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:48,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-11-21 13:49:48,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:48,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-11-21 13:49:48,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:48,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-11-21 13:49:48,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:48,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:49:48,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:49:48,911 INFO L134 CoverageAnalysis]: Checked inductivity of 346 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 346 trivial. 0 not checked. [2022-11-21 13:49:48,912 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:49:48,912 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2120020030] [2022-11-21 13:49:48,912 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2120020030] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:49:48,912 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:49:48,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-21 13:49:48,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788056131] [2022-11-21 13:49:48,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:49:48,913 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 13:49:48,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:49:48,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 13:49:48,914 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-11-21 13:49:48,914 INFO L87 Difference]: Start difference. First operand 4626 states and 5896 transitions. Second operand has 11 states, 11 states have (on average 9.090909090909092) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (35), 9 states have call predecessors, (35), 2 states have return successors, (33), 2 states have call predecessors, (33), 1 states have call successors, (33) [2022-11-21 13:50:02,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:50:02,535 INFO L93 Difference]: Finished difference Result 4706 states and 5999 transitions. [2022-11-21 13:50:02,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-11-21 13:50:02,535 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.090909090909092) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (35), 9 states have call predecessors, (35), 2 states have return successors, (33), 2 states have call predecessors, (33), 1 states have call successors, (33) Word has length 238 [2022-11-21 13:50:02,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:50:02,549 INFO L225 Difference]: With dead ends: 4706 [2022-11-21 13:50:02,550 INFO L226 Difference]: Without dead ends: 4704 [2022-11-21 13:50:02,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 200 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=270, Invalid=660, Unknown=0, NotChecked=0, Total=930 [2022-11-21 13:50:02,552 INFO L413 NwaCegarLoop]: 1217 mSDtfsCounter, 3480 mSDsluCounter, 6550 mSDsCounter, 0 mSdLazyCounter, 7759 mSolverCounterSat, 3751 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3601 SdHoareTripleChecker+Valid, 7767 SdHoareTripleChecker+Invalid, 11510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3751 IncrementalHoareTripleChecker+Valid, 7759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2022-11-21 13:50:02,553 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3601 Valid, 7767 Invalid, 11510 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3751 Valid, 7759 Invalid, 0 Unknown, 0 Unchecked, 11.7s Time] [2022-11-21 13:50:02,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4704 states. [2022-11-21 13:50:03,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4704 to 4640. [2022-11-21 13:50:03,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4640 states, 2949 states have (on average 1.169548999660902) internal successors, (3449), 3027 states have internal predecessors, (3449), 1221 states have call successors, (1221), 468 states have call predecessors, (1221), 464 states have return successors, (1234), 1197 states have call predecessors, (1234), 1219 states have call successors, (1234) [2022-11-21 13:50:03,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4640 states to 4640 states and 5904 transitions. [2022-11-21 13:50:03,533 INFO L78 Accepts]: Start accepts. Automaton has 4640 states and 5904 transitions. Word has length 238 [2022-11-21 13:50:03,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:50:03,533 INFO L495 AbstractCegarLoop]: Abstraction has 4640 states and 5904 transitions. [2022-11-21 13:50:03,533 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.090909090909092) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (35), 9 states have call predecessors, (35), 2 states have return successors, (33), 2 states have call predecessors, (33), 1 states have call successors, (33) [2022-11-21 13:50:03,533 INFO L276 IsEmpty]: Start isEmpty. Operand 4640 states and 5904 transitions. [2022-11-21 13:50:03,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 258 [2022-11-21 13:50:03,537 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:50:03,537 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 13:50:03,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-11-21 13:50:03,537 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-21 13:50:03,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:50:03,538 INFO L85 PathProgramCache]: Analyzing trace with hash -1108058441, now seen corresponding path program 1 times [2022-11-21 13:50:03,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:50:03,538 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883438431] [2022-11-21 13:50:03,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:50:03,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:50:03,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:04,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:50:04,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:04,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 13:50:04,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:04,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 13:50:04,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:04,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 13:50:04,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:04,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-21 13:50:04,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:04,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:50:04,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:04,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:50:04,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:04,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:50:04,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:04,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-21 13:50:04,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:04,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:50:04,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:04,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:50:04,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:04,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:50:04,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:04,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-21 13:50:04,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:04,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:50:04,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:04,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:50:04,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:04,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:50:04,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:04,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-21 13:50:04,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:04,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:50:04,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:04,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:50:04,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:04,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:50:04,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:04,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-21 13:50:04,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:04,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:50:04,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:04,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:50:04,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:04,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:50:04,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:04,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-21 13:50:04,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:04,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-21 13:50:04,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:04,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-21 13:50:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:04,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-21 13:50:04,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:04,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-11-21 13:50:04,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:04,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:50:04,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:04,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-11-21 13:50:04,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:04,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-11-21 13:50:04,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:04,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-11-21 13:50:04,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:04,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-11-21 13:50:04,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:04,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-11-21 13:50:04,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:04,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:50:04,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:04,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:50:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:04,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:50:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:04,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:50:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:04,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-21 13:50:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:04,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:50:04,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:04,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:50:04,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:04,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:50:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:04,316 INFO L134 CoverageAnalysis]: Checked inductivity of 616 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2022-11-21 13:50:04,316 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:50:04,316 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883438431] [2022-11-21 13:50:04,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883438431] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:50:04,317 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:50:04,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-21 13:50:04,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661462902] [2022-11-21 13:50:04,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:50:04,318 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 13:50:04,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:50:04,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 13:50:04,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:50:04,319 INFO L87 Difference]: Start difference. First operand 4640 states and 5904 transitions. Second operand has 10 states, 10 states have (on average 8.9) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (34), 8 states have call predecessors, (34), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2022-11-21 13:50:13,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:50:13,130 INFO L93 Difference]: Finished difference Result 4771 states and 6033 transitions. [2022-11-21 13:50:13,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-11-21 13:50:13,131 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (34), 8 states have call predecessors, (34), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 257 [2022-11-21 13:50:13,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:50:13,146 INFO L225 Difference]: With dead ends: 4771 [2022-11-21 13:50:13,146 INFO L226 Difference]: Without dead ends: 4769 [2022-11-21 13:50:13,148 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=136, Invalid=284, Unknown=0, NotChecked=0, Total=420 [2022-11-21 13:50:13,149 INFO L413 NwaCegarLoop]: 956 mSDtfsCounter, 2805 mSDsluCounter, 3800 mSDsCounter, 0 mSdLazyCounter, 4602 mSolverCounterSat, 2240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2995 SdHoareTripleChecker+Valid, 4756 SdHoareTripleChecker+Invalid, 6842 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2240 IncrementalHoareTripleChecker+Valid, 4602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:50:13,149 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2995 Valid, 4756 Invalid, 6842 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2240 Valid, 4602 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2022-11-21 13:50:13,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4769 states. [2022-11-21 13:50:14,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4769 to 4725. [2022-11-21 13:50:14,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4725 states, 3009 states have (on average 1.163177135260884) internal successors, (3500), 3086 states have internal predecessors, (3500), 1221 states have call successors, (1221), 494 states have call predecessors, (1221), 490 states have return successors, (1234), 1197 states have call predecessors, (1234), 1219 states have call successors, (1234) [2022-11-21 13:50:14,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4725 states to 4725 states and 5955 transitions. [2022-11-21 13:50:14,372 INFO L78 Accepts]: Start accepts. Automaton has 4725 states and 5955 transitions. Word has length 257 [2022-11-21 13:50:14,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:50:14,373 INFO L495 AbstractCegarLoop]: Abstraction has 4725 states and 5955 transitions. [2022-11-21 13:50:14,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.9) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (34), 8 states have call predecessors, (34), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2022-11-21 13:50:14,373 INFO L276 IsEmpty]: Start isEmpty. Operand 4725 states and 5955 transitions. [2022-11-21 13:50:14,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 284 [2022-11-21 13:50:14,375 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:50:14,375 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 18, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 13:50:14,375 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-11-21 13:50:14,375 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-21 13:50:14,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:50:14,376 INFO L85 PathProgramCache]: Analyzing trace with hash 693039703, now seen corresponding path program 1 times [2022-11-21 13:50:14,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:50:14,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955507651] [2022-11-21 13:50:14,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:50:14,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:50:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:50:15,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 13:50:15,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 13:50:15,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 13:50:15,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-21 13:50:15,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:50:15,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:50:15,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:50:15,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-21 13:50:15,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:50:15,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:50:15,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:50:15,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-21 13:50:15,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:50:15,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:50:15,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:50:15,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-21 13:50:15,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:50:15,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:50:15,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:50:15,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-21 13:50:15,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:50:15,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:50:15,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:50:15,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-21 13:50:15,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-21 13:50:15,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-21 13:50:15,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-21 13:50:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-11-21 13:50:15,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:50:15,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-11-21 13:50:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-11-21 13:50:15,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-11-21 13:50:15,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-11-21 13:50:15,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-11-21 13:50:15,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:50:15,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:50:15,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:50:15,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-11-21 13:50:15,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:50:15,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:50:15,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:50:15,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:50:15,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-21 13:50:15,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:50:15,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:50:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:50:15,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-11-21 13:50:15,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:15,338 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 801 trivial. 0 not checked. [2022-11-21 13:50:15,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:50:15,338 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955507651] [2022-11-21 13:50:15,339 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955507651] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:50:15,339 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:50:15,339 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-21 13:50:15,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [739720517] [2022-11-21 13:50:15,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:50:15,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-21 13:50:15,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:50:15,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-21 13:50:15,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-21 13:50:15,341 INFO L87 Difference]: Start difference. First operand 4725 states and 5955 transitions. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (35), 8 states have call predecessors, (35), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2022-11-21 13:50:27,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:50:27,680 INFO L93 Difference]: Finished difference Result 7924 states and 9955 transitions. [2022-11-21 13:50:27,680 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-21 13:50:27,681 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (35), 8 states have call predecessors, (35), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) Word has length 283 [2022-11-21 13:50:27,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:50:27,703 INFO L225 Difference]: With dead ends: 7924 [2022-11-21 13:50:27,703 INFO L226 Difference]: Without dead ends: 7922 [2022-11-21 13:50:27,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=175, Invalid=377, Unknown=0, NotChecked=0, Total=552 [2022-11-21 13:50:27,708 INFO L413 NwaCegarLoop]: 1285 mSDtfsCounter, 4016 mSDsluCounter, 5068 mSDsCounter, 0 mSdLazyCounter, 6814 mSolverCounterSat, 3187 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4225 SdHoareTripleChecker+Valid, 6353 SdHoareTripleChecker+Invalid, 10001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3187 IncrementalHoareTripleChecker+Valid, 6814 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2022-11-21 13:50:27,708 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4225 Valid, 6353 Invalid, 10001 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3187 Valid, 6814 Invalid, 0 Unknown, 0 Unchecked, 9.7s Time] [2022-11-21 13:50:27,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7922 states. [2022-11-21 13:50:29,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7922 to 7802. [2022-11-21 13:50:29,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7802 states, 5027 states have (on average 1.1714740401830117) internal successors, (5889), 5170 states have internal predecessors, (5889), 1946 states have call successors, (1946), 832 states have call predecessors, (1946), 824 states have return successors, (1963), 1896 states have call predecessors, (1963), 1944 states have call successors, (1963) [2022-11-21 13:50:29,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7802 states to 7802 states and 9798 transitions. [2022-11-21 13:50:29,704 INFO L78 Accepts]: Start accepts. Automaton has 7802 states and 9798 transitions. Word has length 283 [2022-11-21 13:50:29,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:50:29,705 INFO L495 AbstractCegarLoop]: Abstraction has 7802 states and 9798 transitions. [2022-11-21 13:50:29,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (35), 8 states have call predecessors, (35), 1 states have return successors, (33), 2 states have call predecessors, (33), 2 states have call successors, (33) [2022-11-21 13:50:29,705 INFO L276 IsEmpty]: Start isEmpty. Operand 7802 states and 9798 transitions. [2022-11-21 13:50:29,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2022-11-21 13:50:29,707 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:50:29,708 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 13:50:29,708 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-11-21 13:50:29,708 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-21 13:50:29,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:50:29,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1850004994, now seen corresponding path program 1 times [2022-11-21 13:50:29,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:50:29,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495002845] [2022-11-21 13:50:29,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:50:29,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:50:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:30,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:50:30,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:30,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 13:50:30,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:30,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 13:50:30,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:30,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 13:50:30,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-21 13:50:31,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:50:31,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:50:31,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:50:31,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-21 13:50:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:50:31,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:50:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:50:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-21 13:50:31,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:50:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:50:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:50:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-21 13:50:31,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:50:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:50:31,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:50:31,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-21 13:50:31,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:50:31,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:50:31,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:50:31,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-21 13:50:31,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-21 13:50:31,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-21 13:50:31,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:50:31,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:50:31,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-21 13:50:31,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-21 13:50:31,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:50:31,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-11-21 13:50:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-11-21 13:50:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-11-21 13:50:31,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 203 [2022-11-21 13:50:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-11-21 13:50:31,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-11-21 13:50:31,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:50:31,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:50:31,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:50:31,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-11-21 13:50:31,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 248 [2022-11-21 13:50:31,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:50:31,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:50:31,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:50:31,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 271 [2022-11-21 13:50:31,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 276 [2022-11-21 13:50:31,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-11-21 13:50:31,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 286 [2022-11-21 13:50:31,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2022-11-21 13:50:31,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:31,463 INFO L134 CoverageAnalysis]: Checked inductivity of 519 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 519 trivial. 0 not checked. [2022-11-21 13:50:31,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:50:31,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495002845] [2022-11-21 13:50:31,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495002845] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:50:31,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:50:31,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-11-21 13:50:31,465 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84596370] [2022-11-21 13:50:31,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:50:31,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-21 13:50:31,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:50:31,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-21 13:50:31,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=208, Unknown=0, NotChecked=0, Total=240 [2022-11-21 13:50:31,466 INFO L87 Difference]: Start difference. First operand 7802 states and 9798 transitions. Second operand has 16 states, 16 states have (on average 7.3125) internal successors, (117), 8 states have internal predecessors, (117), 3 states have call successors, (42), 9 states have call predecessors, (42), 2 states have return successors, (39), 4 states have call predecessors, (39), 3 states have call successors, (39) [2022-11-21 13:50:47,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:50:47,488 INFO L93 Difference]: Finished difference Result 14963 states and 18824 transitions. [2022-11-21 13:50:47,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-11-21 13:50:47,488 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 7.3125) internal successors, (117), 8 states have internal predecessors, (117), 3 states have call successors, (42), 9 states have call predecessors, (42), 2 states have return successors, (39), 4 states have call predecessors, (39), 3 states have call successors, (39) Word has length 301 [2022-11-21 13:50:47,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:50:47,512 INFO L225 Difference]: With dead ends: 14963 [2022-11-21 13:50:47,512 INFO L226 Difference]: Without dead ends: 7917 [2022-11-21 13:50:47,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=216, Invalid=776, Unknown=0, NotChecked=0, Total=992 [2022-11-21 13:50:47,532 INFO L413 NwaCegarLoop]: 957 mSDtfsCounter, 2765 mSDsluCounter, 7212 mSDsCounter, 0 mSdLazyCounter, 9533 mSolverCounterSat, 3293 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2765 SdHoareTripleChecker+Valid, 8169 SdHoareTripleChecker+Invalid, 12826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3293 IncrementalHoareTripleChecker+Valid, 9533 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2022-11-21 13:50:47,532 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2765 Valid, 8169 Invalid, 12826 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3293 Valid, 9533 Invalid, 0 Unknown, 0 Unchecked, 13.1s Time] [2022-11-21 13:50:47,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7917 states. [2022-11-21 13:50:49,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7917 to 7816. [2022-11-21 13:50:49,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7816 states, 5037 states have (on average 1.1711336112765536) internal successors, (5899), 5180 states have internal predecessors, (5899), 1948 states have call successors, (1948), 832 states have call predecessors, (1948), 826 states have return successors, (1968), 1899 states have call predecessors, (1968), 1946 states have call successors, (1968) [2022-11-21 13:50:49,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7816 states to 7816 states and 9815 transitions. [2022-11-21 13:50:49,381 INFO L78 Accepts]: Start accepts. Automaton has 7816 states and 9815 transitions. Word has length 301 [2022-11-21 13:50:49,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:50:49,382 INFO L495 AbstractCegarLoop]: Abstraction has 7816 states and 9815 transitions. [2022-11-21 13:50:49,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 7.3125) internal successors, (117), 8 states have internal predecessors, (117), 3 states have call successors, (42), 9 states have call predecessors, (42), 2 states have return successors, (39), 4 states have call predecessors, (39), 3 states have call successors, (39) [2022-11-21 13:50:49,382 INFO L276 IsEmpty]: Start isEmpty. Operand 7816 states and 9815 transitions. [2022-11-21 13:50:49,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 312 [2022-11-21 13:50:49,385 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:50:49,385 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 13:50:49,386 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-11-21 13:50:49,386 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-21 13:50:49,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:50:49,386 INFO L85 PathProgramCache]: Analyzing trace with hash -1205585624, now seen corresponding path program 1 times [2022-11-21 13:50:49,386 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:50:49,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130896691] [2022-11-21 13:50:49,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:50:49,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:50:49,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:49,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-21 13:50:49,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:49,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-21 13:50:49,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:49,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-21 13:50:49,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:49,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-21 13:50:49,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:49,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-21 13:50:49,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:50:50,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:50:50,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:50:50,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-21 13:50:50,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:50:50,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:50:50,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:50:50,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-21 13:50:50,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:50:50,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:50:50,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:50:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-21 13:50:50,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:50:50,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:50:50,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:50:50,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-21 13:50:50,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:50:50,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:50:50,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:50:50,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-21 13:50:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-21 13:50:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-21 13:50:50,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-21 13:50:50,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-11-21 13:50:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:50:50,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-11-21 13:50:50,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-11-21 13:50:50,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-11-21 13:50:50,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-11-21 13:50:50,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-11-21 13:50:50,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:50:50,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:50:50,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-21 13:50:50,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-11-21 13:50:50,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:50:50,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:50:50,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:50:50,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:50:50,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-21 13:50:50,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:50:50,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-21 13:50:50,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-21 13:50:50,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-11-21 13:50:50,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 277 [2022-11-21 13:50:50,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-21 13:50:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-21 13:50:50,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-11-21 13:50:50,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 300 [2022-11-21 13:50:50,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:50:50,289 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 877 trivial. 0 not checked. [2022-11-21 13:50:50,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:50:50,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130896691] [2022-11-21 13:50:50,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1130896691] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-21 13:50:50,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-21 13:50:50,290 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-21 13:50:50,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1829303354] [2022-11-21 13:50:50,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-21 13:50:50,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-21 13:50:50,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:50:50,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-21 13:50:50,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-21 13:50:50,292 INFO L87 Difference]: Start difference. First operand 7816 states and 9815 transitions. Second operand has 11 states, 11 states have (on average 9.545454545454545) internal successors, (105), 4 states have internal predecessors, (105), 3 states have call successors, (41), 9 states have call predecessors, (41), 2 states have return successors, (38), 2 states have call predecessors, (38), 3 states have call successors, (38) [2022-11-21 13:51:01,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:01,575 INFO L93 Difference]: Finished difference Result 7909 states and 9944 transitions. [2022-11-21 13:51:01,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-21 13:51:01,576 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.545454545454545) internal successors, (105), 4 states have internal predecessors, (105), 3 states have call successors, (41), 9 states have call predecessors, (41), 2 states have return successors, (38), 2 states have call predecessors, (38), 3 states have call successors, (38) Word has length 311 [2022-11-21 13:51:01,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:01,596 INFO L225 Difference]: With dead ends: 7909 [2022-11-21 13:51:01,597 INFO L226 Difference]: Without dead ends: 7907 [2022-11-21 13:51:01,601 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=418, Unknown=0, NotChecked=0, Total=600 [2022-11-21 13:51:01,601 INFO L413 NwaCegarLoop]: 942 mSDtfsCounter, 2606 mSDsluCounter, 4361 mSDsCounter, 0 mSdLazyCounter, 5286 mSolverCounterSat, 2920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2618 SdHoareTripleChecker+Valid, 5303 SdHoareTripleChecker+Invalid, 8206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2920 IncrementalHoareTripleChecker+Valid, 5286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2022-11-21 13:51:01,602 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2618 Valid, 5303 Invalid, 8206 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2920 Valid, 5286 Invalid, 0 Unknown, 0 Unchecked, 8.8s Time] [2022-11-21 13:51:01,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7907 states. [2022-11-21 13:51:03,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7907 to 7814. [2022-11-21 13:51:03,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7814 states, 5036 states have (on average 1.1679904686258935) internal successors, (5882), 5178 states have internal predecessors, (5882), 1948 states have call successors, (1948), 832 states have call predecessors, (1948), 826 states have return successors, (1968), 1899 states have call predecessors, (1968), 1946 states have call successors, (1968) [2022-11-21 13:51:03,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7814 states to 7814 states and 9798 transitions. [2022-11-21 13:51:03,721 INFO L78 Accepts]: Start accepts. Automaton has 7814 states and 9798 transitions. Word has length 311 [2022-11-21 13:51:03,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:03,722 INFO L495 AbstractCegarLoop]: Abstraction has 7814 states and 9798 transitions. [2022-11-21 13:51:03,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.545454545454545) internal successors, (105), 4 states have internal predecessors, (105), 3 states have call successors, (41), 9 states have call predecessors, (41), 2 states have return successors, (38), 2 states have call predecessors, (38), 3 states have call successors, (38) [2022-11-21 13:51:03,722 INFO L276 IsEmpty]: Start isEmpty. Operand 7814 states and 9798 transitions. [2022-11-21 13:51:03,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 323 [2022-11-21 13:51:03,726 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:03,726 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 13:51:03,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-11-21 13:51:03,727 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-21 13:51:03,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:03,727 INFO L85 PathProgramCache]: Analyzing trace with hash 239306399, now seen corresponding path program 1 times [2022-11-21 13:51:03,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:03,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413853944] [2022-11-21 13:51:03,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:03,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:03,829 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:51:03,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [916021656] [2022-11-21 13:51:03,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:03,830 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:51:03,830 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db687a7-8499-48a2-ba03-998712c40009/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:51:03,837 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db687a7-8499-48a2-ba03-998712c40009/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:51:03,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db687a7-8499-48a2-ba03-998712c40009/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-21 13:51:05,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:51:05,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 3266 conjuncts, 42 conjunts are in the unsatisfiable core [2022-11-21 13:51:05,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:51:06,066 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 251 proven. 3 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2022-11-21 13:51:06,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:51:06,639 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 6 proven. 63 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2022-11-21 13:51:06,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:51:06,639 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413853944] [2022-11-21 13:51:06,639 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:51:06,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916021656] [2022-11-21 13:51:06,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916021656] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:51:06,640 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:51:06,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2022-11-21 13:51:06,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393032383] [2022-11-21 13:51:06,641 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:51:06,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-21 13:51:06,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:51:06,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-21 13:51:06,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-11-21 13:51:06,643 INFO L87 Difference]: Start difference. First operand 7814 states and 9798 transitions. Second operand has 14 states, 13 states have (on average 15.76923076923077) internal successors, (205), 12 states have internal predecessors, (205), 5 states have call successors, (89), 2 states have call predecessors, (89), 5 states have return successors, (88), 6 states have call predecessors, (88), 5 states have call successors, (88) [2022-11-21 13:51:11,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:51:11,605 INFO L93 Difference]: Finished difference Result 17606 states and 22912 transitions. [2022-11-21 13:51:11,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 13:51:11,605 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 15.76923076923077) internal successors, (205), 12 states have internal predecessors, (205), 5 states have call successors, (89), 2 states have call predecessors, (89), 5 states have return successors, (88), 6 states have call predecessors, (88), 5 states have call successors, (88) Word has length 322 [2022-11-21 13:51:11,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:51:11,631 INFO L225 Difference]: With dead ends: 17606 [2022-11-21 13:51:11,631 INFO L226 Difference]: Without dead ends: 10459 [2022-11-21 13:51:11,650 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 644 GetRequests, 630 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-11-21 13:51:11,650 INFO L413 NwaCegarLoop]: 2305 mSDtfsCounter, 911 mSDsluCounter, 15372 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1150 SdHoareTripleChecker+Valid, 17677 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-21 13:51:11,651 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1150 Valid, 17677 Invalid, 551 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [240 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-21 13:51:11,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10459 states. [2022-11-21 13:51:13,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10459 to 7814. [2022-11-21 13:51:13,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7814 states, 5036 states have (on average 1.1675933280381254) internal successors, (5880), 5176 states have internal predecessors, (5880), 1948 states have call successors, (1948), 832 states have call predecessors, (1948), 826 states have return successors, (1968), 1899 states have call predecessors, (1968), 1946 states have call successors, (1968) [2022-11-21 13:51:13,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7814 states to 7814 states and 9796 transitions. [2022-11-21 13:51:13,779 INFO L78 Accepts]: Start accepts. Automaton has 7814 states and 9796 transitions. Word has length 322 [2022-11-21 13:51:13,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:51:13,780 INFO L495 AbstractCegarLoop]: Abstraction has 7814 states and 9796 transitions. [2022-11-21 13:51:13,780 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 15.76923076923077) internal successors, (205), 12 states have internal predecessors, (205), 5 states have call successors, (89), 2 states have call predecessors, (89), 5 states have return successors, (88), 6 states have call predecessors, (88), 5 states have call successors, (88) [2022-11-21 13:51:13,780 INFO L276 IsEmpty]: Start isEmpty. Operand 7814 states and 9796 transitions. [2022-11-21 13:51:13,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2022-11-21 13:51:13,786 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:51:13,787 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 13:51:13,814 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db687a7-8499-48a2-ba03-998712c40009/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-21 13:51:14,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db687a7-8499-48a2-ba03-998712c40009/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:51:14,001 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-21 13:51:14,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:51:14,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1560171998, now seen corresponding path program 1 times [2022-11-21 13:51:14,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:51:14,002 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634430979] [2022-11-21 13:51:14,002 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:14,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:51:14,122 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:51:14,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1140471537] [2022-11-21 13:51:14,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:51:14,123 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:51:14,123 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db687a7-8499-48a2-ba03-998712c40009/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:51:14,124 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db687a7-8499-48a2-ba03-998712c40009/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:51:14,130 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db687a7-8499-48a2-ba03-998712c40009/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-21 13:52:12,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-21 13:52:12,739 INFO L263 TraceCheckSpWp]: Trace formula consists of 3284 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-21 13:52:12,750 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-21 13:52:12,933 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 337 proven. 3 refuted. 0 times theorem prover too weak. 310 trivial. 0 not checked. [2022-11-21 13:52:12,934 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-21 13:52:13,524 INFO L134 CoverageAnalysis]: Checked inductivity of 650 backedges. 18 proven. 51 refuted. 0 times theorem prover too weak. 581 trivial. 0 not checked. [2022-11-21 13:52:13,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-21 13:52:13,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634430979] [2022-11-21 13:52:13,524 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-21 13:52:13,525 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1140471537] [2022-11-21 13:52:13,525 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1140471537] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-21 13:52:13,525 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-21 13:52:13,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2022-11-21 13:52:13,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311448277] [2022-11-21 13:52:13,526 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-21 13:52:13,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-21 13:52:13,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-21 13:52:13,528 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-21 13:52:13,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-11-21 13:52:13,528 INFO L87 Difference]: Start difference. First operand 7814 states and 9796 transitions. Second operand has 14 states, 13 states have (on average 15.923076923076923) internal successors, (207), 12 states have internal predecessors, (207), 5 states have call successors, (89), 2 states have call predecessors, (89), 5 states have return successors, (88), 6 states have call predecessors, (88), 5 states have call successors, (88) [2022-11-21 13:52:17,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-21 13:52:17,213 INFO L93 Difference]: Finished difference Result 17593 states and 22892 transitions. [2022-11-21 13:52:17,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-21 13:52:17,215 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 15.923076923076923) internal successors, (207), 12 states have internal predecessors, (207), 5 states have call successors, (89), 2 states have call predecessors, (89), 5 states have return successors, (88), 6 states have call predecessors, (88), 5 states have call successors, (88) Word has length 326 [2022-11-21 13:52:17,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-21 13:52:17,237 INFO L225 Difference]: With dead ends: 17593 [2022-11-21 13:52:17,237 INFO L226 Difference]: Without dead ends: 10459 [2022-11-21 13:52:17,251 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 652 GetRequests, 638 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2022-11-21 13:52:17,252 INFO L413 NwaCegarLoop]: 2304 mSDtfsCounter, 455 mSDsluCounter, 19270 mSDsCounter, 0 mSdLazyCounter, 398 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 692 SdHoareTripleChecker+Valid, 21574 SdHoareTripleChecker+Invalid, 400 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 398 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-21 13:52:17,252 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [692 Valid, 21574 Invalid, 400 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 398 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-21 13:52:17,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10459 states. [2022-11-21 13:52:19,193 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10459 to 7814. [2022-11-21 13:52:19,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7814 states, 5036 states have (on average 1.1671961874503574) internal successors, (5878), 5174 states have internal predecessors, (5878), 1948 states have call successors, (1948), 832 states have call predecessors, (1948), 826 states have return successors, (1968), 1899 states have call predecessors, (1968), 1946 states have call successors, (1968) [2022-11-21 13:52:19,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7814 states to 7814 states and 9794 transitions. [2022-11-21 13:52:19,219 INFO L78 Accepts]: Start accepts. Automaton has 7814 states and 9794 transitions. Word has length 326 [2022-11-21 13:52:19,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-21 13:52:19,219 INFO L495 AbstractCegarLoop]: Abstraction has 7814 states and 9794 transitions. [2022-11-21 13:52:19,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 15.923076923076923) internal successors, (207), 12 states have internal predecessors, (207), 5 states have call successors, (89), 2 states have call predecessors, (89), 5 states have return successors, (88), 6 states have call predecessors, (88), 5 states have call successors, (88) [2022-11-21 13:52:19,220 INFO L276 IsEmpty]: Start isEmpty. Operand 7814 states and 9794 transitions. [2022-11-21 13:52:19,225 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 331 [2022-11-21 13:52:19,225 INFO L187 NwaCegarLoop]: Found error trace [2022-11-21 13:52:19,225 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 13:52:19,271 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db687a7-8499-48a2-ba03-998712c40009/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-21 13:52:19,429 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db687a7-8499-48a2-ba03-998712c40009/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable40 [2022-11-21 13:52:19,429 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-11-21 13:52:19,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-21 13:52:19,430 INFO L85 PathProgramCache]: Analyzing trace with hash -348471169, now seen corresponding path program 1 times [2022-11-21 13:52:19,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-21 13:52:19,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353712702] [2022-11-21 13:52:19,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:52:19,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-21 13:52:19,525 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-21 13:52:19,525 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [835628103] [2022-11-21 13:52:19,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-21 13:52:19,526 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-21 13:52:19,526 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db687a7-8499-48a2-ba03-998712c40009/bin/uautomizer-vX5HgA9Q3a/z3 [2022-11-21 13:52:19,527 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db687a7-8499-48a2-ba03-998712c40009/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-21 13:52:19,534 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5db687a7-8499-48a2-ba03-998712c40009/bin/uautomizer-vX5HgA9Q3a/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-21 13:55:21,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-21 13:55:21,385 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.