./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--media--rc--lirc_dev.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 791161d1 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 21c7509b891e0ddc87dd83939d0ee5cb835b3606a1a2de3064d905837c808c7b --- Real Ultimate output --- This is Ultimate 0.2.2-?-791161d [2022-07-23 04:14:10,953 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-23 04:14:10,956 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-23 04:14:10,988 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-23 04:14:10,988 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-23 04:14:10,990 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-23 04:14:10,991 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-23 04:14:10,996 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-23 04:14:10,997 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-23 04:14:11,001 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-23 04:14:11,002 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-23 04:14:11,004 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-23 04:14:11,004 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-23 04:14:11,006 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-23 04:14:11,007 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-23 04:14:11,010 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-23 04:14:11,011 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-23 04:14:11,013 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-23 04:14:11,014 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-23 04:14:11,019 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-23 04:14:11,020 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-23 04:14:11,021 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-23 04:14:11,022 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-23 04:14:11,023 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-23 04:14:11,024 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-23 04:14:11,028 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-23 04:14:11,028 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-23 04:14:11,028 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-23 04:14:11,030 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-23 04:14:11,030 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-23 04:14:11,031 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-23 04:14:11,031 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-23 04:14:11,032 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-23 04:14:11,033 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-23 04:14:11,033 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-23 04:14:11,035 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-23 04:14:11,035 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-23 04:14:11,036 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-23 04:14:11,036 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-23 04:14:11,036 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-23 04:14:11,036 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-23 04:14:11,038 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-23 04:14:11,039 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-23 04:14:11,066 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-23 04:14:11,067 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-23 04:14:11,067 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-23 04:14:11,067 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-23 04:14:11,068 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-23 04:14:11,068 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-23 04:14:11,069 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-23 04:14:11,069 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-23 04:14:11,069 INFO L138 SettingsManager]: * Use SBE=true [2022-07-23 04:14:11,070 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-23 04:14:11,070 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-23 04:14:11,071 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-23 04:14:11,071 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-23 04:14:11,071 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-23 04:14:11,071 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-23 04:14:11,071 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-23 04:14:11,071 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-23 04:14:11,071 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-23 04:14:11,072 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-23 04:14:11,073 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-23 04:14:11,073 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-23 04:14:11,073 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 04:14:11,074 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-23 04:14:11,074 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-23 04:14:11,074 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-23 04:14:11,074 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-23 04:14:11,074 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-23 04:14:11,074 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-23 04:14:11,074 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-23 04:14:11,075 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-23 04:14:11,075 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> 21c7509b891e0ddc87dd83939d0ee5cb835b3606a1a2de3064d905837c808c7b [2022-07-23 04:14:11,303 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-23 04:14:11,319 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-23 04:14:11,321 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-23 04:14:11,322 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-23 04:14:11,322 INFO L275 PluginConnector]: CDTParser initialized [2022-07-23 04:14:11,323 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i [2022-07-23 04:14:11,369 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efde23fb5/510c00029631459791f982160b31e7ad/FLAG3c6c6ac7e [2022-07-23 04:14:11,942 INFO L306 CDTParser]: Found 1 translation units. [2022-07-23 04:14:11,943 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i [2022-07-23 04:14:11,977 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efde23fb5/510c00029631459791f982160b31e7ad/FLAG3c6c6ac7e [2022-07-23 04:14:12,398 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/efde23fb5/510c00029631459791f982160b31e7ad [2022-07-23 04:14:12,401 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-23 04:14:12,402 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-23 04:14:12,404 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-23 04:14:12,404 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-23 04:14:12,406 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-23 04:14:12,407 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 04:14:12" (1/1) ... [2022-07-23 04:14:12,407 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@254360ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:14:12, skipping insertion in model container [2022-07-23 04:14:12,408 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.07 04:14:12" (1/1) ... [2022-07-23 04:14:12,412 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-23 04:14:12,515 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-23 04:14:14,288 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292064,292077] [2022-07-23 04:14:14,291 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292209,292222] [2022-07-23 04:14:14,292 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292355,292368] [2022-07-23 04:14:14,297 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292520,292533] [2022-07-23 04:14:14,298 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292678,292691] [2022-07-23 04:14:14,299 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292836,292849] [2022-07-23 04:14:14,299 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292994,293007] [2022-07-23 04:14:14,300 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293154,293167] [2022-07-23 04:14:14,300 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293313,293326] [2022-07-23 04:14:14,300 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293452,293465] [2022-07-23 04:14:14,301 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293594,293607] [2022-07-23 04:14:14,301 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293743,293756] [2022-07-23 04:14:14,302 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293882,293895] [2022-07-23 04:14:14,303 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294037,294050] [2022-07-23 04:14:14,303 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294197,294210] [2022-07-23 04:14:14,304 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294348,294361] [2022-07-23 04:14:14,306 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294499,294512] [2022-07-23 04:14:14,307 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294651,294664] [2022-07-23 04:14:14,308 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294800,294813] [2022-07-23 04:14:14,309 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294948,294961] [2022-07-23 04:14:14,309 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295105,295118] [2022-07-23 04:14:14,309 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295254,295267] [2022-07-23 04:14:14,310 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295410,295423] [2022-07-23 04:14:14,311 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295563,295576] [2022-07-23 04:14:14,312 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295709,295722] [2022-07-23 04:14:14,317 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295852,295865] [2022-07-23 04:14:14,319 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296004,296017] [2022-07-23 04:14:14,319 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296150,296163] [2022-07-23 04:14:14,320 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296295,296308] [2022-07-23 04:14:14,321 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296449,296462] [2022-07-23 04:14:14,322 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296600,296613] [2022-07-23 04:14:14,322 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296755,296768] [2022-07-23 04:14:14,323 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296907,296920] [2022-07-23 04:14:14,323 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297062,297075] [2022-07-23 04:14:14,324 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297226,297239] [2022-07-23 04:14:14,324 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297382,297395] [2022-07-23 04:14:14,324 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297546,297559] [2022-07-23 04:14:14,325 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297688,297701] [2022-07-23 04:14:14,326 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297846,297859] [2022-07-23 04:14:14,326 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298013,298026] [2022-07-23 04:14:14,326 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298172,298185] [2022-07-23 04:14:14,327 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298331,298344] [2022-07-23 04:14:14,327 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298480,298493] [2022-07-23 04:14:14,327 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298627,298640] [2022-07-23 04:14:14,328 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298766,298779] [2022-07-23 04:14:14,328 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298929,298942] [2022-07-23 04:14:14,328 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299095,299108] [2022-07-23 04:14:14,329 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299259,299272] [2022-07-23 04:14:14,330 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299424,299437] [2022-07-23 04:14:14,330 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299589,299602] [2022-07-23 04:14:14,330 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299755,299768] [2022-07-23 04:14:14,330 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299920,299933] [2022-07-23 04:14:14,331 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300087,300100] [2022-07-23 04:14:14,331 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300247,300260] [2022-07-23 04:14:14,331 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300409,300422] [2022-07-23 04:14:14,332 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300568,300581] [2022-07-23 04:14:14,332 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300714,300727] [2022-07-23 04:14:14,332 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300857,300870] [2022-07-23 04:14:14,333 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301001,301014] [2022-07-23 04:14:14,333 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301144,301157] [2022-07-23 04:14:14,334 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301288,301301] [2022-07-23 04:14:14,335 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301429,301442] [2022-07-23 04:14:14,335 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301567,301580] [2022-07-23 04:14:14,335 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301725,301738] [2022-07-23 04:14:14,336 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301884,301897] [2022-07-23 04:14:14,336 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302040,302053] [2022-07-23 04:14:14,336 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302189,302202] [2022-07-23 04:14:14,337 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302341,302354] [2022-07-23 04:14:14,337 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302492,302505] [2022-07-23 04:14:14,337 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302641,302654] [2022-07-23 04:14:14,338 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302793,302806] [2022-07-23 04:14:14,338 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302941,302954] [2022-07-23 04:14:14,338 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303094,303107] [2022-07-23 04:14:14,338 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303245,303258] [2022-07-23 04:14:14,339 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303395,303408] [2022-07-23 04:14:14,339 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303542,303555] [2022-07-23 04:14:14,339 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303693,303706] [2022-07-23 04:14:14,340 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303844,303857] [2022-07-23 04:14:14,340 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303992,304005] [2022-07-23 04:14:14,340 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304158,304171] [2022-07-23 04:14:14,341 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304327,304340] [2022-07-23 04:14:14,341 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304494,304507] [2022-07-23 04:14:14,341 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304662,304675] [2022-07-23 04:14:14,342 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304812,304825] [2022-07-23 04:14:14,342 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304959,304972] [2022-07-23 04:14:14,342 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[305120,305133] [2022-07-23 04:14:14,342 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[305290,305303] [2022-07-23 04:14:14,343 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[305452,305465] [2022-07-23 04:14:14,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 04:14:14,420 INFO L203 MainTranslator]: Completed pre-run [2022-07-23 04:14:14,647 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292064,292077] [2022-07-23 04:14:14,649 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292209,292222] [2022-07-23 04:14:14,650 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292355,292368] [2022-07-23 04:14:14,650 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292520,292533] [2022-07-23 04:14:14,651 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292678,292691] [2022-07-23 04:14:14,651 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292836,292849] [2022-07-23 04:14:14,652 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[292994,293007] [2022-07-23 04:14:14,652 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293154,293167] [2022-07-23 04:14:14,652 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293313,293326] [2022-07-23 04:14:14,653 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293452,293465] [2022-07-23 04:14:14,654 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293594,293607] [2022-07-23 04:14:14,657 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293743,293756] [2022-07-23 04:14:14,657 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[293882,293895] [2022-07-23 04:14:14,658 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294037,294050] [2022-07-23 04:14:14,658 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294197,294210] [2022-07-23 04:14:14,658 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294348,294361] [2022-07-23 04:14:14,658 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294499,294512] [2022-07-23 04:14:14,659 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294651,294664] [2022-07-23 04:14:14,659 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294800,294813] [2022-07-23 04:14:14,659 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[294948,294961] [2022-07-23 04:14:14,660 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295105,295118] [2022-07-23 04:14:14,661 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295254,295267] [2022-07-23 04:14:14,661 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295410,295423] [2022-07-23 04:14:14,662 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295563,295576] [2022-07-23 04:14:14,662 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295709,295722] [2022-07-23 04:14:14,662 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[295852,295865] [2022-07-23 04:14:14,663 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296004,296017] [2022-07-23 04:14:14,663 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296150,296163] [2022-07-23 04:14:14,664 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296295,296308] [2022-07-23 04:14:14,665 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296449,296462] [2022-07-23 04:14:14,665 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296600,296613] [2022-07-23 04:14:14,665 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296755,296768] [2022-07-23 04:14:14,666 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[296907,296920] [2022-07-23 04:14:14,666 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297062,297075] [2022-07-23 04:14:14,666 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297226,297239] [2022-07-23 04:14:14,667 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297382,297395] [2022-07-23 04:14:14,667 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297546,297559] [2022-07-23 04:14:14,667 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297688,297701] [2022-07-23 04:14:14,667 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[297846,297859] [2022-07-23 04:14:14,668 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298013,298026] [2022-07-23 04:14:14,669 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298172,298185] [2022-07-23 04:14:14,669 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298331,298344] [2022-07-23 04:14:14,670 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298480,298493] [2022-07-23 04:14:14,670 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298627,298640] [2022-07-23 04:14:14,670 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298766,298779] [2022-07-23 04:14:14,671 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[298929,298942] [2022-07-23 04:14:14,671 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299095,299108] [2022-07-23 04:14:14,671 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299259,299272] [2022-07-23 04:14:14,672 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299424,299437] [2022-07-23 04:14:14,672 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299589,299602] [2022-07-23 04:14:14,672 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299755,299768] [2022-07-23 04:14:14,673 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[299920,299933] [2022-07-23 04:14:14,695 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300087,300100] [2022-07-23 04:14:14,696 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300247,300260] [2022-07-23 04:14:14,696 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300409,300422] [2022-07-23 04:14:14,696 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300568,300581] [2022-07-23 04:14:14,696 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300714,300727] [2022-07-23 04:14:14,697 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[300857,300870] [2022-07-23 04:14:14,700 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301001,301014] [2022-07-23 04:14:14,701 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301144,301157] [2022-07-23 04:14:14,701 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301288,301301] [2022-07-23 04:14:14,702 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301429,301442] [2022-07-23 04:14:14,703 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301567,301580] [2022-07-23 04:14:14,704 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301725,301738] [2022-07-23 04:14:14,706 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[301884,301897] [2022-07-23 04:14:14,706 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302040,302053] [2022-07-23 04:14:14,706 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302189,302202] [2022-07-23 04:14:14,708 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302341,302354] [2022-07-23 04:14:14,708 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302492,302505] [2022-07-23 04:14:14,708 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302641,302654] [2022-07-23 04:14:14,708 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302793,302806] [2022-07-23 04:14:14,709 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[302941,302954] [2022-07-23 04:14:14,712 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303094,303107] [2022-07-23 04:14:14,713 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303245,303258] [2022-07-23 04:14:14,713 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303395,303408] [2022-07-23 04:14:14,715 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303542,303555] [2022-07-23 04:14:14,716 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303693,303706] [2022-07-23 04:14:14,716 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303844,303857] [2022-07-23 04:14:14,716 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[303992,304005] [2022-07-23 04:14:14,717 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304158,304171] [2022-07-23 04:14:14,717 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304327,304340] [2022-07-23 04:14:14,718 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304494,304507] [2022-07-23 04:14:14,718 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304662,304675] [2022-07-23 04:14:14,719 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304812,304825] [2022-07-23 04:14:14,719 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[304959,304972] [2022-07-23 04:14:14,719 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[305120,305133] [2022-07-23 04:14:14,719 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[305290,305303] [2022-07-23 04:14:14,720 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i[305452,305465] [2022-07-23 04:14:14,722 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-23 04:14:14,820 INFO L208 MainTranslator]: Completed translation [2022-07-23 04:14:14,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:14:14 WrapperNode [2022-07-23 04:14:14,821 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-23 04:14:14,821 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-23 04:14:14,822 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-23 04:14:14,822 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-23 04:14:14,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:14:14" (1/1) ... [2022-07-23 04:14:14,897 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:14:14" (1/1) ... [2022-07-23 04:14:14,951 INFO L137 Inliner]: procedures = 519, calls = 1770, calls flagged for inlining = 206, calls inlined = 55, statements flattened = 940 [2022-07-23 04:14:14,951 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-23 04:14:14,952 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-23 04:14:14,952 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-23 04:14:14,952 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-23 04:14:14,968 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:14:14" (1/1) ... [2022-07-23 04:14:14,968 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:14:14" (1/1) ... [2022-07-23 04:14:14,972 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:14:14" (1/1) ... [2022-07-23 04:14:14,976 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:14:14" (1/1) ... [2022-07-23 04:14:15,009 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:14:14" (1/1) ... [2022-07-23 04:14:15,014 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:14:14" (1/1) ... [2022-07-23 04:14:15,027 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:14:14" (1/1) ... [2022-07-23 04:14:15,034 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-23 04:14:15,037 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-23 04:14:15,042 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-23 04:14:15,043 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-23 04:14:15,044 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:14:14" (1/1) ... [2022-07-23 04:14:15,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-23 04:14:15,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:14:15,069 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-23 04:14:15,088 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-23 04:14:15,107 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_usb_gadget__class_registration_with_usb_gadget [2022-07-23 04:14:15,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_usb_gadget__class_registration_with_usb_gadget [2022-07-23 04:14:15,108 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_nonpositive [2022-07-23 04:14:15,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_nonpositive [2022-07-23 04:14:15,108 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-23 04:14:15,108 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-23 04:14:15,108 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-23 04:14:15,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-23 04:14:15,109 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-23 04:14:15,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-23 04:14:15,109 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-23 04:14:15,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-23 04:14:15,109 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-23 04:14:15,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-23 04:14:15,109 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-23 04:14:15,109 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-23 04:14:15,109 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-23 04:14:15,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-23 04:14:15,110 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-23 04:14:15,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-23 04:14:15,110 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-23 04:14:15,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-23 04:14:15,110 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-23 04:14:15,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-23 04:14:15,110 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-23 04:14:15,110 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-23 04:14:15,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-23 04:14:15,111 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-23 04:14:15,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-23 04:14:15,111 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_fs_char_dev__double_registration [2022-07-23 04:14:15,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_fs_char_dev__double_registration [2022-07-23 04:14:15,111 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-23 04:14:15,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-23 04:14:15,111 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-23 04:14:15,111 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-23 04:14:15,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-23 04:14:15,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-23 04:14:15,112 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-23 04:14:15,112 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-23 04:14:15,142 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-23 04:14:15,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-23 04:14:15,143 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-23 04:14:15,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-23 04:14:15,143 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-07-23 04:14:15,143 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-07-23 04:14:15,143 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-23 04:14:15,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-23 04:14:15,143 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_destroy_class [2022-07-23 04:14:15,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_destroy_class [2022-07-23 04:14:15,143 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-23 04:14:15,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-23 04:14:15,143 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-23 04:14:15,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-23 04:14:15,143 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-23 04:14:15,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-23 04:14:15,143 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_drivers_base_class__double_registration [2022-07-23 04:14:15,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_drivers_base_class__double_registration [2022-07-23 04:14:15,143 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_destroy_class [2022-07-23 04:14:15,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_destroy_class [2022-07-23 04:14:15,143 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-23 04:14:15,143 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-23 04:14:15,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-23 04:14:15,143 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-23 04:14:15,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-23 04:14:15,144 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-23 04:14:15,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-23 04:14:15,144 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-23 04:14:15,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-23 04:14:15,144 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-23 04:14:15,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-23 04:14:15,144 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-23 04:14:15,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-23 04:14:15,144 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-23 04:14:15,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-23 04:14:15,144 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-23 04:14:15,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-23 04:14:15,144 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-23 04:14:15,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-23 04:14:15,144 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-23 04:14:15,144 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_usb_gadget__chrdev_registration_with_usb_gadget [2022-07-23 04:14:15,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_usb_gadget__chrdev_registration_with_usb_gadget [2022-07-23 04:14:15,319 INFO L234 CfgBuilder]: Building ICFG [2022-07-23 04:14:15,321 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-23 04:14:15,473 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-23 04:14:15,890 INFO L275 CfgBuilder]: Performing block encoding [2022-07-23 04:14:15,898 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-23 04:14:15,898 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-23 04:14:15,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 04:14:15 BoogieIcfgContainer [2022-07-23 04:14:15,901 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-23 04:14:15,902 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-23 04:14:15,902 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-23 04:14:15,905 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-23 04:14:15,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.07 04:14:12" (1/3) ... [2022-07-23 04:14:15,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11d9eeb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 04:14:15, skipping insertion in model container [2022-07-23 04:14:15,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.07 04:14:14" (2/3) ... [2022-07-23 04:14:15,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11d9eeb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.07 04:14:15, skipping insertion in model container [2022-07-23 04:14:15,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.07 04:14:15" (3/3) ... [2022-07-23 04:14:15,908 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--media--rc--lirc_dev.ko.cil.i [2022-07-23 04:14:15,919 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-23 04:14:15,919 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 29 error locations. [2022-07-23 04:14:15,960 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-23 04:14:15,965 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=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@1a69e457, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4d28d9e8 [2022-07-23 04:14:15,965 INFO L358 AbstractCegarLoop]: Starting to check reachability of 29 error locations. [2022-07-23 04:14:15,988 INFO L276 IsEmpty]: Start isEmpty. Operand has 374 states, 231 states have (on average 1.3073593073593073) internal successors, (302), 263 states have internal predecessors, (302), 77 states have call successors, (77), 37 states have call predecessors, (77), 36 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) [2022-07-23 04:14:15,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-07-23 04:14:15,995 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:14:15,996 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:14:15,996 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_assert_linux_drivers_base_class__double_registrationErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:14:16,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:14:16,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1456749468, now seen corresponding path program 1 times [2022-07-23 04:14:16,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:14:16,008 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642328362] [2022-07-23 04:14:16,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:14:16,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:14:16,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:16,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:14:16,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:16,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 04:14:16,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:16,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:16,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:16,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-23 04:14:16,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:16,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 04:14:16,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:16,493 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-23 04:14:16,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:14:16,493 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642328362] [2022-07-23 04:14:16,494 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642328362] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:14:16,494 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:14:16,494 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:14:16,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228234016] [2022-07-23 04:14:16,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:14:16,499 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:14:16,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:14:16,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:14:16,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:14:16,552 INFO L87 Difference]: Start difference. First operand has 374 states, 231 states have (on average 1.3073593073593073) internal successors, (302), 263 states have internal predecessors, (302), 77 states have call successors, (77), 37 states have call predecessors, (77), 36 states have return successors, (75), 75 states have call predecessors, (75), 75 states have call successors, (75) Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-23 04:14:17,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:14:17,628 INFO L93 Difference]: Finished difference Result 1054 states and 1373 transitions. [2022-07-23 04:14:17,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:14:17,630 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 35 [2022-07-23 04:14:17,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:14:17,641 INFO L225 Difference]: With dead ends: 1054 [2022-07-23 04:14:17,641 INFO L226 Difference]: Without dead ends: 691 [2022-07-23 04:14:17,646 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-23 04:14:17,648 INFO L413 NwaCegarLoop]: 752 mSDtfsCounter, 539 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 1457 mSolverCounterSat, 124 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 607 SdHoareTripleChecker+Valid, 1491 SdHoareTripleChecker+Invalid, 1581 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 124 IncrementalHoareTripleChecker+Valid, 1457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-07-23 04:14:17,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [607 Valid, 1491 Invalid, 1581 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [124 Valid, 1457 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-07-23 04:14:17,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 691 states. [2022-07-23 04:14:17,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 691 to 480. [2022-07-23 04:14:17,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 480 states, 302 states have (on average 1.1754966887417218) internal successors, (355), 336 states have internal predecessors, (355), 101 states have call successors, (101), 50 states have call predecessors, (101), 49 states have return successors, (101), 97 states have call predecessors, (101), 99 states have call successors, (101) [2022-07-23 04:14:17,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 480 states to 480 states and 557 transitions. [2022-07-23 04:14:17,718 INFO L78 Accepts]: Start accepts. Automaton has 480 states and 557 transitions. Word has length 35 [2022-07-23 04:14:17,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:14:17,719 INFO L495 AbstractCegarLoop]: Abstraction has 480 states and 557 transitions. [2022-07-23 04:14:17,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 4 states have internal predecessors, (21), 2 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-07-23 04:14:17,719 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 557 transitions. [2022-07-23 04:14:17,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2022-07-23 04:14:17,721 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:14:17,721 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-07-23 04:14:17,722 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-23 04:14:17,722 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:14:17,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:14:17,722 INFO L85 PathProgramCache]: Analyzing trace with hash -1101797720, now seen corresponding path program 1 times [2022-07-23 04:14:17,723 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:14:17,723 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [743194160] [2022-07-23 04:14:17,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:14:17,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:14:17,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:17,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:14:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:17,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 04:14:17,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:17,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:17,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:17,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-23 04:14:17,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:17,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 04:14:17,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:17,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:14:17,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:17,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-23 04:14:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:17,881 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-07-23 04:14:17,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:14:17,882 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [743194160] [2022-07-23 04:14:17,882 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [743194160] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:14:17,882 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:14:17,882 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:14:17,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225747861] [2022-07-23 04:14:17,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:14:17,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:14:17,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:14:17,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:14:17,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:14:17,884 INFO L87 Difference]: Start difference. First operand 480 states and 557 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-23 04:14:18,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:14:18,404 INFO L93 Difference]: Finished difference Result 482 states and 559 transitions. [2022-07-23 04:14:18,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 04:14:18,404 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 48 [2022-07-23 04:14:18,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:14:18,408 INFO L225 Difference]: With dead ends: 482 [2022-07-23 04:14:18,408 INFO L226 Difference]: Without dead ends: 480 [2022-07-23 04:14:18,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-23 04:14:18,409 INFO L413 NwaCegarLoop]: 392 mSDtfsCounter, 508 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 605 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 568 SdHoareTripleChecker+Valid, 743 SdHoareTripleChecker+Invalid, 701 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 605 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 04:14:18,409 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [568 Valid, 743 Invalid, 701 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 605 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-23 04:14:18,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2022-07-23 04:14:18,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 478. [2022-07-23 04:14:18,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 478 states, 301 states have (on average 1.169435215946844) internal successors, (352), 334 states have internal predecessors, (352), 101 states have call successors, (101), 50 states have call predecessors, (101), 49 states have return successors, (101), 97 states have call predecessors, (101), 99 states have call successors, (101) [2022-07-23 04:14:18,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 478 states to 478 states and 554 transitions. [2022-07-23 04:14:18,432 INFO L78 Accepts]: Start accepts. Automaton has 478 states and 554 transitions. Word has length 48 [2022-07-23 04:14:18,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:14:18,432 INFO L495 AbstractCegarLoop]: Abstraction has 478 states and 554 transitions. [2022-07-23 04:14:18,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 4 states have internal predecessors, (25), 2 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-23 04:14:18,432 INFO L276 IsEmpty]: Start isEmpty. Operand 478 states and 554 transitions. [2022-07-23 04:14:18,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-23 04:14:18,435 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:14:18,435 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1] [2022-07-23 04:14:18,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-23 04:14:18,435 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_assert_linux_fs_char_dev__double_registrationErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:14:18,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:14:18,436 INFO L85 PathProgramCache]: Analyzing trace with hash 951373245, now seen corresponding path program 1 times [2022-07-23 04:14:18,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:14:18,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1022982504] [2022-07-23 04:14:18,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:14:18,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:14:18,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:18,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:14:18,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:18,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 04:14:18,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:18,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:18,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:18,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-23 04:14:18,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:18,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 04:14:18,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:18,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:14:18,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:18,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-23 04:14:18,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:18,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-23 04:14:18,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:18,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-23 04:14:18,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:18,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:18,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:18,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:14:18,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:18,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:18,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:18,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:14:18,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:18,643 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2022-07-23 04:14:18,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:14:18,643 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1022982504] [2022-07-23 04:14:18,643 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1022982504] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:14:18,643 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:14:18,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:14:18,644 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069704597] [2022-07-23 04:14:18,644 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:14:18,644 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:14:18,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:14:18,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:14:18,645 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:14:18,645 INFO L87 Difference]: Start difference. First operand 478 states and 554 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-23 04:14:19,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:14:19,366 INFO L93 Difference]: Finished difference Result 821 states and 930 transitions. [2022-07-23 04:14:19,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:14:19,367 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (14), 3 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 86 [2022-07-23 04:14:19,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:14:19,371 INFO L225 Difference]: With dead ends: 821 [2022-07-23 04:14:19,371 INFO L226 Difference]: Without dead ends: 819 [2022-07-23 04:14:19,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-23 04:14:19,373 INFO L413 NwaCegarLoop]: 468 mSDtfsCounter, 632 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 985 mSolverCounterSat, 130 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 694 SdHoareTripleChecker+Valid, 918 SdHoareTripleChecker+Invalid, 1115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 130 IncrementalHoareTripleChecker+Valid, 985 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-23 04:14:19,373 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [694 Valid, 918 Invalid, 1115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [130 Valid, 985 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-23 04:14:19,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 819 states. [2022-07-23 04:14:19,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 819 to 672. [2022-07-23 04:14:19,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 672 states, 432 states have (on average 1.1828703703703705) internal successors, (511), 467 states have internal predecessors, (511), 137 states have call successors, (137), 78 states have call predecessors, (137), 77 states have return successors, (137), 131 states have call predecessors, (137), 135 states have call successors, (137) [2022-07-23 04:14:19,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 785 transitions. [2022-07-23 04:14:19,403 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 785 transitions. Word has length 86 [2022-07-23 04:14:19,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:14:19,403 INFO L495 AbstractCegarLoop]: Abstraction has 672 states and 785 transitions. [2022-07-23 04:14:19,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (14), 3 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-23 04:14:19,403 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 785 transitions. [2022-07-23 04:14:19,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-23 04:14:19,406 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:14:19,407 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:14:19,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-23 04:14:19,407 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_assert_linux_usb_gadget__chrdev_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:14:19,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:14:19,408 INFO L85 PathProgramCache]: Analyzing trace with hash -292723993, now seen corresponding path program 1 times [2022-07-23 04:14:19,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:14:19,408 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484925693] [2022-07-23 04:14:19,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:14:19,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:14:19,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:19,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:14:19,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:19,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 04:14:19,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:19,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:19,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:19,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-23 04:14:19,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:19,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 04:14:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:19,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:14:19,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:19,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-23 04:14:19,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:19,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-23 04:14:19,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:19,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-23 04:14:19,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:19,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:19,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:19,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:14:19,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:19,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:19,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:19,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:14:19,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:19,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:14:19,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:19,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:19,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:19,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:14:19,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:19,581 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2022-07-23 04:14:19,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:14:19,582 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484925693] [2022-07-23 04:14:19,582 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484925693] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:14:19,582 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:14:19,582 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:14:19,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [875476194] [2022-07-23 04:14:19,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:14:19,583 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:14:19,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:14:19,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:14:19,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:14:19,584 INFO L87 Difference]: Start difference. First operand 672 states and 785 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-23 04:14:20,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:14:20,028 INFO L93 Difference]: Finished difference Result 674 states and 787 transitions. [2022-07-23 04:14:20,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-23 04:14:20,028 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (15), 3 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 105 [2022-07-23 04:14:20,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:14:20,031 INFO L225 Difference]: With dead ends: 674 [2022-07-23 04:14:20,047 INFO L226 Difference]: Without dead ends: 672 [2022-07-23 04:14:20,048 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-23 04:14:20,048 INFO L413 NwaCegarLoop]: 388 mSDtfsCounter, 487 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 739 SdHoareTripleChecker+Invalid, 693 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:14:20,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 739 Invalid, 693 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 597 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 04:14:20,050 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 672 states. [2022-07-23 04:14:20,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 672 to 670. [2022-07-23 04:14:20,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 670 states, 431 states have (on average 1.1763341067285382) internal successors, (507), 465 states have internal predecessors, (507), 137 states have call successors, (137), 78 states have call predecessors, (137), 77 states have return successors, (137), 131 states have call predecessors, (137), 135 states have call successors, (137) [2022-07-23 04:14:20,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 670 states to 670 states and 781 transitions. [2022-07-23 04:14:20,074 INFO L78 Accepts]: Start accepts. Automaton has 670 states and 781 transitions. Word has length 105 [2022-07-23 04:14:20,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:14:20,074 INFO L495 AbstractCegarLoop]: Abstraction has 670 states and 781 transitions. [2022-07-23 04:14:20,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (15), 3 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-23 04:14:20,075 INFO L276 IsEmpty]: Start isEmpty. Operand 670 states and 781 transitions. [2022-07-23 04:14:20,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-23 04:14:20,077 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:14:20,077 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2022-07-23 04:14:20,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-23 04:14:20,077 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:14:20,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:14:20,078 INFO L85 PathProgramCache]: Analyzing trace with hash -876569357, now seen corresponding path program 1 times [2022-07-23 04:14:20,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:14:20,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254327648] [2022-07-23 04:14:20,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:14:20,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:14:20,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:20,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:14:20,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:20,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 04:14:20,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:20,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:20,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:20,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-23 04:14:20,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:20,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 04:14:20,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:20,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:14:20,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:20,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-23 04:14:20,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:20,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-23 04:14:20,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:20,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-23 04:14:20,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:20,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:20,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:20,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-23 04:14:20,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:20,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:14:20,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:20,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:14:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:20,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:20,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:20,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-23 04:14:20,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:20,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 04:14:20,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:20,273 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-23 04:14:20,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:14:20,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254327648] [2022-07-23 04:14:20,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [254327648] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:14:20,274 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:14:20,274 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 04:14:20,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [881892509] [2022-07-23 04:14:20,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:14:20,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 04:14:20,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:14:20,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 04:14:20,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-23 04:14:20,276 INFO L87 Difference]: Start difference. First operand 670 states and 781 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-23 04:14:20,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:14:20,805 INFO L93 Difference]: Finished difference Result 672 states and 783 transitions. [2022-07-23 04:14:20,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 04:14:20,805 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (17), 5 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-07-23 04:14:20,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:14:20,809 INFO L225 Difference]: With dead ends: 672 [2022-07-23 04:14:20,809 INFO L226 Difference]: Without dead ends: 670 [2022-07-23 04:14:20,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-23 04:14:20,811 INFO L413 NwaCegarLoop]: 387 mSDtfsCounter, 838 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 480 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 480 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:14:20,812 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 717 Invalid, 752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 480 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 04:14:20,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2022-07-23 04:14:20,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 668. [2022-07-23 04:14:20,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 668 states, 430 states have (on average 1.172093023255814) internal successors, (504), 463 states have internal predecessors, (504), 137 states have call successors, (137), 78 states have call predecessors, (137), 77 states have return successors, (137), 131 states have call predecessors, (137), 135 states have call successors, (137) [2022-07-23 04:14:20,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 668 states to 668 states and 778 transitions. [2022-07-23 04:14:20,839 INFO L78 Accepts]: Start accepts. Automaton has 668 states and 778 transitions. Word has length 107 [2022-07-23 04:14:20,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:14:20,840 INFO L495 AbstractCegarLoop]: Abstraction has 668 states and 778 transitions. [2022-07-23 04:14:20,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-23 04:14:20,840 INFO L276 IsEmpty]: Start isEmpty. Operand 668 states and 778 transitions. [2022-07-23 04:14:20,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-23 04:14:20,844 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:14:20,844 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2022-07-23 04:14:20,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-23 04:14:20,845 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:14:20,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:14:20,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1725971280, now seen corresponding path program 1 times [2022-07-23 04:14:20,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:14:20,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194373814] [2022-07-23 04:14:20,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:14:20,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:14:20,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:20,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:14:20,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:20,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 04:14:21,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:21,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:21,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:21,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-23 04:14:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:21,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 04:14:21,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:21,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:14:21,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:21,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-23 04:14:21,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:21,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-23 04:14:21,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:21,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-23 04:14:21,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:21,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:21,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-23 04:14:21,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:21,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:14:21,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:21,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:14:21,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:21,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:21,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:21,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-23 04:14:21,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:21,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 04:14:21,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:21,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-23 04:14:21,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:21,100 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-23 04:14:21,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:14:21,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194373814] [2022-07-23 04:14:21,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194373814] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:14:21,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:14:21,101 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 04:14:21,101 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262826639] [2022-07-23 04:14:21,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:14:21,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 04:14:21,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:14:21,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 04:14:21,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-23 04:14:21,103 INFO L87 Difference]: Start difference. First operand 668 states and 778 transitions. Second operand has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-23 04:14:21,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:14:21,586 INFO L93 Difference]: Finished difference Result 670 states and 780 transitions. [2022-07-23 04:14:21,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 04:14:21,587 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (18), 5 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-07-23 04:14:21,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:14:21,590 INFO L225 Difference]: With dead ends: 670 [2022-07-23 04:14:21,603 INFO L226 Difference]: Without dead ends: 668 [2022-07-23 04:14:21,604 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-23 04:14:21,605 INFO L413 NwaCegarLoop]: 385 mSDtfsCounter, 830 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 478 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 879 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 478 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:14:21,605 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [879 Valid, 715 Invalid, 750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 478 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 04:14:21,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2022-07-23 04:14:21,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 666. [2022-07-23 04:14:21,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 666 states, 429 states have (on average 1.167832167832168) internal successors, (501), 461 states have internal predecessors, (501), 137 states have call successors, (137), 78 states have call predecessors, (137), 77 states have return successors, (137), 131 states have call predecessors, (137), 135 states have call successors, (137) [2022-07-23 04:14:21,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 666 states and 775 transitions. [2022-07-23 04:14:21,631 INFO L78 Accepts]: Start accepts. Automaton has 666 states and 775 transitions. Word has length 113 [2022-07-23 04:14:21,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:14:21,632 INFO L495 AbstractCegarLoop]: Abstraction has 666 states and 775 transitions. [2022-07-23 04:14:21,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.428571428571429) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (18), 5 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-23 04:14:21,632 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 775 transitions. [2022-07-23 04:14:21,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2022-07-23 04:14:21,633 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:14:21,634 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 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] [2022-07-23 04:14:21,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-23 04:14:21,634 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_drivers_base_class_destroy_classErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:14:21,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:14:21,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1315263575, now seen corresponding path program 1 times [2022-07-23 04:14:21,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:14:21,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940124888] [2022-07-23 04:14:21,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:14:21,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:14:21,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:21,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:14:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:21,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 04:14:21,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:21,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:21,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:21,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-23 04:14:21,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:21,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 04:14:21,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:21,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:14:21,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:21,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-23 04:14:21,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:21,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-23 04:14:21,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:21,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-23 04:14:21,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:21,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:21,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:21,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-23 04:14:21,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:21,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:14:21,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:21,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:14:21,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:21,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:21,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:21,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-23 04:14:21,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:21,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 04:14:21,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:21,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-23 04:14:21,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:21,957 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-23 04:14:21,957 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:14:21,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940124888] [2022-07-23 04:14:21,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940124888] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:14:21,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:14:21,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-23 04:14:21,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337267574] [2022-07-23 04:14:21,958 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:14:21,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-23 04:14:21,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:14:21,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-23 04:14:21,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2022-07-23 04:14:21,960 INFO L87 Difference]: Start difference. First operand 666 states and 775 transitions. Second operand has 15 states, 14 states have (on average 4.142857142857143) internal successors, (58), 10 states have internal predecessors, (58), 6 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (17), 6 states have call predecessors, (17), 5 states have call successors, (17) [2022-07-23 04:14:24,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:14:24,168 INFO L93 Difference]: Finished difference Result 1556 states and 1785 transitions. [2022-07-23 04:14:24,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-23 04:14:24,168 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.142857142857143) internal successors, (58), 10 states have internal predecessors, (58), 6 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (17), 6 states have call predecessors, (17), 5 states have call successors, (17) Word has length 114 [2022-07-23 04:14:24,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:14:24,174 INFO L225 Difference]: With dead ends: 1556 [2022-07-23 04:14:24,174 INFO L226 Difference]: Without dead ends: 1317 [2022-07-23 04:14:24,175 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 118 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=159, Invalid=771, Unknown=0, NotChecked=0, Total=930 [2022-07-23 04:14:24,176 INFO L413 NwaCegarLoop]: 380 mSDtfsCounter, 1539 mSDsluCounter, 1359 mSDsCounter, 0 mSdLazyCounter, 3608 mSolverCounterSat, 868 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1549 SdHoareTripleChecker+Valid, 1739 SdHoareTripleChecker+Invalid, 4476 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 868 IncrementalHoareTripleChecker+Valid, 3608 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-23 04:14:24,176 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1549 Valid, 1739 Invalid, 4476 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [868 Valid, 3608 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-23 04:14:24,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1317 states. [2022-07-23 04:14:24,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1317 to 902. [2022-07-23 04:14:24,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 902 states, 587 states have (on average 1.161839863713799) internal successors, (682), 628 states have internal predecessors, (682), 188 states have call successors, (188), 104 states have call predecessors, (188), 104 states have return successors, (188), 178 states have call predecessors, (188), 186 states have call successors, (188) [2022-07-23 04:14:24,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 902 states to 902 states and 1058 transitions. [2022-07-23 04:14:24,218 INFO L78 Accepts]: Start accepts. Automaton has 902 states and 1058 transitions. Word has length 114 [2022-07-23 04:14:24,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:14:24,218 INFO L495 AbstractCegarLoop]: Abstraction has 902 states and 1058 transitions. [2022-07-23 04:14:24,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.142857142857143) internal successors, (58), 10 states have internal predecessors, (58), 6 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (17), 6 states have call predecessors, (17), 5 states have call successors, (17) [2022-07-23 04:14:24,218 INFO L276 IsEmpty]: Start isEmpty. Operand 902 states and 1058 transitions. [2022-07-23 04:14:24,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-23 04:14:24,221 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:14:24,221 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 3, 3, 3, 3, 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] [2022-07-23 04:14:24,221 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-23 04:14:24,222 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_drivers_base_class_destroy_classErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:14:24,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:14:24,222 INFO L85 PathProgramCache]: Analyzing trace with hash -331086751, now seen corresponding path program 1 times [2022-07-23 04:14:24,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:14:24,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [277706786] [2022-07-23 04:14:24,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:14:24,223 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:14:24,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:24,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:14:24,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:24,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 04:14:24,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:24,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:24,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:24,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-23 04:14:24,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:24,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 04:14:24,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:24,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:14:24,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:24,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-23 04:14:24,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:24,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-23 04:14:24,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:24,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-23 04:14:24,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:24,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:24,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:24,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:14:24,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:24,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:24,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:24,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:14:24,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:24,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:14:24,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:24,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:24,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:24,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:14:24,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:24,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-23 04:14:24,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:24,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-23 04:14:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:24,537 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-07-23 04:14:24,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:14:24,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [277706786] [2022-07-23 04:14:24,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [277706786] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:14:24,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:14:24,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-23 04:14:24,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83176571] [2022-07-23 04:14:24,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:14:24,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-23 04:14:24,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:14:24,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-23 04:14:24,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-07-23 04:14:24,538 INFO L87 Difference]: Start difference. First operand 902 states and 1058 transitions. Second operand has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 10 states have internal predecessors, (55), 6 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2022-07-23 04:14:26,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:14:26,713 INFO L93 Difference]: Finished difference Result 1829 states and 2159 transitions. [2022-07-23 04:14:26,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-23 04:14:26,714 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 10 states have internal predecessors, (55), 6 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) Word has length 122 [2022-07-23 04:14:26,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:14:26,720 INFO L225 Difference]: With dead ends: 1829 [2022-07-23 04:14:26,720 INFO L226 Difference]: Without dead ends: 1329 [2022-07-23 04:14:26,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=415, Unknown=0, NotChecked=0, Total=506 [2022-07-23 04:14:26,722 INFO L413 NwaCegarLoop]: 454 mSDtfsCounter, 846 mSDsluCounter, 1903 mSDsCounter, 0 mSdLazyCounter, 3507 mSolverCounterSat, 791 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 864 SdHoareTripleChecker+Valid, 2357 SdHoareTripleChecker+Invalid, 4298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 791 IncrementalHoareTripleChecker+Valid, 3507 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-23 04:14:26,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [864 Valid, 2357 Invalid, 4298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [791 Valid, 3507 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-23 04:14:26,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1329 states. [2022-07-23 04:14:26,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1329 to 887. [2022-07-23 04:14:26,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 887 states, 575 states have (on average 1.151304347826087) internal successors, (662), 616 states have internal predecessors, (662), 185 states have call successors, (185), 104 states have call predecessors, (185), 104 states have return successors, (184), 175 states have call predecessors, (184), 183 states have call successors, (184) [2022-07-23 04:14:26,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 887 states to 887 states and 1031 transitions. [2022-07-23 04:14:26,765 INFO L78 Accepts]: Start accepts. Automaton has 887 states and 1031 transitions. Word has length 122 [2022-07-23 04:14:26,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:14:26,765 INFO L495 AbstractCegarLoop]: Abstraction has 887 states and 1031 transitions. [2022-07-23 04:14:26,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.583333333333333) internal successors, (55), 10 states have internal predecessors, (55), 6 states have call successors, (17), 3 states have call predecessors, (17), 2 states have return successors, (16), 6 states have call predecessors, (16), 5 states have call successors, (16) [2022-07-23 04:14:26,765 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1031 transitions. [2022-07-23 04:14:26,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-23 04:14:26,767 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:14:26,768 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2022-07-23 04:14:26,768 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-23 04:14:26,768 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:14:26,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:14:26,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1688734875, now seen corresponding path program 1 times [2022-07-23 04:14:26,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:14:26,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680287287] [2022-07-23 04:14:26,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:14:26,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:14:26,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:26,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:14:26,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:26,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 04:14:26,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:27,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:27,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:27,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-23 04:14:27,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:27,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 04:14:27,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:27,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:14:27,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:27,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-23 04:14:27,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:27,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-23 04:14:27,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:27,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-23 04:14:27,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:27,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:27,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:27,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-23 04:14:27,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:27,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:14:27,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:27,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-23 04:14:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:27,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:27,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:27,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-23 04:14:27,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:27,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-23 04:14:27,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:27,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-23 04:14:27,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:27,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-23 04:14:27,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:27,190 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2022-07-23 04:14:27,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:14:27,190 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680287287] [2022-07-23 04:14:27,190 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680287287] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:14:27,190 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:14:27,190 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-07-23 04:14:27,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924575706] [2022-07-23 04:14:27,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:14:27,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-23 04:14:27,191 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:14:27,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-23 04:14:27,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=307, Unknown=0, NotChecked=0, Total=342 [2022-07-23 04:14:27,192 INFO L87 Difference]: Start difference. First operand 887 states and 1031 transitions. Second operand has 19 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 12 states have internal predecessors, (62), 6 states have call successors, (18), 5 states have call predecessors, (18), 4 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) [2022-07-23 04:14:30,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:14:30,108 INFO L93 Difference]: Finished difference Result 1504 states and 1714 transitions. [2022-07-23 04:14:30,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-23 04:14:30,108 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 12 states have internal predecessors, (62), 6 states have call successors, (18), 5 states have call predecessors, (18), 4 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) Word has length 117 [2022-07-23 04:14:30,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:14:30,113 INFO L225 Difference]: With dead ends: 1504 [2022-07-23 04:14:30,113 INFO L226 Difference]: Without dead ends: 1199 [2022-07-23 04:14:30,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 294 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=287, Invalid=1519, Unknown=0, NotChecked=0, Total=1806 [2022-07-23 04:14:30,115 INFO L413 NwaCegarLoop]: 374 mSDtfsCounter, 1859 mSDsluCounter, 1782 mSDsCounter, 0 mSdLazyCounter, 4699 mSolverCounterSat, 1077 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1869 SdHoareTripleChecker+Valid, 2156 SdHoareTripleChecker+Invalid, 5776 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1077 IncrementalHoareTripleChecker+Valid, 4699 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:14:30,116 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1869 Valid, 2156 Invalid, 5776 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1077 Valid, 4699 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-23 04:14:30,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1199 states. [2022-07-23 04:14:30,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1199 to 883. [2022-07-23 04:14:30,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 883 states, 571 states have (on average 1.148861646234676) internal successors, (656), 612 states have internal predecessors, (656), 185 states have call successors, (185), 104 states have call predecessors, (185), 104 states have return successors, (184), 175 states have call predecessors, (184), 183 states have call successors, (184) [2022-07-23 04:14:30,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 883 states to 883 states and 1025 transitions. [2022-07-23 04:14:30,168 INFO L78 Accepts]: Start accepts. Automaton has 883 states and 1025 transitions. Word has length 117 [2022-07-23 04:14:30,168 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:14:30,168 INFO L495 AbstractCegarLoop]: Abstraction has 883 states and 1025 transitions. [2022-07-23 04:14:30,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 3.6470588235294117) internal successors, (62), 12 states have internal predecessors, (62), 6 states have call successors, (18), 5 states have call predecessors, (18), 4 states have return successors, (18), 7 states have call predecessors, (18), 6 states have call successors, (18) [2022-07-23 04:14:30,168 INFO L276 IsEmpty]: Start isEmpty. Operand 883 states and 1025 transitions. [2022-07-23 04:14:30,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-23 04:14:30,170 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:14:30,170 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 3, 3, 3, 3, 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] [2022-07-23 04:14:30,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-23 04:14:30,170 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_usb_gadget_destroy_classErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:14:30,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:14:30,171 INFO L85 PathProgramCache]: Analyzing trace with hash 1438984896, now seen corresponding path program 1 times [2022-07-23 04:14:30,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:14:30,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407559137] [2022-07-23 04:14:30,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:14:30,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:14:30,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:30,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:14:30,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:30,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 04:14:30,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:30,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:30,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:30,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-23 04:14:30,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:30,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 04:14:30,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:30,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-23 04:14:30,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:30,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2022-07-23 04:14:30,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:30,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-23 04:14:30,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:30,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-23 04:14:30,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:30,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:30,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:30,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-23 04:14:30,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:30,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:30,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:30,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:14:30,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:30,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2022-07-23 04:14:30,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:30,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:30,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:30,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:14:30,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:30,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-23 04:14:30,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:30,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-23 04:14:30,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:30,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-23 04:14:30,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:30,407 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 109 trivial. 0 not checked. [2022-07-23 04:14:30,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:14:30,407 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407559137] [2022-07-23 04:14:30,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1407559137] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:14:30,408 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:14:30,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-23 04:14:30,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488755896] [2022-07-23 04:14:30,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:14:30,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-23 04:14:30,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:14:30,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-23 04:14:30,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-23 04:14:30,409 INFO L87 Difference]: Start difference. First operand 883 states and 1025 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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-07-23 04:14:30,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:14:30,871 INFO L93 Difference]: Finished difference Result 897 states and 1046 transitions. [2022-07-23 04:14:30,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:14:30,872 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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 127 [2022-07-23 04:14:30,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:14:30,876 INFO L225 Difference]: With dead ends: 897 [2022-07-23 04:14:30,876 INFO L226 Difference]: Without dead ends: 895 [2022-07-23 04:14:30,876 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:14:30,877 INFO L413 NwaCegarLoop]: 382 mSDtfsCounter, 643 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 425 mSolverCounterSat, 186 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 695 SdHoareTripleChecker+Valid, 642 SdHoareTripleChecker+Invalid, 611 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 186 IncrementalHoareTripleChecker+Valid, 425 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:14:30,877 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [695 Valid, 642 Invalid, 611 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [186 Valid, 425 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 04:14:30,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 895 states. [2022-07-23 04:14:30,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 895 to 881. [2022-07-23 04:14:30,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 570 states have (on average 1.1403508771929824) internal successors, (650), 610 states have internal predecessors, (650), 185 states have call successors, (185), 104 states have call predecessors, (185), 104 states have return successors, (184), 175 states have call predecessors, (184), 183 states have call successors, (184) [2022-07-23 04:14:30,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1019 transitions. [2022-07-23 04:14:30,927 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1019 transitions. Word has length 127 [2022-07-23 04:14:30,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:14:30,928 INFO L495 AbstractCegarLoop]: Abstraction has 881 states and 1019 transitions. [2022-07-23 04:14:30,928 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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-07-23 04:14:30,928 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1019 transitions. [2022-07-23 04:14:30,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2022-07-23 04:14:30,929 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:14:30,930 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 3, 3, 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] [2022-07-23 04:14:30,930 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-23 04:14:30,930 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_drivers_base_class_destroy_classErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:14:30,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:14:30,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1921822841, now seen corresponding path program 1 times [2022-07-23 04:14:30,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:14:30,931 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008804247] [2022-07-23 04:14:30,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:14:30,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:14:31,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:31,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:14:31,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:31,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 04:14:31,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:31,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:31,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:31,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:14:31,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:31,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:14:31,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:31,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:14:31,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:31,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:14:31,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:31,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-23 04:14:31,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:31,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-23 04:14:31,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:31,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:14:31,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:31,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-23 04:14:31,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:31,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-23 04:14:31,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:31,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:31,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:31,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-23 04:14:31,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:31,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:31,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:31,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:14:31,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:31,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-23 04:14:31,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:31,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:31,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:31,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:14:31,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:31,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-23 04:14:31,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:31,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 04:14:31,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:31,470 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 8 proven. 26 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-07-23 04:14:31,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:14:31,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008804247] [2022-07-23 04:14:31,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008804247] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:14:31,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [242572593] [2022-07-23 04:14:31,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:14:31,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:14:31,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:14:31,472 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 04:14:31,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-23 04:14:31,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:31,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 1929 conjuncts, 69 conjunts are in the unsatisfiable core [2022-07-23 04:14:31,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:14:32,196 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 105 proven. 8 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-23 04:14:32,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 04:14:32,734 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 8 proven. 26 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-07-23 04:14:32,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [242572593] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 04:14:32,734 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 04:14:32,735 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 16] total 31 [2022-07-23 04:14:32,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345374735] [2022-07-23 04:14:32,735 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 04:14:32,735 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2022-07-23 04:14:32,735 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:14:32,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2022-07-23 04:14:32,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=843, Unknown=0, NotChecked=0, Total=930 [2022-07-23 04:14:32,736 INFO L87 Difference]: Start difference. First operand 881 states and 1019 transitions. Second operand has 31 states, 25 states have (on average 3.88) internal successors, (97), 22 states have internal predecessors, (97), 10 states have call successors, (38), 3 states have call predecessors, (38), 9 states have return successors, (39), 15 states have call predecessors, (39), 10 states have call successors, (39) [2022-07-23 04:14:35,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:14:35,261 INFO L93 Difference]: Finished difference Result 1691 states and 1940 transitions. [2022-07-23 04:14:35,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-23 04:14:35,261 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 25 states have (on average 3.88) internal successors, (97), 22 states have internal predecessors, (97), 10 states have call successors, (38), 3 states have call predecessors, (38), 9 states have return successors, (39), 15 states have call predecessors, (39), 10 states have call successors, (39) Word has length 138 [2022-07-23 04:14:35,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:14:35,265 INFO L225 Difference]: With dead ends: 1691 [2022-07-23 04:14:35,265 INFO L226 Difference]: Without dead ends: 883 [2022-07-23 04:14:35,266 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 342 GetRequests, 297 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 267 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=176, Invalid=1546, Unknown=0, NotChecked=0, Total=1722 [2022-07-23 04:14:35,267 INFO L413 NwaCegarLoop]: 367 mSDtfsCounter, 520 mSDsluCounter, 1961 mSDsCounter, 0 mSdLazyCounter, 4332 mSolverCounterSat, 432 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 530 SdHoareTripleChecker+Valid, 2328 SdHoareTripleChecker+Invalid, 4764 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 432 IncrementalHoareTripleChecker+Valid, 4332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-23 04:14:35,267 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [530 Valid, 2328 Invalid, 4764 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [432 Valid, 4332 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-23 04:14:35,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 883 states. [2022-07-23 04:14:35,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 883 to 881. [2022-07-23 04:14:35,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 881 states, 570 states have (on average 1.1333333333333333) internal successors, (646), 606 states have internal predecessors, (646), 185 states have call successors, (185), 104 states have call predecessors, (185), 104 states have return successors, (184), 175 states have call predecessors, (184), 183 states have call successors, (184) [2022-07-23 04:14:35,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 881 states to 881 states and 1015 transitions. [2022-07-23 04:14:35,336 INFO L78 Accepts]: Start accepts. Automaton has 881 states and 1015 transitions. Word has length 138 [2022-07-23 04:14:35,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:14:35,336 INFO L495 AbstractCegarLoop]: Abstraction has 881 states and 1015 transitions. [2022-07-23 04:14:35,336 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 25 states have (on average 3.88) internal successors, (97), 22 states have internal predecessors, (97), 10 states have call successors, (38), 3 states have call predecessors, (38), 9 states have return successors, (39), 15 states have call predecessors, (39), 10 states have call successors, (39) [2022-07-23 04:14:35,337 INFO L276 IsEmpty]: Start isEmpty. Operand 881 states and 1015 transitions. [2022-07-23 04:14:35,338 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2022-07-23 04:14:35,338 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:14:35,338 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 3, 3, 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] [2022-07-23 04:14:35,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-23 04:14:35,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-07-23 04:14:35,552 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_drivers_base_class_destroy_classErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:14:35,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:14:35,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1893739651, now seen corresponding path program 1 times [2022-07-23 04:14:35,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:14:35,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [883900312] [2022-07-23 04:14:35,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:14:35,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:14:35,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:35,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:14:35,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:35,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 04:14:35,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:35,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:35,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:35,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:14:35,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:35,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:14:35,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:36,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:14:36,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:36,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:14:36,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:36,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-23 04:14:36,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:36,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-07-23 04:14:36,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:36,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2022-07-23 04:14:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:36,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:14:36,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:36,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-23 04:14:36,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:36,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-23 04:14:36,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:36,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:36,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:36,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-23 04:14:36,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:36,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:36,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:36,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:14:36,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:36,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-23 04:14:36,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:36,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:36,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:36,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:14:36,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:36,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-23 04:14:36,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:36,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-23 04:14:36,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:36,119 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 6 proven. 28 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-07-23 04:14:36,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:14:36,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [883900312] [2022-07-23 04:14:36,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [883900312] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:14:36,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2106504980] [2022-07-23 04:14:36,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:14:36,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:14:36,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:14:36,121 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 04:14:36,131 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-23 04:14:36,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:36,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 1939 conjuncts, 93 conjunts are in the unsatisfiable core [2022-07-23 04:14:36,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:14:36,947 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 89 proven. 2 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2022-07-23 04:14:36,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 04:14:37,713 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-07-23 04:14:37,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2106504980] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 04:14:37,714 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 04:14:37,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 20, 16] total 46 [2022-07-23 04:14:37,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1394313999] [2022-07-23 04:14:37,714 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 04:14:37,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2022-07-23 04:14:37,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:14:37,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2022-07-23 04:14:37,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1937, Unknown=0, NotChecked=0, Total=2070 [2022-07-23 04:14:37,717 INFO L87 Difference]: Start difference. First operand 881 states and 1015 transitions. Second operand has 46 states, 40 states have (on average 3.1) internal successors, (124), 34 states have internal predecessors, (124), 12 states have call successors, (48), 4 states have call predecessors, (48), 12 states have return successors, (49), 18 states have call predecessors, (49), 12 states have call successors, (49) [2022-07-23 04:14:43,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:14:43,547 INFO L93 Difference]: Finished difference Result 1562 states and 1821 transitions. [2022-07-23 04:14:43,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-23 04:14:43,548 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 40 states have (on average 3.1) internal successors, (124), 34 states have internal predecessors, (124), 12 states have call successors, (48), 4 states have call predecessors, (48), 12 states have return successors, (49), 18 states have call predecessors, (49), 12 states have call successors, (49) Word has length 143 [2022-07-23 04:14:43,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:14:43,551 INFO L225 Difference]: With dead ends: 1562 [2022-07-23 04:14:43,552 INFO L226 Difference]: Without dead ends: 842 [2022-07-23 04:14:43,554 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 359 GetRequests, 297 SyntacticMatches, 1 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 779 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=254, Invalid=3652, Unknown=0, NotChecked=0, Total=3906 [2022-07-23 04:14:43,554 INFO L413 NwaCegarLoop]: 485 mSDtfsCounter, 436 mSDsluCounter, 6746 mSDsCounter, 0 mSdLazyCounter, 10591 mSolverCounterSat, 498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 443 SdHoareTripleChecker+Valid, 7231 SdHoareTripleChecker+Invalid, 11089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 498 IncrementalHoareTripleChecker+Valid, 10591 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:14:43,555 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [443 Valid, 7231 Invalid, 11089 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [498 Valid, 10591 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-07-23 04:14:43,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2022-07-23 04:14:43,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 767. [2022-07-23 04:14:43,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 767 states, 495 states have (on average 1.1373737373737374) internal successors, (563), 527 states have internal predecessors, (563), 157 states have call successors, (157), 93 states have call predecessors, (157), 93 states have return successors, (156), 150 states have call predecessors, (156), 155 states have call successors, (156) [2022-07-23 04:14:43,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 767 states to 767 states and 876 transitions. [2022-07-23 04:14:43,622 INFO L78 Accepts]: Start accepts. Automaton has 767 states and 876 transitions. Word has length 143 [2022-07-23 04:14:43,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:14:43,622 INFO L495 AbstractCegarLoop]: Abstraction has 767 states and 876 transitions. [2022-07-23 04:14:43,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 40 states have (on average 3.1) internal successors, (124), 34 states have internal predecessors, (124), 12 states have call successors, (48), 4 states have call predecessors, (48), 12 states have return successors, (49), 18 states have call predecessors, (49), 12 states have call successors, (49) [2022-07-23 04:14:43,623 INFO L276 IsEmpty]: Start isEmpty. Operand 767 states and 876 transitions. [2022-07-23 04:14:43,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-07-23 04:14:43,624 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:14:43,624 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 3, 3, 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] [2022-07-23 04:14:43,660 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-23 04:14:43,844 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-07-23 04:14:43,844 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_drivers_base_class_destroy_classErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:14:43,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:14:43,845 INFO L85 PathProgramCache]: Analyzing trace with hash 1252398581, now seen corresponding path program 1 times [2022-07-23 04:14:43,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:14:43,845 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103497196] [2022-07-23 04:14:43,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:14:43,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:14:43,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:43,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:14:43,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:43,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 04:14:43,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:43,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:43,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:43,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:14:43,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:43,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:14:43,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:43,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:14:43,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:43,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:14:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:43,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-23 04:14:43,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:43,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 04:14:43,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:43,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:14:43,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:43,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:14:43,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:44,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:14:44,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:44,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:14:44,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:44,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 04:14:44,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:44,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:44,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:44,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:14:44,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:44,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:44,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:44,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:14:44,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:44,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-23 04:14:44,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:44,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:44,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:44,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:14:44,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:44,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 04:14:44,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:44,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-23 04:14:44,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:44,048 INFO L134 CoverageAnalysis]: Checked inductivity of 178 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 178 trivial. 0 not checked. [2022-07-23 04:14:44,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:14:44,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103497196] [2022-07-23 04:14:44,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103497196] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:14:44,048 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:14:44,048 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-23 04:14:44,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225893881] [2022-07-23 04:14:44,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:14:44,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-23 04:14:44,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:14:44,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-23 04:14:44,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-23 04:14:44,051 INFO L87 Difference]: Start difference. First operand 767 states and 876 transitions. Second operand has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-23 04:14:44,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:14:44,783 INFO L93 Difference]: Finished difference Result 1203 states and 1371 transitions. [2022-07-23 04:14:44,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:14:44,784 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (22), 3 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 149 [2022-07-23 04:14:44,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:14:44,788 INFO L225 Difference]: With dead ends: 1203 [2022-07-23 04:14:44,788 INFO L226 Difference]: Without dead ends: 1201 [2022-07-23 04:14:44,789 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-07-23 04:14:44,790 INFO L413 NwaCegarLoop]: 441 mSDtfsCounter, 585 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 664 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 637 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 810 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 664 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-23 04:14:44,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [637 Valid, 748 Invalid, 810 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 664 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-23 04:14:44,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1201 states. [2022-07-23 04:14:44,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1201 to 889. [2022-07-23 04:14:44,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 889 states, 575 states have (on average 1.1356521739130434) internal successors, (653), 611 states have internal predecessors, (653), 181 states have call successors, (181), 109 states have call predecessors, (181), 111 states have return successors, (186), 172 states have call predecessors, (186), 179 states have call successors, (186) [2022-07-23 04:14:44,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 889 states to 889 states and 1020 transitions. [2022-07-23 04:14:44,869 INFO L78 Accepts]: Start accepts. Automaton has 889 states and 1020 transitions. Word has length 149 [2022-07-23 04:14:44,869 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:14:44,869 INFO L495 AbstractCegarLoop]: Abstraction has 889 states and 1020 transitions. [2022-07-23 04:14:44,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 12.8) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (22), 3 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-23 04:14:44,869 INFO L276 IsEmpty]: Start isEmpty. Operand 889 states and 1020 transitions. [2022-07-23 04:14:44,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-07-23 04:14:44,871 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:14:44,871 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 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] [2022-07-23 04:14:44,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-23 04:14:44,871 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:14:44,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:14:44,872 INFO L85 PathProgramCache]: Analyzing trace with hash 1102990983, now seen corresponding path program 1 times [2022-07-23 04:14:44,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:14:44,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866078077] [2022-07-23 04:14:44,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:14:44,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:14:44,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:45,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:14:45,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:45,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 04:14:45,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:45,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:45,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:45,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:14:45,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:45,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:14:45,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:45,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:14:45,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:45,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:14:45,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:45,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-23 04:14:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:45,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 04:14:45,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:45,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:14:45,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:45,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:14:45,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:45,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:14:45,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:45,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:14:45,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:45,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 04:14:45,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:45,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:45,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:45,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:14:45,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:45,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-23 04:14:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:45,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-23 04:14:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:45,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:45,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:45,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-23 04:14:45,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:45,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-23 04:14:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:45,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 04:14:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:45,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-23 04:14:45,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:45,611 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 5 proven. 20 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-23 04:14:45,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:14:45,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866078077] [2022-07-23 04:14:45,613 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866078077] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:14:45,613 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [876521913] [2022-07-23 04:14:45,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:14:45,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:14:45,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:14:45,614 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 04:14:45,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-23 04:14:45,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:45,962 INFO L263 TraceCheckSpWp]: Trace formula consists of 1933 conjuncts, 72 conjunts are in the unsatisfiable core [2022-07-23 04:14:45,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:14:46,704 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 48 proven. 18 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2022-07-23 04:14:46,705 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 04:14:47,290 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2022-07-23 04:14:47,291 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [876521913] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 04:14:47,291 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 04:14:47,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 16, 15] total 40 [2022-07-23 04:14:47,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857370379] [2022-07-23 04:14:47,291 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 04:14:47,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2022-07-23 04:14:47,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:14:47,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2022-07-23 04:14:47,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=1455, Unknown=0, NotChecked=0, Total=1560 [2022-07-23 04:14:47,293 INFO L87 Difference]: Start difference. First operand 889 states and 1020 transitions. Second operand has 40 states, 36 states have (on average 4.416666666666667) internal successors, (159), 33 states have internal predecessors, (159), 17 states have call successors, (56), 7 states have call predecessors, (56), 8 states have return successors, (57), 16 states have call predecessors, (57), 17 states have call successors, (57) [2022-07-23 04:14:53,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:14:53,807 INFO L93 Difference]: Finished difference Result 1433 states and 1590 transitions. [2022-07-23 04:14:53,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-07-23 04:14:53,807 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 36 states have (on average 4.416666666666667) internal successors, (159), 33 states have internal predecessors, (159), 17 states have call successors, (56), 7 states have call predecessors, (56), 8 states have return successors, (57), 16 states have call predecessors, (57), 17 states have call successors, (57) Word has length 144 [2022-07-23 04:14:53,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:14:53,813 INFO L225 Difference]: With dead ends: 1433 [2022-07-23 04:14:53,813 INFO L226 Difference]: Without dead ends: 1159 [2022-07-23 04:14:53,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 389 GetRequests, 310 SyntacticMatches, 5 SemanticMatches, 74 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 796 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=576, Invalid=5124, Unknown=0, NotChecked=0, Total=5700 [2022-07-23 04:14:53,816 INFO L413 NwaCegarLoop]: 557 mSDtfsCounter, 1714 mSDsluCounter, 4069 mSDsCounter, 0 mSdLazyCounter, 11348 mSolverCounterSat, 1355 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1714 SdHoareTripleChecker+Valid, 4626 SdHoareTripleChecker+Invalid, 12703 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1355 IncrementalHoareTripleChecker+Valid, 11348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:14:53,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1714 Valid, 4626 Invalid, 12703 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1355 Valid, 11348 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-07-23 04:14:53,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1159 states. [2022-07-23 04:14:53,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1159 to 884. [2022-07-23 04:14:53,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 884 states, 574 states have (on average 1.1289198606271778) internal successors, (648), 610 states have internal predecessors, (648), 175 states have call successors, (175), 109 states have call predecessors, (175), 113 states have return successors, (182), 168 states have call predecessors, (182), 173 states have call successors, (182) [2022-07-23 04:14:53,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 884 states to 884 states and 1005 transitions. [2022-07-23 04:14:53,987 INFO L78 Accepts]: Start accepts. Automaton has 884 states and 1005 transitions. Word has length 144 [2022-07-23 04:14:53,987 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:14:53,987 INFO L495 AbstractCegarLoop]: Abstraction has 884 states and 1005 transitions. [2022-07-23 04:14:53,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 36 states have (on average 4.416666666666667) internal successors, (159), 33 states have internal predecessors, (159), 17 states have call successors, (56), 7 states have call predecessors, (56), 8 states have return successors, (57), 16 states have call predecessors, (57), 17 states have call successors, (57) [2022-07-23 04:14:53,987 INFO L276 IsEmpty]: Start isEmpty. Operand 884 states and 1005 transitions. [2022-07-23 04:14:53,989 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-23 04:14:53,989 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:14:53,989 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 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] [2022-07-23 04:14:53,998 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-23 04:14:54,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:14:54,199 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:14:54,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:14:54,199 INFO L85 PathProgramCache]: Analyzing trace with hash -1777528727, now seen corresponding path program 1 times [2022-07-23 04:14:54,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:14:54,200 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [704328026] [2022-07-23 04:14:54,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:14:54,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:14:54,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:54,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:14:54,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:54,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 04:14:54,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:54,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:54,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:54,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:14:54,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:54,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:14:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:54,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:14:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:54,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:14:54,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:54,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-23 04:14:54,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:54,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 04:14:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:54,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:14:54,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:54,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:14:54,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:54,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:14:54,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:54,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:14:54,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:54,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 04:14:54,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:54,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:54,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:54,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:14:54,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:54,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-23 04:14:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:54,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-23 04:14:54,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:54,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:54,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:54,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-23 04:14:54,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:54,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-23 04:14:54,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:54,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 04:14:54,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:54,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-23 04:14:54,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:54,358 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-07-23 04:14:54,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:14:54,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [704328026] [2022-07-23 04:14:54,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [704328026] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:14:54,359 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:14:54,359 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 04:14:54,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1106055191] [2022-07-23 04:14:54,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:14:54,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 04:14:54,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:14:54,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 04:14:54,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-23 04:14:54,360 INFO L87 Difference]: Start difference. First operand 884 states and 1005 transitions. Second operand has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-23 04:14:54,867 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:14:54,867 INFO L93 Difference]: Finished difference Result 884 states and 1005 transitions. [2022-07-23 04:14:54,867 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 04:14:54,867 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (24), 5 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 146 [2022-07-23 04:14:54,868 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:14:54,896 INFO L225 Difference]: With dead ends: 884 [2022-07-23 04:14:54,896 INFO L226 Difference]: Without dead ends: 882 [2022-07-23 04:14:54,897 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-23 04:14:54,897 INFO L413 NwaCegarLoop]: 379 mSDtfsCounter, 811 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 857 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:14:54,897 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [857 Valid, 701 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 04:14:54,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 882 states. [2022-07-23 04:14:55,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 882 to 882. [2022-07-23 04:14:55,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 882 states, 573 states have (on average 1.12565445026178) internal successors, (645), 608 states have internal predecessors, (645), 175 states have call successors, (175), 109 states have call predecessors, (175), 113 states have return successors, (182), 168 states have call predecessors, (182), 173 states have call successors, (182) [2022-07-23 04:14:55,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 882 states to 882 states and 1002 transitions. [2022-07-23 04:14:55,009 INFO L78 Accepts]: Start accepts. Automaton has 882 states and 1002 transitions. Word has length 146 [2022-07-23 04:14:55,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:14:55,009 INFO L495 AbstractCegarLoop]: Abstraction has 882 states and 1002 transitions. [2022-07-23 04:14:55,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.285714285714286) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-23 04:14:55,010 INFO L276 IsEmpty]: Start isEmpty. Operand 882 states and 1002 transitions. [2022-07-23 04:14:55,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2022-07-23 04:14:55,012 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:14:55,012 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 4, 4, 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] [2022-07-23 04:14:55,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-23 04:14:55,012 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:14:55,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:14:55,013 INFO L85 PathProgramCache]: Analyzing trace with hash -608956573, now seen corresponding path program 1 times [2022-07-23 04:14:55,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:14:55,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372664934] [2022-07-23 04:14:55,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:14:55,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:14:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:56,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:14:56,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:56,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 04:14:56,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:56,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:56,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:56,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:14:56,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:56,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:14:56,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:56,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:14:56,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:56,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:14:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:56,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-23 04:14:56,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:56,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 04:14:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:56,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:14:56,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:56,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:14:56,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:56,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:14:56,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:56,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:14:56,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:56,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 04:14:56,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:56,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:56,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:14:56,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:56,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-23 04:14:56,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:56,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-23 04:14:56,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:56,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:14:56,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:56,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-23 04:14:56,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:56,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-23 04:14:56,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:56,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 04:14:56,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:56,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:14:56,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:56,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-23 04:14:56,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:56,849 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2022-07-23 04:14:56,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:14:56,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372664934] [2022-07-23 04:14:56,849 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372664934] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:14:56,849 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [365512990] [2022-07-23 04:14:56,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:14:56,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:14:56,849 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:14:56,851 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 04:14:56,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-23 04:14:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:14:57,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 1952 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-23 04:14:57,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:14:57,848 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 48 proven. 18 refuted. 0 times theorem prover too weak. 67 trivial. 0 not checked. [2022-07-23 04:14:57,848 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 04:14:58,296 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 3 proven. 18 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-07-23 04:14:58,297 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [365512990] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 04:14:58,297 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 04:14:58,297 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 16, 15] total 50 [2022-07-23 04:14:58,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635988062] [2022-07-23 04:14:58,297 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 04:14:58,297 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-07-23 04:14:58,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:14:58,298 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-07-23 04:14:58,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=2321, Unknown=0, NotChecked=0, Total=2450 [2022-07-23 04:14:58,299 INFO L87 Difference]: Start difference. First operand 882 states and 1002 transitions. Second operand has 50 states, 43 states have (on average 3.86046511627907) internal successors, (166), 40 states have internal predecessors, (166), 20 states have call successors, (63), 6 states have call predecessors, (63), 9 states have return successors, (65), 25 states have call predecessors, (65), 20 states have call successors, (65) [2022-07-23 04:15:04,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:04,952 INFO L93 Difference]: Finished difference Result 1072 states and 1195 transitions. [2022-07-23 04:15:04,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-07-23 04:15:04,952 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 43 states have (on average 3.86046511627907) internal successors, (166), 40 states have internal predecessors, (166), 20 states have call successors, (63), 6 states have call predecessors, (63), 9 states have return successors, (65), 25 states have call predecessors, (65), 20 states have call successors, (65) Word has length 150 [2022-07-23 04:15:04,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:04,956 INFO L225 Difference]: With dead ends: 1072 [2022-07-23 04:15:04,956 INFO L226 Difference]: Without dead ends: 898 [2022-07-23 04:15:04,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 321 SyntacticMatches, 2 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1224 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=564, Invalid=6078, Unknown=0, NotChecked=0, Total=6642 [2022-07-23 04:15:04,958 INFO L413 NwaCegarLoop]: 310 mSDtfsCounter, 2008 mSDsluCounter, 2655 mSDsCounter, 0 mSdLazyCounter, 7807 mSolverCounterSat, 1441 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2011 SdHoareTripleChecker+Valid, 2965 SdHoareTripleChecker+Invalid, 9248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1441 IncrementalHoareTripleChecker+Valid, 7807 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:04,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2011 Valid, 2965 Invalid, 9248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1441 Valid, 7807 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-07-23 04:15:04,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 898 states. [2022-07-23 04:15:05,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 898 to 894. [2022-07-23 04:15:05,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 581 states have (on average 1.1239242685025816) internal successors, (653), 618 states have internal predecessors, (653), 175 states have call successors, (175), 111 states have call predecessors, (175), 117 states have return successors, (186), 168 states have call predecessors, (186), 173 states have call successors, (186) [2022-07-23 04:15:05,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1014 transitions. [2022-07-23 04:15:05,110 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1014 transitions. Word has length 150 [2022-07-23 04:15:05,111 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:05,111 INFO L495 AbstractCegarLoop]: Abstraction has 894 states and 1014 transitions. [2022-07-23 04:15:05,111 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 43 states have (on average 3.86046511627907) internal successors, (166), 40 states have internal predecessors, (166), 20 states have call successors, (63), 6 states have call predecessors, (63), 9 states have return successors, (65), 25 states have call predecessors, (65), 20 states have call successors, (65) [2022-07-23 04:15:05,111 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1014 transitions. [2022-07-23 04:15:05,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-23 04:15:05,113 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:05,113 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 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] [2022-07-23 04:15:05,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-23 04:15:05,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-07-23 04:15:05,336 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:15:05,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:05,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1189834910, now seen corresponding path program 1 times [2022-07-23 04:15:05,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:05,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487923213] [2022-07-23 04:15:05,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:05,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:05,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:05,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:05,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:05,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 04:15:05,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:05,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:05,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:05,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:15:05,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:05,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:15:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:05,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:15:05,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:05,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:15:05,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:05,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-23 04:15:05,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:05,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 04:15:05,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:05,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:15:05,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:05,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:15:05,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:05,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:15:05,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:05,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:15:05,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:05,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 04:15:05,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:05,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:05,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:05,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:15:05,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:05,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-23 04:15:05,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:05,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-23 04:15:05,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:05,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:05,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:05,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-23 04:15:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:05,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-23 04:15:05,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:05,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 04:15:05,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:05,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-23 04:15:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:05,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-23 04:15:05,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:05,509 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 124 trivial. 0 not checked. [2022-07-23 04:15:05,509 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:05,509 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487923213] [2022-07-23 04:15:05,509 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [487923213] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:15:05,509 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:15:05,510 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-23 04:15:05,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1667323765] [2022-07-23 04:15:05,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:15:05,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 04:15:05,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:05,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 04:15:05,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-23 04:15:05,511 INFO L87 Difference]: Start difference. First operand 894 states and 1014 transitions. Second operand has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-23 04:15:06,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:06,083 INFO L93 Difference]: Finished difference Result 894 states and 1014 transitions. [2022-07-23 04:15:06,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-23 04:15:06,084 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (25), 5 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 152 [2022-07-23 04:15:06,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:06,087 INFO L225 Difference]: With dead ends: 894 [2022-07-23 04:15:06,087 INFO L226 Difference]: Without dead ends: 892 [2022-07-23 04:15:06,088 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-23 04:15:06,088 INFO L413 NwaCegarLoop]: 377 mSDtfsCounter, 803 mSDsluCounter, 322 mSDsCounter, 0 mSdLazyCounter, 472 mSolverCounterSat, 272 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 848 SdHoareTripleChecker+Valid, 699 SdHoareTripleChecker+Invalid, 744 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 272 IncrementalHoareTripleChecker+Valid, 472 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:06,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [848 Valid, 699 Invalid, 744 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [272 Valid, 472 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 04:15:06,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 892 states. [2022-07-23 04:15:06,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 892 to 892. [2022-07-23 04:15:06,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 892 states, 580 states have (on average 1.1206896551724137) internal successors, (650), 616 states have internal predecessors, (650), 175 states have call successors, (175), 111 states have call predecessors, (175), 117 states have return successors, (186), 168 states have call predecessors, (186), 173 states have call successors, (186) [2022-07-23 04:15:06,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 892 states to 892 states and 1011 transitions. [2022-07-23 04:15:06,233 INFO L78 Accepts]: Start accepts. Automaton has 892 states and 1011 transitions. Word has length 152 [2022-07-23 04:15:06,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:06,234 INFO L495 AbstractCegarLoop]: Abstraction has 892 states and 1011 transitions. [2022-07-23 04:15:06,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.857142857142858) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (25), 5 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-23 04:15:06,234 INFO L276 IsEmpty]: Start isEmpty. Operand 892 states and 1011 transitions. [2022-07-23 04:15:06,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2022-07-23 04:15:06,236 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:06,236 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-23 04:15:06,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-23 04:15:06,236 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:15:06,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:06,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1381837497, now seen corresponding path program 1 times [2022-07-23 04:15:06,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:06,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086724982] [2022-07-23 04:15:06,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:06,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:06,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:06,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:06,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:06,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 04:15:06,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:06,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:06,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:06,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:15:06,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:06,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:15:06,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:06,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:15:06,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:06,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:15:06,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:06,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-23 04:15:06,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:06,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 04:15:06,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:06,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:15:06,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:06,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:15:06,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:06,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:15:06,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:06,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:15:06,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:06,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 04:15:06,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:06,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:06,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:06,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:15:06,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:06,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-23 04:15:06,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:06,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-23 04:15:06,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:06,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:06,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:06,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-23 04:15:06,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:06,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-23 04:15:06,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:06,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 04:15:06,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:06,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:06,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:06,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-23 04:15:06,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:06,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:06,945 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 10 proven. 25 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2022-07-23 04:15:06,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:06,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086724982] [2022-07-23 04:15:06,947 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086724982] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:15:06,947 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1727351699] [2022-07-23 04:15:06,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:06,947 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:15:06,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:15:06,972 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 04:15:06,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-23 04:15:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:07,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 1971 conjuncts, 85 conjunts are in the unsatisfiable core [2022-07-23 04:15:07,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:15:08,215 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 71 proven. 2 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2022-07-23 04:15:08,216 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 04:15:08,935 INFO L134 CoverageAnalysis]: Checked inductivity of 145 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2022-07-23 04:15:08,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1727351699] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 04:15:08,936 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 04:15:08,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 20, 16] total 48 [2022-07-23 04:15:08,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [896064794] [2022-07-23 04:15:08,936 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 04:15:08,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 48 states [2022-07-23 04:15:08,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:08,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 48 interpolants. [2022-07-23 04:15:08,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=2121, Unknown=0, NotChecked=0, Total=2256 [2022-07-23 04:15:08,938 INFO L87 Difference]: Start difference. First operand 892 states and 1011 transitions. Second operand has 48 states, 44 states have (on average 3.590909090909091) internal successors, (158), 35 states have internal predecessors, (158), 16 states have call successors, (59), 7 states have call predecessors, (59), 12 states have return successors, (61), 19 states have call predecessors, (61), 16 states have call successors, (61) [2022-07-23 04:15:13,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:13,785 INFO L93 Difference]: Finished difference Result 1123 states and 1243 transitions. [2022-07-23 04:15:13,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-07-23 04:15:13,786 INFO L78 Accepts]: Start accepts. Automaton has has 48 states, 44 states have (on average 3.590909090909091) internal successors, (158), 35 states have internal predecessors, (158), 16 states have call successors, (59), 7 states have call predecessors, (59), 12 states have return successors, (61), 19 states have call predecessors, (61), 16 states have call successors, (61) Word has length 156 [2022-07-23 04:15:13,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:13,789 INFO L225 Difference]: With dead ends: 1123 [2022-07-23 04:15:13,789 INFO L226 Difference]: Without dead ends: 887 [2022-07-23 04:15:13,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 408 GetRequests, 331 SyntacticMatches, 5 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1027 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=484, Invalid=4918, Unknown=0, NotChecked=0, Total=5402 [2022-07-23 04:15:13,791 INFO L413 NwaCegarLoop]: 301 mSDtfsCounter, 1389 mSDsluCounter, 2981 mSDsCounter, 0 mSdLazyCounter, 7637 mSolverCounterSat, 950 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1392 SdHoareTripleChecker+Valid, 3282 SdHoareTripleChecker+Invalid, 8587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 950 IncrementalHoareTripleChecker+Valid, 7637 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:13,791 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1392 Valid, 3282 Invalid, 8587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [950 Valid, 7637 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-07-23 04:15:13,792 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2022-07-23 04:15:13,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 878. [2022-07-23 04:15:13,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 878 states, 574 states have (on average 1.1184668989547037) internal successors, (642), 604 states have internal predecessors, (642), 173 states have call successors, (173), 111 states have call predecessors, (173), 111 states have return successors, (176), 166 states have call predecessors, (176), 171 states have call successors, (176) [2022-07-23 04:15:13,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 878 states to 878 states and 991 transitions. [2022-07-23 04:15:13,936 INFO L78 Accepts]: Start accepts. Automaton has 878 states and 991 transitions. Word has length 156 [2022-07-23 04:15:13,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:13,936 INFO L495 AbstractCegarLoop]: Abstraction has 878 states and 991 transitions. [2022-07-23 04:15:13,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 48 states, 44 states have (on average 3.590909090909091) internal successors, (158), 35 states have internal predecessors, (158), 16 states have call successors, (59), 7 states have call predecessors, (59), 12 states have return successors, (61), 19 states have call predecessors, (61), 16 states have call successors, (61) [2022-07-23 04:15:13,937 INFO L276 IsEmpty]: Start isEmpty. Operand 878 states and 991 transitions. [2022-07-23 04:15:13,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-07-23 04:15:13,938 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:13,938 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 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] [2022-07-23 04:15:13,946 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-23 04:15:14,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-07-23 04:15:14,146 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:15:14,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:14,147 INFO L85 PathProgramCache]: Analyzing trace with hash -982153904, now seen corresponding path program 1 times [2022-07-23 04:15:14,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:14,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660819265] [2022-07-23 04:15:14,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:14,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:14,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:14,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:14,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:14,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 04:15:14,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:14,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:14,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:14,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:15:14,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:14,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:15:14,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:14,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:15:14,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:14,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:15:14,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:14,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-23 04:15:14,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:14,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 04:15:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:14,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:15:14,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:14,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:15:14,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:14,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:15:14,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:14,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:15:14,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:14,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 04:15:14,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:14,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:14,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:14,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-23 04:15:14,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:14,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-23 04:15:14,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:14,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-23 04:15:14,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:14,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:14,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:14,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-23 04:15:14,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:14,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-23 04:15:14,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:14,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 04:15:14,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:14,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-23 04:15:14,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:14,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-23 04:15:14,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:14,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-23 04:15:14,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:14,774 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-23 04:15:14,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:14,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660819265] [2022-07-23 04:15:14,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [660819265] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:15:14,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [74685361] [2022-07-23 04:15:14,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:14,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:15:14,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:15:14,777 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 04:15:14,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-23 04:15:15,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:15,153 INFO L263 TraceCheckSpWp]: Trace formula consists of 1916 conjuncts, 83 conjunts are in the unsatisfiable core [2022-07-23 04:15:15,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:15:15,646 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 57 proven. 13 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2022-07-23 04:15:15,646 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 04:15:16,680 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 6 proven. 19 refuted. 0 times theorem prover too weak. 99 trivial. 0 not checked. [2022-07-23 04:15:16,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [74685361] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 04:15:16,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 04:15:16,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 22, 21] total 51 [2022-07-23 04:15:16,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583099802] [2022-07-23 04:15:16,681 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 04:15:16,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-07-23 04:15:16,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:16,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-07-23 04:15:16,682 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=2399, Unknown=0, NotChecked=0, Total=2550 [2022-07-23 04:15:16,683 INFO L87 Difference]: Start difference. First operand 878 states and 991 transitions. Second operand has 51 states, 43 states have (on average 3.511627906976744) internal successors, (151), 35 states have internal predecessors, (151), 15 states have call successors, (54), 6 states have call predecessors, (54), 13 states have return successors, (52), 20 states have call predecessors, (52), 15 states have call successors, (52) [2022-07-23 04:15:20,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:20,297 INFO L93 Difference]: Finished difference Result 1134 states and 1269 transitions. [2022-07-23 04:15:20,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-07-23 04:15:20,306 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 43 states have (on average 3.511627906976744) internal successors, (151), 35 states have internal predecessors, (151), 15 states have call successors, (54), 6 states have call predecessors, (54), 13 states have return successors, (52), 20 states have call predecessors, (52), 15 states have call successors, (52) Word has length 158 [2022-07-23 04:15:20,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:20,310 INFO L225 Difference]: With dead ends: 1134 [2022-07-23 04:15:20,310 INFO L226 Difference]: Without dead ends: 877 [2022-07-23 04:15:20,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 330 SyntacticMatches, 4 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 921 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=444, Invalid=5106, Unknown=0, NotChecked=0, Total=5550 [2022-07-23 04:15:20,312 INFO L413 NwaCegarLoop]: 303 mSDtfsCounter, 1149 mSDsluCounter, 2614 mSDsCounter, 0 mSdLazyCounter, 7863 mSolverCounterSat, 868 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1152 SdHoareTripleChecker+Valid, 2917 SdHoareTripleChecker+Invalid, 8731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 868 IncrementalHoareTripleChecker+Valid, 7863 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:20,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1152 Valid, 2917 Invalid, 8731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [868 Valid, 7863 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-07-23 04:15:20,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2022-07-23 04:15:20,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 876. [2022-07-23 04:15:20,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 572 states have (on average 1.117132867132867) internal successors, (639), 602 states have internal predecessors, (639), 173 states have call successors, (173), 111 states have call predecessors, (173), 111 states have return successors, (176), 166 states have call predecessors, (176), 171 states have call successors, (176) [2022-07-23 04:15:20,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 988 transitions. [2022-07-23 04:15:20,480 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 988 transitions. Word has length 158 [2022-07-23 04:15:20,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:20,480 INFO L495 AbstractCegarLoop]: Abstraction has 876 states and 988 transitions. [2022-07-23 04:15:20,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 43 states have (on average 3.511627906976744) internal successors, (151), 35 states have internal predecessors, (151), 15 states have call successors, (54), 6 states have call predecessors, (54), 13 states have return successors, (52), 20 states have call predecessors, (52), 15 states have call successors, (52) [2022-07-23 04:15:20,481 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 988 transitions. [2022-07-23 04:15:20,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-07-23 04:15:20,483 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:20,483 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-23 04:15:20,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-23 04:15:20,690 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:15:20,693 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:15:20,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:20,694 INFO L85 PathProgramCache]: Analyzing trace with hash 350553155, now seen corresponding path program 1 times [2022-07-23 04:15:20,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:20,694 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477112878] [2022-07-23 04:15:20,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:20,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:20,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:20,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:20,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:20,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 04:15:20,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:20,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:20,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:20,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-23 04:15:20,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:20,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 04:15:20,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:20,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-23 04:15:20,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:20,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-23 04:15:20,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:20,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:15:20,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:20,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-23 04:15:20,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:20,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-23 04:15:20,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:20,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-23 04:15:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:20,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:20,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:20,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-23 04:15:20,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:20,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:20,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:20,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:20,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:20,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-23 04:15:20,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:20,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:20,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:20,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:20,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:20,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-23 04:15:20,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:20,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-23 04:15:20,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:20,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-23 04:15:20,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:20,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-23 04:15:20,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:20,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:20,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:20,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-23 04:15:20,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:20,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-23 04:15:20,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:20,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-23 04:15:20,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:20,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-23 04:15:20,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:20,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-23 04:15:20,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:20,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-23 04:15:20,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:20,858 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2022-07-23 04:15:20,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:20,858 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477112878] [2022-07-23 04:15:20,858 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477112878] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:15:20,859 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:15:20,859 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-23 04:15:20,859 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338439713] [2022-07-23 04:15:20,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:15:20,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 04:15:20,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:20,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 04:15:20,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:15:20,860 INFO L87 Difference]: Start difference. First operand 876 states and 988 transitions. Second operand has 10 states, 10 states have (on average 9.2) internal successors, (92), 7 states have internal predecessors, (92), 3 states have call successors, (28), 5 states have call predecessors, (28), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2022-07-23 04:15:22,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:22,308 INFO L93 Difference]: Finished difference Result 1424 states and 1665 transitions. [2022-07-23 04:15:22,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 04:15:22,308 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 7 states have internal predecessors, (92), 3 states have call successors, (28), 5 states have call predecessors, (28), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) Word has length 187 [2022-07-23 04:15:22,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:22,313 INFO L225 Difference]: With dead ends: 1424 [2022-07-23 04:15:22,313 INFO L226 Difference]: Without dead ends: 1020 [2022-07-23 04:15:22,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-07-23 04:15:22,315 INFO L413 NwaCegarLoop]: 564 mSDtfsCounter, 695 mSDsluCounter, 1222 mSDsCounter, 0 mSdLazyCounter, 2054 mSolverCounterSat, 573 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 743 SdHoareTripleChecker+Valid, 1786 SdHoareTripleChecker+Invalid, 2627 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 573 IncrementalHoareTripleChecker+Valid, 2054 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:22,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [743 Valid, 1786 Invalid, 2627 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [573 Valid, 2054 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-07-23 04:15:22,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1020 states. [2022-07-23 04:15:22,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1020 to 876. [2022-07-23 04:15:22,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 876 states, 572 states have (on average 1.1136363636363635) internal successors, (637), 602 states have internal predecessors, (637), 173 states have call successors, (173), 111 states have call predecessors, (173), 111 states have return successors, (176), 166 states have call predecessors, (176), 171 states have call successors, (176) [2022-07-23 04:15:22,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 876 states to 876 states and 986 transitions. [2022-07-23 04:15:22,531 INFO L78 Accepts]: Start accepts. Automaton has 876 states and 986 transitions. Word has length 187 [2022-07-23 04:15:22,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:22,531 INFO L495 AbstractCegarLoop]: Abstraction has 876 states and 986 transitions. [2022-07-23 04:15:22,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.2) internal successors, (92), 7 states have internal predecessors, (92), 3 states have call successors, (28), 5 states have call predecessors, (28), 1 states have return successors, (27), 3 states have call predecessors, (27), 3 states have call successors, (27) [2022-07-23 04:15:22,532 INFO L276 IsEmpty]: Start isEmpty. Operand 876 states and 986 transitions. [2022-07-23 04:15:22,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2022-07-23 04:15:22,534 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:22,534 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 9, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-23 04:15:22,534 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-23 04:15:22,534 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:15:22,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:22,535 INFO L85 PathProgramCache]: Analyzing trace with hash -241695337, now seen corresponding path program 1 times [2022-07-23 04:15:22,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:22,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946992633] [2022-07-23 04:15:22,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:22,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:22,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:22,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:22,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:22,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 04:15:22,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:22,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:22,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:22,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-23 04:15:22,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:22,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-07-23 04:15:22,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:22,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-07-23 04:15:22,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:22,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-23 04:15:22,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:22,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-23 04:15:22,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:22,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-23 04:15:22,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:22,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-23 04:15:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:22,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-23 04:15:22,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:22,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:22,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:22,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-23 04:15:22,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:22,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:22,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:22,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:22,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:22,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-23 04:15:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:22,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:22,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:22,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:22,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-23 04:15:22,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:22,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-23 04:15:22,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:22,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-07-23 04:15:22,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:22,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-23 04:15:22,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:22,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-23 04:15:22,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:22,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-23 04:15:22,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:22,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:22,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:22,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-23 04:15:22,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:22,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-23 04:15:22,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:22,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-23 04:15:22,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:22,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-23 04:15:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:22,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-23 04:15:22,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:22,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-23 04:15:22,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:22,818 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-23 04:15:22,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:22,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946992633] [2022-07-23 04:15:22,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946992633] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:15:22,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [52901003] [2022-07-23 04:15:22,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:22,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:15:22,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:15:22,836 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 04:15:22,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-23 04:15:23,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:23,196 INFO L263 TraceCheckSpWp]: Trace formula consists of 2044 conjuncts, 17 conjunts are in the unsatisfiable core [2022-07-23 04:15:23,200 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:15:23,223 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 104 trivial. 0 not checked. [2022-07-23 04:15:23,224 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 04:15:23,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [52901003] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:15:23,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 04:15:23,224 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [11] total 11 [2022-07-23 04:15:23,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397147673] [2022-07-23 04:15:23,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:15:23,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-23 04:15:23,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:23,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-23 04:15:23,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-23 04:15:23,226 INFO L87 Difference]: Start difference. First operand 876 states and 986 transitions. Second operand has 7 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2022-07-23 04:15:23,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:23,413 INFO L93 Difference]: Finished difference Result 1048 states and 1152 transitions. [2022-07-23 04:15:23,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-23 04:15:23,414 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) Word has length 198 [2022-07-23 04:15:23,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:23,416 INFO L225 Difference]: With dead ends: 1048 [2022-07-23 04:15:23,416 INFO L226 Difference]: Without dead ends: 684 [2022-07-23 04:15:23,417 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 269 GetRequests, 257 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2022-07-23 04:15:23,418 INFO L413 NwaCegarLoop]: 374 mSDtfsCounter, 2 mSDsluCounter, 1834 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 2208 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:23,418 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 2208 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-23 04:15:23,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 684 states. [2022-07-23 04:15:23,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 684 to 684. [2022-07-23 04:15:23,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 684 states, 443 states have (on average 1.1264108352144468) internal successors, (499), 469 states have internal predecessors, (499), 134 states have call successors, (134), 88 states have call predecessors, (134), 87 states have return successors, (136), 128 states have call predecessors, (136), 132 states have call successors, (136) [2022-07-23 04:15:23,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 684 states to 684 states and 769 transitions. [2022-07-23 04:15:23,571 INFO L78 Accepts]: Start accepts. Automaton has 684 states and 769 transitions. Word has length 198 [2022-07-23 04:15:23,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:23,572 INFO L495 AbstractCegarLoop]: Abstraction has 684 states and 769 transitions. [2022-07-23 04:15:23,572 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 17.833333333333332) internal successors, (107), 6 states have internal predecessors, (107), 3 states have call successors, (30), 2 states have call predecessors, (30), 4 states have return successors, (29), 3 states have call predecessors, (29), 3 states have call successors, (29) [2022-07-23 04:15:23,572 INFO L276 IsEmpty]: Start isEmpty. Operand 684 states and 769 transitions. [2022-07-23 04:15:23,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-07-23 04:15:23,573 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:23,573 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-23 04:15:23,594 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-23 04:15:23,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:15:23,786 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_drivers_base_class_destroy_classErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:15:23,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:23,787 INFO L85 PathProgramCache]: Analyzing trace with hash -356239818, now seen corresponding path program 1 times [2022-07-23 04:15:23,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:23,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611296515] [2022-07-23 04:15:23,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:23,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:23,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:24,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:24,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:24,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 04:15:24,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:24,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:24,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:24,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:15:24,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:24,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:15:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:24,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:15:24,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:24,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:15:24,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:24,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-23 04:15:24,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:24,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 04:15:24,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:24,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:15:24,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:24,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:15:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:24,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:15:24,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:24,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:15:24,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:24,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 04:15:24,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:24,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:24,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:24,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:15:24,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:24,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:24,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:24,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:24,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:24,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-23 04:15:24,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:24,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:24,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:24,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:24,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:24,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 04:15:24,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:24,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-23 04:15:24,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:24,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:24,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:24,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-23 04:15:24,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:24,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-23 04:15:24,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:24,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-23 04:15:24,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:24,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-23 04:15:24,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:24,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:24,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:24,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2022-07-23 04:15:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:24,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-23 04:15:24,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:24,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-23 04:15:24,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:24,312 INFO L134 CoverageAnalysis]: Checked inductivity of 281 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-23 04:15:24,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:24,312 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611296515] [2022-07-23 04:15:24,313 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611296515] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:15:24,313 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:15:24,313 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-07-23 04:15:24,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2104576855] [2022-07-23 04:15:24,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:15:24,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-23 04:15:24,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:24,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-23 04:15:24,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=378, Unknown=0, NotChecked=0, Total=420 [2022-07-23 04:15:24,314 INFO L87 Difference]: Start difference. First operand 684 states and 769 transitions. Second operand has 21 states, 18 states have (on average 5.166666666666667) internal successors, (93), 15 states have internal predecessors, (93), 9 states have call successors, (31), 6 states have call predecessors, (31), 4 states have return successors, (30), 9 states have call predecessors, (30), 9 states have call successors, (30) [2022-07-23 04:15:27,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:27,075 INFO L93 Difference]: Finished difference Result 1408 states and 1672 transitions. [2022-07-23 04:15:27,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-07-23 04:15:27,075 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 18 states have (on average 5.166666666666667) internal successors, (93), 15 states have internal predecessors, (93), 9 states have call successors, (31), 6 states have call predecessors, (31), 4 states have return successors, (30), 9 states have call predecessors, (30), 9 states have call successors, (30) Word has length 206 [2022-07-23 04:15:27,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:27,081 INFO L225 Difference]: With dead ends: 1408 [2022-07-23 04:15:27,081 INFO L226 Difference]: Without dead ends: 878 [2022-07-23 04:15:27,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=196, Invalid=1210, Unknown=0, NotChecked=0, Total=1406 [2022-07-23 04:15:27,083 INFO L413 NwaCegarLoop]: 314 mSDtfsCounter, 1329 mSDsluCounter, 1675 mSDsCounter, 0 mSdLazyCounter, 4815 mSolverCounterSat, 1510 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1331 SdHoareTripleChecker+Valid, 1989 SdHoareTripleChecker+Invalid, 6325 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1510 IncrementalHoareTripleChecker+Valid, 4815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:27,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1331 Valid, 1989 Invalid, 6325 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1510 Valid, 4815 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-23 04:15:27,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 878 states. [2022-07-23 04:15:27,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 878 to 690. [2022-07-23 04:15:27,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 690 states, 445 states have (on average 1.1213483146067416) internal successors, (499), 473 states have internal predecessors, (499), 136 states have call successors, (136), 88 states have call predecessors, (136), 89 states have return successors, (140), 130 states have call predecessors, (140), 134 states have call successors, (140) [2022-07-23 04:15:27,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 690 states to 690 states and 775 transitions. [2022-07-23 04:15:27,228 INFO L78 Accepts]: Start accepts. Automaton has 690 states and 775 transitions. Word has length 206 [2022-07-23 04:15:27,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:27,229 INFO L495 AbstractCegarLoop]: Abstraction has 690 states and 775 transitions. [2022-07-23 04:15:27,229 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 18 states have (on average 5.166666666666667) internal successors, (93), 15 states have internal predecessors, (93), 9 states have call successors, (31), 6 states have call predecessors, (31), 4 states have return successors, (30), 9 states have call predecessors, (30), 9 states have call successors, (30) [2022-07-23 04:15:27,229 INFO L276 IsEmpty]: Start isEmpty. Operand 690 states and 775 transitions. [2022-07-23 04:15:27,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 216 [2022-07-23 04:15:27,230 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:27,231 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-23 04:15:27,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-23 04:15:27,231 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:15:27,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:27,231 INFO L85 PathProgramCache]: Analyzing trace with hash -1497570482, now seen corresponding path program 1 times [2022-07-23 04:15:27,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:27,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446567636] [2022-07-23 04:15:27,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:27,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:29,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:29,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:29,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 04:15:29,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:29,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:29,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:29,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:15:29,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:29,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:15:29,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:29,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:15:29,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:29,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:15:29,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:29,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-23 04:15:29,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:29,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 04:15:29,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:29,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:15:29,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:29,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:15:29,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:29,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:15:29,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:29,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:15:29,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:29,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 04:15:29,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:29,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:29,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:29,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:15:29,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:29,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:29,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:29,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:29,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:29,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-23 04:15:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:29,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:29,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:29,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:29,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:29,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 04:15:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:29,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-23 04:15:29,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:29,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-23 04:15:29,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:29,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-23 04:15:29,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:29,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-23 04:15:29,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:29,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-23 04:15:29,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:29,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:29,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:29,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-23 04:15:29,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:29,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-23 04:15:29,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:29,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-23 04:15:29,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:30,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:30,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:30,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-23 04:15:30,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:30,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:30,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:30,030 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 273 trivial. 0 not checked. [2022-07-23 04:15:30,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:30,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446567636] [2022-07-23 04:15:30,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446567636] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:15:30,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1801402816] [2022-07-23 04:15:30,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:30,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:15:30,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:15:30,032 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 04:15:30,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-07-23 04:15:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:30,362 INFO L263 TraceCheckSpWp]: Trace formula consists of 2160 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-23 04:15:30,366 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:15:30,798 INFO L134 CoverageAnalysis]: Checked inductivity of 283 backedges. 56 proven. 0 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2022-07-23 04:15:30,798 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 04:15:30,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1801402816] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:15:30,798 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 04:15:30,798 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [27] total 44 [2022-07-23 04:15:30,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883211406] [2022-07-23 04:15:30,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:15:30,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-23 04:15:30,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:30,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-23 04:15:30,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=1795, Unknown=0, NotChecked=0, Total=1892 [2022-07-23 04:15:30,800 INFO L87 Difference]: Start difference. First operand 690 states and 775 transitions. Second operand has 19 states, 18 states have (on average 5.777777777777778) internal successors, (104), 18 states have internal predecessors, (104), 8 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2022-07-23 04:15:31,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:31,858 INFO L93 Difference]: Finished difference Result 960 states and 1070 transitions. [2022-07-23 04:15:31,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-23 04:15:31,859 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 5.777777777777778) internal successors, (104), 18 states have internal predecessors, (104), 8 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) Word has length 215 [2022-07-23 04:15:31,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:31,862 INFO L225 Difference]: With dead ends: 960 [2022-07-23 04:15:31,862 INFO L226 Difference]: Without dead ends: 708 [2022-07-23 04:15:31,864 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 323 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 442 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=357, Invalid=3675, Unknown=0, NotChecked=0, Total=4032 [2022-07-23 04:15:31,864 INFO L413 NwaCegarLoop]: 456 mSDtfsCounter, 119 mSDsluCounter, 7043 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 7499 SdHoareTripleChecker+Invalid, 1235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 498 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:31,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 7499 Invalid, 1235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [498 Valid, 737 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 04:15:31,865 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 708 states. [2022-07-23 04:15:32,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 708 to 677. [2022-07-23 04:15:32,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 438 states have (on average 1.1118721461187215) internal successors, (487), 465 states have internal predecessors, (487), 131 states have call successors, (131), 85 states have call predecessors, (131), 89 states have return successors, (135), 128 states have call predecessors, (135), 129 states have call successors, (135) [2022-07-23 04:15:32,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 753 transitions. [2022-07-23 04:15:32,029 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 753 transitions. Word has length 215 [2022-07-23 04:15:32,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:32,029 INFO L495 AbstractCegarLoop]: Abstraction has 677 states and 753 transitions. [2022-07-23 04:15:32,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 5.777777777777778) internal successors, (104), 18 states have internal predecessors, (104), 8 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (32), 8 states have call predecessors, (32), 8 states have call successors, (32) [2022-07-23 04:15:32,029 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 753 transitions. [2022-07-23 04:15:32,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 211 [2022-07-23 04:15:32,031 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:32,031 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 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] [2022-07-23 04:15:32,051 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-07-23 04:15:32,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-07-23 04:15:32,251 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:15:32,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:32,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1299940040, now seen corresponding path program 1 times [2022-07-23 04:15:32,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:32,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807115974] [2022-07-23 04:15:32,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:32,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:32,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:32,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:32,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:32,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 04:15:32,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:32,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:32,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:32,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:15:32,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:32,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:15:32,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:32,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:15:32,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:32,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:15:32,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:32,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-23 04:15:32,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:32,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 04:15:32,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:32,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:15:32,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:32,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:15:32,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:32,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:15:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:32,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:15:32,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:32,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 04:15:32,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:32,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:32,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:32,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:15:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:32,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:32,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:32,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:32,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:32,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 04:15:32,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:32,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-23 04:15:32,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:32,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:32,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:32,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:32,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:32,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-23 04:15:32,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:32,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-23 04:15:32,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:32,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-23 04:15:32,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:32,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-23 04:15:32,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:32,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:32,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:32,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-23 04:15:32,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:32,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-23 04:15:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:32,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-23 04:15:32,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:32,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:32,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-23 04:15:32,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:32,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:32,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:32,433 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-23 04:15:32,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:32,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807115974] [2022-07-23 04:15:32,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807115974] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:15:32,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:15:32,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 04:15:32,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603369088] [2022-07-23 04:15:32,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:15:32,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 04:15:32,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:32,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 04:15:32,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-23 04:15:32,435 INFO L87 Difference]: Start difference. First operand 677 states and 753 transitions. Second operand has 8 states, 8 states have (on average 12.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (31), 5 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2022-07-23 04:15:33,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:33,392 INFO L93 Difference]: Finished difference Result 714 states and 773 transitions. [2022-07-23 04:15:33,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-23 04:15:33,392 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (31), 5 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 210 [2022-07-23 04:15:33,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:33,395 INFO L225 Difference]: With dead ends: 714 [2022-07-23 04:15:33,395 INFO L226 Difference]: Without dead ends: 712 [2022-07-23 04:15:33,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2022-07-23 04:15:33,396 INFO L413 NwaCegarLoop]: 411 mSDtfsCounter, 1461 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 494 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1504 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 1451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 494 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:33,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1504 Valid, 875 Invalid, 1451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [494 Valid, 957 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-23 04:15:33,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 712 states. [2022-07-23 04:15:33,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 712 to 675. [2022-07-23 04:15:33,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 437 states have (on average 1.1098398169336385) internal successors, (485), 463 states have internal predecessors, (485), 131 states have call successors, (131), 85 states have call predecessors, (131), 89 states have return successors, (135), 128 states have call predecessors, (135), 129 states have call successors, (135) [2022-07-23 04:15:33,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 751 transitions. [2022-07-23 04:15:33,554 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 751 transitions. Word has length 210 [2022-07-23 04:15:33,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:33,554 INFO L495 AbstractCegarLoop]: Abstraction has 675 states and 751 transitions. [2022-07-23 04:15:33,555 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 12.0) internal successors, (96), 4 states have internal predecessors, (96), 2 states have call successors, (31), 5 states have call predecessors, (31), 1 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2022-07-23 04:15:33,555 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 751 transitions. [2022-07-23 04:15:33,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2022-07-23 04:15:33,556 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:33,556 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 3, 3, 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] [2022-07-23 04:15:33,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-23 04:15:33,557 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:15:33,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:33,557 INFO L85 PathProgramCache]: Analyzing trace with hash -600142417, now seen corresponding path program 1 times [2022-07-23 04:15:33,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:33,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613365049] [2022-07-23 04:15:33,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:33,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:33,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:33,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:33,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:33,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 04:15:33,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:33,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:33,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:33,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:15:33,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:33,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:15:33,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:33,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:15:33,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:33,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:15:33,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:33,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-23 04:15:33,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:33,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 04:15:33,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:33,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:15:33,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:33,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:15:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:33,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:15:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:33,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:15:33,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:33,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 04:15:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:33,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:33,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:33,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:15:33,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:33,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:33,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:33,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:33,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:33,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-23 04:15:33,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:33,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:33,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:33,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:33,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:33,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 04:15:33,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:33,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-23 04:15:33,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:34,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-23 04:15:34,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:34,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-23 04:15:34,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:34,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-23 04:15:34,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:34,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-23 04:15:34,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:34,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:34,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:34,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2022-07-23 04:15:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:34,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2022-07-23 04:15:34,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:34,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-23 04:15:34,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:34,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-23 04:15:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:34,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-23 04:15:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:34,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-07-23 04:15:34,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:34,098 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-07-23 04:15:34,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:34,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613365049] [2022-07-23 04:15:34,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613365049] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:15:34,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [937759945] [2022-07-23 04:15:34,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:34,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:15:34,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:15:34,100 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 04:15:34,115 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-07-23 04:15:34,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:34,451 INFO L263 TraceCheckSpWp]: Trace formula consists of 2096 conjuncts, 64 conjunts are in the unsatisfiable core [2022-07-23 04:15:34,456 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:15:34,775 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 153 proven. 21 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-07-23 04:15:34,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 04:15:35,238 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-07-23 04:15:35,239 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [937759945] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 04:15:35,239 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 04:15:35,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 16, 15] total 33 [2022-07-23 04:15:35,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1495680926] [2022-07-23 04:15:35,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 04:15:35,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-07-23 04:15:35,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:35,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-07-23 04:15:35,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=979, Unknown=0, NotChecked=0, Total=1056 [2022-07-23 04:15:35,241 INFO L87 Difference]: Start difference. First operand 675 states and 751 transitions. Second operand has 33 states, 30 states have (on average 6.3) internal successors, (189), 27 states have internal predecessors, (189), 13 states have call successors, (71), 7 states have call predecessors, (71), 8 states have return successors, (68), 14 states have call predecessors, (68), 13 states have call successors, (68) [2022-07-23 04:15:38,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:38,679 INFO L93 Difference]: Finished difference Result 1064 states and 1177 transitions. [2022-07-23 04:15:38,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-07-23 04:15:38,680 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 6.3) internal successors, (189), 27 states have internal predecessors, (189), 13 states have call successors, (71), 7 states have call predecessors, (71), 8 states have return successors, (68), 14 states have call predecessors, (68), 13 states have call successors, (68) Word has length 214 [2022-07-23 04:15:38,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:38,682 INFO L225 Difference]: With dead ends: 1064 [2022-07-23 04:15:38,682 INFO L226 Difference]: Without dead ends: 687 [2022-07-23 04:15:38,684 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 534 GetRequests, 479 SyntacticMatches, 3 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 279 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=316, Invalid=2546, Unknown=0, NotChecked=0, Total=2862 [2022-07-23 04:15:38,684 INFO L413 NwaCegarLoop]: 311 mSDtfsCounter, 1216 mSDsluCounter, 2155 mSDsCounter, 0 mSdLazyCounter, 5595 mSolverCounterSat, 1025 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1216 SdHoareTripleChecker+Valid, 2466 SdHoareTripleChecker+Invalid, 6620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1025 IncrementalHoareTripleChecker+Valid, 5595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:38,685 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1216 Valid, 2466 Invalid, 6620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1025 Valid, 5595 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-07-23 04:15:38,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 687 states. [2022-07-23 04:15:38,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 687 to 663. [2022-07-23 04:15:38,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 431 states have (on average 1.1020881670533642) internal successors, (475), 454 states have internal predecessors, (475), 129 states have call successors, (129), 84 states have call predecessors, (129), 85 states have return successors, (129), 126 states have call predecessors, (129), 127 states have call successors, (129) [2022-07-23 04:15:38,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 733 transitions. [2022-07-23 04:15:38,862 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 733 transitions. Word has length 214 [2022-07-23 04:15:38,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:38,863 INFO L495 AbstractCegarLoop]: Abstraction has 663 states and 733 transitions. [2022-07-23 04:15:38,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 6.3) internal successors, (189), 27 states have internal predecessors, (189), 13 states have call successors, (71), 7 states have call predecessors, (71), 8 states have return successors, (68), 14 states have call predecessors, (68), 13 states have call successors, (68) [2022-07-23 04:15:38,863 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 733 transitions. [2022-07-23 04:15:38,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-07-23 04:15:38,864 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:38,865 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 4, 4, 3, 3, 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] [2022-07-23 04:15:38,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-07-23 04:15:39,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-07-23 04:15:39,085 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:15:39,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:39,086 INFO L85 PathProgramCache]: Analyzing trace with hash 2038632069, now seen corresponding path program 1 times [2022-07-23 04:15:39,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:39,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1832012384] [2022-07-23 04:15:39,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:39,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:39,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:39,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:39,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:39,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 04:15:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:39,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:39,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:39,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:15:39,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:39,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:15:39,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:39,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:15:39,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:39,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:15:39,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:39,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-23 04:15:39,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:39,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 04:15:39,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:39,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:15:39,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:39,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:15:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:39,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:15:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:39,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:15:39,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:39,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 04:15:39,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:39,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:39,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:39,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:15:39,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:39,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:39,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:39,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:39,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 04:15:39,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:39,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-23 04:15:39,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:39,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:39,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:39,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:39,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:39,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-23 04:15:39,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:39,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-23 04:15:39,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:39,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-23 04:15:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:39,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-23 04:15:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:39,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:39,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:39,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-23 04:15:39,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:39,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-23 04:15:39,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:39,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-23 04:15:39,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:39,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-23 04:15:39,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:39,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 193 [2022-07-23 04:15:39,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:39,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 199 [2022-07-23 04:15:39,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:39,301 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 24 proven. 6 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-07-23 04:15:39,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:39,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1832012384] [2022-07-23 04:15:39,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1832012384] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:15:39,302 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925467306] [2022-07-23 04:15:39,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:39,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:15:39,303 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:15:39,304 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 04:15:39,316 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-07-23 04:15:39,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:39,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 2070 conjuncts, 41 conjunts are in the unsatisfiable core [2022-07-23 04:15:39,638 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:15:39,787 INFO L134 CoverageAnalysis]: Checked inductivity of 254 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-07-23 04:15:39,787 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-23 04:15:39,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925467306] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:15:39,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-23 04:15:39,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [13] total 24 [2022-07-23 04:15:39,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394697899] [2022-07-23 04:15:39,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:15:39,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-23 04:15:39,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:39,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-23 04:15:39,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=507, Unknown=0, NotChecked=0, Total=552 [2022-07-23 04:15:39,789 INFO L87 Difference]: Start difference. First operand 663 states and 733 transitions. Second operand has 15 states, 14 states have (on average 7.214285714285714) internal successors, (101), 14 states have internal predecessors, (101), 6 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (31), 6 states have call predecessors, (31), 6 states have call successors, (31) [2022-07-23 04:15:40,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:40,295 INFO L93 Difference]: Finished difference Result 820 states and 890 transitions. [2022-07-23 04:15:40,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-23 04:15:40,295 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 7.214285714285714) internal successors, (101), 14 states have internal predecessors, (101), 6 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (31), 6 states have call predecessors, (31), 6 states have call successors, (31) Word has length 209 [2022-07-23 04:15:40,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:40,297 INFO L225 Difference]: With dead ends: 820 [2022-07-23 04:15:40,297 INFO L226 Difference]: Without dead ends: 665 [2022-07-23 04:15:40,298 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 261 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=124, Invalid=932, Unknown=0, NotChecked=0, Total=1056 [2022-07-23 04:15:40,298 INFO L413 NwaCegarLoop]: 369 mSDtfsCounter, 157 mSDsluCounter, 4390 mSDsCounter, 0 mSdLazyCounter, 366 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 4759 SdHoareTripleChecker+Invalid, 578 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 366 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:40,300 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 4759 Invalid, 578 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 366 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-23 04:15:40,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 665 states. [2022-07-23 04:15:40,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 665 to 663. [2022-07-23 04:15:40,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 663 states, 431 states have (on average 1.099767981438515) internal successors, (474), 454 states have internal predecessors, (474), 129 states have call successors, (129), 84 states have call predecessors, (129), 85 states have return successors, (129), 126 states have call predecessors, (129), 127 states have call successors, (129) [2022-07-23 04:15:40,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 663 states to 663 states and 732 transitions. [2022-07-23 04:15:40,464 INFO L78 Accepts]: Start accepts. Automaton has 663 states and 732 transitions. Word has length 209 [2022-07-23 04:15:40,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:40,464 INFO L495 AbstractCegarLoop]: Abstraction has 663 states and 732 transitions. [2022-07-23 04:15:40,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 7.214285714285714) internal successors, (101), 14 states have internal predecessors, (101), 6 states have call successors, (32), 2 states have call predecessors, (32), 4 states have return successors, (31), 6 states have call predecessors, (31), 6 states have call successors, (31) [2022-07-23 04:15:40,464 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 732 transitions. [2022-07-23 04:15:40,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2022-07-23 04:15:40,466 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:40,467 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 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] [2022-07-23 04:15:40,487 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-07-23 04:15:40,679 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-07-23 04:15:40,680 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:15:40,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:40,680 INFO L85 PathProgramCache]: Analyzing trace with hash 1210752770, now seen corresponding path program 1 times [2022-07-23 04:15:40,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:40,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205783973] [2022-07-23 04:15:40,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:40,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:40,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:40,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:40,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:40,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 04:15:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:40,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:40,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:40,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:15:40,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:40,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:15:40,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:40,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:15:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:40,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:15:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:40,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-23 04:15:40,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:40,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 04:15:40,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:40,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:15:40,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:40,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:15:40,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:40,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:15:40,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:40,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:15:40,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:40,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 04:15:40,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:40,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:40,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:40,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:15:40,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:40,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:40,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:40,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:40,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 04:15:40,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:40,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-23 04:15:40,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:40,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:40,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:40,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:40,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:40,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-23 04:15:40,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:40,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-23 04:15:40,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:40,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 151 [2022-07-23 04:15:40,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:40,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-07-23 04:15:40,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:40,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:40,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:40,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-23 04:15:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:40,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-07-23 04:15:40,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:40,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-23 04:15:40,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:40,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:40,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:40,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-23 04:15:40,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:40,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:40,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:40,919 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-23 04:15:40,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:40,920 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205783973] [2022-07-23 04:15:40,920 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205783973] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:15:40,920 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:15:40,920 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-23 04:15:40,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014506217] [2022-07-23 04:15:40,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:15:40,921 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 04:15:40,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:40,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 04:15:40,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:15:40,922 INFO L87 Difference]: Start difference. First operand 663 states and 732 transitions. Second operand has 10 states, 10 states have (on average 9.9) internal successors, (99), 6 states have internal predecessors, (99), 2 states have call successors, (31), 5 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2022-07-23 04:15:41,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:41,773 INFO L93 Difference]: Finished difference Result 663 states and 732 transitions. [2022-07-23 04:15:41,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 04:15:41,773 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.9) internal successors, (99), 6 states have internal predecessors, (99), 2 states have call successors, (31), 5 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 213 [2022-07-23 04:15:41,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:41,776 INFO L225 Difference]: With dead ends: 663 [2022-07-23 04:15:41,776 INFO L226 Difference]: Without dead ends: 661 [2022-07-23 04:15:41,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=222, Unknown=0, NotChecked=0, Total=306 [2022-07-23 04:15:41,778 INFO L413 NwaCegarLoop]: 339 mSDtfsCounter, 928 mSDsluCounter, 575 mSDsCounter, 0 mSdLazyCounter, 1063 mSolverCounterSat, 417 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 959 SdHoareTripleChecker+Valid, 914 SdHoareTripleChecker+Invalid, 1480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 417 IncrementalHoareTripleChecker+Valid, 1063 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:41,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [959 Valid, 914 Invalid, 1480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [417 Valid, 1063 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-07-23 04:15:41,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 661 states. [2022-07-23 04:15:41,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 661 to 661. [2022-07-23 04:15:41,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 661 states, 430 states have (on average 1.0976744186046512) internal successors, (472), 452 states have internal predecessors, (472), 129 states have call successors, (129), 84 states have call predecessors, (129), 85 states have return successors, (129), 126 states have call predecessors, (129), 127 states have call successors, (129) [2022-07-23 04:15:41,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 661 states to 661 states and 730 transitions. [2022-07-23 04:15:41,942 INFO L78 Accepts]: Start accepts. Automaton has 661 states and 730 transitions. Word has length 213 [2022-07-23 04:15:41,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:41,943 INFO L495 AbstractCegarLoop]: Abstraction has 661 states and 730 transitions. [2022-07-23 04:15:41,943 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.9) internal successors, (99), 6 states have internal predecessors, (99), 2 states have call successors, (31), 5 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2022-07-23 04:15:41,943 INFO L276 IsEmpty]: Start isEmpty. Operand 661 states and 730 transitions. [2022-07-23 04:15:41,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-07-23 04:15:41,944 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:41,945 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 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, 1] [2022-07-23 04:15:41,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-23 04:15:41,945 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:15:41,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:41,945 INFO L85 PathProgramCache]: Analyzing trace with hash 2056655727, now seen corresponding path program 1 times [2022-07-23 04:15:41,945 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:41,946 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799354402] [2022-07-23 04:15:41,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:41,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:42,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:42,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:42,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:42,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 04:15:42,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:42,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:42,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:42,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:15:42,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:42,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:15:42,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:42,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:15:42,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:42,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:15:42,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:42,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-23 04:15:42,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:42,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 04:15:42,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:42,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:15:42,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:42,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:15:42,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:42,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:15:42,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:42,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:15:42,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:42,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 04:15:42,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:42,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:42,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:42,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:15:42,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:42,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:42,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:42,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:42,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:42,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-23 04:15:42,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:42,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:42,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:42,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:42,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:42,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 04:15:42,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:42,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-23 04:15:42,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:42,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:42,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:42,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-23 04:15:42,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:42,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:42,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:42,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-23 04:15:42,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:42,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 168 [2022-07-23 04:15:42,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:42,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-23 04:15:42,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:42,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:42,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:42,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2022-07-23 04:15:42,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:42,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 192 [2022-07-23 04:15:42,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:42,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-23 04:15:42,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:42,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-07-23 04:15:42,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:42,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-07-23 04:15:42,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:42,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-07-23 04:15:42,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:42,499 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2022-07-23 04:15:42,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:42,500 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799354402] [2022-07-23 04:15:42,502 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799354402] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-23 04:15:42,502 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [561211941] [2022-07-23 04:15:42,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:42,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-23 04:15:42,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-23 04:15:42,504 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-23 04:15:42,505 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-07-23 04:15:42,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:42,846 INFO L263 TraceCheckSpWp]: Trace formula consists of 2134 conjuncts, 85 conjunts are in the unsatisfiable core [2022-07-23 04:15:42,851 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-23 04:15:43,336 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 179 proven. 2 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2022-07-23 04:15:43,336 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-23 04:15:43,875 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 261 trivial. 0 not checked. [2022-07-23 04:15:43,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [561211941] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-23 04:15:43,875 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-23 04:15:43,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 20, 16] total 43 [2022-07-23 04:15:43,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712409102] [2022-07-23 04:15:43,876 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-23 04:15:43,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-07-23 04:15:43,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:43,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-07-23 04:15:43,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1682, Unknown=0, NotChecked=0, Total=1806 [2022-07-23 04:15:43,877 INFO L87 Difference]: Start difference. First operand 661 states and 730 transitions. Second operand has 43 states, 40 states have (on average 5.15) internal successors, (206), 32 states have internal predecessors, (206), 15 states have call successors, (75), 7 states have call predecessors, (75), 10 states have return successors, (73), 17 states have call predecessors, (73), 15 states have call successors, (73) [2022-07-23 04:15:47,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:47,165 INFO L93 Difference]: Finished difference Result 963 states and 1039 transitions. [2022-07-23 04:15:47,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-07-23 04:15:47,192 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 40 states have (on average 5.15) internal successors, (206), 32 states have internal predecessors, (206), 15 states have call successors, (75), 7 states have call predecessors, (75), 10 states have return successors, (73), 17 states have call predecessors, (73), 15 states have call successors, (73) Word has length 226 [2022-07-23 04:15:47,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:47,194 INFO L225 Difference]: With dead ends: 963 [2022-07-23 04:15:47,194 INFO L226 Difference]: Without dead ends: 594 [2022-07-23 04:15:47,195 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 561 GetRequests, 493 SyntacticMatches, 7 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 746 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=397, Invalid=3509, Unknown=0, NotChecked=0, Total=3906 [2022-07-23 04:15:47,195 INFO L413 NwaCegarLoop]: 298 mSDtfsCounter, 1659 mSDsluCounter, 2413 mSDsCounter, 0 mSdLazyCounter, 5990 mSolverCounterSat, 1300 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1661 SdHoareTripleChecker+Valid, 2711 SdHoareTripleChecker+Invalid, 7290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1300 IncrementalHoareTripleChecker+Valid, 5990 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:47,196 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1661 Valid, 2711 Invalid, 7290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1300 Valid, 5990 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-07-23 04:15:47,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2022-07-23 04:15:47,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 594. [2022-07-23 04:15:47,342 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 594 states, 385 states have (on average 1.0987012987012987) internal successors, (423), 405 states have internal predecessors, (423), 114 states have call successors, (114), 79 states have call predecessors, (114), 78 states have return successors, (112), 111 states have call predecessors, (112), 112 states have call successors, (112) [2022-07-23 04:15:47,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 649 transitions. [2022-07-23 04:15:47,343 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 649 transitions. Word has length 226 [2022-07-23 04:15:47,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:47,344 INFO L495 AbstractCegarLoop]: Abstraction has 594 states and 649 transitions. [2022-07-23 04:15:47,344 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 40 states have (on average 5.15) internal successors, (206), 32 states have internal predecessors, (206), 15 states have call successors, (75), 7 states have call predecessors, (75), 10 states have return successors, (73), 17 states have call predecessors, (73), 15 states have call successors, (73) [2022-07-23 04:15:47,344 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 649 transitions. [2022-07-23 04:15:47,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 230 [2022-07-23 04:15:47,345 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:47,346 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 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, 1, 1, 1, 1] [2022-07-23 04:15:47,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-07-23 04:15:47,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-07-23 04:15:47,552 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:15:47,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:47,553 INFO L85 PathProgramCache]: Analyzing trace with hash 920927049, now seen corresponding path program 1 times [2022-07-23 04:15:47,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:47,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488732246] [2022-07-23 04:15:47,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:47,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:47,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:47,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:47,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:47,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 04:15:47,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:47,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:47,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:47,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:15:47,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:47,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:15:47,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:47,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:15:47,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:47,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:15:47,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:47,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-23 04:15:47,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:47,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 04:15:47,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:47,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:15:47,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:47,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:15:47,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:47,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:15:47,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:47,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:15:47,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:47,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 04:15:47,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:47,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:47,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:47,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:15:47,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:47,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:47,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:47,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:47,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:47,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-23 04:15:47,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:47,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:47,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:47,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:47,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 04:15:47,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:47,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-23 04:15:47,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:47,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:47,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:47,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-23 04:15:47,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:47,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:47,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:47,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-23 04:15:47,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:47,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-23 04:15:47,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:47,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-23 04:15:47,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:47,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:47,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:47,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-23 04:15:47,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:47,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-23 04:15:47,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:47,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-23 04:15:47,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:47,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-23 04:15:47,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:47,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-23 04:15:47,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:47,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-23 04:15:47,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:47,760 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-23 04:15:47,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:47,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488732246] [2022-07-23 04:15:47,761 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1488732246] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:15:47,761 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:15:47,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 04:15:47,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946363120] [2022-07-23 04:15:47,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:15:47,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 04:15:47,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:47,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 04:15:47,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-23 04:15:47,762 INFO L87 Difference]: Start difference. First operand 594 states and 649 transitions. Second operand has 8 states, 8 states have (on average 13.5) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (35), 6 states have call predecessors, (35), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2022-07-23 04:15:48,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:48,416 INFO L93 Difference]: Finished difference Result 594 states and 649 transitions. [2022-07-23 04:15:48,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 04:15:48,416 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (35), 6 states have call predecessors, (35), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) Word has length 229 [2022-07-23 04:15:48,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:48,419 INFO L225 Difference]: With dead ends: 594 [2022-07-23 04:15:48,419 INFO L226 Difference]: Without dead ends: 592 [2022-07-23 04:15:48,419 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2022-07-23 04:15:48,419 INFO L413 NwaCegarLoop]: 328 mSDtfsCounter, 911 mSDsluCounter, 426 mSDsCounter, 0 mSdLazyCounter, 678 mSolverCounterSat, 361 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 951 SdHoareTripleChecker+Valid, 754 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 361 IncrementalHoareTripleChecker+Valid, 678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:48,420 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [951 Valid, 754 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [361 Valid, 678 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 04:15:48,420 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2022-07-23 04:15:48,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 592. [2022-07-23 04:15:48,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 384 states have (on average 1.09375) internal successors, (420), 403 states have internal predecessors, (420), 114 states have call successors, (114), 79 states have call predecessors, (114), 78 states have return successors, (112), 111 states have call predecessors, (112), 112 states have call successors, (112) [2022-07-23 04:15:48,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 646 transitions. [2022-07-23 04:15:48,570 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 646 transitions. Word has length 229 [2022-07-23 04:15:48,570 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:48,570 INFO L495 AbstractCegarLoop]: Abstraction has 592 states and 646 transitions. [2022-07-23 04:15:48,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 13.5) internal successors, (108), 4 states have internal predecessors, (108), 2 states have call successors, (35), 6 states have call predecessors, (35), 2 states have return successors, (34), 2 states have call predecessors, (34), 2 states have call successors, (34) [2022-07-23 04:15:48,571 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 646 transitions. [2022-07-23 04:15:48,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2022-07-23 04:15:48,572 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:48,572 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:15:48,572 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-23 04:15:48,572 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:15:48,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:48,573 INFO L85 PathProgramCache]: Analyzing trace with hash -460235288, now seen corresponding path program 1 times [2022-07-23 04:15:48,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:48,573 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031578751] [2022-07-23 04:15:48,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:48,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:48,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:48,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:48,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:48,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 04:15:48,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:48,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:48,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:48,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:15:48,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:48,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:15:48,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:48,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:15:48,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:48,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:15:48,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:48,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-23 04:15:48,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:48,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 04:15:48,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:48,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:15:48,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:48,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:15:48,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:48,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:15:48,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:48,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:15:48,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:48,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 04:15:48,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:48,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:48,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:48,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:15:48,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:48,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:48,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:48,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:48,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:48,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-23 04:15:48,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:48,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:48,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:48,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:48,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:48,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 04:15:48,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:48,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-23 04:15:48,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:48,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:48,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:48,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-23 04:15:48,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:48,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:48,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:48,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-23 04:15:48,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:48,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-23 04:15:48,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:48,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-23 04:15:48,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:48,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:48,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:48,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-23 04:15:48,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:48,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-23 04:15:48,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:48,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-23 04:15:48,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:48,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-23 04:15:48,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:48,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-23 04:15:48,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:48,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-23 04:15:48,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:48,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-23 04:15:48,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:48,790 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-23 04:15:48,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:48,791 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031578751] [2022-07-23 04:15:48,791 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031578751] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:15:48,791 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:15:48,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 04:15:48,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524188124] [2022-07-23 04:15:48,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:15:48,792 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 04:15:48,792 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:48,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 04:15:48,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-23 04:15:48,793 INFO L87 Difference]: Start difference. First operand 592 states and 646 transitions. Second operand has 8 states, 8 states have (on average 14.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (36), 6 states have call predecessors, (36), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2022-07-23 04:15:49,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:49,768 INFO L93 Difference]: Finished difference Result 627 states and 665 transitions. [2022-07-23 04:15:49,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-23 04:15:49,768 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (36), 6 states have call predecessors, (36), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) Word has length 235 [2022-07-23 04:15:49,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:49,771 INFO L225 Difference]: With dead ends: 627 [2022-07-23 04:15:49,771 INFO L226 Difference]: Without dead ends: 625 [2022-07-23 04:15:49,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=108, Invalid=234, Unknown=0, NotChecked=0, Total=342 [2022-07-23 04:15:49,772 INFO L413 NwaCegarLoop]: 574 mSDtfsCounter, 944 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 1027 mSolverCounterSat, 394 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 979 SdHoareTripleChecker+Valid, 1107 SdHoareTripleChecker+Invalid, 1421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 394 IncrementalHoareTripleChecker+Valid, 1027 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:49,773 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [979 Valid, 1107 Invalid, 1421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [394 Valid, 1027 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-23 04:15:49,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2022-07-23 04:15:49,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 592. [2022-07-23 04:15:49,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 384 states have (on average 1.0911458333333333) internal successors, (419), 403 states have internal predecessors, (419), 114 states have call successors, (114), 79 states have call predecessors, (114), 78 states have return successors, (112), 111 states have call predecessors, (112), 112 states have call successors, (112) [2022-07-23 04:15:49,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 645 transitions. [2022-07-23 04:15:49,925 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 645 transitions. Word has length 235 [2022-07-23 04:15:49,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:49,925 INFO L495 AbstractCegarLoop]: Abstraction has 592 states and 645 transitions. [2022-07-23 04:15:49,926 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.0) internal successors, (112), 4 states have internal predecessors, (112), 2 states have call successors, (36), 6 states have call predecessors, (36), 1 states have return successors, (35), 2 states have call predecessors, (35), 2 states have call successors, (35) [2022-07-23 04:15:49,926 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 645 transitions. [2022-07-23 04:15:49,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-07-23 04:15:49,927 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:49,927 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:15:49,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-23 04:15:49,928 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:15:49,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:49,928 INFO L85 PathProgramCache]: Analyzing trace with hash -622740987, now seen corresponding path program 1 times [2022-07-23 04:15:49,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:49,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421795856] [2022-07-23 04:15:49,928 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:49,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:49,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:50,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 04:15:50,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:50,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:15:50,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:15:50,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:15:50,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:15:50,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-23 04:15:50,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 04:15:50,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:15:50,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:15:50,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:15:50,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:15:50,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 04:15:50,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:50,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:15:50,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:50,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:50,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-23 04:15:50,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:50,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:50,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 04:15:50,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-23 04:15:50,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:50,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-23 04:15:50,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:50,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-23 04:15:50,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-23 04:15:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-23 04:15:50,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:50,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-23 04:15:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-23 04:15:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-23 04:15:50,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-23 04:15:50,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-23 04:15:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-23 04:15:50,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-23 04:15:50,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-23 04:15:50,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,119 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-23 04:15:50,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:50,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421795856] [2022-07-23 04:15:50,119 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421795856] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:15:50,119 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:15:50,120 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 04:15:50,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869184641] [2022-07-23 04:15:50,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:15:50,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 04:15:50,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:50,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 04:15:50,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-23 04:15:50,121 INFO L87 Difference]: Start difference. First operand 592 states and 645 transitions. Second operand has 8 states, 8 states have (on average 14.5) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (37), 6 states have call predecessors, (37), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-07-23 04:15:50,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:50,716 INFO L93 Difference]: Finished difference Result 592 states and 645 transitions. [2022-07-23 04:15:50,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 04:15:50,717 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (37), 6 states have call predecessors, (37), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 241 [2022-07-23 04:15:50,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:50,719 INFO L225 Difference]: With dead ends: 592 [2022-07-23 04:15:50,719 INFO L226 Difference]: Without dead ends: 590 [2022-07-23 04:15:50,720 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-23 04:15:50,720 INFO L413 NwaCegarLoop]: 358 mSDtfsCounter, 904 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 941 SdHoareTripleChecker+Valid, 708 SdHoareTripleChecker+Invalid, 889 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:50,720 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [941 Valid, 708 Invalid, 889 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 532 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 04:15:50,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2022-07-23 04:15:50,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2022-07-23 04:15:50,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 590 states, 383 states have (on average 1.0861618798955615) internal successors, (416), 401 states have internal predecessors, (416), 114 states have call successors, (114), 79 states have call predecessors, (114), 78 states have return successors, (112), 111 states have call predecessors, (112), 112 states have call successors, (112) [2022-07-23 04:15:50,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 642 transitions. [2022-07-23 04:15:50,867 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 642 transitions. Word has length 241 [2022-07-23 04:15:50,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:50,868 INFO L495 AbstractCegarLoop]: Abstraction has 590 states and 642 transitions. [2022-07-23 04:15:50,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.5) internal successors, (116), 4 states have internal predecessors, (116), 2 states have call successors, (37), 6 states have call predecessors, (37), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-07-23 04:15:50,868 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 642 transitions. [2022-07-23 04:15:50,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-07-23 04:15:50,869 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:50,870 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:15:50,870 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-23 04:15:50,870 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:15:50,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:50,870 INFO L85 PathProgramCache]: Analyzing trace with hash 433711426, now seen corresponding path program 1 times [2022-07-23 04:15:50,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:50,871 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976844352] [2022-07-23 04:15:50,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:50,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:50,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:50,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 04:15:50,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:50,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:15:50,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:15:50,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:15:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:15:50,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-23 04:15:50,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 04:15:50,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:15:50,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:15:50,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:15:50,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:15:50,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 04:15:50,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:50,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:15:50,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:50,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:50,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-23 04:15:50,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-23 04:15:50,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:50,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:50,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-23 04:15:50,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:50,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-07-23 04:15:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:51,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:51,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:51,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2022-07-23 04:15:51,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:51,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:51,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:51,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-23 04:15:51,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:51,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-23 04:15:51,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:51,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-23 04:15:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:51,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:51,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:51,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-23 04:15:51,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:51,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-23 04:15:51,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:51,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-23 04:15:51,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:51,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-23 04:15:51,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:51,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-23 04:15:51,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:51,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-23 04:15:51,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:51,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-23 04:15:51,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:51,055 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-23 04:15:51,055 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:51,055 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976844352] [2022-07-23 04:15:51,055 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976844352] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:15:51,055 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:15:51,055 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-23 04:15:51,055 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1875954789] [2022-07-23 04:15:51,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:15:51,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-23 04:15:51,057 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:51,057 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-23 04:15:51,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-23 04:15:51,057 INFO L87 Difference]: Start difference. First operand 590 states and 642 transitions. Second operand has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 7 states have internal predecessors, (116), 4 states have call successors, (37), 6 states have call predecessors, (37), 1 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) [2022-07-23 04:15:51,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:51,979 INFO L93 Difference]: Finished difference Result 647 states and 684 transitions. [2022-07-23 04:15:51,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-23 04:15:51,979 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 7 states have internal predecessors, (116), 4 states have call successors, (37), 6 states have call predecessors, (37), 1 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) Word has length 241 [2022-07-23 04:15:51,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:51,981 INFO L225 Difference]: With dead ends: 647 [2022-07-23 04:15:51,981 INFO L226 Difference]: Without dead ends: 436 [2022-07-23 04:15:51,982 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=77, Invalid=303, Unknown=0, NotChecked=0, Total=380 [2022-07-23 04:15:51,983 INFO L413 NwaCegarLoop]: 363 mSDtfsCounter, 777 mSDsluCounter, 740 mSDsCounter, 0 mSdLazyCounter, 1505 mSolverCounterSat, 500 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 777 SdHoareTripleChecker+Valid, 1103 SdHoareTripleChecker+Invalid, 2005 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 500 IncrementalHoareTripleChecker+Valid, 1505 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:51,983 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [777 Valid, 1103 Invalid, 2005 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [500 Valid, 1505 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-07-23 04:15:51,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2022-07-23 04:15:52,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 436. [2022-07-23 04:15:52,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 436 states, 281 states have (on average 1.0640569395017794) internal successors, (299), 297 states have internal predecessors, (299), 87 states have call successors, (87), 55 states have call predecessors, (87), 54 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-23 04:15:52,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 436 states to 436 states and 471 transitions. [2022-07-23 04:15:52,087 INFO L78 Accepts]: Start accepts. Automaton has 436 states and 471 transitions. Word has length 241 [2022-07-23 04:15:52,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:52,087 INFO L495 AbstractCegarLoop]: Abstraction has 436 states and 471 transitions. [2022-07-23 04:15:52,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.545454545454545) internal successors, (116), 7 states have internal predecessors, (116), 4 states have call successors, (37), 6 states have call predecessors, (37), 1 states have return successors, (36), 4 states have call predecessors, (36), 4 states have call successors, (36) [2022-07-23 04:15:52,088 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 471 transitions. [2022-07-23 04:15:52,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2022-07-23 04:15:52,089 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:52,089 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-23 04:15:52,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-23 04:15:52,089 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:15:52,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:52,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1683504449, now seen corresponding path program 1 times [2022-07-23 04:15:52,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:52,090 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345258853] [2022-07-23 04:15:52,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:52,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:52,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:52,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 04:15:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:52,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:15:52,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:15:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:15:52,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:15:52,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-23 04:15:52,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 04:15:52,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:15:52,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:15:52,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:15:52,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:15:52,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 04:15:52,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:52,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:15:52,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:52,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:52,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-23 04:15:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:52,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:52,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 04:15:52,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-23 04:15:52,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:52,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-23 04:15:52,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:52,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-23 04:15:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-23 04:15:52,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-23 04:15:52,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:52,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-23 04:15:52,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-23 04:15:52,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-23 04:15:52,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-23 04:15:52,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-23 04:15:52,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-23 04:15:52,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-23 04:15:52,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-23 04:15:52,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-23 04:15:52,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:52,292 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-23 04:15:52,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:52,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345258853] [2022-07-23 04:15:52,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345258853] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:15:52,293 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:15:52,293 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 04:15:52,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1438842522] [2022-07-23 04:15:52,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:15:52,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 04:15:52,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:52,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 04:15:52,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-23 04:15:52,294 INFO L87 Difference]: Start difference. First operand 436 states and 471 transitions. Second operand has 8 states, 8 states have (on average 15.0) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (38), 6 states have call predecessors, (38), 1 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2022-07-23 04:15:52,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:52,888 INFO L93 Difference]: Finished difference Result 436 states and 471 transitions. [2022-07-23 04:15:52,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 04:15:52,889 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.0) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (38), 6 states have call predecessors, (38), 1 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 247 [2022-07-23 04:15:52,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:52,891 INFO L225 Difference]: With dead ends: 436 [2022-07-23 04:15:52,891 INFO L226 Difference]: Without dead ends: 434 [2022-07-23 04:15:52,891 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-23 04:15:52,891 INFO L413 NwaCegarLoop]: 354 mSDtfsCounter, 888 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 924 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:52,892 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [924 Valid, 704 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 04:15:52,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2022-07-23 04:15:53,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 434. [2022-07-23 04:15:53,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 434 states, 280 states have (on average 1.0607142857142857) internal successors, (297), 295 states have internal predecessors, (297), 87 states have call successors, (87), 55 states have call predecessors, (87), 54 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-23 04:15:53,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 434 states to 434 states and 469 transitions. [2022-07-23 04:15:53,016 INFO L78 Accepts]: Start accepts. Automaton has 434 states and 469 transitions. Word has length 247 [2022-07-23 04:15:53,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:53,016 INFO L495 AbstractCegarLoop]: Abstraction has 434 states and 469 transitions. [2022-07-23 04:15:53,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.0) internal successors, (120), 4 states have internal predecessors, (120), 2 states have call successors, (38), 6 states have call predecessors, (38), 1 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2022-07-23 04:15:53,017 INFO L276 IsEmpty]: Start isEmpty. Operand 434 states and 469 transitions. [2022-07-23 04:15:53,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2022-07-23 04:15:53,018 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:53,018 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 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, 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-07-23 04:15:53,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-23 04:15:53,018 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:15:53,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:53,019 INFO L85 PathProgramCache]: Analyzing trace with hash -1354751516, now seen corresponding path program 1 times [2022-07-23 04:15:53,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:53,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794542573] [2022-07-23 04:15:53,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:53,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:53,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:53,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:53,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:53,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 04:15:53,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:53,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:53,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:53,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:15:53,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:53,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:15:53,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:53,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:15:53,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:53,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:15:53,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:53,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-23 04:15:53,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:53,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 04:15:53,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:53,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:15:53,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:53,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:15:53,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:53,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:15:53,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:53,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:15:53,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:53,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 04:15:53,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:53,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:53,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:53,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:15:53,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:53,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:53,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:53,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:53,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:53,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-23 04:15:53,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:53,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:53,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:53,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:53,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:53,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 04:15:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:53,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-23 04:15:53,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:53,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:53,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:53,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-23 04:15:53,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:53,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:53,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:53,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-23 04:15:53,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:53,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-23 04:15:53,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:53,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-23 04:15:53,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:53,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:53,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:53,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-23 04:15:53,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:53,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-23 04:15:53,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:53,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-23 04:15:53,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:53,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-23 04:15:53,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:53,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-23 04:15:53,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:53,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-23 04:15:53,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:53,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-23 04:15:53,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:53,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-23 04:15:53,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:53,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-23 04:15:53,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:53,240 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-23 04:15:53,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:53,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794542573] [2022-07-23 04:15:53,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794542573] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:15:53,240 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:15:53,240 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 04:15:53,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535720084] [2022-07-23 04:15:53,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:15:53,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 04:15:53,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:53,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 04:15:53,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-23 04:15:53,242 INFO L87 Difference]: Start difference. First operand 434 states and 469 transitions. Second operand has 8 states, 8 states have (on average 15.25) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (38), 6 states have call predecessors, (38), 1 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2022-07-23 04:15:53,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:53,767 INFO L93 Difference]: Finished difference Result 434 states and 469 transitions. [2022-07-23 04:15:53,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 04:15:53,768 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.25) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (38), 6 states have call predecessors, (38), 1 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) Word has length 249 [2022-07-23 04:15:53,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:53,770 INFO L225 Difference]: With dead ends: 434 [2022-07-23 04:15:53,770 INFO L226 Difference]: Without dead ends: 432 [2022-07-23 04:15:53,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-23 04:15:53,771 INFO L413 NwaCegarLoop]: 352 mSDtfsCounter, 872 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 908 SdHoareTripleChecker+Valid, 702 SdHoareTripleChecker+Invalid, 883 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:53,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [908 Valid, 702 Invalid, 883 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 04:15:53,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 432 states. [2022-07-23 04:15:53,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 432 to 432. [2022-07-23 04:15:53,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 279 states have (on average 1.0573476702508962) internal successors, (295), 293 states have internal predecessors, (295), 87 states have call successors, (87), 55 states have call predecessors, (87), 54 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-23 04:15:53,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 467 transitions. [2022-07-23 04:15:53,875 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 467 transitions. Word has length 249 [2022-07-23 04:15:53,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:53,876 INFO L495 AbstractCegarLoop]: Abstraction has 432 states and 467 transitions. [2022-07-23 04:15:53,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.25) internal successors, (122), 4 states have internal predecessors, (122), 2 states have call successors, (38), 6 states have call predecessors, (38), 1 states have return successors, (37), 2 states have call predecessors, (37), 2 states have call successors, (37) [2022-07-23 04:15:53,876 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 467 transitions. [2022-07-23 04:15:53,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2022-07-23 04:15:53,877 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:53,878 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 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, 1, 1, 1, 1, 1, 1, 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-07-23 04:15:53,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-23 04:15:53,878 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:15:53,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:53,878 INFO L85 PathProgramCache]: Analyzing trace with hash -43862279, now seen corresponding path program 1 times [2022-07-23 04:15:53,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:53,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445949799] [2022-07-23 04:15:53,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:53,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:53,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:54,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 04:15:54,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:54,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:15:54,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:15:54,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:15:54,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:15:54,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-23 04:15:54,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 04:15:54,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:15:54,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:15:54,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:15:54,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:15:54,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 04:15:54,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:54,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:15:54,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:54,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:54,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-23 04:15:54,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:54,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 04:15:54,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-23 04:15:54,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-23 04:15:54,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:54,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-23 04:15:54,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-23 04:15:54,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-23 04:15:54,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:54,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-23 04:15:54,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-23 04:15:54,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-23 04:15:54,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-23 04:15:54,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-23 04:15:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-23 04:15:54,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-23 04:15:54,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-23 04:15:54,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-23 04:15:54,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-23 04:15:54,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,231 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-23 04:15:54,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:54,231 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445949799] [2022-07-23 04:15:54,231 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445949799] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:15:54,231 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:15:54,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 04:15:54,232 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557734761] [2022-07-23 04:15:54,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:15:54,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 04:15:54,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:54,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 04:15:54,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-23 04:15:54,233 INFO L87 Difference]: Start difference. First operand 432 states and 467 transitions. Second operand has 8 states, 8 states have (on average 15.75) internal successors, (126), 4 states have internal predecessors, (126), 2 states have call successors, (39), 6 states have call predecessors, (39), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2022-07-23 04:15:54,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:54,775 INFO L93 Difference]: Finished difference Result 432 states and 467 transitions. [2022-07-23 04:15:54,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 04:15:54,775 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 4 states have internal predecessors, (126), 2 states have call successors, (39), 6 states have call predecessors, (39), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) Word has length 255 [2022-07-23 04:15:54,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:54,777 INFO L225 Difference]: With dead ends: 432 [2022-07-23 04:15:54,777 INFO L226 Difference]: Without dead ends: 430 [2022-07-23 04:15:54,778 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 78 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-23 04:15:54,779 INFO L413 NwaCegarLoop]: 350 mSDtfsCounter, 864 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 899 SdHoareTripleChecker+Valid, 700 SdHoareTripleChecker+Invalid, 881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:54,779 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [899 Valid, 700 Invalid, 881 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 04:15:54,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2022-07-23 04:15:54,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2022-07-23 04:15:54,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 278 states have (on average 1.0539568345323742) internal successors, (293), 291 states have internal predecessors, (293), 87 states have call successors, (87), 55 states have call predecessors, (87), 54 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-23 04:15:54,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 465 transitions. [2022-07-23 04:15:54,883 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 465 transitions. Word has length 255 [2022-07-23 04:15:54,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:54,884 INFO L495 AbstractCegarLoop]: Abstraction has 430 states and 465 transitions. [2022-07-23 04:15:54,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.75) internal successors, (126), 4 states have internal predecessors, (126), 2 states have call successors, (39), 6 states have call predecessors, (39), 1 states have return successors, (38), 2 states have call predecessors, (38), 2 states have call successors, (38) [2022-07-23 04:15:54,884 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 465 transitions. [2022-07-23 04:15:54,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 262 [2022-07-23 04:15:54,885 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:54,886 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-23 04:15:54,886 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-23 04:15:54,886 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:15:54,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:54,886 INFO L85 PathProgramCache]: Analyzing trace with hash 312603938, now seen corresponding path program 1 times [2022-07-23 04:15:54,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:54,887 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865557059] [2022-07-23 04:15:54,887 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:54,887 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:54,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:54,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 04:15:54,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:54,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:15:54,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:15:54,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:15:54,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:15:54,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:54,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-23 04:15:55,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:55,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 04:15:55,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:55,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:15:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:55,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:15:55,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:55,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:15:55,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:55,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:15:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:55,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 04:15:55,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:55,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:55,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:55,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:15:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:55,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:55,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:55,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:55,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-23 04:15:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:55,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:55,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:55,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:55,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 04:15:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:55,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-23 04:15:55,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:55,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:55,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:55,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-23 04:15:55,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:55,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:55,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:55,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-23 04:15:55,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:55,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-23 04:15:55,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:55,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-23 04:15:55,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:55,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:55,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:55,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-23 04:15:55,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:55,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-23 04:15:55,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:55,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-23 04:15:55,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:55,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-23 04:15:55,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:55,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-23 04:15:55,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:55,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-23 04:15:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:55,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-23 04:15:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:55,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-23 04:15:55,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:55,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-23 04:15:55,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:55,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-23 04:15:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:55,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-23 04:15:55,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:55,141 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-23 04:15:55,142 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:55,142 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865557059] [2022-07-23 04:15:55,142 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1865557059] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:15:55,142 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:15:55,143 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 04:15:55,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132045433] [2022-07-23 04:15:55,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:15:55,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 04:15:55,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:55,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 04:15:55,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-23 04:15:55,145 INFO L87 Difference]: Start difference. First operand 430 states and 465 transitions. Second operand has 8 states, 8 states have (on average 16.25) internal successors, (130), 4 states have internal predecessors, (130), 2 states have call successors, (40), 6 states have call predecessors, (40), 1 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2022-07-23 04:15:55,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:55,801 INFO L93 Difference]: Finished difference Result 430 states and 465 transitions. [2022-07-23 04:15:55,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 04:15:55,801 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.25) internal successors, (130), 4 states have internal predecessors, (130), 2 states have call successors, (40), 6 states have call predecessors, (40), 1 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) Word has length 261 [2022-07-23 04:15:55,802 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:55,803 INFO L225 Difference]: With dead ends: 430 [2022-07-23 04:15:55,804 INFO L226 Difference]: Without dead ends: 428 [2022-07-23 04:15:55,805 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-23 04:15:55,806 INFO L413 NwaCegarLoop]: 348 mSDtfsCounter, 854 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 522 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 888 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 522 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:55,806 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [888 Valid, 698 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 522 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-23 04:15:55,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 428 states. [2022-07-23 04:15:55,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 428 to 428. [2022-07-23 04:15:55,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 277 states have (on average 1.0505415162454874) internal successors, (291), 289 states have internal predecessors, (291), 87 states have call successors, (87), 55 states have call predecessors, (87), 54 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-23 04:15:55,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 463 transitions. [2022-07-23 04:15:55,916 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 463 transitions. Word has length 261 [2022-07-23 04:15:55,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:55,916 INFO L495 AbstractCegarLoop]: Abstraction has 428 states and 463 transitions. [2022-07-23 04:15:55,916 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.25) internal successors, (130), 4 states have internal predecessors, (130), 2 states have call successors, (40), 6 states have call predecessors, (40), 1 states have return successors, (39), 2 states have call predecessors, (39), 2 states have call successors, (39) [2022-07-23 04:15:55,916 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 463 transitions. [2022-07-23 04:15:55,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2022-07-23 04:15:55,918 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:55,918 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-23 04:15:55,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-23 04:15:55,918 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:15:55,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:55,918 INFO L85 PathProgramCache]: Analyzing trace with hash 1168433669, now seen corresponding path program 1 times [2022-07-23 04:15:55,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:55,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655998080] [2022-07-23 04:15:55,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:55,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:55,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:55,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:55,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 04:15:56,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:56,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:15:56,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:15:56,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:15:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:15:56,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-23 04:15:56,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 04:15:56,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:15:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:15:56,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:15:56,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:15:56,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 04:15:56,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:56,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:15:56,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:56,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:56,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-23 04:15:56,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 04:15:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-23 04:15:56,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:56,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-23 04:15:56,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:56,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-23 04:15:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-23 04:15:56,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-23 04:15:56,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:56,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-23 04:15:56,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-23 04:15:56,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-23 04:15:56,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-23 04:15:56,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-23 04:15:56,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-23 04:15:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-23 04:15:56,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-23 04:15:56,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-23 04:15:56,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-23 04:15:56,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-23 04:15:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-23 04:15:56,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,152 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-23 04:15:56,152 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:56,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655998080] [2022-07-23 04:15:56,152 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655998080] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:15:56,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:15:56,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 04:15:56,153 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122737429] [2022-07-23 04:15:56,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:15:56,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 04:15:56,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:56,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 04:15:56,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-23 04:15:56,155 INFO L87 Difference]: Start difference. First operand 428 states and 463 transitions. Second operand has 8 states, 8 states have (on average 16.75) internal successors, (134), 4 states have internal predecessors, (134), 2 states have call successors, (41), 6 states have call predecessors, (41), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2022-07-23 04:15:56,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:56,774 INFO L93 Difference]: Finished difference Result 428 states and 463 transitions. [2022-07-23 04:15:56,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 04:15:56,775 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 16.75) internal successors, (134), 4 states have internal predecessors, (134), 2 states have call successors, (41), 6 states have call predecessors, (41), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) Word has length 267 [2022-07-23 04:15:56,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:56,780 INFO L225 Difference]: With dead ends: 428 [2022-07-23 04:15:56,781 INFO L226 Difference]: Without dead ends: 426 [2022-07-23 04:15:56,781 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-23 04:15:56,781 INFO L413 NwaCegarLoop]: 346 mSDtfsCounter, 844 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 520 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 877 SdHoareTripleChecker+Valid, 696 SdHoareTripleChecker+Invalid, 877 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 520 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:56,782 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [877 Valid, 696 Invalid, 877 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 520 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 04:15:56,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 426 states. [2022-07-23 04:15:56,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 426 to 426. [2022-07-23 04:15:56,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 426 states, 276 states have (on average 1.0471014492753623) internal successors, (289), 287 states have internal predecessors, (289), 87 states have call successors, (87), 55 states have call predecessors, (87), 54 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-23 04:15:56,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 426 states and 461 transitions. [2022-07-23 04:15:56,908 INFO L78 Accepts]: Start accepts. Automaton has 426 states and 461 transitions. Word has length 267 [2022-07-23 04:15:56,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:56,908 INFO L495 AbstractCegarLoop]: Abstraction has 426 states and 461 transitions. [2022-07-23 04:15:56,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 16.75) internal successors, (134), 4 states have internal predecessors, (134), 2 states have call successors, (41), 6 states have call predecessors, (41), 1 states have return successors, (40), 2 states have call predecessors, (40), 2 states have call successors, (40) [2022-07-23 04:15:56,909 INFO L276 IsEmpty]: Start isEmpty. Operand 426 states and 461 transitions. [2022-07-23 04:15:56,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 274 [2022-07-23 04:15:56,910 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:56,910 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-23 04:15:56,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-07-23 04:15:56,910 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:15:56,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:56,911 INFO L85 PathProgramCache]: Analyzing trace with hash -645970940, now seen corresponding path program 1 times [2022-07-23 04:15:56,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:56,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327858925] [2022-07-23 04:15:56,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:56,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:56,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 04:15:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:56,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:15:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:15:56,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:56,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:15:57,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:15:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-23 04:15:57,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 04:15:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:15:57,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:15:57,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:15:57,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:15:57,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 04:15:57,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:57,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:15:57,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:57,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:57,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-23 04:15:57,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:57,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:57,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 04:15:57,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-23 04:15:57,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:57,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-23 04:15:57,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:57,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-23 04:15:57,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-23 04:15:57,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-23 04:15:57,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:57,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-23 04:15:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-23 04:15:57,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-23 04:15:57,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-23 04:15:57,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-23 04:15:57,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-23 04:15:57,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-23 04:15:57,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-23 04:15:57,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-23 04:15:57,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-23 04:15:57,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-23 04:15:57,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-23 04:15:57,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-07-23 04:15:57,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,105 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-23 04:15:57,105 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:57,105 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327858925] [2022-07-23 04:15:57,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327858925] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:15:57,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:15:57,106 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 04:15:57,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928393802] [2022-07-23 04:15:57,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:15:57,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 04:15:57,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:57,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 04:15:57,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-23 04:15:57,107 INFO L87 Difference]: Start difference. First operand 426 states and 461 transitions. Second operand has 8 states, 8 states have (on average 17.25) internal successors, (138), 4 states have internal predecessors, (138), 2 states have call successors, (42), 6 states have call predecessors, (42), 1 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2022-07-23 04:15:57,635 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:57,635 INFO L93 Difference]: Finished difference Result 426 states and 461 transitions. [2022-07-23 04:15:57,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 04:15:57,636 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.25) internal successors, (138), 4 states have internal predecessors, (138), 2 states have call successors, (42), 6 states have call predecessors, (42), 1 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) Word has length 273 [2022-07-23 04:15:57,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:57,638 INFO L225 Difference]: With dead ends: 426 [2022-07-23 04:15:57,638 INFO L226 Difference]: Without dead ends: 424 [2022-07-23 04:15:57,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-23 04:15:57,638 INFO L413 NwaCegarLoop]: 344 mSDtfsCounter, 834 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 518 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 866 SdHoareTripleChecker+Valid, 694 SdHoareTripleChecker+Invalid, 875 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 518 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:57,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [866 Valid, 694 Invalid, 875 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 518 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 04:15:57,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 424 states. [2022-07-23 04:15:57,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 424 to 424. [2022-07-23 04:15:57,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 424 states, 275 states have (on average 1.0436363636363637) internal successors, (287), 285 states have internal predecessors, (287), 87 states have call successors, (87), 55 states have call predecessors, (87), 54 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-23 04:15:57,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 424 states to 424 states and 459 transitions. [2022-07-23 04:15:57,745 INFO L78 Accepts]: Start accepts. Automaton has 424 states and 459 transitions. Word has length 273 [2022-07-23 04:15:57,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:57,745 INFO L495 AbstractCegarLoop]: Abstraction has 424 states and 459 transitions. [2022-07-23 04:15:57,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.25) internal successors, (138), 4 states have internal predecessors, (138), 2 states have call successors, (42), 6 states have call predecessors, (42), 1 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2022-07-23 04:15:57,745 INFO L276 IsEmpty]: Start isEmpty. Operand 424 states and 459 transitions. [2022-07-23 04:15:57,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 280 [2022-07-23 04:15:57,747 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:57,747 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-23 04:15:57,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-07-23 04:15:57,747 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:15:57,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:57,748 INFO L85 PathProgramCache]: Analyzing trace with hash 2010354461, now seen corresponding path program 1 times [2022-07-23 04:15:57,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:57,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [319870428] [2022-07-23 04:15:57,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:57,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:57,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:57,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 04:15:57,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:57,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:15:57,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:15:57,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:15:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:15:57,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-23 04:15:57,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 04:15:57,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:15:57,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:15:57,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:15:57,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:15:57,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 04:15:57,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:57,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:15:57,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:57,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:57,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-23 04:15:57,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:57,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:57,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 04:15:57,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-23 04:15:57,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:57,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-23 04:15:57,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:57,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-23 04:15:57,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-23 04:15:57,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-23 04:15:57,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:57,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-23 04:15:57,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-23 04:15:57,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-23 04:15:57,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-23 04:15:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-23 04:15:57,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-23 04:15:57,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-23 04:15:57,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-23 04:15:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-23 04:15:57,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-23 04:15:57,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-23 04:15:57,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-23 04:15:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-07-23 04:15:57,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-23 04:15:57,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:57,985 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-23 04:15:57,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:57,985 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [319870428] [2022-07-23 04:15:57,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [319870428] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:15:57,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:15:57,986 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 04:15:57,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819212060] [2022-07-23 04:15:57,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:15:57,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 04:15:57,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:57,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 04:15:57,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-23 04:15:57,987 INFO L87 Difference]: Start difference. First operand 424 states and 459 transitions. Second operand has 8 states, 8 states have (on average 17.75) internal successors, (142), 4 states have internal predecessors, (142), 2 states have call successors, (43), 6 states have call predecessors, (43), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2022-07-23 04:15:58,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:58,574 INFO L93 Difference]: Finished difference Result 424 states and 459 transitions. [2022-07-23 04:15:58,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 04:15:58,575 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 4 states have internal predecessors, (142), 2 states have call successors, (43), 6 states have call predecessors, (43), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) Word has length 279 [2022-07-23 04:15:58,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:58,576 INFO L225 Difference]: With dead ends: 424 [2022-07-23 04:15:58,576 INFO L226 Difference]: Without dead ends: 422 [2022-07-23 04:15:58,577 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-23 04:15:58,577 INFO L413 NwaCegarLoop]: 342 mSDtfsCounter, 824 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 855 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:58,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [855 Valid, 692 Invalid, 873 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 04:15:58,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2022-07-23 04:15:58,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 422. [2022-07-23 04:15:58,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 274 states have (on average 1.0401459854014599) internal successors, (285), 283 states have internal predecessors, (285), 87 states have call successors, (87), 55 states have call predecessors, (87), 54 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-23 04:15:58,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 457 transitions. [2022-07-23 04:15:58,682 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 457 transitions. Word has length 279 [2022-07-23 04:15:58,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:58,683 INFO L495 AbstractCegarLoop]: Abstraction has 422 states and 457 transitions. [2022-07-23 04:15:58,683 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 17.75) internal successors, (142), 4 states have internal predecessors, (142), 2 states have call successors, (43), 6 states have call predecessors, (43), 1 states have return successors, (42), 2 states have call predecessors, (42), 2 states have call successors, (42) [2022-07-23 04:15:58,683 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 457 transitions. [2022-07-23 04:15:58,684 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2022-07-23 04:15:58,684 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:58,685 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-23 04:15:58,685 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-07-23 04:15:58,685 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:15:58,685 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:58,685 INFO L85 PathProgramCache]: Analyzing trace with hash -448659565, now seen corresponding path program 1 times [2022-07-23 04:15:58,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:58,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514317326] [2022-07-23 04:15:58,686 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:58,686 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:58,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:58,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:58,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:58,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 04:15:58,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:58,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:58,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:58,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:15:58,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:58,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:15:58,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:58,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:15:58,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:58,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:15:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:58,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-23 04:15:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:58,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 04:15:58,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:58,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:15:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:58,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:15:58,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:58,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:15:58,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:58,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:15:58,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:58,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 04:15:58,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:58,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:58,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:58,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:15:58,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:58,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:58,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:58,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:58,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:58,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-23 04:15:58,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:58,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:58,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:58,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:58,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 04:15:58,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:58,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-23 04:15:58,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:58,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:58,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:58,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-23 04:15:58,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:58,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:58,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:58,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-23 04:15:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:58,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-23 04:15:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:58,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-23 04:15:58,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:58,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:58,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-23 04:15:58,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:58,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-23 04:15:58,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:58,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-23 04:15:58,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:58,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-23 04:15:58,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:58,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-23 04:15:58,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:58,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-23 04:15:58,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:58,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-23 04:15:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:58,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-23 04:15:58,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:58,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-23 04:15:58,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:58,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-23 04:15:58,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:58,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-23 04:15:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:58,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-23 04:15:58,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:58,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-07-23 04:15:58,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:58,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-23 04:15:58,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:58,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2022-07-23 04:15:58,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:58,878 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-23 04:15:58,879 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:58,879 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514317326] [2022-07-23 04:15:58,879 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514317326] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:15:58,879 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:15:58,879 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 04:15:58,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122796519] [2022-07-23 04:15:58,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:15:58,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 04:15:58,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:58,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 04:15:58,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-23 04:15:58,881 INFO L87 Difference]: Start difference. First operand 422 states and 457 transitions. Second operand has 8 states, 8 states have (on average 18.25) internal successors, (146), 4 states have internal predecessors, (146), 2 states have call successors, (44), 6 states have call predecessors, (44), 1 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2022-07-23 04:15:59,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:15:59,508 INFO L93 Difference]: Finished difference Result 422 states and 457 transitions. [2022-07-23 04:15:59,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 04:15:59,509 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.25) internal successors, (146), 4 states have internal predecessors, (146), 2 states have call successors, (44), 6 states have call predecessors, (44), 1 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) Word has length 285 [2022-07-23 04:15:59,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:15:59,510 INFO L225 Difference]: With dead ends: 422 [2022-07-23 04:15:59,510 INFO L226 Difference]: Without dead ends: 420 [2022-07-23 04:15:59,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 100 GetRequests, 88 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-23 04:15:59,511 INFO L413 NwaCegarLoop]: 340 mSDtfsCounter, 814 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 514 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 844 SdHoareTripleChecker+Valid, 690 SdHoareTripleChecker+Invalid, 871 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 514 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 04:15:59,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [844 Valid, 690 Invalid, 871 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 514 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-23 04:15:59,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 420 states. [2022-07-23 04:15:59,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 420 to 420. [2022-07-23 04:15:59,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 420 states, 273 states have (on average 1.0366300366300367) internal successors, (283), 281 states have internal predecessors, (283), 87 states have call successors, (87), 55 states have call predecessors, (87), 54 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-23 04:15:59,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 420 states to 420 states and 455 transitions. [2022-07-23 04:15:59,626 INFO L78 Accepts]: Start accepts. Automaton has 420 states and 455 transitions. Word has length 285 [2022-07-23 04:15:59,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:15:59,626 INFO L495 AbstractCegarLoop]: Abstraction has 420 states and 455 transitions. [2022-07-23 04:15:59,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.25) internal successors, (146), 4 states have internal predecessors, (146), 2 states have call successors, (44), 6 states have call predecessors, (44), 1 states have return successors, (43), 2 states have call predecessors, (43), 2 states have call successors, (43) [2022-07-23 04:15:59,627 INFO L276 IsEmpty]: Start isEmpty. Operand 420 states and 455 transitions. [2022-07-23 04:15:59,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 292 [2022-07-23 04:15:59,628 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:15:59,629 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-23 04:15:59,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-07-23 04:15:59,629 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:15:59,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:15:59,630 INFO L85 PathProgramCache]: Analyzing trace with hash 2024722807, now seen corresponding path program 1 times [2022-07-23 04:15:59,630 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:15:59,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733274705] [2022-07-23 04:15:59,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:15:59,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:15:59,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:59,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 04:15:59,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:15:59,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:15:59,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:15:59,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:15:59,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-23 04:15:59,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 04:15:59,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:15:59,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:15:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:15:59,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:15:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 04:15:59,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:59,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:15:59,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:59,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:59,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-23 04:15:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:59,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:15:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 04:15:59,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-23 04:15:59,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:59,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-23 04:15:59,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:15:59,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-23 04:15:59,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-23 04:15:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-23 04:15:59,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:15:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-23 04:15:59,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-23 04:15:59,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-23 04:15:59,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-23 04:15:59,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-23 04:15:59,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-23 04:15:59,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-23 04:15:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-23 04:15:59,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-23 04:15:59,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-23 04:15:59,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-23 04:15:59,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-23 04:15:59,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-07-23 04:15:59,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-23 04:15:59,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2022-07-23 04:15:59,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-23 04:15:59,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:15:59,885 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-23 04:15:59,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:15:59,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733274705] [2022-07-23 04:15:59,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733274705] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:15:59,886 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:15:59,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 04:15:59,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1257501355] [2022-07-23 04:15:59,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:15:59,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 04:15:59,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:15:59,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 04:15:59,889 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-23 04:15:59,889 INFO L87 Difference]: Start difference. First operand 420 states and 455 transitions. Second operand has 8 states, 8 states have (on average 18.75) internal successors, (150), 4 states have internal predecessors, (150), 2 states have call successors, (45), 6 states have call predecessors, (45), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2022-07-23 04:16:00,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:16:00,392 INFO L93 Difference]: Finished difference Result 420 states and 455 transitions. [2022-07-23 04:16:00,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 04:16:00,392 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 18.75) internal successors, (150), 4 states have internal predecessors, (150), 2 states have call successors, (45), 6 states have call predecessors, (45), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) Word has length 291 [2022-07-23 04:16:00,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:16:00,397 INFO L225 Difference]: With dead ends: 420 [2022-07-23 04:16:00,397 INFO L226 Difference]: Without dead ends: 418 [2022-07-23 04:16:00,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-23 04:16:00,398 INFO L413 NwaCegarLoop]: 338 mSDtfsCounter, 804 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 512 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 833 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 869 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-23 04:16:00,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [833 Valid, 688 Invalid, 869 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 512 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-23 04:16:00,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 418 states. [2022-07-23 04:16:00,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 418 to 418. [2022-07-23 04:16:00,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 418 states, 272 states have (on average 1.0330882352941178) internal successors, (281), 279 states have internal predecessors, (281), 87 states have call successors, (87), 55 states have call predecessors, (87), 54 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-23 04:16:00,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 418 states to 418 states and 453 transitions. [2022-07-23 04:16:00,510 INFO L78 Accepts]: Start accepts. Automaton has 418 states and 453 transitions. Word has length 291 [2022-07-23 04:16:00,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:16:00,510 INFO L495 AbstractCegarLoop]: Abstraction has 418 states and 453 transitions. [2022-07-23 04:16:00,510 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 18.75) internal successors, (150), 4 states have internal predecessors, (150), 2 states have call successors, (45), 6 states have call predecessors, (45), 1 states have return successors, (44), 2 states have call predecessors, (44), 2 states have call successors, (44) [2022-07-23 04:16:00,511 INFO L276 IsEmpty]: Start isEmpty. Operand 418 states and 453 transitions. [2022-07-23 04:16:00,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2022-07-23 04:16:00,512 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:16:00,512 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-23 04:16:00,513 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-07-23 04:16:00,513 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:16:00,513 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:16:00,513 INFO L85 PathProgramCache]: Analyzing trace with hash -2019577928, now seen corresponding path program 1 times [2022-07-23 04:16:00,513 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:16:00,513 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1646211245] [2022-07-23 04:16:00,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:16:00,514 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:16:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:16:00,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 04:16:00,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:00,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:16:00,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:16:00,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:16:00,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:16:00,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-23 04:16:00,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 04:16:00,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:16:00,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:16:00,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:16:00,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:16:00,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 04:16:00,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:00,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:16:00,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:00,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:16:00,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-23 04:16:00,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:00,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:16:00,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 04:16:00,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-23 04:16:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:16:00,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-23 04:16:00,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:16:00,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-23 04:16:00,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-23 04:16:00,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-23 04:16:00,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:00,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-23 04:16:00,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-23 04:16:00,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-23 04:16:00,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-23 04:16:00,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-23 04:16:00,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-23 04:16:00,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-23 04:16:00,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-23 04:16:00,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-23 04:16:00,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-23 04:16:00,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-23 04:16:00,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-23 04:16:00,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-07-23 04:16:00,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-23 04:16:00,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2022-07-23 04:16:00,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-23 04:16:00,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2022-07-23 04:16:00,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:00,760 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-23 04:16:00,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:16:00,760 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1646211245] [2022-07-23 04:16:00,760 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1646211245] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:16:00,760 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:16:00,761 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 04:16:00,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574570218] [2022-07-23 04:16:00,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:16:00,761 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 04:16:00,761 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:16:00,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 04:16:00,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-23 04:16:00,762 INFO L87 Difference]: Start difference. First operand 418 states and 453 transitions. Second operand has 8 states, 8 states have (on average 19.25) internal successors, (154), 4 states have internal predecessors, (154), 2 states have call successors, (46), 6 states have call predecessors, (46), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2022-07-23 04:16:01,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:16:01,354 INFO L93 Difference]: Finished difference Result 418 states and 453 transitions. [2022-07-23 04:16:01,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 04:16:01,354 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.25) internal successors, (154), 4 states have internal predecessors, (154), 2 states have call successors, (46), 6 states have call predecessors, (46), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) Word has length 297 [2022-07-23 04:16:01,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:16:01,356 INFO L225 Difference]: With dead ends: 418 [2022-07-23 04:16:01,356 INFO L226 Difference]: Without dead ends: 416 [2022-07-23 04:16:01,357 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 92 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-23 04:16:01,357 INFO L413 NwaCegarLoop]: 336 mSDtfsCounter, 794 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 822 SdHoareTripleChecker+Valid, 686 SdHoareTripleChecker+Invalid, 867 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:16:01,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [822 Valid, 686 Invalid, 867 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 04:16:01,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 416 states. [2022-07-23 04:16:01,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 416 to 416. [2022-07-23 04:16:01,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 416 states, 271 states have (on average 1.029520295202952) internal successors, (279), 277 states have internal predecessors, (279), 87 states have call successors, (87), 55 states have call predecessors, (87), 54 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-23 04:16:01,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 416 states to 416 states and 451 transitions. [2022-07-23 04:16:01,464 INFO L78 Accepts]: Start accepts. Automaton has 416 states and 451 transitions. Word has length 297 [2022-07-23 04:16:01,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:16:01,465 INFO L495 AbstractCegarLoop]: Abstraction has 416 states and 451 transitions. [2022-07-23 04:16:01,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.25) internal successors, (154), 4 states have internal predecessors, (154), 2 states have call successors, (46), 6 states have call predecessors, (46), 1 states have return successors, (45), 2 states have call predecessors, (45), 2 states have call successors, (45) [2022-07-23 04:16:01,465 INFO L276 IsEmpty]: Start isEmpty. Operand 416 states and 451 transitions. [2022-07-23 04:16:01,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 304 [2022-07-23 04:16:01,466 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:16:01,467 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-23 04:16:01,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-07-23 04:16:01,467 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:16:01,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:16:01,467 INFO L85 PathProgramCache]: Analyzing trace with hash -1543049479, now seen corresponding path program 1 times [2022-07-23 04:16:01,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:16:01,468 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292678529] [2022-07-23 04:16:01,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:16:01,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:16:01,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:16:01,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 04:16:01,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:01,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:16:01,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:16:01,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:16:01,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:16:01,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-23 04:16:01,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 04:16:01,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:16:01,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:16:01,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:16:01,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:16:01,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 04:16:01,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:01,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:16:01,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:01,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:16:01,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-23 04:16:01,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:01,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:16:01,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 04:16:01,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-23 04:16:01,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:16:01,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-23 04:16:01,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:16:01,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-23 04:16:01,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-23 04:16:01,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-23 04:16:01,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:01,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-23 04:16:01,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-23 04:16:01,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-23 04:16:01,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-23 04:16:01,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-23 04:16:01,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-23 04:16:01,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-23 04:16:01,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-23 04:16:01,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-23 04:16:01,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-23 04:16:01,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-23 04:16:01,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-23 04:16:01,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-07-23 04:16:01,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-23 04:16:01,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2022-07-23 04:16:01,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-23 04:16:01,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2022-07-23 04:16:01,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-07-23 04:16:01,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:01,686 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-23 04:16:01,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:16:01,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292678529] [2022-07-23 04:16:01,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292678529] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:16:01,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:16:01,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 04:16:01,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653095649] [2022-07-23 04:16:01,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:16:01,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 04:16:01,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:16:01,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 04:16:01,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-23 04:16:01,689 INFO L87 Difference]: Start difference. First operand 416 states and 451 transitions. Second operand has 8 states, 8 states have (on average 19.75) internal successors, (158), 4 states have internal predecessors, (158), 2 states have call successors, (47), 6 states have call predecessors, (47), 1 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2022-07-23 04:16:02,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:16:02,308 INFO L93 Difference]: Finished difference Result 416 states and 451 transitions. [2022-07-23 04:16:02,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 04:16:02,308 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 19.75) internal successors, (158), 4 states have internal predecessors, (158), 2 states have call successors, (47), 6 states have call predecessors, (47), 1 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) Word has length 303 [2022-07-23 04:16:02,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:16:02,320 INFO L225 Difference]: With dead ends: 416 [2022-07-23 04:16:02,321 INFO L226 Difference]: Without dead ends: 414 [2022-07-23 04:16:02,321 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-23 04:16:02,321 INFO L413 NwaCegarLoop]: 334 mSDtfsCounter, 784 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 508 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 811 SdHoareTripleChecker+Valid, 684 SdHoareTripleChecker+Invalid, 865 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 508 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:16:02,321 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [811 Valid, 684 Invalid, 865 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 508 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 04:16:02,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 414 states. [2022-07-23 04:16:02,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 414 to 414. [2022-07-23 04:16:02,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 270 states have (on average 1.025925925925926) internal successors, (277), 275 states have internal predecessors, (277), 87 states have call successors, (87), 55 states have call predecessors, (87), 54 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-23 04:16:02,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 449 transitions. [2022-07-23 04:16:02,435 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 449 transitions. Word has length 303 [2022-07-23 04:16:02,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:16:02,435 INFO L495 AbstractCegarLoop]: Abstraction has 414 states and 449 transitions. [2022-07-23 04:16:02,435 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 19.75) internal successors, (158), 4 states have internal predecessors, (158), 2 states have call successors, (47), 6 states have call predecessors, (47), 1 states have return successors, (46), 2 states have call predecessors, (46), 2 states have call successors, (46) [2022-07-23 04:16:02,435 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 449 transitions. [2022-07-23 04:16:02,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 310 [2022-07-23 04:16:02,437 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:16:02,437 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-23 04:16:02,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-07-23 04:16:02,437 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:16:02,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:16:02,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1319340359, now seen corresponding path program 1 times [2022-07-23 04:16:02,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:16:02,438 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757566465] [2022-07-23 04:16:02,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:16:02,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:16:02,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:16:02,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 04:16:02,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:02,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:16:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:16:02,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:16:02,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:16:02,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-23 04:16:02,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 04:16:02,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:16:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:16:02,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:16:02,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:16:02,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 04:16:02,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:02,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:16:02,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:02,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:16:02,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-23 04:16:02,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:02,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:16:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 04:16:02,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-23 04:16:02,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:16:02,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-23 04:16:02,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:16:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-23 04:16:02,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-23 04:16:02,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-23 04:16:02,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:02,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-23 04:16:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-23 04:16:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-23 04:16:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-23 04:16:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-23 04:16:02,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-23 04:16:02,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-23 04:16:02,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-23 04:16:02,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-23 04:16:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-23 04:16:02,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-23 04:16:02,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-23 04:16:02,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-07-23 04:16:02,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-23 04:16:02,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2022-07-23 04:16:02,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-23 04:16:02,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2022-07-23 04:16:02,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-07-23 04:16:02,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2022-07-23 04:16:02,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:02,738 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-23 04:16:02,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:16:02,739 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757566465] [2022-07-23 04:16:02,739 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757566465] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:16:02,739 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:16:02,739 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 04:16:02,739 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196754565] [2022-07-23 04:16:02,739 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:16:02,740 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 04:16:02,740 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:16:02,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 04:16:02,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-23 04:16:02,741 INFO L87 Difference]: Start difference. First operand 414 states and 449 transitions. Second operand has 8 states, 8 states have (on average 20.25) internal successors, (162), 4 states have internal predecessors, (162), 2 states have call successors, (48), 6 states have call predecessors, (48), 1 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2022-07-23 04:16:03,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:16:03,308 INFO L93 Difference]: Finished difference Result 414 states and 449 transitions. [2022-07-23 04:16:03,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 04:16:03,309 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 20.25) internal successors, (162), 4 states have internal predecessors, (162), 2 states have call successors, (48), 6 states have call predecessors, (48), 1 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) Word has length 309 [2022-07-23 04:16:03,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:16:03,310 INFO L225 Difference]: With dead ends: 414 [2022-07-23 04:16:03,310 INFO L226 Difference]: Without dead ends: 412 [2022-07-23 04:16:03,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-23 04:16:03,311 INFO L413 NwaCegarLoop]: 332 mSDtfsCounter, 774 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 506 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 800 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 506 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:16:03,311 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [800 Valid, 682 Invalid, 863 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 506 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 04:16:03,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 412 states. [2022-07-23 04:16:03,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 412 to 412. [2022-07-23 04:16:03,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 412 states, 269 states have (on average 1.0223048327137547) internal successors, (275), 273 states have internal predecessors, (275), 87 states have call successors, (87), 55 states have call predecessors, (87), 54 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-23 04:16:03,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 412 states to 412 states and 447 transitions. [2022-07-23 04:16:03,434 INFO L78 Accepts]: Start accepts. Automaton has 412 states and 447 transitions. Word has length 309 [2022-07-23 04:16:03,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:16:03,434 INFO L495 AbstractCegarLoop]: Abstraction has 412 states and 447 transitions. [2022-07-23 04:16:03,434 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 20.25) internal successors, (162), 4 states have internal predecessors, (162), 2 states have call successors, (48), 6 states have call predecessors, (48), 1 states have return successors, (47), 2 states have call predecessors, (47), 2 states have call successors, (47) [2022-07-23 04:16:03,434 INFO L276 IsEmpty]: Start isEmpty. Operand 412 states and 447 transitions. [2022-07-23 04:16:03,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 316 [2022-07-23 04:16:03,436 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:16:03,436 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-23 04:16:03,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43 [2022-07-23 04:16:03,436 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:16:03,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:16:03,437 INFO L85 PathProgramCache]: Analyzing trace with hash 642791397, now seen corresponding path program 1 times [2022-07-23 04:16:03,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:16:03,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332420743] [2022-07-23 04:16:03,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:16:03,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:16:03,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:16:03,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 04:16:03,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:03,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:16:03,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:16:03,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:16:03,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:16:03,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-23 04:16:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 04:16:03,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:16:03,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:16:03,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:16:03,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:16:03,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 04:16:03,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:03,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:16:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:03,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:16:03,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-23 04:16:03,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:03,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:16:03,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 04:16:03,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-23 04:16:03,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:16:03,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-23 04:16:03,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:16:03,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-23 04:16:03,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-23 04:16:03,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-23 04:16:03,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:03,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-23 04:16:03,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-23 04:16:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-23 04:16:03,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-23 04:16:03,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-23 04:16:03,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-23 04:16:03,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-23 04:16:03,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-23 04:16:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-23 04:16:03,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-23 04:16:03,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-23 04:16:03,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-23 04:16:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-07-23 04:16:03,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-23 04:16:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2022-07-23 04:16:03,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-23 04:16:03,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2022-07-23 04:16:03,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-07-23 04:16:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2022-07-23 04:16:03,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2022-07-23 04:16:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:03,677 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-23 04:16:03,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:16:03,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332420743] [2022-07-23 04:16:03,678 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332420743] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:16:03,678 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:16:03,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-23 04:16:03,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [423842717] [2022-07-23 04:16:03,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:16:03,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-23 04:16:03,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:16:03,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-23 04:16:03,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-23 04:16:03,679 INFO L87 Difference]: Start difference. First operand 412 states and 447 transitions. Second operand has 10 states, 10 states have (on average 16.6) internal successors, (166), 6 states have internal predecessors, (166), 2 states have call successors, (49), 6 states have call predecessors, (49), 2 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2022-07-23 04:16:04,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:16:04,459 INFO L93 Difference]: Finished difference Result 412 states and 447 transitions. [2022-07-23 04:16:04,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-23 04:16:04,460 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 16.6) internal successors, (166), 6 states have internal predecessors, (166), 2 states have call successors, (49), 6 states have call predecessors, (49), 2 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) Word has length 315 [2022-07-23 04:16:04,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:16:04,461 INFO L225 Difference]: With dead ends: 412 [2022-07-23 04:16:04,461 INFO L226 Difference]: Without dead ends: 410 [2022-07-23 04:16:04,462 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 98 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2022-07-23 04:16:04,462 INFO L413 NwaCegarLoop]: 325 mSDtfsCounter, 778 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 955 mSolverCounterSat, 359 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 810 SdHoareTripleChecker+Valid, 912 SdHoareTripleChecker+Invalid, 1314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 359 IncrementalHoareTripleChecker+Valid, 955 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-23 04:16:04,462 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [810 Valid, 912 Invalid, 1314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [359 Valid, 955 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-23 04:16:04,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 410 states. [2022-07-23 04:16:04,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 410 to 410. [2022-07-23 04:16:04,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 410 states, 268 states have (on average 1.0186567164179106) internal successors, (273), 271 states have internal predecessors, (273), 87 states have call successors, (87), 55 states have call predecessors, (87), 54 states have return successors, (85), 85 states have call predecessors, (85), 85 states have call successors, (85) [2022-07-23 04:16:04,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 410 states to 410 states and 445 transitions. [2022-07-23 04:16:04,574 INFO L78 Accepts]: Start accepts. Automaton has 410 states and 445 transitions. Word has length 315 [2022-07-23 04:16:04,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:16:04,574 INFO L495 AbstractCegarLoop]: Abstraction has 410 states and 445 transitions. [2022-07-23 04:16:04,575 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 16.6) internal successors, (166), 6 states have internal predecessors, (166), 2 states have call successors, (49), 6 states have call predecessors, (49), 2 states have return successors, (48), 2 states have call predecessors, (48), 2 states have call successors, (48) [2022-07-23 04:16:04,575 INFO L276 IsEmpty]: Start isEmpty. Operand 410 states and 445 transitions. [2022-07-23 04:16:04,576 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 322 [2022-07-23 04:16:04,576 INFO L187 NwaCegarLoop]: Found error trace [2022-07-23 04:16:04,577 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 11, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-07-23 04:16:04,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-07-23 04:16:04,577 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ldv_linux_usb_urb_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (and 27 more)] === [2022-07-23 04:16:04,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-23 04:16:04,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1312174456, now seen corresponding path program 1 times [2022-07-23 04:16:04,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-23 04:16:04,578 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1801791732] [2022-07-23 04:16:04,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-23 04:16:04,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-23 04:16:04,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:16:04,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-23 04:16:04,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:04,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-23 04:16:04,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-23 04:16:04,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-23 04:16:04,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-07-23 04:16:04,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-07-23 04:16:04,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-07-23 04:16:04,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-23 04:16:04,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2022-07-23 04:16:04,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-23 04:16:04,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-23 04:16:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-23 04:16:04,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:04,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-23 04:16:04,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:04,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:16:04,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-23 04:16:04,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:04,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-23 04:16:04,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-23 04:16:04,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-23 04:16:04,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:16:04,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2022-07-23 04:16:04,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-23 04:16:04,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-23 04:16:04,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-23 04:16:04,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-23 04:16:04,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-23 04:16:04,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-07-23 04:16:04,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-23 04:16:04,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2022-07-23 04:16:04,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-23 04:16:04,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 213 [2022-07-23 04:16:04,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2022-07-23 04:16:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 225 [2022-07-23 04:16:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 231 [2022-07-23 04:16:04,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-23 04:16:04,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-23 04:16:04,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2022-07-23 04:16:04,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-23 04:16:04,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 263 [2022-07-23 04:16:04,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 269 [2022-07-23 04:16:04,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 275 [2022-07-23 04:16:04,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-23 04:16:04,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 287 [2022-07-23 04:16:04,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 293 [2022-07-23 04:16:04,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 299 [2022-07-23 04:16:04,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 305 [2022-07-23 04:16:04,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 311 [2022-07-23 04:16:04,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-23 04:16:04,819 INFO L134 CoverageAnalysis]: Checked inductivity of 275 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 275 trivial. 0 not checked. [2022-07-23 04:16:04,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-23 04:16:04,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1801791732] [2022-07-23 04:16:04,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1801791732] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-23 04:16:04,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-23 04:16:04,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-23 04:16:04,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66998899] [2022-07-23 04:16:04,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-23 04:16:04,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-23 04:16:04,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-23 04:16:04,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-23 04:16:04,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-23 04:16:04,821 INFO L87 Difference]: Start difference. First operand 410 states and 445 transitions. Second operand has 8 states, 8 states have (on average 21.25) internal successors, (170), 4 states have internal predecessors, (170), 2 states have call successors, (50), 6 states have call predecessors, (50), 1 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2022-07-23 04:16:05,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-23 04:16:05,403 INFO L93 Difference]: Finished difference Result 410 states and 445 transitions. [2022-07-23 04:16:05,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-23 04:16:05,403 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 21.25) internal successors, (170), 4 states have internal predecessors, (170), 2 states have call successors, (50), 6 states have call predecessors, (50), 1 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) Word has length 321 [2022-07-23 04:16:05,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-23 04:16:05,404 INFO L225 Difference]: With dead ends: 410 [2022-07-23 04:16:05,404 INFO L226 Difference]: Without dead ends: 0 [2022-07-23 04:16:05,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=61, Invalid=121, Unknown=0, NotChecked=0, Total=182 [2022-07-23 04:16:05,405 INFO L413 NwaCegarLoop]: 329 mSDtfsCounter, 751 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 504 mSolverCounterSat, 357 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 775 SdHoareTripleChecker+Valid, 679 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 357 IncrementalHoareTripleChecker+Valid, 504 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-07-23 04:16:05,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [775 Valid, 679 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [357 Valid, 504 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-07-23 04:16:05,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-07-23 04:16:05,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-07-23 04:16:05,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-23 04:16:05,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-07-23 04:16:05,409 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 321 [2022-07-23 04:16:05,409 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-23 04:16:05,410 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-07-23 04:16:05,410 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 21.25) internal successors, (170), 4 states have internal predecessors, (170), 2 states have call successors, (50), 6 states have call predecessors, (50), 1 states have return successors, (49), 2 states have call predecessors, (49), 2 states have call successors, (49) [2022-07-23 04:16:05,410 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-07-23 04:16:05,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-07-23 04:16:05,413 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (28 of 29 remaining) [2022-07-23 04:16:05,413 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_assert_linux_usb_gadget__class_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (27 of 29 remaining) [2022-07-23 04:16:05,414 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (26 of 29 remaining) [2022-07-23 04:16:05,414 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (25 of 29 remaining) [2022-07-23 04:16:05,414 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_assert_linux_fs_char_dev__double_registrationErr0ASSERT_VIOLATIONERROR_FUNCTION (24 of 29 remaining) [2022-07-23 04:16:05,414 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (23 of 29 remaining) [2022-07-23 04:16:05,414 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (22 of 29 remaining) [2022-07-23 04:16:05,414 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (21 of 29 remaining) [2022-07-23 04:16:05,414 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (20 of 29 remaining) [2022-07-23 04:16:05,414 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_assert_linux_drivers_base_class__double_registrationErr0ASSERT_VIOLATIONERROR_FUNCTION (19 of 29 remaining) [2022-07-23 04:16:05,415 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (18 of 29 remaining) [2022-07-23 04:16:05,415 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (17 of 29 remaining) [2022-07-23 04:16:05,415 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (16 of 29 remaining) [2022-07-23 04:16:05,415 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (15 of 29 remaining) [2022-07-23 04:16:05,415 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (14 of 29 remaining) [2022-07-23 04:16:05,415 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_usb_urb_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (13 of 29 remaining) [2022-07-23 04:16:05,415 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_usb_gadget_destroy_classErr0ASSERT_VIOLATIONERROR_FUNCTION (12 of 29 remaining) [2022-07-23 04:16:05,415 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (11 of 29 remaining) [2022-07-23 04:16:05,416 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_drivers_base_class_destroy_classErr0ASSERT_VIOLATIONERROR_FUNCTION (10 of 29 remaining) [2022-07-23 04:16:05,416 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (9 of 29 remaining) [2022-07-23 04:16:05,416 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (8 of 29 remaining) [2022-07-23 04:16:05,416 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 29 remaining) [2022-07-23 04:16:05,416 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 29 remaining) [2022-07-23 04:16:05,416 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_assert_linux_usb_gadget__chrdev_registration_with_usb_gadgetErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 29 remaining) [2022-07-23 04:16:05,417 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 29 remaining) [2022-07-23 04:16:05,417 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION (3 of 29 remaining) [2022-07-23 04:16:05,417 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 29 remaining) [2022-07-23 04:16:05,417 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 29 remaining) [2022-07-23 04:16:05,417 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION (0 of 29 remaining) [2022-07-23 04:16:05,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-07-23 04:16:05,419 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-07-23 04:17:33,476 WARN L233 SmtUtils]: Spent 1.35m on a formula simplification. DAG size of input: 281 DAG size of output: 279 (called from [L 182] de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.HoareAnnotationComposer.or)