./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--usb--gspca--gspca_main.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 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--usb--gspca--gspca_main.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 68ead1e29a6cc769e9e712c81a52de8a551f5275fff71a8b8c48675aa28de434 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 15:31:13,348 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 15:31:13,350 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 15:31:13,388 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 15:31:13,389 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 15:31:13,390 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 15:31:13,394 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 15:31:13,397 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 15:31:13,399 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 15:31:13,404 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 15:31:13,406 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 15:31:13,408 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 15:31:13,408 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 15:31:13,410 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 15:31:13,411 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 15:31:13,417 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 15:31:13,418 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 15:31:13,419 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 15:31:13,421 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 15:31:13,424 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 15:31:13,427 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 15:31:13,428 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 15:31:13,429 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 15:31:13,430 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 15:31:13,432 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 15:31:13,435 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 15:31:13,437 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 15:31:13,437 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 15:31:13,438 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 15:31:13,438 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 15:31:13,439 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 15:31:13,439 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 15:31:13,441 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 15:31:13,441 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 15:31:13,442 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 15:31:13,443 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 15:31:13,443 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 15:31:13,444 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 15:31:13,444 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 15:31:13,444 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 15:31:13,445 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 15:31:13,446 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 15:31:13,450 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-21 15:31:13,486 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 15:31:13,487 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 15:31:13,487 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 15:31:13,487 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 15:31:13,488 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 15:31:13,488 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 15:31:13,489 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 15:31:13,489 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 15:31:13,489 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 15:31:13,490 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 15:31:13,490 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 15:31:13,490 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 15:31:13,490 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 15:31:13,491 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 15:31:13,491 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 15:31:13,500 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 15:31:13,500 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 15:31:13,501 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 15:31:13,501 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 15:31:13,501 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 15:31:13,501 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 15:31:13,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 15:31:13,502 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 15:31:13,502 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 15:31:13,502 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 15:31:13,502 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 15:31:13,502 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 15:31:13,503 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 15:31:13,503 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 15:31:13,503 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 15:31:13,503 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 -> 68ead1e29a6cc769e9e712c81a52de8a551f5275fff71a8b8c48675aa28de434 [2022-07-21 15:31:13,789 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 15:31:13,811 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 15:31:13,813 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 15:31:13,814 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 15:31:13,816 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 15:31:13,818 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--usb--gspca--gspca_main.ko.cil.i [2022-07-21 15:31:13,885 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/583a497c5/83ca922f83ee43eb8ec9fe8682a46e83/FLAGff8dc6a71 [2022-07-21 15:31:14,768 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 15:31:14,769 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i [2022-07-21 15:31:14,831 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/583a497c5/83ca922f83ee43eb8ec9fe8682a46e83/FLAGff8dc6a71 [2022-07-21 15:31:15,229 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/583a497c5/83ca922f83ee43eb8ec9fe8682a46e83 [2022-07-21 15:31:15,231 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 15:31:15,232 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 15:31:15,233 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 15:31:15,233 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 15:31:15,236 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 15:31:15,236 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 03:31:15" (1/1) ... [2022-07-21 15:31:15,237 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@555d829e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:31:15, skipping insertion in model container [2022-07-21 15:31:15,237 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 03:31:15" (1/1) ... [2022-07-21 15:31:15,243 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 15:31:15,387 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 15:31:18,998 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--usb--gspca--gspca_main.ko.cil.i[418415,418428] [2022-07-21 15:31:19,006 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--usb--gspca--gspca_main.ko.cil.i[418560,418573] [2022-07-21 15:31:19,008 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--usb--gspca--gspca_main.ko.cil.i[418706,418719] [2022-07-21 15:31:19,008 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--usb--gspca--gspca_main.ko.cil.i[418871,418884] [2022-07-21 15:31:19,013 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--usb--gspca--gspca_main.ko.cil.i[419029,419042] [2022-07-21 15:31:19,014 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--usb--gspca--gspca_main.ko.cil.i[419187,419200] [2022-07-21 15:31:19,014 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--usb--gspca--gspca_main.ko.cil.i[419345,419358] [2022-07-21 15:31:19,015 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--usb--gspca--gspca_main.ko.cil.i[419505,419518] [2022-07-21 15:31:19,015 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--usb--gspca--gspca_main.ko.cil.i[419664,419677] [2022-07-21 15:31:19,016 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--usb--gspca--gspca_main.ko.cil.i[419803,419816] [2022-07-21 15:31:19,016 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--usb--gspca--gspca_main.ko.cil.i[419945,419958] [2022-07-21 15:31:19,017 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--usb--gspca--gspca_main.ko.cil.i[420094,420107] [2022-07-21 15:31:19,017 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--usb--gspca--gspca_main.ko.cil.i[420233,420246] [2022-07-21 15:31:19,017 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--usb--gspca--gspca_main.ko.cil.i[420388,420401] [2022-07-21 15:31:19,018 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--usb--gspca--gspca_main.ko.cil.i[420548,420561] [2022-07-21 15:31:19,018 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--usb--gspca--gspca_main.ko.cil.i[420699,420712] [2022-07-21 15:31:19,018 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--usb--gspca--gspca_main.ko.cil.i[420850,420863] [2022-07-21 15:31:19,019 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--usb--gspca--gspca_main.ko.cil.i[421002,421015] [2022-07-21 15:31:19,020 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--usb--gspca--gspca_main.ko.cil.i[421151,421164] [2022-07-21 15:31:19,020 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--usb--gspca--gspca_main.ko.cil.i[421299,421312] [2022-07-21 15:31:19,020 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--usb--gspca--gspca_main.ko.cil.i[421456,421469] [2022-07-21 15:31:19,021 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--usb--gspca--gspca_main.ko.cil.i[421605,421618] [2022-07-21 15:31:19,021 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--usb--gspca--gspca_main.ko.cil.i[421761,421774] [2022-07-21 15:31:19,022 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--usb--gspca--gspca_main.ko.cil.i[421914,421927] [2022-07-21 15:31:19,023 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--usb--gspca--gspca_main.ko.cil.i[422060,422073] [2022-07-21 15:31:19,024 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--usb--gspca--gspca_main.ko.cil.i[422203,422216] [2022-07-21 15:31:19,024 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--usb--gspca--gspca_main.ko.cil.i[422355,422368] [2022-07-21 15:31:19,025 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--usb--gspca--gspca_main.ko.cil.i[422501,422514] [2022-07-21 15:31:19,025 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--usb--gspca--gspca_main.ko.cil.i[422646,422659] [2022-07-21 15:31:19,026 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--usb--gspca--gspca_main.ko.cil.i[422800,422813] [2022-07-21 15:31:19,027 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--usb--gspca--gspca_main.ko.cil.i[422951,422964] [2022-07-21 15:31:19,028 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--usb--gspca--gspca_main.ko.cil.i[423106,423119] [2022-07-21 15:31:19,028 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--usb--gspca--gspca_main.ko.cil.i[423258,423271] [2022-07-21 15:31:19,028 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--usb--gspca--gspca_main.ko.cil.i[423413,423426] [2022-07-21 15:31:19,029 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--usb--gspca--gspca_main.ko.cil.i[423577,423590] [2022-07-21 15:31:19,029 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--usb--gspca--gspca_main.ko.cil.i[423733,423746] [2022-07-21 15:31:19,030 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--usb--gspca--gspca_main.ko.cil.i[423897,423910] [2022-07-21 15:31:19,030 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--usb--gspca--gspca_main.ko.cil.i[424039,424052] [2022-07-21 15:31:19,031 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--usb--gspca--gspca_main.ko.cil.i[424197,424210] [2022-07-21 15:31:19,031 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--usb--gspca--gspca_main.ko.cil.i[424364,424377] [2022-07-21 15:31:19,032 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--usb--gspca--gspca_main.ko.cil.i[424523,424536] [2022-07-21 15:31:19,032 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--usb--gspca--gspca_main.ko.cil.i[424682,424695] [2022-07-21 15:31:19,033 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--usb--gspca--gspca_main.ko.cil.i[424831,424844] [2022-07-21 15:31:19,033 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--usb--gspca--gspca_main.ko.cil.i[424978,424991] [2022-07-21 15:31:19,033 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--usb--gspca--gspca_main.ko.cil.i[425117,425130] [2022-07-21 15:31:19,034 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--usb--gspca--gspca_main.ko.cil.i[425280,425293] [2022-07-21 15:31:19,034 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--usb--gspca--gspca_main.ko.cil.i[425446,425459] [2022-07-21 15:31:19,035 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--usb--gspca--gspca_main.ko.cil.i[425610,425623] [2022-07-21 15:31:19,035 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--usb--gspca--gspca_main.ko.cil.i[425775,425788] [2022-07-21 15:31:19,036 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--usb--gspca--gspca_main.ko.cil.i[425940,425953] [2022-07-21 15:31:19,036 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--usb--gspca--gspca_main.ko.cil.i[426106,426119] [2022-07-21 15:31:19,036 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--usb--gspca--gspca_main.ko.cil.i[426271,426284] [2022-07-21 15:31:19,037 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--usb--gspca--gspca_main.ko.cil.i[426438,426451] [2022-07-21 15:31:19,037 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--usb--gspca--gspca_main.ko.cil.i[426598,426611] [2022-07-21 15:31:19,037 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--usb--gspca--gspca_main.ko.cil.i[426760,426773] [2022-07-21 15:31:19,038 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--usb--gspca--gspca_main.ko.cil.i[426919,426932] [2022-07-21 15:31:19,038 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--usb--gspca--gspca_main.ko.cil.i[427065,427078] [2022-07-21 15:31:19,039 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--usb--gspca--gspca_main.ko.cil.i[427208,427221] [2022-07-21 15:31:19,039 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--usb--gspca--gspca_main.ko.cil.i[427352,427365] [2022-07-21 15:31:19,039 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--usb--gspca--gspca_main.ko.cil.i[427495,427508] [2022-07-21 15:31:19,040 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--usb--gspca--gspca_main.ko.cil.i[427639,427652] [2022-07-21 15:31:19,041 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--usb--gspca--gspca_main.ko.cil.i[427780,427793] [2022-07-21 15:31:19,041 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--usb--gspca--gspca_main.ko.cil.i[427918,427931] [2022-07-21 15:31:19,041 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--usb--gspca--gspca_main.ko.cil.i[428076,428089] [2022-07-21 15:31:19,042 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--usb--gspca--gspca_main.ko.cil.i[428235,428248] [2022-07-21 15:31:19,042 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--usb--gspca--gspca_main.ko.cil.i[428391,428404] [2022-07-21 15:31:19,042 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--usb--gspca--gspca_main.ko.cil.i[428540,428553] [2022-07-21 15:31:19,043 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--usb--gspca--gspca_main.ko.cil.i[428692,428705] [2022-07-21 15:31:19,043 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--usb--gspca--gspca_main.ko.cil.i[428843,428856] [2022-07-21 15:31:19,043 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--usb--gspca--gspca_main.ko.cil.i[428992,429005] [2022-07-21 15:31:19,044 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--usb--gspca--gspca_main.ko.cil.i[429144,429157] [2022-07-21 15:31:19,044 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--usb--gspca--gspca_main.ko.cil.i[429292,429305] [2022-07-21 15:31:19,044 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--usb--gspca--gspca_main.ko.cil.i[429445,429458] [2022-07-21 15:31:19,045 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--usb--gspca--gspca_main.ko.cil.i[429596,429609] [2022-07-21 15:31:19,045 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--usb--gspca--gspca_main.ko.cil.i[429746,429759] [2022-07-21 15:31:19,045 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--usb--gspca--gspca_main.ko.cil.i[429893,429906] [2022-07-21 15:31:19,046 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--usb--gspca--gspca_main.ko.cil.i[430044,430057] [2022-07-21 15:31:19,046 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--usb--gspca--gspca_main.ko.cil.i[430195,430208] [2022-07-21 15:31:19,047 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--usb--gspca--gspca_main.ko.cil.i[430343,430356] [2022-07-21 15:31:19,047 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--usb--gspca--gspca_main.ko.cil.i[430509,430522] [2022-07-21 15:31:19,048 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--usb--gspca--gspca_main.ko.cil.i[430678,430691] [2022-07-21 15:31:19,048 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--usb--gspca--gspca_main.ko.cil.i[430845,430858] [2022-07-21 15:31:19,049 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--usb--gspca--gspca_main.ko.cil.i[431013,431026] [2022-07-21 15:31:19,049 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--usb--gspca--gspca_main.ko.cil.i[431163,431176] [2022-07-21 15:31:19,049 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--usb--gspca--gspca_main.ko.cil.i[431310,431323] [2022-07-21 15:31:19,050 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--usb--gspca--gspca_main.ko.cil.i[431471,431484] [2022-07-21 15:31:19,050 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--usb--gspca--gspca_main.ko.cil.i[431641,431654] [2022-07-21 15:31:19,050 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--usb--gspca--gspca_main.ko.cil.i[431803,431816] [2022-07-21 15:31:19,069 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 15:31:19,145 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 15:31:19,754 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--usb--gspca--gspca_main.ko.cil.i[418415,418428] [2022-07-21 15:31:19,756 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--usb--gspca--gspca_main.ko.cil.i[418560,418573] [2022-07-21 15:31:19,756 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--usb--gspca--gspca_main.ko.cil.i[418706,418719] [2022-07-21 15:31:19,757 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--usb--gspca--gspca_main.ko.cil.i[418871,418884] [2022-07-21 15:31:19,757 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--usb--gspca--gspca_main.ko.cil.i[419029,419042] [2022-07-21 15:31:19,758 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--usb--gspca--gspca_main.ko.cil.i[419187,419200] [2022-07-21 15:31:19,759 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--usb--gspca--gspca_main.ko.cil.i[419345,419358] [2022-07-21 15:31:19,759 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--usb--gspca--gspca_main.ko.cil.i[419505,419518] [2022-07-21 15:31:19,760 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--usb--gspca--gspca_main.ko.cil.i[419664,419677] [2022-07-21 15:31:19,760 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--usb--gspca--gspca_main.ko.cil.i[419803,419816] [2022-07-21 15:31:19,761 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--usb--gspca--gspca_main.ko.cil.i[419945,419958] [2022-07-21 15:31:19,761 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--usb--gspca--gspca_main.ko.cil.i[420094,420107] [2022-07-21 15:31:19,761 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--usb--gspca--gspca_main.ko.cil.i[420233,420246] [2022-07-21 15:31:19,761 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--usb--gspca--gspca_main.ko.cil.i[420388,420401] [2022-07-21 15:31:19,762 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--usb--gspca--gspca_main.ko.cil.i[420548,420561] [2022-07-21 15:31:19,762 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--usb--gspca--gspca_main.ko.cil.i[420699,420712] [2022-07-21 15:31:19,762 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--usb--gspca--gspca_main.ko.cil.i[420850,420863] [2022-07-21 15:31:19,763 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--usb--gspca--gspca_main.ko.cil.i[421002,421015] [2022-07-21 15:31:19,763 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--usb--gspca--gspca_main.ko.cil.i[421151,421164] [2022-07-21 15:31:19,763 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--usb--gspca--gspca_main.ko.cil.i[421299,421312] [2022-07-21 15:31:19,764 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--usb--gspca--gspca_main.ko.cil.i[421456,421469] [2022-07-21 15:31:19,765 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--usb--gspca--gspca_main.ko.cil.i[421605,421618] [2022-07-21 15:31:19,765 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--usb--gspca--gspca_main.ko.cil.i[421761,421774] [2022-07-21 15:31:19,766 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--usb--gspca--gspca_main.ko.cil.i[421914,421927] [2022-07-21 15:31:19,766 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--usb--gspca--gspca_main.ko.cil.i[422060,422073] [2022-07-21 15:31:19,766 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--usb--gspca--gspca_main.ko.cil.i[422203,422216] [2022-07-21 15:31:19,767 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--usb--gspca--gspca_main.ko.cil.i[422355,422368] [2022-07-21 15:31:19,767 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--usb--gspca--gspca_main.ko.cil.i[422501,422514] [2022-07-21 15:31:19,767 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--usb--gspca--gspca_main.ko.cil.i[422646,422659] [2022-07-21 15:31:19,768 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--usb--gspca--gspca_main.ko.cil.i[422800,422813] [2022-07-21 15:31:19,768 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--usb--gspca--gspca_main.ko.cil.i[422951,422964] [2022-07-21 15:31:19,768 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--usb--gspca--gspca_main.ko.cil.i[423106,423119] [2022-07-21 15:31:19,769 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--usb--gspca--gspca_main.ko.cil.i[423258,423271] [2022-07-21 15:31:19,769 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--usb--gspca--gspca_main.ko.cil.i[423413,423426] [2022-07-21 15:31:19,770 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--usb--gspca--gspca_main.ko.cil.i[423577,423590] [2022-07-21 15:31:19,770 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--usb--gspca--gspca_main.ko.cil.i[423733,423746] [2022-07-21 15:31:19,770 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--usb--gspca--gspca_main.ko.cil.i[423897,423910] [2022-07-21 15:31:19,771 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--usb--gspca--gspca_main.ko.cil.i[424039,424052] [2022-07-21 15:31:19,771 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--usb--gspca--gspca_main.ko.cil.i[424197,424210] [2022-07-21 15:31:19,771 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--usb--gspca--gspca_main.ko.cil.i[424364,424377] [2022-07-21 15:31:19,773 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--usb--gspca--gspca_main.ko.cil.i[424523,424536] [2022-07-21 15:31:19,773 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--usb--gspca--gspca_main.ko.cil.i[424682,424695] [2022-07-21 15:31:19,773 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--usb--gspca--gspca_main.ko.cil.i[424831,424844] [2022-07-21 15:31:19,774 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--usb--gspca--gspca_main.ko.cil.i[424978,424991] [2022-07-21 15:31:19,774 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--usb--gspca--gspca_main.ko.cil.i[425117,425130] [2022-07-21 15:31:19,774 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--usb--gspca--gspca_main.ko.cil.i[425280,425293] [2022-07-21 15:31:19,775 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--usb--gspca--gspca_main.ko.cil.i[425446,425459] [2022-07-21 15:31:19,775 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--usb--gspca--gspca_main.ko.cil.i[425610,425623] [2022-07-21 15:31:19,775 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--usb--gspca--gspca_main.ko.cil.i[425775,425788] [2022-07-21 15:31:19,776 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--usb--gspca--gspca_main.ko.cil.i[425940,425953] [2022-07-21 15:31:19,776 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--usb--gspca--gspca_main.ko.cil.i[426106,426119] [2022-07-21 15:31:19,777 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--usb--gspca--gspca_main.ko.cil.i[426271,426284] [2022-07-21 15:31:19,777 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--usb--gspca--gspca_main.ko.cil.i[426438,426451] [2022-07-21 15:31:19,777 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--usb--gspca--gspca_main.ko.cil.i[426598,426611] [2022-07-21 15:31:19,778 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--usb--gspca--gspca_main.ko.cil.i[426760,426773] [2022-07-21 15:31:19,778 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--usb--gspca--gspca_main.ko.cil.i[426919,426932] [2022-07-21 15:31:19,782 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--usb--gspca--gspca_main.ko.cil.i[427065,427078] [2022-07-21 15:31:19,783 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--usb--gspca--gspca_main.ko.cil.i[427208,427221] [2022-07-21 15:31:19,783 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--usb--gspca--gspca_main.ko.cil.i[427352,427365] [2022-07-21 15:31:19,784 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--usb--gspca--gspca_main.ko.cil.i[427495,427508] [2022-07-21 15:31:19,784 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--usb--gspca--gspca_main.ko.cil.i[427639,427652] [2022-07-21 15:31:19,785 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--usb--gspca--gspca_main.ko.cil.i[427780,427793] [2022-07-21 15:31:19,786 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--usb--gspca--gspca_main.ko.cil.i[427918,427931] [2022-07-21 15:31:19,788 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--usb--gspca--gspca_main.ko.cil.i[428076,428089] [2022-07-21 15:31:19,789 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--usb--gspca--gspca_main.ko.cil.i[428235,428248] [2022-07-21 15:31:19,789 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--usb--gspca--gspca_main.ko.cil.i[428391,428404] [2022-07-21 15:31:19,789 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--usb--gspca--gspca_main.ko.cil.i[428540,428553] [2022-07-21 15:31:19,790 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--usb--gspca--gspca_main.ko.cil.i[428692,428705] [2022-07-21 15:31:19,791 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--usb--gspca--gspca_main.ko.cil.i[428843,428856] [2022-07-21 15:31:19,791 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--usb--gspca--gspca_main.ko.cil.i[428992,429005] [2022-07-21 15:31:19,791 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--usb--gspca--gspca_main.ko.cil.i[429144,429157] [2022-07-21 15:31:19,792 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--usb--gspca--gspca_main.ko.cil.i[429292,429305] [2022-07-21 15:31:19,797 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--usb--gspca--gspca_main.ko.cil.i[429445,429458] [2022-07-21 15:31:19,797 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--usb--gspca--gspca_main.ko.cil.i[429596,429609] [2022-07-21 15:31:19,798 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--usb--gspca--gspca_main.ko.cil.i[429746,429759] [2022-07-21 15:31:19,798 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--usb--gspca--gspca_main.ko.cil.i[429893,429906] [2022-07-21 15:31:19,798 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--usb--gspca--gspca_main.ko.cil.i[430044,430057] [2022-07-21 15:31:19,799 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--usb--gspca--gspca_main.ko.cil.i[430195,430208] [2022-07-21 15:31:19,800 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--usb--gspca--gspca_main.ko.cil.i[430343,430356] [2022-07-21 15:31:19,800 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--usb--gspca--gspca_main.ko.cil.i[430509,430522] [2022-07-21 15:31:19,801 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--usb--gspca--gspca_main.ko.cil.i[430678,430691] [2022-07-21 15:31:19,801 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--usb--gspca--gspca_main.ko.cil.i[430845,430858] [2022-07-21 15:31:19,802 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--usb--gspca--gspca_main.ko.cil.i[431013,431026] [2022-07-21 15:31:19,802 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--usb--gspca--gspca_main.ko.cil.i[431163,431176] [2022-07-21 15:31:19,802 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--usb--gspca--gspca_main.ko.cil.i[431310,431323] [2022-07-21 15:31:19,803 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--usb--gspca--gspca_main.ko.cil.i[431471,431484] [2022-07-21 15:31:19,803 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--usb--gspca--gspca_main.ko.cil.i[431641,431654] [2022-07-21 15:31:19,803 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--usb--gspca--gspca_main.ko.cil.i[431803,431816] [2022-07-21 15:31:19,809 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 15:31:20,086 INFO L208 MainTranslator]: Completed translation [2022-07-21 15:31:20,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:31:20 WrapperNode [2022-07-21 15:31:20,095 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 15:31:20,096 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 15:31:20,096 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 15:31:20,096 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 15:31:20,102 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:31:20" (1/1) ... [2022-07-21 15:31:20,263 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:31:20" (1/1) ... [2022-07-21 15:31:20,500 INFO L137 Inliner]: procedures = 643, calls = 3813, calls flagged for inlining = 294, calls inlined = 195, statements flattened = 6099 [2022-07-21 15:31:20,501 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 15:31:20,502 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 15:31:20,502 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 15:31:20,503 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 15:31:20,511 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:31:20" (1/1) ... [2022-07-21 15:31:20,511 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:31:20" (1/1) ... [2022-07-21 15:31:20,538 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:31:20" (1/1) ... [2022-07-21 15:31:20,539 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:31:20" (1/1) ... [2022-07-21 15:31:20,648 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:31:20" (1/1) ... [2022-07-21 15:31:20,667 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:31:20" (1/1) ... [2022-07-21 15:31:20,733 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:31:20" (1/1) ... [2022-07-21 15:31:20,767 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 15:31:20,768 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 15:31:20,768 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 15:31:20,768 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 15:31:20,768 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:31:20" (1/1) ... [2022-07-21 15:31:20,774 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 15:31:20,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:31:20,796 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-21 15:31:20,819 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-21 15:31:20,834 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2022-07-21 15:31:20,834 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2022-07-21 15:31:20,834 INFO L130 BoogieDeclarations]: Found specification of procedure PDEBUG_MODE [2022-07-21 15:31:20,834 INFO L138 BoogieDeclarations]: Found implementation of procedure PDEBUG_MODE [2022-07-21 15:31:20,834 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-21 15:31:20,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-21 15:31:20,834 INFO L130 BoogieDeclarations]: Found specification of procedure alt_xfer [2022-07-21 15:31:20,835 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_xfer [2022-07-21 15:31:20,835 INFO L130 BoogieDeclarations]: Found specification of procedure vidioc_streamon [2022-07-21 15:31:20,835 INFO L138 BoogieDeclarations]: Found implementation of procedure vidioc_streamon [2022-07-21 15:31:20,835 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-21 15:31:20,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-21 15:31:20,835 INFO L130 BoogieDeclarations]: Found specification of procedure dev_poll [2022-07-21 15:31:20,835 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_poll [2022-07-21 15:31:20,835 INFO L130 BoogieDeclarations]: Found specification of procedure vidioc_reqbufs [2022-07-21 15:31:20,836 INFO L138 BoogieDeclarations]: Found implementation of procedure vidioc_reqbufs [2022-07-21 15:31:20,836 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-21 15:31:20,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-21 15:31:20,836 INFO L130 BoogieDeclarations]: Found specification of procedure frame_ready_nolock [2022-07-21 15:31:20,836 INFO L138 BoogieDeclarations]: Found implementation of procedure frame_ready_nolock [2022-07-21 15:31:20,836 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_usb_alloc_coherent [2022-07-21 15:31:20,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_usb_alloc_coherent [2022-07-21 15:31:20,836 INFO L130 BoogieDeclarations]: Found specification of procedure frame_ready [2022-07-21 15:31:20,837 INFO L138 BoogieDeclarations]: Found implementation of procedure frame_ready [2022-07-21 15:31:20,837 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_in [2022-07-21 15:31:20,837 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_in [2022-07-21 15:31:20,837 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-21 15:31:20,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-21 15:31:20,837 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-21 15:31:20,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-21 15:31:20,837 INFO L130 BoogieDeclarations]: Found specification of procedure gspca_set_alt0 [2022-07-21 15:31:20,838 INFO L138 BoogieDeclarations]: Found implementation of procedure gspca_set_alt0 [2022-07-21 15:31:20,838 INFO L130 BoogieDeclarations]: Found specification of procedure ktime_get [2022-07-21 15:31:20,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ktime_get [2022-07-21 15:31:20,838 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-21 15:31:20,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-21 15:31:20,838 INFO L130 BoogieDeclarations]: Found specification of procedure v4l2_ctrl_handler_free [2022-07-21 15:31:20,838 INFO L138 BoogieDeclarations]: Found implementation of procedure v4l2_ctrl_handler_free [2022-07-21 15:31:20,838 INFO L130 BoogieDeclarations]: Found specification of procedure strlcpy [2022-07-21 15:31:20,839 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcpy [2022-07-21 15:31:20,839 INFO L130 BoogieDeclarations]: Found specification of procedure int_irq [2022-07-21 15:31:20,839 INFO L138 BoogieDeclarations]: Found implementation of procedure int_irq [2022-07-21 15:31:20,839 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-21 15:31:20,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-21 15:31:20,839 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-21 15:31:20,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-21 15:31:20,840 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_queue_lock_of_gspca_dev [2022-07-21 15:31:20,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_queue_lock_of_gspca_dev [2022-07-21 15:31:20,840 INFO L130 BoogieDeclarations]: Found specification of procedure v4l2_ctrl_handler_setup [2022-07-21 15:31:20,840 INFO L138 BoogieDeclarations]: Found implementation of procedure v4l2_ctrl_handler_setup [2022-07-21 15:31:20,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 15:31:20,840 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_usb_lock_of_gspca_dev [2022-07-21 15:31:20,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_usb_lock_of_gspca_dev [2022-07-21 15:31:20,840 INFO L130 BoogieDeclarations]: Found specification of procedure gspca_stream_off [2022-07-21 15:31:20,841 INFO L138 BoogieDeclarations]: Found implementation of procedure gspca_stream_off [2022-07-21 15:31:20,841 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-21 15:31:20,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-21 15:31:20,841 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-21 15:31:20,841 INFO L130 BoogieDeclarations]: Found specification of procedure gspca_input_create_urb [2022-07-21 15:31:20,842 INFO L138 BoogieDeclarations]: Found implementation of procedure gspca_input_create_urb [2022-07-21 15:31:20,842 INFO L130 BoogieDeclarations]: Found specification of procedure ns_to_timeval [2022-07-21 15:31:20,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ns_to_timeval [2022-07-21 15:31:20,842 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-07-21 15:31:20,842 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-07-21 15:31:20,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-21 15:31:20,842 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-21 15:31:20,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-21 15:31:20,843 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-21 15:31:20,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-21 15:31:20,843 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-21 15:31:20,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-21 15:31:20,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 15:31:20,847 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-21 15:31:20,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-21 15:31:20,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-21 15:31:20,847 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-21 15:31:20,847 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-21 15:31:20,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-21 15:31:20,847 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-21 15:31:20,847 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-21 15:31:20,848 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-21 15:31:20,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-21 15:31:20,849 INFO L130 BoogieDeclarations]: Found specification of procedure dev_close [2022-07-21 15:31:20,849 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_close [2022-07-21 15:31:20,849 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-21 15:31:20,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-21 15:31:20,849 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2022-07-21 15:31:20,849 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2022-07-21 15:31:20,850 INFO L130 BoogieDeclarations]: Found specification of procedure v4l2_ctrl_subscribe_event [2022-07-21 15:31:20,850 INFO L138 BoogieDeclarations]: Found implementation of procedure v4l2_ctrl_subscribe_event [2022-07-21 15:31:20,850 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-21 15:31:20,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-21 15:31:20,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 15:31:20,850 INFO L130 BoogieDeclarations]: Found specification of procedure gspca_resume [2022-07-21 15:31:20,850 INFO L138 BoogieDeclarations]: Found implementation of procedure gspca_resume [2022-07-21 15:31:20,850 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_urbs [2022-07-21 15:31:20,850 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_urbs [2022-07-21 15:31:20,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 15:31:20,851 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-21 15:31:20,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-21 15:31:20,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 15:31:20,851 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-21 15:31:20,851 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-21 15:31:20,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-21 15:31:20,851 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2022-07-21 15:31:20,852 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2022-07-21 15:31:20,852 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-21 15:31:20,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-21 15:31:20,852 INFO L130 BoogieDeclarations]: Found specification of procedure dev_open [2022-07-21 15:31:20,855 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_open [2022-07-21 15:31:20,855 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_queue_lock_of_gspca_dev [2022-07-21 15:31:20,855 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_queue_lock_of_gspca_dev [2022-07-21 15:31:20,855 INFO L130 BoogieDeclarations]: Found specification of procedure gspca_vm_close [2022-07-21 15:31:20,855 INFO L138 BoogieDeclarations]: Found implementation of procedure gspca_vm_close [2022-07-21 15:31:20,855 INFO L130 BoogieDeclarations]: Found specification of procedure vidioc_qbuf [2022-07-21 15:31:20,855 INFO L138 BoogieDeclarations]: Found implementation of procedure vidioc_qbuf [2022-07-21 15:31:20,856 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-21 15:31:20,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-21 15:31:20,856 INFO L130 BoogieDeclarations]: Found specification of procedure input_unregister_device [2022-07-21 15:31:20,856 INFO L138 BoogieDeclarations]: Found implementation of procedure input_unregister_device [2022-07-21 15:31:20,856 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-21 15:31:20,856 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-21 15:31:20,857 INFO L130 BoogieDeclarations]: Found specification of procedure v4l2_event_unsubscribe [2022-07-21 15:31:20,857 INFO L138 BoogieDeclarations]: Found implementation of procedure v4l2_event_unsubscribe [2022-07-21 15:31:20,857 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 15:31:20,857 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 15:31:20,857 INFO L130 BoogieDeclarations]: Found specification of procedure wxh_to_mode [2022-07-21 15:31:20,857 INFO L138 BoogieDeclarations]: Found implementation of procedure wxh_to_mode [2022-07-21 15:31:20,857 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2022-07-21 15:31:20,858 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2022-07-21 15:31:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-21 15:31:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-21 15:31:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-21 15:31:20,858 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-21 15:31:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_interface [2022-07-21 15:31:20,858 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_interface [2022-07-21 15:31:20,858 INFO L130 BoogieDeclarations]: Found specification of procedure frame_free [2022-07-21 15:31:20,859 INFO L138 BoogieDeclarations]: Found implementation of procedure frame_free [2022-07-21 15:31:20,859 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-07-21 15:31:20,859 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-07-21 15:31:20,859 INFO L130 BoogieDeclarations]: Found specification of procedure dev_mmap [2022-07-21 15:31:20,859 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_mmap [2022-07-21 15:31:20,859 INFO L130 BoogieDeclarations]: Found specification of procedure usb_make_path [2022-07-21 15:31:20,859 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_make_path [2022-07-21 15:31:20,859 INFO L130 BoogieDeclarations]: Found specification of procedure vidioc_streamoff [2022-07-21 15:31:20,860 INFO L138 BoogieDeclarations]: Found implementation of procedure vidioc_streamoff [2022-07-21 15:31:20,860 INFO L130 BoogieDeclarations]: Found specification of procedure gspca_init_transfer [2022-07-21 15:31:20,860 INFO L138 BoogieDeclarations]: Found implementation of procedure gspca_init_transfer [2022-07-21 15:31:20,860 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2022-07-21 15:31:20,860 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2022-07-21 15:31:20,860 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-21 15:31:20,860 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-21 15:31:20,860 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-21 15:31:20,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-21 15:31:20,861 INFO L130 BoogieDeclarations]: Found specification of procedure video_drvdata [2022-07-21 15:31:20,861 INFO L138 BoogieDeclarations]: Found implementation of procedure video_drvdata [2022-07-21 15:31:20,861 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_free_urb [2022-07-21 15:31:20,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_free_urb [2022-07-21 15:31:20,861 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-21 15:31:20,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-21 15:31:20,861 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 15:31:20,862 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-21 15:31:20,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-21 15:31:20,862 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 15:31:20,862 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-07-21 15:31:20,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-07-21 15:31:20,862 INFO L130 BoogieDeclarations]: Found specification of procedure usb_ifnum_to_if [2022-07-21 15:31:20,862 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_ifnum_to_if [2022-07-21 15:31:20,862 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_usb_lock_of_gspca_dev [2022-07-21 15:31:20,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_usb_lock_of_gspca_dev [2022-07-21 15:31:20,863 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_usb_free_coherent [2022-07-21 15:31:20,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_usb_free_coherent [2022-07-21 15:31:20,863 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 15:31:20,863 INFO L130 BoogieDeclarations]: Found specification of procedure video_device_node_name [2022-07-21 15:31:20,863 INFO L138 BoogieDeclarations]: Found implementation of procedure video_device_node_name [2022-07-21 15:31:20,863 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_module_put [2022-07-21 15:31:20,863 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_module_put [2022-07-21 15:31:20,864 INFO L130 BoogieDeclarations]: Found specification of procedure read_alloc [2022-07-21 15:31:20,864 INFO L138 BoogieDeclarations]: Found implementation of procedure read_alloc [2022-07-21 15:31:20,864 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-21 15:31:20,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-21 15:31:20,864 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-21 15:31:20,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-21 15:31:20,864 INFO L130 BoogieDeclarations]: Found specification of procedure vidioc_dqbuf [2022-07-21 15:31:20,864 INFO L138 BoogieDeclarations]: Found implementation of procedure vidioc_dqbuf [2022-07-21 15:31:20,865 INFO L130 BoogieDeclarations]: Found specification of procedure video_device_release_empty [2022-07-21 15:31:20,865 INFO L138 BoogieDeclarations]: Found implementation of procedure video_device_release_empty [2022-07-21 15:31:20,865 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-21 15:31:20,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-21 15:31:20,865 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_alloc_urb [2022-07-21 15:31:20,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_alloc_urb [2022-07-21 15:31:20,865 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-21 15:31:20,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-21 15:31:20,866 INFO L130 BoogieDeclarations]: Found specification of procedure gspca_input_destroy_urb [2022-07-21 15:31:20,866 INFO L138 BoogieDeclarations]: Found implementation of procedure gspca_input_destroy_urb [2022-07-21 15:31:20,866 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-21 15:31:20,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-21 15:31:20,866 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-21 15:31:20,866 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-21 15:31:20,866 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-21 15:31:20,866 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-21 15:31:20,866 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-21 15:31:20,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-21 15:31:20,867 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~VOID [2022-07-21 15:31:20,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~VOID [2022-07-21 15:31:20,867 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-21 15:31:20,867 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-21 15:31:20,867 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-21 15:31:20,867 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-21 15:31:20,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 15:31:20,868 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-21 15:31:20,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-21 15:31:20,868 INFO L130 BoogieDeclarations]: Found specification of procedure gspca_disconnect [2022-07-21 15:31:20,868 INFO L138 BoogieDeclarations]: Found implementation of procedure gspca_disconnect [2022-07-21 15:31:20,868 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-21 15:31:20,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-21 15:31:20,868 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-21 15:31:20,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-21 15:31:20,869 INFO L130 BoogieDeclarations]: Found specification of procedure vidioc_s_input [2022-07-21 15:31:20,869 INFO L138 BoogieDeclarations]: Found implementation of procedure vidioc_s_input [2022-07-21 15:31:20,869 INFO L130 BoogieDeclarations]: Found specification of procedure try_fmt_vid_cap [2022-07-21 15:31:20,869 INFO L138 BoogieDeclarations]: Found implementation of procedure try_fmt_vid_cap [2022-07-21 15:31:20,869 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2022-07-21 15:31:20,869 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2022-07-21 15:31:20,869 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-21 15:31:20,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-21 15:31:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-21 15:31:20,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-21 15:31:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure msecs_to_jiffies [2022-07-21 15:31:20,870 INFO L138 BoogieDeclarations]: Found implementation of procedure msecs_to_jiffies [2022-07-21 15:31:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_usb_lock_of_gspca_dev [2022-07-21 15:31:20,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_usb_lock_of_gspca_dev [2022-07-21 15:31:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-21 15:31:20,870 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-21 15:31:20,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 15:31:20,871 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~VOID [2022-07-21 15:31:20,871 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~VOID [2022-07-21 15:31:20,871 INFO L130 BoogieDeclarations]: Found specification of procedure gspca_vm_open [2022-07-21 15:31:20,871 INFO L138 BoogieDeclarations]: Found implementation of procedure gspca_vm_open [2022-07-21 15:31:21,764 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 15:31:21,771 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 15:31:21,970 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-21 15:31:25,745 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 15:31:25,768 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 15:31:25,769 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-21 15:31:25,772 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:31:25 BoogieIcfgContainer [2022-07-21 15:31:25,773 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 15:31:25,774 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 15:31:25,774 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 15:31:25,777 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 15:31:25,777 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 03:31:15" (1/3) ... [2022-07-21 15:31:25,777 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ad4172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 03:31:25, skipping insertion in model container [2022-07-21 15:31:25,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:31:20" (2/3) ... [2022-07-21 15:31:25,778 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ad4172 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 03:31:25, skipping insertion in model container [2022-07-21 15:31:25,778 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:31:25" (3/3) ... [2022-07-21 15:31:25,779 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i [2022-07-21 15:31:25,791 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 15:31:25,791 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-07-21 15:31:25,862 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 15:31:25,867 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@a512fed, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6a4ef1bc [2022-07-21 15:31:25,867 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2022-07-21 15:31:25,875 INFO L276 IsEmpty]: Start isEmpty. Operand has 1803 states, 1294 states have (on average 1.3493044822256568) internal successors, (1746), 1344 states have internal predecessors, (1746), 368 states have call successors, (368), 111 states have call predecessors, (368), 110 states have return successors, (364), 357 states have call predecessors, (364), 364 states have call successors, (364) [2022-07-21 15:31:25,882 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-21 15:31:25,882 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:31:25,883 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:31:25,883 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:31:25,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:31:25,888 INFO L85 PathProgramCache]: Analyzing trace with hash 831534073, now seen corresponding path program 1 times [2022-07-21 15:31:25,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:31:25,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611530972] [2022-07-21 15:31:25,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:31:25,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:31:26,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:26,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:31:26,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:26,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:31:26,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:26,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:31:26,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:26,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:31:26,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:26,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:31:26,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:26,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:31:26,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:26,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:31:26,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:26,603 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 15:31:26,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:31:26,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611530972] [2022-07-21 15:31:26,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611530972] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:31:26,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:31:26,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:31:26,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736548838] [2022-07-21 15:31:26,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:31:26,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:31:26,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:31:26,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:31:26,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:31:26,648 INFO L87 Difference]: Start difference. First operand has 1803 states, 1294 states have (on average 1.3493044822256568) internal successors, (1746), 1344 states have internal predecessors, (1746), 368 states have call successors, (368), 111 states have call predecessors, (368), 110 states have return successors, (364), 357 states have call predecessors, (364), 364 states have call successors, (364) Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (8), 4 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-21 15:31:31,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:31:31,008 INFO L93 Difference]: Finished difference Result 3527 states and 5017 transitions. [2022-07-21 15:31:31,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:31:31,012 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (8), 4 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 49 [2022-07-21 15:31:31,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:31:31,039 INFO L225 Difference]: With dead ends: 3527 [2022-07-21 15:31:31,039 INFO L226 Difference]: Without dead ends: 1785 [2022-07-21 15:31:31,056 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:31:31,059 INFO L413 NwaCegarLoop]: 2212 mSDtfsCounter, 4465 mSDsluCounter, 1281 mSDsCounter, 0 mSdLazyCounter, 2411 mSolverCounterSat, 1562 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4616 SdHoareTripleChecker+Valid, 3493 SdHoareTripleChecker+Invalid, 3973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1562 IncrementalHoareTripleChecker+Valid, 2411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-21 15:31:31,059 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4616 Valid, 3493 Invalid, 3973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1562 Valid, 2411 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-07-21 15:31:31,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1785 states. [2022-07-21 15:31:31,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1785 to 1785. [2022-07-21 15:31:31,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1785 states, 1283 states have (on average 1.308651597817615) internal successors, (1679), 1329 states have internal predecessors, (1679), 364 states have call successors, (364), 110 states have call predecessors, (364), 109 states have return successors, (362), 355 states have call predecessors, (362), 362 states have call successors, (362) [2022-07-21 15:31:31,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1785 states and 2405 transitions. [2022-07-21 15:31:31,214 INFO L78 Accepts]: Start accepts. Automaton has 1785 states and 2405 transitions. Word has length 49 [2022-07-21 15:31:31,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:31:31,216 INFO L495 AbstractCegarLoop]: Abstraction has 1785 states and 2405 transitions. [2022-07-21 15:31:31,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (8), 4 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-21 15:31:31,216 INFO L276 IsEmpty]: Start isEmpty. Operand 1785 states and 2405 transitions. [2022-07-21 15:31:31,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-21 15:31:31,218 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:31:31,218 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:31:31,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 15:31:31,219 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:31:31,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:31:31,219 INFO L85 PathProgramCache]: Analyzing trace with hash 571787044, now seen corresponding path program 1 times [2022-07-21 15:31:31,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:31:31,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298631898] [2022-07-21 15:31:31,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:31:31,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:31:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:31,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:31:31,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:31,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:31:31,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:31,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:31:31,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:31,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:31:31,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:31,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:31:31,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:31,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:31:31,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:31,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:31:31,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:31,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 15:31:31,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:31,522 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 15:31:31,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:31:31,523 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298631898] [2022-07-21 15:31:31,523 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298631898] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:31:31,523 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:31:31,523 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:31:31,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1856159646] [2022-07-21 15:31:31,524 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:31:31,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:31:31,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:31:31,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:31:31,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:31:31,526 INFO L87 Difference]: Start difference. First operand 1785 states and 2405 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 15:31:35,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:31:35,324 INFO L93 Difference]: Finished difference Result 1785 states and 2405 transitions. [2022-07-21 15:31:35,324 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:31:35,324 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 55 [2022-07-21 15:31:35,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:31:35,334 INFO L225 Difference]: With dead ends: 1785 [2022-07-21 15:31:35,334 INFO L226 Difference]: Without dead ends: 1783 [2022-07-21 15:31:35,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:31:35,336 INFO L413 NwaCegarLoop]: 2194 mSDtfsCounter, 4433 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2397 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4581 SdHoareTripleChecker+Valid, 3459 SdHoareTripleChecker+Invalid, 3951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1554 IncrementalHoareTripleChecker+Valid, 2397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-07-21 15:31:35,336 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4581 Valid, 3459 Invalid, 3951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1554 Valid, 2397 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-07-21 15:31:35,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2022-07-21 15:31:35,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1783. [2022-07-21 15:31:35,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1783 states, 1282 states have (on average 1.3081123244929798) internal successors, (1677), 1327 states have internal predecessors, (1677), 364 states have call successors, (364), 110 states have call predecessors, (364), 109 states have return successors, (362), 355 states have call predecessors, (362), 362 states have call successors, (362) [2022-07-21 15:31:35,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 2403 transitions. [2022-07-21 15:31:35,398 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 2403 transitions. Word has length 55 [2022-07-21 15:31:35,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:31:35,399 INFO L495 AbstractCegarLoop]: Abstraction has 1783 states and 2403 transitions. [2022-07-21 15:31:35,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-21 15:31:35,399 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2403 transitions. [2022-07-21 15:31:35,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-21 15:31:35,401 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:31:35,401 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:31:35,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 15:31:35,401 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:31:35,402 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:31:35,402 INFO L85 PathProgramCache]: Analyzing trace with hash -1684624910, now seen corresponding path program 1 times [2022-07-21 15:31:35,402 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:31:35,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143456995] [2022-07-21 15:31:35,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:31:35,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:31:35,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:35,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:31:35,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:35,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:31:35,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:35,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:31:35,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:35,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:31:35,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:35,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:31:35,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:35,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:31:35,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:35,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:31:35,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:35,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 15:31:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:35,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 15:31:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:35,627 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 15:31:35,627 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:31:35,627 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143456995] [2022-07-21 15:31:35,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143456995] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:31:35,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:31:35,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:31:35,628 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038672391] [2022-07-21 15:31:35,628 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:31:35,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:31:35,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:31:35,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:31:35,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:31:35,629 INFO L87 Difference]: Start difference. First operand 1783 states and 2403 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-21 15:31:39,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:31:39,084 INFO L93 Difference]: Finished difference Result 1783 states and 2403 transitions. [2022-07-21 15:31:39,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:31:39,085 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 61 [2022-07-21 15:31:39,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:31:39,094 INFO L225 Difference]: With dead ends: 1783 [2022-07-21 15:31:39,094 INFO L226 Difference]: Without dead ends: 1781 [2022-07-21 15:31:39,096 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:31:39,097 INFO L413 NwaCegarLoop]: 2192 mSDtfsCounter, 4427 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2395 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4574 SdHoareTripleChecker+Valid, 3457 SdHoareTripleChecker+Invalid, 3949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1554 IncrementalHoareTripleChecker+Valid, 2395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-21 15:31:39,097 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4574 Valid, 3457 Invalid, 3949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1554 Valid, 2395 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-07-21 15:31:39,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2022-07-21 15:31:39,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1781. [2022-07-21 15:31:39,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1781 states, 1281 states have (on average 1.3075722092115534) internal successors, (1675), 1325 states have internal predecessors, (1675), 364 states have call successors, (364), 110 states have call predecessors, (364), 109 states have return successors, (362), 355 states have call predecessors, (362), 362 states have call successors, (362) [2022-07-21 15:31:39,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1781 states and 2401 transitions. [2022-07-21 15:31:39,160 INFO L78 Accepts]: Start accepts. Automaton has 1781 states and 2401 transitions. Word has length 61 [2022-07-21 15:31:39,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:31:39,160 INFO L495 AbstractCegarLoop]: Abstraction has 1781 states and 2401 transitions. [2022-07-21 15:31:39,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-21 15:31:39,161 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 2401 transitions. [2022-07-21 15:31:39,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-21 15:31:39,162 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:31:39,162 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:31:39,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 15:31:39,163 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:31:39,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:31:39,163 INFO L85 PathProgramCache]: Analyzing trace with hash -1434663393, now seen corresponding path program 1 times [2022-07-21 15:31:39,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:31:39,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1482936514] [2022-07-21 15:31:39,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:31:39,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:31:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:39,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:31:39,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:39,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:31:39,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:39,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:31:39,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:39,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:31:39,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:39,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:31:39,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:39,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:31:39,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:39,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:31:39,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:39,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 15:31:39,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:39,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 15:31:39,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:39,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:31:39,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:39,460 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 15:31:39,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:31:39,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1482936514] [2022-07-21 15:31:39,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1482936514] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:31:39,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:31:39,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:31:39,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800241914] [2022-07-21 15:31:39,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:31:39,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:31:39,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:31:39,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:31:39,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:31:39,463 INFO L87 Difference]: Start difference. First operand 1781 states and 2401 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-21 15:31:42,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:31:42,710 INFO L93 Difference]: Finished difference Result 1781 states and 2401 transitions. [2022-07-21 15:31:42,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:31:42,710 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 67 [2022-07-21 15:31:42,710 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:31:42,721 INFO L225 Difference]: With dead ends: 1781 [2022-07-21 15:31:42,721 INFO L226 Difference]: Without dead ends: 1779 [2022-07-21 15:31:42,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:31:42,723 INFO L413 NwaCegarLoop]: 2190 mSDtfsCounter, 4421 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2393 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4567 SdHoareTripleChecker+Valid, 3455 SdHoareTripleChecker+Invalid, 3947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1554 IncrementalHoareTripleChecker+Valid, 2393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-21 15:31:42,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4567 Valid, 3455 Invalid, 3947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1554 Valid, 2393 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-21 15:31:42,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2022-07-21 15:31:42,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 1779. [2022-07-21 15:31:42,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1779 states, 1280 states have (on average 1.30703125) internal successors, (1673), 1323 states have internal predecessors, (1673), 364 states have call successors, (364), 110 states have call predecessors, (364), 109 states have return successors, (362), 355 states have call predecessors, (362), 362 states have call successors, (362) [2022-07-21 15:31:42,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2399 transitions. [2022-07-21 15:31:42,786 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2399 transitions. Word has length 67 [2022-07-21 15:31:42,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:31:42,786 INFO L495 AbstractCegarLoop]: Abstraction has 1779 states and 2399 transitions. [2022-07-21 15:31:42,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-21 15:31:42,787 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2399 transitions. [2022-07-21 15:31:42,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-21 15:31:42,788 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:31:42,788 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:31:42,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 15:31:42,788 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:31:42,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:31:42,789 INFO L85 PathProgramCache]: Analyzing trace with hash -901207908, now seen corresponding path program 1 times [2022-07-21 15:31:42,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:31:42,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841957159] [2022-07-21 15:31:42,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:31:42,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:31:42,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:42,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:31:42,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:42,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:31:42,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:42,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:31:42,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:42,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:31:42,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:43,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:31:43,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:43,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:31:43,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:43,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:31:43,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:43,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 15:31:43,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:43,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 15:31:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:43,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:31:43,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:43,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:31:43,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:43,072 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 15:31:43,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:31:43,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841957159] [2022-07-21 15:31:43,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841957159] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:31:43,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:31:43,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:31:43,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [908361068] [2022-07-21 15:31:43,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:31:43,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:31:43,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:31:43,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:31:43,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:31:43,075 INFO L87 Difference]: Start difference. First operand 1779 states and 2399 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-21 15:31:46,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:31:46,211 INFO L93 Difference]: Finished difference Result 1779 states and 2399 transitions. [2022-07-21 15:31:46,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:31:46,212 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 73 [2022-07-21 15:31:46,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:31:46,219 INFO L225 Difference]: With dead ends: 1779 [2022-07-21 15:31:46,220 INFO L226 Difference]: Without dead ends: 1777 [2022-07-21 15:31:46,220 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:31:46,221 INFO L413 NwaCegarLoop]: 2188 mSDtfsCounter, 4415 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2391 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4560 SdHoareTripleChecker+Valid, 3453 SdHoareTripleChecker+Invalid, 3945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1554 IncrementalHoareTripleChecker+Valid, 2391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:31:46,221 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4560 Valid, 3453 Invalid, 3945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1554 Valid, 2391 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-21 15:31:46,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2022-07-21 15:31:46,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1777. [2022-07-21 15:31:46,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1777 states, 1279 states have (on average 1.3064894448788116) internal successors, (1671), 1321 states have internal predecessors, (1671), 364 states have call successors, (364), 110 states have call predecessors, (364), 109 states have return successors, (362), 355 states have call predecessors, (362), 362 states have call successors, (362) [2022-07-21 15:31:46,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1777 states to 1777 states and 2397 transitions. [2022-07-21 15:31:46,288 INFO L78 Accepts]: Start accepts. Automaton has 1777 states and 2397 transitions. Word has length 73 [2022-07-21 15:31:46,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:31:46,288 INFO L495 AbstractCegarLoop]: Abstraction has 1777 states and 2397 transitions. [2022-07-21 15:31:46,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-21 15:31:46,289 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 2397 transitions. [2022-07-21 15:31:46,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-21 15:31:46,290 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:31:46,290 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:31:46,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 15:31:46,291 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:31:46,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:31:46,291 INFO L85 PathProgramCache]: Analyzing trace with hash -1789613504, now seen corresponding path program 1 times [2022-07-21 15:31:46,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:31:46,292 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412111347] [2022-07-21 15:31:46,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:31:46,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:31:46,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:46,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:31:46,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:46,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:31:46,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:46,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:31:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:46,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:31:46,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:46,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:31:46,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:46,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:31:46,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:46,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:31:46,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:46,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 15:31:46,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:46,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 15:31:46,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:46,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:31:46,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:46,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:31:46,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:46,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:31:46,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:46,577 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 15:31:46,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:31:46,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412111347] [2022-07-21 15:31:46,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412111347] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:31:46,578 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:31:46,578 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:31:46,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1075281367] [2022-07-21 15:31:46,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:31:46,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:31:46,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:31:46,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:31:46,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:31:46,579 INFO L87 Difference]: Start difference. First operand 1777 states and 2397 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-21 15:31:49,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:31:49,620 INFO L93 Difference]: Finished difference Result 1777 states and 2397 transitions. [2022-07-21 15:31:49,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:31:49,620 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 79 [2022-07-21 15:31:49,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:31:49,629 INFO L225 Difference]: With dead ends: 1777 [2022-07-21 15:31:49,629 INFO L226 Difference]: Without dead ends: 1775 [2022-07-21 15:31:49,630 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:31:49,631 INFO L413 NwaCegarLoop]: 2186 mSDtfsCounter, 4409 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2389 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4553 SdHoareTripleChecker+Valid, 3451 SdHoareTripleChecker+Invalid, 3943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1554 IncrementalHoareTripleChecker+Valid, 2389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-21 15:31:49,631 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4553 Valid, 3451 Invalid, 3943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1554 Valid, 2389 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-21 15:31:49,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2022-07-21 15:31:49,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1775. [2022-07-21 15:31:49,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1775 states, 1278 states have (on average 1.305946791862285) internal successors, (1669), 1319 states have internal predecessors, (1669), 364 states have call successors, (364), 110 states have call predecessors, (364), 109 states have return successors, (362), 355 states have call predecessors, (362), 362 states have call successors, (362) [2022-07-21 15:31:49,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 2395 transitions. [2022-07-21 15:31:49,692 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 2395 transitions. Word has length 79 [2022-07-21 15:31:49,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:31:49,692 INFO L495 AbstractCegarLoop]: Abstraction has 1775 states and 2395 transitions. [2022-07-21 15:31:49,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-21 15:31:49,693 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2395 transitions. [2022-07-21 15:31:49,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-21 15:31:49,694 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:31:49,694 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:31:49,694 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 15:31:49,695 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:31:49,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:31:49,695 INFO L85 PathProgramCache]: Analyzing trace with hash -1235042294, now seen corresponding path program 1 times [2022-07-21 15:31:49,695 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:31:49,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096908920] [2022-07-21 15:31:49,695 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:31:49,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:31:49,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:49,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:31:49,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:49,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:31:49,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:49,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:31:49,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:49,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:31:49,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:49,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:31:49,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:49,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:31:49,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:49,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:31:49,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:49,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 15:31:49,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:49,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 15:31:49,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:49,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:31:49,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:49,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:31:49,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:50,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:31:50,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:50,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:31:50,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:50,024 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 15:31:50,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:31:50,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096908920] [2022-07-21 15:31:50,024 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096908920] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:31:50,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:31:50,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:31:50,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009687594] [2022-07-21 15:31:50,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:31:50,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:31:50,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:31:50,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:31:50,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:31:50,027 INFO L87 Difference]: Start difference. First operand 1775 states and 2395 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-21 15:31:53,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:31:53,099 INFO L93 Difference]: Finished difference Result 1775 states and 2395 transitions. [2022-07-21 15:31:53,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:31:53,100 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 85 [2022-07-21 15:31:53,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:31:53,106 INFO L225 Difference]: With dead ends: 1775 [2022-07-21 15:31:53,106 INFO L226 Difference]: Without dead ends: 1773 [2022-07-21 15:31:53,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:31:53,107 INFO L413 NwaCegarLoop]: 2184 mSDtfsCounter, 4403 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2387 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4546 SdHoareTripleChecker+Valid, 3449 SdHoareTripleChecker+Invalid, 3941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1554 IncrementalHoareTripleChecker+Valid, 2387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-21 15:31:53,108 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4546 Valid, 3449 Invalid, 3941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1554 Valid, 2387 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-21 15:31:53,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2022-07-21 15:31:53,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 1773. [2022-07-21 15:31:53,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1773 states, 1277 states have (on average 1.3054032889584966) internal successors, (1667), 1317 states have internal predecessors, (1667), 364 states have call successors, (364), 110 states have call predecessors, (364), 109 states have return successors, (362), 355 states have call predecessors, (362), 362 states have call successors, (362) [2022-07-21 15:31:53,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2393 transitions. [2022-07-21 15:31:53,167 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2393 transitions. Word has length 85 [2022-07-21 15:31:53,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:31:53,167 INFO L495 AbstractCegarLoop]: Abstraction has 1773 states and 2393 transitions. [2022-07-21 15:31:53,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-21 15:31:53,168 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2393 transitions. [2022-07-21 15:31:53,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-21 15:31:53,169 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:31:53,169 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:31:53,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 15:31:53,169 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:31:53,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:31:53,170 INFO L85 PathProgramCache]: Analyzing trace with hash -892313890, now seen corresponding path program 1 times [2022-07-21 15:31:53,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:31:53,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1664747940] [2022-07-21 15:31:53,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:31:53,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:31:53,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:53,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:31:53,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:53,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:31:53,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:53,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:31:53,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:53,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:31:53,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:53,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:31:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:53,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:31:53,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:53,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:31:53,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:53,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 15:31:53,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:53,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 15:31:53,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:53,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:31:53,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:53,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:31:53,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:53,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:31:53,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:53,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:31:53,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:53,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 15:31:53,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:53,465 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 15:31:53,465 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:31:53,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1664747940] [2022-07-21 15:31:53,465 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1664747940] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:31:53,465 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:31:53,466 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:31:53,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401512052] [2022-07-21 15:31:53,466 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:31:53,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:31:53,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:31:53,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:31:53,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:31:53,467 INFO L87 Difference]: Start difference. First operand 1773 states and 2393 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-21 15:31:56,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:31:56,620 INFO L93 Difference]: Finished difference Result 1773 states and 2393 transitions. [2022-07-21 15:31:56,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:31:56,623 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 91 [2022-07-21 15:31:56,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:31:56,632 INFO L225 Difference]: With dead ends: 1773 [2022-07-21 15:31:56,632 INFO L226 Difference]: Without dead ends: 1771 [2022-07-21 15:31:56,633 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:31:56,634 INFO L413 NwaCegarLoop]: 2182 mSDtfsCounter, 4401 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2381 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4543 SdHoareTripleChecker+Valid, 3447 SdHoareTripleChecker+Invalid, 3935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1554 IncrementalHoareTripleChecker+Valid, 2381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:31:56,634 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4543 Valid, 3447 Invalid, 3935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1554 Valid, 2381 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-21 15:31:56,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2022-07-21 15:31:56,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 1771. [2022-07-21 15:31:56,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1771 states, 1276 states have (on average 1.304858934169279) internal successors, (1665), 1315 states have internal predecessors, (1665), 364 states have call successors, (364), 110 states have call predecessors, (364), 109 states have return successors, (362), 355 states have call predecessors, (362), 362 states have call successors, (362) [2022-07-21 15:31:56,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2391 transitions. [2022-07-21 15:31:56,701 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2391 transitions. Word has length 91 [2022-07-21 15:31:56,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:31:56,701 INFO L495 AbstractCegarLoop]: Abstraction has 1771 states and 2391 transitions. [2022-07-21 15:31:56,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-21 15:31:56,702 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2391 transitions. [2022-07-21 15:31:56,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-21 15:31:56,702 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:31:56,703 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:31:56,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 15:31:56,703 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:31:56,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:31:56,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1479975649, now seen corresponding path program 1 times [2022-07-21 15:31:56,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:31:56,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155215568] [2022-07-21 15:31:56,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:31:56,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:31:56,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:56,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:31:56,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:56,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:31:56,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:56,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:31:56,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:56,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:31:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:56,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:31:56,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:56,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:31:56,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:56,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:31:56,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:56,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 15:31:56,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:56,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 15:31:56,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:56,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:31:56,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:56,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:31:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:56,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:31:56,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:56,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:31:56,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:56,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 15:31:56,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:31:56,968 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 15:31:56,968 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:31:56,968 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155215568] [2022-07-21 15:31:56,969 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1155215568] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:31:56,969 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:31:56,969 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:31:56,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547396690] [2022-07-21 15:31:56,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:31:56,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:31:56,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:31:56,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:31:56,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:31:56,971 INFO L87 Difference]: Start difference. First operand 1771 states and 2391 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, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-21 15:32:00,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:32:00,103 INFO L93 Difference]: Finished difference Result 1771 states and 2391 transitions. [2022-07-21 15:32:00,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:32:00,103 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, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 93 [2022-07-21 15:32:00,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:32:00,112 INFO L225 Difference]: With dead ends: 1771 [2022-07-21 15:32:00,113 INFO L226 Difference]: Without dead ends: 1769 [2022-07-21 15:32:00,114 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:32:00,114 INFO L413 NwaCegarLoop]: 2180 mSDtfsCounter, 4389 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2383 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4531 SdHoareTripleChecker+Valid, 3445 SdHoareTripleChecker+Invalid, 3937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1554 IncrementalHoareTripleChecker+Valid, 2383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:32:00,115 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4531 Valid, 3445 Invalid, 3937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1554 Valid, 2383 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-21 15:32:00,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1769 states. [2022-07-21 15:32:00,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1769 to 1769. [2022-07-21 15:32:00,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1769 states, 1275 states have (on average 1.304313725490196) internal successors, (1663), 1313 states have internal predecessors, (1663), 364 states have call successors, (364), 110 states have call predecessors, (364), 109 states have return successors, (362), 355 states have call predecessors, (362), 362 states have call successors, (362) [2022-07-21 15:32:00,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 2389 transitions. [2022-07-21 15:32:00,182 INFO L78 Accepts]: Start accepts. Automaton has 1769 states and 2389 transitions. Word has length 93 [2022-07-21 15:32:00,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:32:00,182 INFO L495 AbstractCegarLoop]: Abstraction has 1769 states and 2389 transitions. [2022-07-21 15:32:00,183 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, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-21 15:32:00,183 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 2389 transitions. [2022-07-21 15:32:00,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-21 15:32:00,184 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:32:00,184 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:32:00,184 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 15:32:00,184 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:32:00,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:32:00,185 INFO L85 PathProgramCache]: Analyzing trace with hash 782366646, now seen corresponding path program 1 times [2022-07-21 15:32:00,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:32:00,185 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1159602598] [2022-07-21 15:32:00,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:32:00,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:32:00,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:00,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:32:00,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:00,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:32:00,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:00,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:32:00,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:00,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:32:00,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:00,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:32:00,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:00,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:32:00,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:00,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:32:00,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:00,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 15:32:00,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:00,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 15:32:00,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:00,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:32:00,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:00,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:32:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:00,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:32:00,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:00,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:32:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:00,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 15:32:00,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:00,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 15:32:00,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:00,475 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 15:32:00,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:32:00,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1159602598] [2022-07-21 15:32:00,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1159602598] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:32:00,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:32:00,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:32:00,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [663237722] [2022-07-21 15:32:00,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:32:00,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:32:00,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:32:00,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:32:00,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:32:00,477 INFO L87 Difference]: Start difference. First operand 1769 states and 2389 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-21 15:32:08,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:32:08,214 INFO L93 Difference]: Finished difference Result 3451 states and 4689 transitions. [2022-07-21 15:32:08,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 15:32:08,215 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 99 [2022-07-21 15:32:08,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:32:08,235 INFO L225 Difference]: With dead ends: 3451 [2022-07-21 15:32:08,236 INFO L226 Difference]: Without dead ends: 3449 [2022-07-21 15:32:08,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-21 15:32:08,239 INFO L413 NwaCegarLoop]: 3970 mSDtfsCounter, 4725 mSDsluCounter, 2701 mSDsCounter, 0 mSdLazyCounter, 6296 mSolverCounterSat, 2162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4851 SdHoareTripleChecker+Valid, 6671 SdHoareTripleChecker+Invalid, 8458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2162 IncrementalHoareTripleChecker+Valid, 6296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-07-21 15:32:08,239 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4851 Valid, 6671 Invalid, 8458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2162 Valid, 6296 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2022-07-21 15:32:08,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3449 states. [2022-07-21 15:32:08,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3449 to 3404. [2022-07-21 15:32:08,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3404 states, 2487 states have (on average 1.3104141535987133) internal successors, (3259), 2543 states have internal predecessors, (3259), 680 states have call successors, (680), 217 states have call predecessors, (680), 216 states have return successors, (722), 663 states have call predecessors, (722), 678 states have call successors, (722) [2022-07-21 15:32:08,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3404 states to 3404 states and 4661 transitions. [2022-07-21 15:32:08,455 INFO L78 Accepts]: Start accepts. Automaton has 3404 states and 4661 transitions. Word has length 99 [2022-07-21 15:32:08,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:32:08,456 INFO L495 AbstractCegarLoop]: Abstraction has 3404 states and 4661 transitions. [2022-07-21 15:32:08,457 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-21 15:32:08,457 INFO L276 IsEmpty]: Start isEmpty. Operand 3404 states and 4661 transitions. [2022-07-21 15:32:08,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-21 15:32:08,461 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:32:08,462 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:32:08,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 15:32:08,463 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:32:08,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:32:08,463 INFO L85 PathProgramCache]: Analyzing trace with hash -790324929, now seen corresponding path program 1 times [2022-07-21 15:32:08,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:32:08,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506962071] [2022-07-21 15:32:08,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:32:08,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:32:08,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:08,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:32:08,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:08,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:32:08,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:08,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:32:08,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:08,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:32:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:08,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:32:08,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:08,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:32:08,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:08,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:32:08,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:08,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 15:32:08,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:08,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 15:32:08,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:08,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:32:08,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:08,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:32:08,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:08,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:32:08,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:08,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:32:08,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:08,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 15:32:08,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:08,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 15:32:08,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:08,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:32:08,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:08,733 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 15:32:08,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:32:08,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506962071] [2022-07-21 15:32:08,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [506962071] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:32:08,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:32:08,734 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:32:08,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258058655] [2022-07-21 15:32:08,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:32:08,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:32:08,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:32:08,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:32:08,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:32:08,736 INFO L87 Difference]: Start difference. First operand 3404 states and 4661 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-21 15:32:12,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:32:12,042 INFO L93 Difference]: Finished difference Result 3404 states and 4661 transitions. [2022-07-21 15:32:12,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:32:12,043 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 105 [2022-07-21 15:32:12,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:32:12,061 INFO L225 Difference]: With dead ends: 3404 [2022-07-21 15:32:12,061 INFO L226 Difference]: Without dead ends: 3402 [2022-07-21 15:32:12,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:32:12,064 INFO L413 NwaCegarLoop]: 2178 mSDtfsCounter, 4385 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2381 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4525 SdHoareTripleChecker+Valid, 3443 SdHoareTripleChecker+Invalid, 3935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1554 IncrementalHoareTripleChecker+Valid, 2381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-21 15:32:12,065 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4525 Valid, 3443 Invalid, 3935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1554 Valid, 2381 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-21 15:32:12,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3402 states. [2022-07-21 15:32:12,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3402 to 3402. [2022-07-21 15:32:12,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3402 states, 2486 states have (on average 1.3097345132743363) internal successors, (3256), 2541 states have internal predecessors, (3256), 680 states have call successors, (680), 217 states have call predecessors, (680), 216 states have return successors, (722), 663 states have call predecessors, (722), 678 states have call successors, (722) [2022-07-21 15:32:12,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3402 states to 3402 states and 4658 transitions. [2022-07-21 15:32:12,258 INFO L78 Accepts]: Start accepts. Automaton has 3402 states and 4658 transitions. Word has length 105 [2022-07-21 15:32:12,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:32:12,258 INFO L495 AbstractCegarLoop]: Abstraction has 3402 states and 4658 transitions. [2022-07-21 15:32:12,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-21 15:32:12,259 INFO L276 IsEmpty]: Start isEmpty. Operand 3402 states and 4658 transitions. [2022-07-21 15:32:12,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-21 15:32:12,260 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:32:12,260 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:32:12,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 15:32:12,260 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:32:12,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:32:12,261 INFO L85 PathProgramCache]: Analyzing trace with hash -9933911, now seen corresponding path program 1 times [2022-07-21 15:32:12,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:32:12,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916377860] [2022-07-21 15:32:12,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:32:12,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:32:12,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:12,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:32:12,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:12,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:32:12,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:12,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:32:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:12,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:32:12,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:12,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:32:12,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:12,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:32:12,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:12,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:32:12,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:12,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 15:32:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:12,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 15:32:12,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:12,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:32:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:12,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:32:12,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:12,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:32:12,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:12,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:32:12,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:12,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 15:32:12,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:12,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 15:32:12,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:12,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:32:12,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:12,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 15:32:12,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:12,537 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 15:32:12,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:32:12,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [916377860] [2022-07-21 15:32:12,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [916377860] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:32:12,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:32:12,538 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:32:12,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [725932273] [2022-07-21 15:32:12,538 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:32:12,538 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:32:12,538 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:32:12,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:32:12,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:32:12,539 INFO L87 Difference]: Start difference. First operand 3402 states and 4658 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 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-21 15:32:15,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:32:15,700 INFO L93 Difference]: Finished difference Result 3402 states and 4658 transitions. [2022-07-21 15:32:15,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:32:15,701 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 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 111 [2022-07-21 15:32:15,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:32:15,713 INFO L225 Difference]: With dead ends: 3402 [2022-07-21 15:32:15,714 INFO L226 Difference]: Without dead ends: 3400 [2022-07-21 15:32:15,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:32:15,716 INFO L413 NwaCegarLoop]: 2176 mSDtfsCounter, 4379 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2379 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4518 SdHoareTripleChecker+Valid, 3441 SdHoareTripleChecker+Invalid, 3933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1554 IncrementalHoareTripleChecker+Valid, 2379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:32:15,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4518 Valid, 3441 Invalid, 3933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1554 Valid, 2379 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-21 15:32:15,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3400 states. [2022-07-21 15:32:15,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3400 to 3400. [2022-07-21 15:32:15,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3400 states, 2485 states have (on average 1.3090543259557343) internal successors, (3253), 2539 states have internal predecessors, (3253), 680 states have call successors, (680), 217 states have call predecessors, (680), 216 states have return successors, (722), 663 states have call predecessors, (722), 678 states have call successors, (722) [2022-07-21 15:32:15,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3400 states to 3400 states and 4655 transitions. [2022-07-21 15:32:15,856 INFO L78 Accepts]: Start accepts. Automaton has 3400 states and 4655 transitions. Word has length 111 [2022-07-21 15:32:15,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:32:15,857 INFO L495 AbstractCegarLoop]: Abstraction has 3400 states and 4655 transitions. [2022-07-21 15:32:15,857 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 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-21 15:32:15,857 INFO L276 IsEmpty]: Start isEmpty. Operand 3400 states and 4655 transitions. [2022-07-21 15:32:15,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-21 15:32:15,858 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:32:15,858 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:32:15,858 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 15:32:15,859 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:32:15,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:32:15,859 INFO L85 PathProgramCache]: Analyzing trace with hash 151245329, now seen corresponding path program 1 times [2022-07-21 15:32:15,859 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:32:15,859 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426640074] [2022-07-21 15:32:15,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:32:15,860 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:32:15,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:15,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:32:15,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:15,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:32:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:16,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:32:16,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:16,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:32:16,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:16,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:32:16,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:16,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:32:16,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:16,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:32:16,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:16,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 15:32:16,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:16,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 15:32:16,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:16,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:32:16,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:16,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:32:16,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:16,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:32:16,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:16,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:32:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:16,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 15:32:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:16,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 15:32:16,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:16,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:32:16,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:16,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 15:32:16,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:16,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 15:32:16,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:16,129 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 15:32:16,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:32:16,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1426640074] [2022-07-21 15:32:16,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1426640074] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:32:16,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:32:16,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:32:16,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151559780] [2022-07-21 15:32:16,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:32:16,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:32:16,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:32:16,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:32:16,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:32:16,132 INFO L87 Difference]: Start difference. First operand 3400 states and 4655 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-21 15:32:19,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:32:19,300 INFO L93 Difference]: Finished difference Result 3400 states and 4655 transitions. [2022-07-21 15:32:19,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:32:19,300 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 117 [2022-07-21 15:32:19,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:32:19,326 INFO L225 Difference]: With dead ends: 3400 [2022-07-21 15:32:19,331 INFO L226 Difference]: Without dead ends: 3398 [2022-07-21 15:32:19,333 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:32:19,336 INFO L413 NwaCegarLoop]: 2174 mSDtfsCounter, 4373 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2377 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4511 SdHoareTripleChecker+Valid, 3439 SdHoareTripleChecker+Invalid, 3931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1554 IncrementalHoareTripleChecker+Valid, 2377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:32:19,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4511 Valid, 3439 Invalid, 3931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1554 Valid, 2377 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-21 15:32:19,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2022-07-21 15:32:19,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 3398. [2022-07-21 15:32:19,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3398 states, 2484 states have (on average 1.3083735909822867) internal successors, (3250), 2537 states have internal predecessors, (3250), 680 states have call successors, (680), 217 states have call predecessors, (680), 216 states have return successors, (722), 663 states have call predecessors, (722), 678 states have call successors, (722) [2022-07-21 15:32:19,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3398 states to 3398 states and 4652 transitions. [2022-07-21 15:32:19,482 INFO L78 Accepts]: Start accepts. Automaton has 3398 states and 4652 transitions. Word has length 117 [2022-07-21 15:32:19,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:32:19,485 INFO L495 AbstractCegarLoop]: Abstraction has 3398 states and 4652 transitions. [2022-07-21 15:32:19,485 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-21 15:32:19,485 INFO L276 IsEmpty]: Start isEmpty. Operand 3398 states and 4652 transitions. [2022-07-21 15:32:19,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-21 15:32:19,487 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:32:19,487 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:32:19,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 15:32:19,487 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:32:19,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:32:19,488 INFO L85 PathProgramCache]: Analyzing trace with hash -159316302, now seen corresponding path program 1 times [2022-07-21 15:32:19,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:32:19,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333974380] [2022-07-21 15:32:19,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:32:19,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:32:19,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:19,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:32:19,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:19,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:32:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:19,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:32:19,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:19,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:32:19,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:19,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:32:19,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:19,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:32:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:19,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:32:19,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:19,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 15:32:19,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:19,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 15:32:19,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:19,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:32:19,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:19,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:32:19,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:19,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:32:19,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:19,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:32:19,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:19,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 15:32:19,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:19,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 15:32:19,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:19,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:32:19,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:19,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 15:32:19,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:19,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 15:32:19,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:19,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 15:32:19,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:19,871 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 15:32:19,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:32:19,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333974380] [2022-07-21 15:32:19,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333974380] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:32:19,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:32:19,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:32:19,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288096764] [2022-07-21 15:32:19,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:32:19,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:32:19,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:32:19,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:32:19,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:32:19,874 INFO L87 Difference]: Start difference. First operand 3398 states and 4652 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-21 15:32:23,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:32:23,305 INFO L93 Difference]: Finished difference Result 3398 states and 4652 transitions. [2022-07-21 15:32:23,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:32:23,305 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 123 [2022-07-21 15:32:23,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:32:23,316 INFO L225 Difference]: With dead ends: 3398 [2022-07-21 15:32:23,317 INFO L226 Difference]: Without dead ends: 3396 [2022-07-21 15:32:23,318 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:32:23,319 INFO L413 NwaCegarLoop]: 2172 mSDtfsCounter, 4367 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2375 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4504 SdHoareTripleChecker+Valid, 3437 SdHoareTripleChecker+Invalid, 3929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1554 IncrementalHoareTripleChecker+Valid, 2375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-21 15:32:23,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4504 Valid, 3437 Invalid, 3929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1554 Valid, 2375 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-21 15:32:23,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3396 states. [2022-07-21 15:32:23,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3396 to 3396. [2022-07-21 15:32:23,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3396 states, 2483 states have (on average 1.3076923076923077) internal successors, (3247), 2535 states have internal predecessors, (3247), 680 states have call successors, (680), 217 states have call predecessors, (680), 216 states have return successors, (722), 663 states have call predecessors, (722), 678 states have call successors, (722) [2022-07-21 15:32:23,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3396 states to 3396 states and 4649 transitions. [2022-07-21 15:32:23,468 INFO L78 Accepts]: Start accepts. Automaton has 3396 states and 4649 transitions. Word has length 123 [2022-07-21 15:32:23,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:32:23,469 INFO L495 AbstractCegarLoop]: Abstraction has 3396 states and 4649 transitions. [2022-07-21 15:32:23,469 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-21 15:32:23,469 INFO L276 IsEmpty]: Start isEmpty. Operand 3396 states and 4649 transitions. [2022-07-21 15:32:23,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-21 15:32:23,470 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:32:23,471 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:32:23,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 15:32:23,471 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:32:23,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:32:23,471 INFO L85 PathProgramCache]: Analyzing trace with hash 1766972875, now seen corresponding path program 1 times [2022-07-21 15:32:23,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:32:23,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355738038] [2022-07-21 15:32:23,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:32:23,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:32:23,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:23,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:32:23,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:23,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:32:23,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:23,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:32:23,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:23,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:32:23,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:23,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:32:23,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:23,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:32:23,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:23,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:32:23,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:23,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 15:32:23,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:23,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 15:32:23,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:23,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:32:23,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:23,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:32:23,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:23,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:32:23,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:23,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:32:23,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:23,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 15:32:23,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:23,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 15:32:23,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:23,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:32:23,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:23,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 15:32:23,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:23,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 15:32:23,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:23,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 15:32:23,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:23,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 15:32:23,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:23,790 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 15:32:23,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:32:23,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355738038] [2022-07-21 15:32:23,790 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355738038] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:32:23,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:32:23,791 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:32:23,791 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601192686] [2022-07-21 15:32:23,791 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:32:23,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:32:23,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:32:23,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:32:23,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:32:23,792 INFO L87 Difference]: Start difference. First operand 3396 states and 4649 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-21 15:32:26,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:32:26,941 INFO L93 Difference]: Finished difference Result 3396 states and 4649 transitions. [2022-07-21 15:32:26,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:32:26,942 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 129 [2022-07-21 15:32:26,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:32:26,952 INFO L225 Difference]: With dead ends: 3396 [2022-07-21 15:32:26,952 INFO L226 Difference]: Without dead ends: 3394 [2022-07-21 15:32:26,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:32:26,955 INFO L413 NwaCegarLoop]: 2170 mSDtfsCounter, 4361 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2373 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4497 SdHoareTripleChecker+Valid, 3435 SdHoareTripleChecker+Invalid, 3927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1554 IncrementalHoareTripleChecker+Valid, 2373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:32:26,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4497 Valid, 3435 Invalid, 3927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1554 Valid, 2373 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-21 15:32:26,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3394 states. [2022-07-21 15:32:27,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3394 to 3394. [2022-07-21 15:32:27,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3394 states, 2482 states have (on average 1.3070104754230458) internal successors, (3244), 2533 states have internal predecessors, (3244), 680 states have call successors, (680), 217 states have call predecessors, (680), 216 states have return successors, (722), 663 states have call predecessors, (722), 678 states have call successors, (722) [2022-07-21 15:32:27,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3394 states to 3394 states and 4646 transitions. [2022-07-21 15:32:27,114 INFO L78 Accepts]: Start accepts. Automaton has 3394 states and 4646 transitions. Word has length 129 [2022-07-21 15:32:27,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:32:27,115 INFO L495 AbstractCegarLoop]: Abstraction has 3394 states and 4646 transitions. [2022-07-21 15:32:27,115 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-21 15:32:27,115 INFO L276 IsEmpty]: Start isEmpty. Operand 3394 states and 4646 transitions. [2022-07-21 15:32:27,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-21 15:32:27,117 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:32:27,117 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:32:27,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 15:32:27,117 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:32:27,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:32:27,118 INFO L85 PathProgramCache]: Analyzing trace with hash 796582475, now seen corresponding path program 1 times [2022-07-21 15:32:27,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:32:27,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205140325] [2022-07-21 15:32:27,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:32:27,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:32:27,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:27,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:32:27,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:27,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:32:27,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:27,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:32:27,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:27,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:32:27,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:27,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:32:27,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:27,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:32:27,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:27,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:32:27,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:27,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 15:32:27,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:27,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 15:32:27,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:27,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:32:27,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:27,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:32:27,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:27,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:32:27,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:27,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:32:27,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:27,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 15:32:27,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:27,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 15:32:27,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:27,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:32:27,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:27,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 15:32:27,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:27,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 15:32:27,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:27,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 15:32:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:27,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 15:32:27,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:27,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 15:32:27,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:27,451 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 15:32:27,451 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:32:27,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1205140325] [2022-07-21 15:32:27,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1205140325] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:32:27,454 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:32:27,454 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:32:27,454 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236897184] [2022-07-21 15:32:27,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:32:27,455 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:32:27,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:32:27,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:32:27,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:32:27,455 INFO L87 Difference]: Start difference. First operand 3394 states and 4646 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-21 15:32:30,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:32:30,810 INFO L93 Difference]: Finished difference Result 3394 states and 4646 transitions. [2022-07-21 15:32:30,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:32:30,811 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 135 [2022-07-21 15:32:30,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:32:30,821 INFO L225 Difference]: With dead ends: 3394 [2022-07-21 15:32:30,821 INFO L226 Difference]: Without dead ends: 3392 [2022-07-21 15:32:30,822 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:32:30,823 INFO L413 NwaCegarLoop]: 2168 mSDtfsCounter, 4355 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2371 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4490 SdHoareTripleChecker+Valid, 3433 SdHoareTripleChecker+Invalid, 3925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1554 IncrementalHoareTripleChecker+Valid, 2371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-21 15:32:30,823 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4490 Valid, 3433 Invalid, 3925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1554 Valid, 2371 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-21 15:32:30,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3392 states. [2022-07-21 15:32:30,946 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3392 to 3392. [2022-07-21 15:32:30,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3392 states, 2481 states have (on average 1.3063280935106811) internal successors, (3241), 2531 states have internal predecessors, (3241), 680 states have call successors, (680), 217 states have call predecessors, (680), 216 states have return successors, (722), 663 states have call predecessors, (722), 678 states have call successors, (722) [2022-07-21 15:32:30,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3392 states to 3392 states and 4643 transitions. [2022-07-21 15:32:30,962 INFO L78 Accepts]: Start accepts. Automaton has 3392 states and 4643 transitions. Word has length 135 [2022-07-21 15:32:30,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:32:30,963 INFO L495 AbstractCegarLoop]: Abstraction has 3392 states and 4643 transitions. [2022-07-21 15:32:30,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-21 15:32:30,963 INFO L276 IsEmpty]: Start isEmpty. Operand 3392 states and 4643 transitions. [2022-07-21 15:32:30,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-21 15:32:30,964 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:32:30,965 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:32:30,965 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-21 15:32:30,965 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:32:30,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:32:30,965 INFO L85 PathProgramCache]: Analyzing trace with hash -1589534682, now seen corresponding path program 1 times [2022-07-21 15:32:30,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:32:30,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [309596239] [2022-07-21 15:32:30,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:32:30,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:32:31,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:32:31,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:32:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:32:31,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:32:31,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:32:31,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:32:31,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:32:31,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 15:32:31,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 15:32:31,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:32:31,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:32:31,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:32:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:32:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 15:32:31,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 15:32:31,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:32:31,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 15:32:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 15:32:31,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 15:32:31,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 15:32:31,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 15:32:31,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-21 15:32:31,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:31,256 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 15:32:31,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:32:31,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [309596239] [2022-07-21 15:32:31,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [309596239] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:32:31,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:32:31,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:32:31,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680298704] [2022-07-21 15:32:31,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:32:31,258 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:32:31,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:32:31,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:32:31,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:32:31,259 INFO L87 Difference]: Start difference. First operand 3392 states and 4643 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-21 15:32:34,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:32:34,817 INFO L93 Difference]: Finished difference Result 3392 states and 4643 transitions. [2022-07-21 15:32:34,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:32:34,817 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 141 [2022-07-21 15:32:34,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:32:34,829 INFO L225 Difference]: With dead ends: 3392 [2022-07-21 15:32:34,829 INFO L226 Difference]: Without dead ends: 3390 [2022-07-21 15:32:34,832 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:32:34,833 INFO L413 NwaCegarLoop]: 2166 mSDtfsCounter, 4349 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2369 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4483 SdHoareTripleChecker+Valid, 3431 SdHoareTripleChecker+Invalid, 3923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1554 IncrementalHoareTripleChecker+Valid, 2369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-21 15:32:34,833 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4483 Valid, 3431 Invalid, 3923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1554 Valid, 2369 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-07-21 15:32:34,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3390 states. [2022-07-21 15:32:34,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3390 to 3390. [2022-07-21 15:32:34,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3390 states, 2480 states have (on average 1.3056451612903226) internal successors, (3238), 2529 states have internal predecessors, (3238), 680 states have call successors, (680), 217 states have call predecessors, (680), 216 states have return successors, (722), 663 states have call predecessors, (722), 678 states have call successors, (722) [2022-07-21 15:32:34,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3390 states to 3390 states and 4640 transitions. [2022-07-21 15:32:34,970 INFO L78 Accepts]: Start accepts. Automaton has 3390 states and 4640 transitions. Word has length 141 [2022-07-21 15:32:34,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:32:34,970 INFO L495 AbstractCegarLoop]: Abstraction has 3390 states and 4640 transitions. [2022-07-21 15:32:34,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-21 15:32:34,971 INFO L276 IsEmpty]: Start isEmpty. Operand 3390 states and 4640 transitions. [2022-07-21 15:32:34,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-21 15:32:34,972 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:32:34,973 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:32:34,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-21 15:32:34,973 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:32:34,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:32:34,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1464303862, now seen corresponding path program 1 times [2022-07-21 15:32:34,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:32:34,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071579008] [2022-07-21 15:32:34,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:32:34,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:32:35,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:35,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:32:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:35,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:32:35,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:35,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:32:35,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:35,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:32:35,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:35,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:32:35,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:35,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:32:35,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:35,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:32:35,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:35,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 15:32:35,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:35,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 15:32:35,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:35,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:32:35,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:35,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:32:35,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:35,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:32:35,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:35,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:32:35,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:35,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 15:32:35,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:35,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 15:32:35,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:35,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:32:35,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:35,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 15:32:35,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:35,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 15:32:35,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:35,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 15:32:35,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:35,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 15:32:35,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:35,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 15:32:35,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:35,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-21 15:32:35,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:35,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:32:35,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:35,277 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 15:32:35,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:32:35,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071579008] [2022-07-21 15:32:35,277 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071579008] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:32:35,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:32:35,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:32:35,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771842580] [2022-07-21 15:32:35,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:32:35,279 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:32:35,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:32:35,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:32:35,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:32:35,280 INFO L87 Difference]: Start difference. First operand 3390 states and 4640 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-21 15:32:38,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:32:38,670 INFO L93 Difference]: Finished difference Result 3390 states and 4640 transitions. [2022-07-21 15:32:38,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:32:38,671 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 147 [2022-07-21 15:32:38,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:32:38,684 INFO L225 Difference]: With dead ends: 3390 [2022-07-21 15:32:38,684 INFO L226 Difference]: Without dead ends: 3388 [2022-07-21 15:32:38,687 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:32:38,688 INFO L413 NwaCegarLoop]: 2164 mSDtfsCounter, 4343 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2367 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4476 SdHoareTripleChecker+Valid, 3429 SdHoareTripleChecker+Invalid, 3921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1554 IncrementalHoareTripleChecker+Valid, 2367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-21 15:32:38,688 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4476 Valid, 3429 Invalid, 3921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1554 Valid, 2367 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-21 15:32:38,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3388 states. [2022-07-21 15:32:38,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3388 to 3388. [2022-07-21 15:32:38,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3388 states, 2479 states have (on average 1.3049616780960065) internal successors, (3235), 2527 states have internal predecessors, (3235), 680 states have call successors, (680), 217 states have call predecessors, (680), 216 states have return successors, (722), 663 states have call predecessors, (722), 678 states have call successors, (722) [2022-07-21 15:32:38,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3388 states to 3388 states and 4637 transitions. [2022-07-21 15:32:38,894 INFO L78 Accepts]: Start accepts. Automaton has 3388 states and 4637 transitions. Word has length 147 [2022-07-21 15:32:38,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:32:38,895 INFO L495 AbstractCegarLoop]: Abstraction has 3388 states and 4637 transitions. [2022-07-21 15:32:38,895 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-21 15:32:38,895 INFO L276 IsEmpty]: Start isEmpty. Operand 3388 states and 4637 transitions. [2022-07-21 15:32:38,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-21 15:32:38,897 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:32:38,897 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:32:38,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-21 15:32:38,898 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:32:38,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:32:38,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1160454884, now seen corresponding path program 1 times [2022-07-21 15:32:38,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:32:38,899 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2022000383] [2022-07-21 15:32:38,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:32:38,899 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:32:38,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:39,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:32:39,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:39,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:32:39,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:39,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:32:39,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:39,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:32:39,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:39,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:32:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:39,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:32:39,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:39,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:32:39,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:39,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 15:32:39,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:39,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 15:32:39,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:39,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:32:39,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:39,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:32:39,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:39,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:32:39,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:39,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:32:39,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:39,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 15:32:39,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:39,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 15:32:39,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:39,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:32:39,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:39,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 15:32:39,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:39,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 15:32:39,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:39,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 15:32:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:39,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 15:32:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:39,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 15:32:39,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:39,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-21 15:32:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:39,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:32:39,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:39,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-21 15:32:39,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:39,246 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 15:32:39,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:32:39,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2022000383] [2022-07-21 15:32:39,247 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2022000383] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:32:39,247 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:32:39,247 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:32:39,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512978117] [2022-07-21 15:32:39,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:32:39,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:32:39,250 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:32:39,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:32:39,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:32:39,251 INFO L87 Difference]: Start difference. First operand 3388 states and 4637 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-21 15:32:45,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:32:45,920 INFO L93 Difference]: Finished difference Result 6689 states and 9291 transitions. [2022-07-21 15:32:45,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 15:32:45,921 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 153 [2022-07-21 15:32:45,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:32:45,951 INFO L225 Difference]: With dead ends: 6689 [2022-07-21 15:32:45,952 INFO L226 Difference]: Without dead ends: 6687 [2022-07-21 15:32:45,958 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-21 15:32:45,959 INFO L413 NwaCegarLoop]: 2433 mSDtfsCounter, 6609 mSDsluCounter, 1709 mSDsCounter, 0 mSdLazyCounter, 5131 mSolverCounterSat, 2643 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6727 SdHoareTripleChecker+Valid, 4142 SdHoareTripleChecker+Invalid, 7774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2643 IncrementalHoareTripleChecker+Valid, 5131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-07-21 15:32:45,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6727 Valid, 4142 Invalid, 7774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2643 Valid, 5131 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-07-21 15:32:45,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6687 states. [2022-07-21 15:32:46,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6687 to 6590. [2022-07-21 15:32:46,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6590 states, 4857 states have (on average 1.3094502779493515) internal successors, (6360), 4941 states have internal predecessors, (6360), 1301 states have call successors, (1301), 420 states have call predecessors, (1301), 419 states have return successors, (1537), 1268 states have call predecessors, (1537), 1299 states have call successors, (1537) [2022-07-21 15:32:46,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6590 states to 6590 states and 9198 transitions. [2022-07-21 15:32:46,366 INFO L78 Accepts]: Start accepts. Automaton has 6590 states and 9198 transitions. Word has length 153 [2022-07-21 15:32:46,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:32:46,367 INFO L495 AbstractCegarLoop]: Abstraction has 6590 states and 9198 transitions. [2022-07-21 15:32:46,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-21 15:32:46,368 INFO L276 IsEmpty]: Start isEmpty. Operand 6590 states and 9198 transitions. [2022-07-21 15:32:46,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-07-21 15:32:46,370 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:32:46,370 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:32:46,370 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-21 15:32:46,371 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:32:46,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:32:46,371 INFO L85 PathProgramCache]: Analyzing trace with hash -1625234295, now seen corresponding path program 1 times [2022-07-21 15:32:46,371 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:32:46,372 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244576958] [2022-07-21 15:32:46,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:32:46,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:32:46,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:46,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:32:46,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:46,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:32:46,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:46,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:32:46,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:46,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:32:46,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:46,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:32:46,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:46,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:32:46,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:46,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:32:46,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:46,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 15:32:46,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:46,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 15:32:46,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:46,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:32:46,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:46,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:32:46,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:46,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:32:46,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:46,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:32:46,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:46,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 15:32:46,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:46,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 15:32:46,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:46,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:32:46,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:46,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 15:32:46,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:46,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 15:32:46,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:46,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 15:32:46,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:46,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 15:32:46,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:46,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 15:32:46,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:46,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-21 15:32:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:46,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:32:46,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:46,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-21 15:32:46,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:46,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-21 15:32:46,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:46,694 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 15:32:46,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:32:46,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244576958] [2022-07-21 15:32:46,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [244576958] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:32:46,694 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:32:46,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:32:46,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214470056] [2022-07-21 15:32:46,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:32:46,695 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:32:46,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:32:46,696 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:32:46,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:32:46,696 INFO L87 Difference]: Start difference. First operand 6590 states and 9198 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-21 15:32:50,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:32:50,164 INFO L93 Difference]: Finished difference Result 6590 states and 9198 transitions. [2022-07-21 15:32:50,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:32:50,165 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 159 [2022-07-21 15:32:50,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:32:50,188 INFO L225 Difference]: With dead ends: 6590 [2022-07-21 15:32:50,188 INFO L226 Difference]: Without dead ends: 6588 [2022-07-21 15:32:50,194 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:32:50,194 INFO L413 NwaCegarLoop]: 2162 mSDtfsCounter, 4337 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2365 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4468 SdHoareTripleChecker+Valid, 3427 SdHoareTripleChecker+Invalid, 3919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1554 IncrementalHoareTripleChecker+Valid, 2365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-21 15:32:50,195 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4468 Valid, 3427 Invalid, 3919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1554 Valid, 2365 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-21 15:32:50,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6588 states. [2022-07-21 15:32:50,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6588 to 6588. [2022-07-21 15:32:50,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6588 states, 4856 states have (on average 1.3091021416803954) internal successors, (6357), 4939 states have internal predecessors, (6357), 1301 states have call successors, (1301), 420 states have call predecessors, (1301), 419 states have return successors, (1537), 1268 states have call predecessors, (1537), 1299 states have call successors, (1537) [2022-07-21 15:32:50,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6588 states to 6588 states and 9195 transitions. [2022-07-21 15:32:50,561 INFO L78 Accepts]: Start accepts. Automaton has 6588 states and 9195 transitions. Word has length 159 [2022-07-21 15:32:50,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:32:50,561 INFO L495 AbstractCegarLoop]: Abstraction has 6588 states and 9195 transitions. [2022-07-21 15:32:50,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-21 15:32:50,562 INFO L276 IsEmpty]: Start isEmpty. Operand 6588 states and 9195 transitions. [2022-07-21 15:32:50,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-07-21 15:32:50,564 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:32:50,564 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 15:32:50,564 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-21 15:32:50,564 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_usb_urb_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:32:50,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:32:50,565 INFO L85 PathProgramCache]: Analyzing trace with hash 889461959, now seen corresponding path program 1 times [2022-07-21 15:32:50,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:32:50,565 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701957712] [2022-07-21 15:32:50,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:32:50,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:32:50,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:32:50,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:32:50,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:32:50,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:32:50,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:32:50,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:32:50,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:32:50,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-21 15:32:50,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 15:32:50,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:32:50,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:32:50,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:32:50,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:32:50,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 15:32:50,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 15:32:50,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:32:50,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 15:32:50,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-21 15:32:50,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 15:32:50,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 15:32:50,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 15:32:50,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-21 15:32:50,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:32:50,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-21 15:32:50,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-21 15:32:50,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-21 15:32:50,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:50,909 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-21 15:32:50,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:32:50,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701957712] [2022-07-21 15:32:50,910 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701957712] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:32:50,910 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:32:50,910 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:32:50,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031172613] [2022-07-21 15:32:50,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:32:50,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:32:50,913 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:32:50,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:32:50,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:32:50,914 INFO L87 Difference]: Start difference. First operand 6588 states and 9195 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-21 15:32:57,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:32:57,511 INFO L93 Difference]: Finished difference Result 13089 states and 18697 transitions. [2022-07-21 15:32:57,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 15:32:57,512 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 165 [2022-07-21 15:32:57,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:32:57,569 INFO L225 Difference]: With dead ends: 13089 [2022-07-21 15:32:57,569 INFO L226 Difference]: Without dead ends: 12840 [2022-07-21 15:32:57,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-21 15:32:57,583 INFO L413 NwaCegarLoop]: 2435 mSDtfsCounter, 6588 mSDsluCounter, 1709 mSDsCounter, 0 mSdLazyCounter, 5132 mSolverCounterSat, 2642 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6704 SdHoareTripleChecker+Valid, 4144 SdHoareTripleChecker+Invalid, 7774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2642 IncrementalHoareTripleChecker+Valid, 5132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:32:57,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6704 Valid, 4144 Invalid, 7774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2642 Valid, 5132 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2022-07-21 15:32:57,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12840 states. [2022-07-21 15:32:58,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12840 to 12750. [2022-07-21 15:32:58,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12750 states, 9471 states have (on average 1.3155949741315596) internal successors, (12460), 9622 states have internal predecessors, (12460), 2472 states have call successors, (2472), 798 states have call predecessors, (2472), 795 states have return successors, (3385), 2409 states have call predecessors, (3385), 2469 states have call successors, (3385) [2022-07-21 15:32:58,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12750 states to 12750 states and 18317 transitions. [2022-07-21 15:32:58,447 INFO L78 Accepts]: Start accepts. Automaton has 12750 states and 18317 transitions. Word has length 165 [2022-07-21 15:32:58,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:32:58,447 INFO L495 AbstractCegarLoop]: Abstraction has 12750 states and 18317 transitions. [2022-07-21 15:32:58,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-21 15:32:58,452 INFO L276 IsEmpty]: Start isEmpty. Operand 12750 states and 18317 transitions. [2022-07-21 15:32:58,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2022-07-21 15:32:58,458 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:32:58,459 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 41, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 15:32:58,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-21 15:32:58,459 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_kernel_module_module_putErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:32:58,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:32:58,460 INFO L85 PathProgramCache]: Analyzing trace with hash 580643187, now seen corresponding path program 1 times [2022-07-21 15:32:58,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:32:58,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580332179] [2022-07-21 15:32:58,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:32:58,460 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:32:58,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:32:58,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:32:58,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:32:58,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:32:58,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:32:58,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:32:58,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:32:58,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:32:58,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 15:32:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:32:58,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:32:58,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:32:58,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 15:32:58,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:32:58,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:32:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:32:58,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:32:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:32:58,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:32:58,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:32:58,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 15:32:58,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:32:58,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:32:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:32:58,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-21 15:32:58,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:32:58,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:58,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:32:58,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:32:59,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-21 15:32:59,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:32:59,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:32:59,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:32:59,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-21 15:32:59,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:32:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:32:59,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:32:59,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-21 15:32:59,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:32:59,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:32:59,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:32:59,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-21 15:32:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:32:59,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:32:59,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:32:59,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-21 15:32:59,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:32:59,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:32:59,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:32:59,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-21 15:32:59,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:32:59,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:32:59,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:32:59,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-21 15:32:59,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:32:59,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:32:59,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:32:59,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2022-07-21 15:32:59,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:32:59,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:32:59,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:32:59,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2022-07-21 15:32:59,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:32:59,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:32:59,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:32:59,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2022-07-21 15:32:59,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:32:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:32:59,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:32:59,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2022-07-21 15:32:59,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:32:59,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:32:59,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:32:59,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2022-07-21 15:32:59,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:32:59,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:32:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:32:59,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 407 [2022-07-21 15:32:59,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:32:59,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:32:59,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:32:59,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 428 [2022-07-21 15:32:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:32:59,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:32:59,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:32:59,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 449 [2022-07-21 15:32:59,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 457 [2022-07-21 15:32:59,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:32:59,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:32:59,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 15:32:59,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:32:59,426 INFO L134 CoverageAnalysis]: Checked inductivity of 5179 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5179 trivial. 0 not checked. [2022-07-21 15:32:59,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:32:59,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580332179] [2022-07-21 15:32:59,427 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580332179] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:32:59,427 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:32:59,427 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:32:59,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32515812] [2022-07-21 15:32:59,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:32:59,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:32:59,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:32:59,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:32:59,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:32:59,429 INFO L87 Difference]: Start difference. First operand 12750 states and 18317 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (37), 5 states have call predecessors, (37), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2022-07-21 15:33:04,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:33:04,659 INFO L93 Difference]: Finished difference Result 28663 states and 43712 transitions. [2022-07-21 15:33:04,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 15:33:04,661 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (37), 5 states have call predecessors, (37), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 494 [2022-07-21 15:33:04,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:33:04,746 INFO L225 Difference]: With dead ends: 28663 [2022-07-21 15:33:04,746 INFO L226 Difference]: Without dead ends: 15978 [2022-07-21 15:33:04,861 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-21 15:33:04,862 INFO L413 NwaCegarLoop]: 2125 mSDtfsCounter, 4305 mSDsluCounter, 1591 mSDsCounter, 0 mSdLazyCounter, 3545 mSolverCounterSat, 2015 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4305 SdHoareTripleChecker+Valid, 3716 SdHoareTripleChecker+Invalid, 5560 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2015 IncrementalHoareTripleChecker+Valid, 3545 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-21 15:33:04,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4305 Valid, 3716 Invalid, 5560 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2015 Valid, 3545 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-07-21 15:33:04,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15978 states. [2022-07-21 15:33:05,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15978 to 14287. [2022-07-21 15:33:05,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14287 states, 10697 states have (on average 1.3190614190894643) internal successors, (14110), 10852 states have internal predecessors, (14110), 2697 states have call successors, (2697), 798 states have call predecessors, (2697), 881 states have return successors, (4216), 2724 states have call predecessors, (4216), 2694 states have call successors, (4216) [2022-07-21 15:33:05,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14287 states to 14287 states and 21023 transitions. [2022-07-21 15:33:05,883 INFO L78 Accepts]: Start accepts. Automaton has 14287 states and 21023 transitions. Word has length 494 [2022-07-21 15:33:05,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:33:05,884 INFO L495 AbstractCegarLoop]: Abstraction has 14287 states and 21023 transitions. [2022-07-21 15:33:05,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (37), 5 states have call predecessors, (37), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2022-07-21 15:33:05,884 INFO L276 IsEmpty]: Start isEmpty. Operand 14287 states and 21023 transitions. [2022-07-21 15:33:05,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2022-07-21 15:33:05,891 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:33:05,891 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 41, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 15:33:05,892 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-21 15:33:05,892 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_linux_kernel_module_module_putErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:33:05,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:33:05,893 INFO L85 PathProgramCache]: Analyzing trace with hash -99415183, now seen corresponding path program 1 times [2022-07-21 15:33:05,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:33:05,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819408930] [2022-07-21 15:33:05,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:33:05,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:33:06,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:33:06,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:06,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:33:06,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:33:06,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:06,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:33:06,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:33:06,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:33:06,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 15:33:06,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:06,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:06,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:06,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 15:33:06,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:06,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:06,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:33:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:06,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 15:33:06,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:06,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:06,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-21 15:33:06,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:06,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:06,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:06,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-21 15:33:06,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:06,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-21 15:33:06,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:06,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:06,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:06,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-21 15:33:06,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:06,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:06,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:06,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-21 15:33:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:06,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:06,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:06,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-21 15:33:06,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:06,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:06,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-21 15:33:06,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:06,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:06,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:06,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-21 15:33:06,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:06,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:06,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:06,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2022-07-21 15:33:06,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:06,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:06,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:06,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2022-07-21 15:33:06,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:06,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:06,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:06,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2022-07-21 15:33:06,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:06,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:06,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:06,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2022-07-21 15:33:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:06,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:06,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:07,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:07,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2022-07-21 15:33:07,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:07,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:07,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 407 [2022-07-21 15:33:07,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:07,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:07,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 428 [2022-07-21 15:33:07,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:07,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:07,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:07,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 449 [2022-07-21 15:33:07,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 457 [2022-07-21 15:33:07,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:07,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:07,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 15:33:07,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:07,122 INFO L134 CoverageAnalysis]: Checked inductivity of 5179 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5179 trivial. 0 not checked. [2022-07-21 15:33:07,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:33:07,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819408930] [2022-07-21 15:33:07,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819408930] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:33:07,122 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:33:07,122 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 15:33:07,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660642637] [2022-07-21 15:33:07,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:33:07,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 15:33:07,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:33:07,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 15:33:07,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 15:33:07,125 INFO L87 Difference]: Start difference. First operand 14287 states and 21023 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (37), 5 states have call predecessors, (37), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2022-07-21 15:33:15,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:33:15,508 INFO L93 Difference]: Finished difference Result 30184 states and 46362 transitions. [2022-07-21 15:33:15,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 15:33:15,509 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (37), 5 states have call predecessors, (37), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 494 [2022-07-21 15:33:15,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:33:15,566 INFO L225 Difference]: With dead ends: 30184 [2022-07-21 15:33:15,567 INFO L226 Difference]: Without dead ends: 15962 [2022-07-21 15:33:15,626 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=261, Unknown=0, NotChecked=0, Total=380 [2022-07-21 15:33:15,627 INFO L413 NwaCegarLoop]: 2125 mSDtfsCounter, 4354 mSDsluCounter, 2597 mSDsCounter, 0 mSdLazyCounter, 7389 mSolverCounterSat, 2024 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4354 SdHoareTripleChecker+Valid, 4722 SdHoareTripleChecker+Invalid, 9413 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2024 IncrementalHoareTripleChecker+Valid, 7389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2022-07-21 15:33:15,627 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4354 Valid, 4722 Invalid, 9413 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2024 Valid, 7389 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2022-07-21 15:33:15,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15962 states. [2022-07-21 15:33:16,431 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15962 to 14287. [2022-07-21 15:33:16,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14287 states, 10697 states have (on average 1.3179396092362345) internal successors, (14098), 10856 states have internal predecessors, (14098), 2693 states have call successors, (2693), 798 states have call predecessors, (2693), 885 states have return successors, (4216), 2720 states have call predecessors, (4216), 2690 states have call successors, (4216) [2022-07-21 15:33:16,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14287 states to 14287 states and 21007 transitions. [2022-07-21 15:33:16,630 INFO L78 Accepts]: Start accepts. Automaton has 14287 states and 21007 transitions. Word has length 494 [2022-07-21 15:33:16,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:33:16,631 INFO L495 AbstractCegarLoop]: Abstraction has 14287 states and 21007 transitions. [2022-07-21 15:33:16,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (37), 5 states have call predecessors, (37), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2022-07-21 15:33:16,631 INFO L276 IsEmpty]: Start isEmpty. Operand 14287 states and 21007 transitions. [2022-07-21 15:33:16,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2022-07-21 15:33:16,637 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:33:16,638 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 41, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-21 15:33:16,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-21 15:33:16,638 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_linux_kernel_module_module_putErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:33:16,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:33:16,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1258511913, now seen corresponding path program 1 times [2022-07-21 15:33:16,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:33:16,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416036807] [2022-07-21 15:33:16,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:33:16,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:33:16,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:16,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:33:16,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:16,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:16,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:16,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:33:16,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:16,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:33:16,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:16,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:16,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:16,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:33:16,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:16,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:33:16,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:16,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:33:16,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:16,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 15:33:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:16,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:16,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:16,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:16,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:16,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:16,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:16,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 15:33:16,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:16,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:17,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:33:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:17,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:17,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 15:33:17,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:17,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:17,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-21 15:33:17,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:17,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:17,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-21 15:33:17,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:17,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:17,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:17,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-21 15:33:17,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:17,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:17,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:17,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-21 15:33:17,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:17,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:17,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:17,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-21 15:33:17,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:17,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:17,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:17,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-21 15:33:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:17,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:17,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:17,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-21 15:33:17,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:17,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:17,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:17,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-21 15:33:17,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:17,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:17,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:17,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2022-07-21 15:33:17,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:17,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:17,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:17,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2022-07-21 15:33:17,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:17,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:17,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:17,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2022-07-21 15:33:17,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:17,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:17,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2022-07-21 15:33:17,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:17,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:17,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2022-07-21 15:33:17,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:17,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:17,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:17,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 407 [2022-07-21 15:33:17,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:17,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:17,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 428 [2022-07-21 15:33:17,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:17,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:17,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:17,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 449 [2022-07-21 15:33:17,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 457 [2022-07-21 15:33:17,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:17,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:17,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 15:33:17,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 483 [2022-07-21 15:33:17,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:17,470 INFO L134 CoverageAnalysis]: Checked inductivity of 5191 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5191 trivial. 0 not checked. [2022-07-21 15:33:17,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:33:17,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416036807] [2022-07-21 15:33:17,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416036807] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:33:17,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:33:17,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 15:33:17,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756454522] [2022-07-21 15:33:17,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:33:17,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 15:33:17,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:33:17,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 15:33:17,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 15:33:17,473 INFO L87 Difference]: Start difference. First operand 14287 states and 21007 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (38), 6 states have call predecessors, (38), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-07-21 15:33:34,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:33:34,894 INFO L93 Difference]: Finished difference Result 24293 states and 37234 transitions. [2022-07-21 15:33:34,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 15:33:34,894 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (38), 6 states have call predecessors, (38), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 500 [2022-07-21 15:33:34,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:33:34,976 INFO L225 Difference]: With dead ends: 24293 [2022-07-21 15:33:34,976 INFO L226 Difference]: Without dead ends: 24291 [2022-07-21 15:33:34,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 185 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-07-21 15:33:34,987 INFO L413 NwaCegarLoop]: 4483 mSDtfsCounter, 13112 mSDsluCounter, 4164 mSDsCounter, 0 mSdLazyCounter, 15318 mSolverCounterSat, 6364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13321 SdHoareTripleChecker+Valid, 8647 SdHoareTripleChecker+Invalid, 21682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6364 IncrementalHoareTripleChecker+Valid, 15318 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:33:34,987 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13321 Valid, 8647 Invalid, 21682 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6364 Valid, 15318 Invalid, 0 Unknown, 0 Unchecked, 16.0s Time] [2022-07-21 15:33:35,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24291 states. [2022-07-21 15:33:36,076 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24291 to 21695. [2022-07-21 15:33:36,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21695 states, 16257 states have (on average 1.322630251583933) internal successors, (21502), 16504 states have internal predecessors, (21502), 4109 states have call successors, (4109), 1150 states have call predecessors, (4109), 1317 states have return successors, (7202), 4184 states have call predecessors, (7202), 4106 states have call successors, (7202) [2022-07-21 15:33:36,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21695 states to 21695 states and 32813 transitions. [2022-07-21 15:33:36,245 INFO L78 Accepts]: Start accepts. Automaton has 21695 states and 32813 transitions. Word has length 500 [2022-07-21 15:33:36,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:33:36,245 INFO L495 AbstractCegarLoop]: Abstraction has 21695 states and 32813 transitions. [2022-07-21 15:33:36,245 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (38), 6 states have call predecessors, (38), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-07-21 15:33:36,246 INFO L276 IsEmpty]: Start isEmpty. Operand 21695 states and 32813 transitions. [2022-07-21 15:33:36,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2022-07-21 15:33:36,259 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:33:36,260 INFO L195 NwaCegarLoop]: trace histogram [43, 43, 43, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:33:36,260 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-21 15:33:36,260 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:33:36,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:33:36,260 INFO L85 PathProgramCache]: Analyzing trace with hash 2091765019, now seen corresponding path program 1 times [2022-07-21 15:33:36,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:33:36,261 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [184465740] [2022-07-21 15:33:36,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:33:36,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:33:36,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:33:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:36,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:33:36,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:33:36,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:36,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:33:36,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:33:36,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:33:36,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 15:33:36,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:36,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:36,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 15:33:36,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:36,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:36,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:36,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:33:36,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:36,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:36,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 15:33:36,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:36,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:36,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:36,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-21 15:33:36,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:36,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:36,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:36,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-21 15:33:36,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:36,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:36,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-21 15:33:36,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:36,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:36,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:36,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-21 15:33:36,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:36,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:36,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:36,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-21 15:33:36,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:36,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:36,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-21 15:33:36,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:36,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:36,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:36,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-21 15:33:36,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:36,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:36,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:36,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-21 15:33:36,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:36,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:36,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:36,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2022-07-21 15:33:36,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:36,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:36,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:36,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2022-07-21 15:33:36,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:36,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2022-07-21 15:33:36,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:36,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:36,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:36,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2022-07-21 15:33:36,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:36,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:36,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2022-07-21 15:33:36,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:36,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:36,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:36,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:37,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 407 [2022-07-21 15:33:37,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:37,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:37,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:37,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:37,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:37,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:37,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 428 [2022-07-21 15:33:37,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:37,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:37,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:37,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:37,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:37,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:37,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 449 [2022-07-21 15:33:37,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:37,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 455 [2022-07-21 15:33:37,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:37,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:37,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:37,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:37,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:37,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:37,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:37,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 15:33:37,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:37,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 491 [2022-07-21 15:33:37,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:37,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:37,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:37,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 503 [2022-07-21 15:33:37,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:37,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 509 [2022-07-21 15:33:37,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:37,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 514 [2022-07-21 15:33:37,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:37,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 526 [2022-07-21 15:33:37,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:37,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:37,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:37,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:37,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:37,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 15:33:37,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:37,155 INFO L134 CoverageAnalysis]: Checked inductivity of 5579 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5579 trivial. 0 not checked. [2022-07-21 15:33:37,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:33:37,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [184465740] [2022-07-21 15:33:37,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [184465740] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:33:37,156 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:33:37,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 15:33:37,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [943462220] [2022-07-21 15:33:37,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:33:37,157 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 15:33:37,157 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:33:37,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 15:33:37,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-21 15:33:37,158 INFO L87 Difference]: Start difference. First operand 21695 states and 32813 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (44), 7 states have call predecessors, (44), 1 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2022-07-21 15:33:53,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:33:53,854 INFO L93 Difference]: Finished difference Result 46997 states and 78942 transitions. [2022-07-21 15:33:53,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 15:33:53,855 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (44), 7 states have call predecessors, (44), 1 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) Word has length 556 [2022-07-21 15:33:53,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:33:54,011 INFO L225 Difference]: With dead ends: 46997 [2022-07-21 15:33:54,011 INFO L226 Difference]: Without dead ends: 46995 [2022-07-21 15:33:54,029 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2022-07-21 15:33:54,029 INFO L413 NwaCegarLoop]: 3383 mSDtfsCounter, 7871 mSDsluCounter, 3297 mSDsCounter, 0 mSdLazyCounter, 13924 mSolverCounterSat, 4320 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7970 SdHoareTripleChecker+Valid, 6680 SdHoareTripleChecker+Invalid, 18244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4320 IncrementalHoareTripleChecker+Valid, 13924 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:33:54,030 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7970 Valid, 6680 Invalid, 18244 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4320 Valid, 13924 Invalid, 0 Unknown, 0 Unchecked, 14.0s Time] [2022-07-21 15:33:54,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46995 states. [2022-07-21 15:33:56,546 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46995 to 43311. [2022-07-21 15:33:56,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43311 states, 32449 states have (on average 1.3261117445838084) internal successors, (43031), 33060 states have internal predecessors, (43031), 8222 states have call successors, (8222), 2218 states have call predecessors, (8222), 2628 states have return successors, (19732), 8336 states have call predecessors, (19732), 8219 states have call successors, (19732) [2022-07-21 15:33:56,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43311 states to 43311 states and 70985 transitions. [2022-07-21 15:33:56,913 INFO L78 Accepts]: Start accepts. Automaton has 43311 states and 70985 transitions. Word has length 556 [2022-07-21 15:33:56,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:33:56,914 INFO L495 AbstractCegarLoop]: Abstraction has 43311 states and 70985 transitions. [2022-07-21 15:33:56,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (44), 7 states have call predecessors, (44), 1 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2022-07-21 15:33:56,914 INFO L276 IsEmpty]: Start isEmpty. Operand 43311 states and 70985 transitions. [2022-07-21 15:33:56,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 578 [2022-07-21 15:33:56,922 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:33:56,922 INFO L195 NwaCegarLoop]: trace histogram [43, 43, 43, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 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-21 15:33:56,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-21 15:33:56,923 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:33:56,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:33:56,923 INFO L85 PathProgramCache]: Analyzing trace with hash 1788279544, now seen corresponding path program 1 times [2022-07-21 15:33:56,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:33:56,923 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895121169] [2022-07-21 15:33:56,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:33:56,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:33:57,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:33:57,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:57,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:33:57,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:33:57,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:57,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:33:57,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:33:57,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:33:57,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 15:33:57,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:57,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:57,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:57,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 15:33:57,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:57,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:57,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:57,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:33:57,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:57,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:57,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:57,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 15:33:57,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:57,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:57,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:57,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-21 15:33:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:57,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:57,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:57,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-21 15:33:57,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:57,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:57,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-21 15:33:57,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:57,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:57,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-21 15:33:57,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:57,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:57,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:57,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-21 15:33:57,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:57,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:57,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-21 15:33:57,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:57,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:57,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:57,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-21 15:33:57,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:58,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:58,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:58,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-21 15:33:58,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:58,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:58,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2022-07-21 15:33:58,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:58,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:58,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:58,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2022-07-21 15:33:58,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:58,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:58,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:58,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2022-07-21 15:33:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:58,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:58,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:58,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2022-07-21 15:33:58,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:58,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:58,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:58,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2022-07-21 15:33:58,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:58,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:58,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:58,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 407 [2022-07-21 15:33:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:58,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:58,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:58,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 428 [2022-07-21 15:33:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:58,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:58,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:33:58,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 449 [2022-07-21 15:33:58,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 455 [2022-07-21 15:33:58,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:58,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:58,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:58,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 15:33:58,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 491 [2022-07-21 15:33:58,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:58,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 503 [2022-07-21 15:33:58,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 509 [2022-07-21 15:33:58,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 514 [2022-07-21 15:33:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 527 [2022-07-21 15:33:58,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:58,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 15:33:58,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 551 [2022-07-21 15:33:58,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:33:58,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:33:58,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:33:58,283 INFO L134 CoverageAnalysis]: Checked inductivity of 5600 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5600 trivial. 0 not checked. [2022-07-21 15:33:58,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:33:58,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895121169] [2022-07-21 15:33:58,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895121169] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:33:58,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:33:58,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 15:33:58,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [594616876] [2022-07-21 15:33:58,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:33:58,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 15:33:58,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:33:58,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 15:33:58,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:33:58,286 INFO L87 Difference]: Start difference. First operand 43311 states and 70985 transitions. Second operand has 10 states, 10 states have (on average 10.7) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (47), 8 states have call predecessors, (47), 2 states have return successors, (44), 2 states have call predecessors, (44), 1 states have call successors, (44) [2022-07-21 15:34:18,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:34:18,009 INFO L93 Difference]: Finished difference Result 61361 states and 108159 transitions. [2022-07-21 15:34:18,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-21 15:34:18,009 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.7) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (47), 8 states have call predecessors, (47), 2 states have return successors, (44), 2 states have call predecessors, (44), 1 states have call successors, (44) Word has length 577 [2022-07-21 15:34:18,010 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:34:18,398 INFO L225 Difference]: With dead ends: 61361 [2022-07-21 15:34:18,398 INFO L226 Difference]: Without dead ends: 61359 [2022-07-21 15:34:18,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 207 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=196, Invalid=454, Unknown=0, NotChecked=0, Total=650 [2022-07-21 15:34:18,426 INFO L413 NwaCegarLoop]: 3501 mSDtfsCounter, 15430 mSDsluCounter, 4761 mSDsCounter, 0 mSdLazyCounter, 14705 mSolverCounterSat, 8481 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15537 SdHoareTripleChecker+Valid, 8262 SdHoareTripleChecker+Invalid, 23186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 8481 IncrementalHoareTripleChecker+Valid, 14705 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 16.1s IncrementalHoareTripleChecker+Time [2022-07-21 15:34:18,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15537 Valid, 8262 Invalid, 23186 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [8481 Valid, 14705 Invalid, 0 Unknown, 0 Unchecked, 16.1s Time] [2022-07-21 15:34:18,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61359 states. [2022-07-21 15:34:21,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61359 to 51554. [2022-07-21 15:34:21,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51554 states, 38807 states have (on average 1.328085139278996) internal successors, (51539), 39500 states have internal predecessors, (51539), 9442 states have call successors, (9442), 2230 states have call predecessors, (9442), 3293 states have return successors, (25435), 10175 states have call predecessors, (25435), 9439 states have call successors, (25435) [2022-07-21 15:34:22,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51554 states to 51554 states and 86416 transitions. [2022-07-21 15:34:22,096 INFO L78 Accepts]: Start accepts. Automaton has 51554 states and 86416 transitions. Word has length 577 [2022-07-21 15:34:22,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:34:22,096 INFO L495 AbstractCegarLoop]: Abstraction has 51554 states and 86416 transitions. [2022-07-21 15:34:22,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.7) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (47), 8 states have call predecessors, (47), 2 states have return successors, (44), 2 states have call predecessors, (44), 1 states have call successors, (44) [2022-07-21 15:34:22,096 INFO L276 IsEmpty]: Start isEmpty. Operand 51554 states and 86416 transitions. [2022-07-21 15:34:22,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2022-07-21 15:34:22,104 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:34:22,104 INFO L195 NwaCegarLoop]: trace histogram [43, 43, 43, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 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-21 15:34:22,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-21 15:34:22,104 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:34:22,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:34:22,105 INFO L85 PathProgramCache]: Analyzing trace with hash 147048227, now seen corresponding path program 1 times [2022-07-21 15:34:22,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:34:22,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252723093] [2022-07-21 15:34:22,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:34:22,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:34:22,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:34:22,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:34:22,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:34:22,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-21 15:34:22,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:34:22,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:34:22,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:34:22,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:34:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 15:34:22,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:34:22,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:34:22,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:34:22,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-21 15:34:22,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:34:22,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:34:22,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:34:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-21 15:34:22,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:34:22,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:34:22,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:34:22,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-21 15:34:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:34:22,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:34:22,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:34:22,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-21 15:34:22,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:34:22,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:34:22,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:34:22,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-21 15:34:22,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:34:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:34:22,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:34:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-21 15:34:22,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:34:22,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:34:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:34:22,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-21 15:34:22,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:34:22,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:34:22,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:34:22,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-21 15:34:22,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:34:22,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:34:22,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:34:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-21 15:34:22,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:34:22,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:34:22,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:34:22,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-21 15:34:22,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:34:22,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:34:22,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:34:22,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-21 15:34:22,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:34:22,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:34:22,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:34:22,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2022-07-21 15:34:22,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:34:22,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:34:22,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:34:22,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2022-07-21 15:34:22,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:34:22,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:34:22,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:34:22,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2022-07-21 15:34:22,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:34:22,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:34:22,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:34:22,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2022-07-21 15:34:22,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:34:22,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:34:22,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:34:22,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2022-07-21 15:34:22,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:34:22,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:34:22,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:34:22,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 407 [2022-07-21 15:34:22,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:34:22,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:34:22,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:34:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 428 [2022-07-21 15:34:22,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:34:22,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:34:22,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:34:22,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 449 [2022-07-21 15:34:22,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 455 [2022-07-21 15:34:22,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:34:22,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:34:22,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:34:22,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 15:34:22,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 491 [2022-07-21 15:34:22,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:34:22,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 503 [2022-07-21 15:34:22,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 509 [2022-07-21 15:34:22,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 514 [2022-07-21 15:34:22,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 526 [2022-07-21 15:34:22,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:34:22,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:34:22,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-21 15:34:22,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 550 [2022-07-21 15:34:22,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:34:22,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:34:22,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:34:22,913 INFO L134 CoverageAnalysis]: Checked inductivity of 5600 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5600 trivial. 0 not checked. [2022-07-21 15:34:22,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:34:22,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252723093] [2022-07-21 15:34:22,913 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [252723093] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:34:22,913 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:34:22,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 15:34:22,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228189858] [2022-07-21 15:34:22,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:34:22,915 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 15:34:22,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:34:22,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 15:34:22,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-21 15:34:22,915 INFO L87 Difference]: Start difference. First operand 51554 states and 86416 transitions. Second operand has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (47), 7 states have call predecessors, (47), 2 states have return successors, (44), 2 states have call predecessors, (44), 1 states have call successors, (44) [2022-07-21 15:34:30,264 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-21 15:34:42,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:34:42,700 INFO L93 Difference]: Finished difference Result 116639 states and 218333 transitions. [2022-07-21 15:34:42,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-21 15:34:42,700 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.636363636363637) internal successors, (106), 5 states have internal predecessors, (106), 2 states have call successors, (47), 7 states have call predecessors, (47), 2 states have return successors, (44), 2 states have call predecessors, (44), 1 states have call successors, (44) Word has length 576 [2022-07-21 15:34:42,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:34:43,073 INFO L225 Difference]: With dead ends: 116639 [2022-07-21 15:34:43,073 INFO L226 Difference]: Without dead ends: 65150 [2022-07-21 15:34:43,872 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 204 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=195, Invalid=561, Unknown=0, NotChecked=0, Total=756 [2022-07-21 15:34:43,873 INFO L413 NwaCegarLoop]: 2392 mSDtfsCounter, 6729 mSDsluCounter, 3822 mSDsCounter, 0 mSdLazyCounter, 13866 mSolverCounterSat, 3514 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6729 SdHoareTripleChecker+Valid, 6214 SdHoareTripleChecker+Invalid, 17380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3514 IncrementalHoareTripleChecker+Valid, 13866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.5s IncrementalHoareTripleChecker+Time [2022-07-21 15:34:43,873 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6729 Valid, 6214 Invalid, 17380 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3514 Valid, 13866 Invalid, 0 Unknown, 0 Unchecked, 14.5s Time] [2022-07-21 15:34:43,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65150 states.