./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --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 87fc46113f1aa6bf5cd254bff58332904e2431653df647e3a9a61cd4104d8890 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:28:03,884 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:28:03,970 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-Reach-64bit-Automizer_Default.epf [2023-11-29 02:28:03,975 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:28:03,976 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:28:04,006 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:28:04,007 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:28:04,008 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:28:04,009 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:28:04,009 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:28:04,010 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:28:04,011 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:28:04,012 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:28:04,012 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:28:04,013 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:28:04,014 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:28:04,014 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-29 02:28:04,015 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:28:04,016 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:28:04,016 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-29 02:28:04,017 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:28:04,017 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-29 02:28:04,018 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-29 02:28:04,018 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:28:04,019 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:28:04,019 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:28:04,020 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:28:04,020 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:28:04,021 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:28:04,021 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:28:04,022 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:28:04,022 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-29 02:28:04,022 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 02:28:04,023 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 02:28:04,023 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:28:04,023 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:28:04,023 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-29 02:28:04,024 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:28:04,024 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:28:04,024 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> 87fc46113f1aa6bf5cd254bff58332904e2431653df647e3a9a61cd4104d8890 [2023-11-29 02:28:04,326 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:28:04,354 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:28:04,358 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:28:04,359 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:28:04,360 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:28:04,362 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i [2023-11-29 02:28:07,727 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:28:08,181 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:28:08,181 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i [2023-11-29 02:28:08,227 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya/data/c806cdc5b/3f811d317c9e458295489305ee173d86/FLAG84bb1a6e0 [2023-11-29 02:28:08,247 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya/data/c806cdc5b/3f811d317c9e458295489305ee173d86 [2023-11-29 02:28:08,250 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:28:08,252 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:28:08,254 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:28:08,254 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:28:08,261 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:28:08,262 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:28:08" (1/1) ... [2023-11-29 02:28:08,263 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28f62178 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:28:08, skipping insertion in model container [2023-11-29 02:28:08,263 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:28:08" (1/1) ... [2023-11-29 02:28:08,416 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:28:11,104 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[287816,287829] [2023-11-29 02:28:11,108 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[287961,287974] [2023-11-29 02:28:11,109 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[288107,288120] [2023-11-29 02:28:11,109 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[288272,288285] [2023-11-29 02:28:11,110 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[288430,288443] [2023-11-29 02:28:11,111 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[288588,288601] [2023-11-29 02:28:11,112 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[288746,288759] [2023-11-29 02:28:11,112 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[288906,288919] [2023-11-29 02:28:11,113 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[289065,289078] [2023-11-29 02:28:11,114 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[289204,289217] [2023-11-29 02:28:11,115 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[289346,289359] [2023-11-29 02:28:11,116 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[289495,289508] [2023-11-29 02:28:11,116 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[289634,289647] [2023-11-29 02:28:11,117 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[289789,289802] [2023-11-29 02:28:11,118 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[289949,289962] [2023-11-29 02:28:11,119 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[290100,290113] [2023-11-29 02:28:11,120 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[290251,290264] [2023-11-29 02:28:11,121 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[290403,290416] [2023-11-29 02:28:11,122 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[290552,290565] [2023-11-29 02:28:11,122 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[290700,290713] [2023-11-29 02:28:11,123 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[290857,290870] [2023-11-29 02:28:11,124 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[291006,291019] [2023-11-29 02:28:11,125 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[291162,291175] [2023-11-29 02:28:11,125 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[291315,291328] [2023-11-29 02:28:11,126 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[291461,291474] [2023-11-29 02:28:11,127 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[291604,291617] [2023-11-29 02:28:11,128 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[291756,291769] [2023-11-29 02:28:11,129 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[291902,291915] [2023-11-29 02:28:11,130 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[292047,292060] [2023-11-29 02:28:11,131 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[292201,292214] [2023-11-29 02:28:11,132 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[292352,292365] [2023-11-29 02:28:11,133 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[292507,292520] [2023-11-29 02:28:11,134 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[292659,292672] [2023-11-29 02:28:11,135 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[292814,292827] [2023-11-29 02:28:11,135 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[292978,292991] [2023-11-29 02:28:11,136 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[293134,293147] [2023-11-29 02:28:11,137 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[293298,293311] [2023-11-29 02:28:11,137 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[293440,293453] [2023-11-29 02:28:11,138 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[293598,293611] [2023-11-29 02:28:11,138 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[293765,293778] [2023-11-29 02:28:11,139 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[293924,293937] [2023-11-29 02:28:11,139 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[294083,294096] [2023-11-29 02:28:11,140 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[294232,294245] [2023-11-29 02:28:11,141 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[294379,294392] [2023-11-29 02:28:11,141 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[294518,294531] [2023-11-29 02:28:11,142 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[294681,294694] [2023-11-29 02:28:11,142 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[294847,294860] [2023-11-29 02:28:11,143 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[295011,295024] [2023-11-29 02:28:11,143 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[295176,295189] [2023-11-29 02:28:11,144 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[295341,295354] [2023-11-29 02:28:11,145 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[295507,295520] [2023-11-29 02:28:11,145 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[295672,295685] [2023-11-29 02:28:11,146 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[295839,295852] [2023-11-29 02:28:11,146 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[295999,296012] [2023-11-29 02:28:11,147 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[296161,296174] [2023-11-29 02:28:11,147 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[296320,296333] [2023-11-29 02:28:11,148 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[296466,296479] [2023-11-29 02:28:11,148 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[296609,296622] [2023-11-29 02:28:11,148 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[296753,296766] [2023-11-29 02:28:11,149 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[296896,296909] [2023-11-29 02:28:11,150 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[297040,297053] [2023-11-29 02:28:11,150 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[297181,297194] [2023-11-29 02:28:11,150 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[297319,297332] [2023-11-29 02:28:11,151 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[297477,297490] [2023-11-29 02:28:11,151 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[297636,297649] [2023-11-29 02:28:11,152 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[297792,297805] [2023-11-29 02:28:11,152 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[297941,297954] [2023-11-29 02:28:11,153 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[298093,298106] [2023-11-29 02:28:11,153 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[298244,298257] [2023-11-29 02:28:11,153 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[298393,298406] [2023-11-29 02:28:11,154 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[298545,298558] [2023-11-29 02:28:11,154 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[298693,298706] [2023-11-29 02:28:11,155 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[298846,298859] [2023-11-29 02:28:11,155 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[298997,299010] [2023-11-29 02:28:11,155 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[299147,299160] [2023-11-29 02:28:11,156 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[299294,299307] [2023-11-29 02:28:11,156 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[299445,299458] [2023-11-29 02:28:11,157 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[299596,299609] [2023-11-29 02:28:11,158 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[299744,299757] [2023-11-29 02:28:11,159 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[299910,299923] [2023-11-29 02:28:11,159 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[300079,300092] [2023-11-29 02:28:11,160 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[300246,300259] [2023-11-29 02:28:11,160 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[300414,300427] [2023-11-29 02:28:11,161 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[300564,300577] [2023-11-29 02:28:11,161 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[300711,300724] [2023-11-29 02:28:11,162 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[300872,300885] [2023-11-29 02:28:11,162 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[301042,301055] [2023-11-29 02:28:11,163 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[301204,301217] [2023-11-29 02:28:11,167 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:28:11,203 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:28:11,315 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ volatile ("bt %2,%1\n\tsbb %0,%0": "=r" (oldbit): "m" (*((unsigned long *)addr)), "Ir" (nr)); [4326-4327] [2023-11-29 02:28:11,319 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movb %%gs:%P1,%0": "=q" (pfo_ret__): "p" (& current_task)); [4388] [2023-11-29 02:28:11,319 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movw %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4391] [2023-11-29 02:28:11,319 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movl %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4394] [2023-11-29 02:28:11,319 WARN L75 lationResultReporter]: Unsoundness Warning: Ignoring inline assembler instruction C: __asm__ ("movq %%gs:%P1,%0": "=r" (pfo_ret__): "p" (& current_task)); [4397] [2023-11-29 02:28:11,484 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[287816,287829] [2023-11-29 02:28:11,484 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[287961,287974] [2023-11-29 02:28:11,485 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[288107,288120] [2023-11-29 02:28:11,485 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[288272,288285] [2023-11-29 02:28:11,486 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[288430,288443] [2023-11-29 02:28:11,486 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[288588,288601] [2023-11-29 02:28:11,487 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[288746,288759] [2023-11-29 02:28:11,487 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[288906,288919] [2023-11-29 02:28:11,488 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[289065,289078] [2023-11-29 02:28:11,488 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[289204,289217] [2023-11-29 02:28:11,489 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[289346,289359] [2023-11-29 02:28:11,489 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[289495,289508] [2023-11-29 02:28:11,490 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[289634,289647] [2023-11-29 02:28:11,491 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[289789,289802] [2023-11-29 02:28:11,491 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[289949,289962] [2023-11-29 02:28:11,492 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[290100,290113] [2023-11-29 02:28:11,493 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[290251,290264] [2023-11-29 02:28:11,493 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[290403,290416] [2023-11-29 02:28:11,494 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[290552,290565] [2023-11-29 02:28:11,494 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[290700,290713] [2023-11-29 02:28:11,495 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[290857,290870] [2023-11-29 02:28:11,495 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[291006,291019] [2023-11-29 02:28:11,496 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[291162,291175] [2023-11-29 02:28:11,496 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[291315,291328] [2023-11-29 02:28:11,497 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[291461,291474] [2023-11-29 02:28:11,497 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[291604,291617] [2023-11-29 02:28:11,498 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[291756,291769] [2023-11-29 02:28:11,498 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[291902,291915] [2023-11-29 02:28:11,499 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[292047,292060] [2023-11-29 02:28:11,499 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[292201,292214] [2023-11-29 02:28:11,500 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[292352,292365] [2023-11-29 02:28:11,500 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[292507,292520] [2023-11-29 02:28:11,501 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[292659,292672] [2023-11-29 02:28:11,501 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[292814,292827] [2023-11-29 02:28:11,502 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[292978,292991] [2023-11-29 02:28:11,502 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[293134,293147] [2023-11-29 02:28:11,503 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[293298,293311] [2023-11-29 02:28:11,504 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[293440,293453] [2023-11-29 02:28:11,504 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[293598,293611] [2023-11-29 02:28:11,504 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[293765,293778] [2023-11-29 02:28:11,505 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[293924,293937] [2023-11-29 02:28:11,506 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[294083,294096] [2023-11-29 02:28:11,506 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[294232,294245] [2023-11-29 02:28:11,506 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[294379,294392] [2023-11-29 02:28:11,507 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[294518,294531] [2023-11-29 02:28:11,507 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[294681,294694] [2023-11-29 02:28:11,508 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[294847,294860] [2023-11-29 02:28:11,508 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[295011,295024] [2023-11-29 02:28:11,509 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[295176,295189] [2023-11-29 02:28:11,509 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[295341,295354] [2023-11-29 02:28:11,510 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[295507,295520] [2023-11-29 02:28:11,510 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[295672,295685] [2023-11-29 02:28:11,510 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[295839,295852] [2023-11-29 02:28:11,511 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[295999,296012] [2023-11-29 02:28:11,511 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[296161,296174] [2023-11-29 02:28:11,512 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[296320,296333] [2023-11-29 02:28:11,512 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[296466,296479] [2023-11-29 02:28:11,513 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[296609,296622] [2023-11-29 02:28:11,513 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[296753,296766] [2023-11-29 02:28:11,514 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[296896,296909] [2023-11-29 02:28:11,514 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[297040,297053] [2023-11-29 02:28:11,515 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[297181,297194] [2023-11-29 02:28:11,515 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[297319,297332] [2023-11-29 02:28:11,516 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[297477,297490] [2023-11-29 02:28:11,516 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[297636,297649] [2023-11-29 02:28:11,517 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[297792,297805] [2023-11-29 02:28:11,517 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[297941,297954] [2023-11-29 02:28:11,518 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[298093,298106] [2023-11-29 02:28:11,518 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[298244,298257] [2023-11-29 02:28:11,519 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[298393,298406] [2023-11-29 02:28:11,519 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[298545,298558] [2023-11-29 02:28:11,520 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[298693,298706] [2023-11-29 02:28:11,520 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[298846,298859] [2023-11-29 02:28:11,521 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[298997,299010] [2023-11-29 02:28:11,521 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[299147,299160] [2023-11-29 02:28:11,522 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[299294,299307] [2023-11-29 02:28:11,522 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[299445,299458] [2023-11-29 02:28:11,523 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[299596,299609] [2023-11-29 02:28:11,523 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[299744,299757] [2023-11-29 02:28:11,524 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[299910,299923] [2023-11-29 02:28:11,524 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[300079,300092] [2023-11-29 02:28:11,525 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[300246,300259] [2023-11-29 02:28:11,525 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[300414,300427] [2023-11-29 02:28:11,526 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[300564,300577] [2023-11-29 02:28:11,526 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[300711,300724] [2023-11-29 02:28:11,527 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[300872,300885] [2023-11-29 02:28:11,527 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[301042,301055] [2023-11-29 02:28:11,528 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[301204,301217] [2023-11-29 02:28:11,531 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:28:11,771 WARN L675 CHandler]: The function __bad_percpu_size is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 02:28:11,781 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:28:11,781 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:28:11 WrapperNode [2023-11-29 02:28:11,781 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:28:11,783 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:28:11,783 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:28:11,783 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:28:11,792 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:28:11" (1/1) ... [2023-11-29 02:28:11,884 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:28:11" (1/1) ... [2023-11-29 02:28:12,061 INFO L138 Inliner]: procedures = 516, calls = 1404, calls flagged for inlining = 239, calls inlined = 169, statements flattened = 3307 [2023-11-29 02:28:12,062 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:28:12,063 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:28:12,063 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:28:12,063 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:28:12,079 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:28:11" (1/1) ... [2023-11-29 02:28:12,080 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:28:11" (1/1) ... [2023-11-29 02:28:12,105 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:28:11" (1/1) ... [2023-11-29 02:28:13,022 INFO L175 MemorySlicer]: Split 478 memory accesses to 12 slices as follows [8, 24, 56, 8, 1, 7, 56, 10, 7, 1, 298, 2]. 62 percent of accesses are in the largest equivalence class. The 217 initializations are split as follows [0, 24, 56, 0, 0, 7, 0, 0, 0, 1, 127, 2]. The 112 writes are split as follows [0, 0, 0, 4, 0, 0, 48, 9, 1, 0, 50, 0]. [2023-11-29 02:28:13,022 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:28:11" (1/1) ... [2023-11-29 02:28:13,022 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:28:11" (1/1) ... [2023-11-29 02:28:13,130 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:28:11" (1/1) ... [2023-11-29 02:28:13,149 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:28:11" (1/1) ... [2023-11-29 02:28:13,181 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:28:11" (1/1) ... [2023-11-29 02:28:13,197 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:28:11" (1/1) ... [2023-11-29 02:28:13,236 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:28:13,237 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:28:13,238 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:28:13,238 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:28:13,239 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:28:11" (1/1) ... [2023-11-29 02:28:13,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:28:13,259 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:28:13,274 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 02:28:13,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 02:28:13,319 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_97 [2023-11-29 02:28:13,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_97 [2023-11-29 02:28:13,319 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2023-11-29 02:28:13,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2023-11-29 02:28:13,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2023-11-29 02:28:13,319 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2023-11-29 02:28:13,320 INFO L130 BoogieDeclarations]: Found specification of procedure parport_uss720_disable_irq [2023-11-29 02:28:13,320 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_uss720_disable_irq [2023-11-29 02:28:13,320 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_async [2023-11-29 02:28:13,320 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_async [2023-11-29 02:28:13,320 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2023-11-29 02:28:13,320 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2023-11-29 02:28:13,320 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2023-11-29 02:28:13,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2023-11-29 02:28:13,321 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2023-11-29 02:28:13,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2023-11-29 02:28:13,321 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2023-11-29 02:28:13,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2023-11-29 02:28:13,321 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2023-11-29 02:28:13,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2023-11-29 02:28:13,321 INFO L130 BoogieDeclarations]: Found specification of procedure parport_uss720_read_status [2023-11-29 02:28:13,322 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_uss720_read_status [2023-11-29 02:28:13,322 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2023-11-29 02:28:13,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2023-11-29 02:28:13,322 INFO L130 BoogieDeclarations]: Found specification of procedure parport_uss720_read_data [2023-11-29 02:28:13,322 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_uss720_read_data [2023-11-29 02:28:13,322 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2023-11-29 02:28:13,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2023-11-29 02:28:13,322 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2023-11-29 02:28:13,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2023-11-29 02:28:13,323 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 02:28:13,323 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2023-11-29 02:28:13,323 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2023-11-29 02:28:13,323 INFO L130 BoogieDeclarations]: Found specification of procedure parport_uss720_data_reverse [2023-11-29 02:28:13,323 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_uss720_data_reverse [2023-11-29 02:28:13,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#0 [2023-11-29 02:28:13,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#1 [2023-11-29 02:28:13,323 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#2 [2023-11-29 02:28:13,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#3 [2023-11-29 02:28:13,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#4 [2023-11-29 02:28:13,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#5 [2023-11-29 02:28:13,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#6 [2023-11-29 02:28:13,324 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#7 [2023-11-29 02:28:13,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#8 [2023-11-29 02:28:13,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#9 [2023-11-29 02:28:13,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#10 [2023-11-29 02:28:13,325 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int#11 [2023-11-29 02:28:13,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#0 [2023-11-29 02:28:13,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#1 [2023-11-29 02:28:13,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#2 [2023-11-29 02:28:13,325 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#3 [2023-11-29 02:28:13,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#4 [2023-11-29 02:28:13,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#5 [2023-11-29 02:28:13,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#6 [2023-11-29 02:28:13,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#7 [2023-11-29 02:28:13,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#8 [2023-11-29 02:28:13,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#9 [2023-11-29 02:28:13,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#10 [2023-11-29 02:28:13,326 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int#11 [2023-11-29 02:28:13,327 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2023-11-29 02:28:13,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2023-11-29 02:28:13,327 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2023-11-29 02:28:13,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2023-11-29 02:28:13,327 INFO L130 BoogieDeclarations]: Found specification of procedure kref_get [2023-11-29 02:28:13,327 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_get [2023-11-29 02:28:13,327 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2023-11-29 02:28:13,327 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2023-11-29 02:28:13,327 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 02:28:13,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 02:28:13,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 02:28:13,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 02:28:13,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-29 02:28:13,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-29 02:28:13,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2023-11-29 02:28:13,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2023-11-29 02:28:13,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2023-11-29 02:28:13,328 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2023-11-29 02:28:13,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2023-11-29 02:28:13,329 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2023-11-29 02:28:13,329 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2023-11-29 02:28:13,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2023-11-29 02:28:13,329 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2023-11-29 02:28:13,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2023-11-29 02:28:13,329 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2023-11-29 02:28:13,329 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2023-11-29 02:28:13,330 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2023-11-29 02:28:13,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2023-11-29 02:28:13,330 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2023-11-29 02:28:13,330 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2023-11-29 02:28:13,330 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_dev_dbg [2023-11-29 02:28:13,330 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_dev_dbg [2023-11-29 02:28:13,330 INFO L130 BoogieDeclarations]: Found specification of procedure submit_async_request [2023-11-29 02:28:13,330 INFO L138 BoogieDeclarations]: Found implementation of procedure submit_async_request [2023-11-29 02:28:13,330 INFO L130 BoogieDeclarations]: Found specification of procedure kref_put [2023-11-29 02:28:13,331 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_put [2023-11-29 02:28:13,331 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2023-11-29 02:28:13,331 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2023-11-29 02:28:13,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 02:28:13,331 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:28:13,331 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2023-11-29 02:28:13,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2023-11-29 02:28:13,332 INFO L130 BoogieDeclarations]: Found specification of procedure change_mode [2023-11-29 02:28:13,332 INFO L138 BoogieDeclarations]: Found implementation of procedure change_mode [2023-11-29 02:28:13,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 02:28:13,332 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 02:28:13,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 02:28:13,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2023-11-29 02:28:13,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2023-11-29 02:28:13,333 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2023-11-29 02:28:13,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2023-11-29 02:28:13,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2023-11-29 02:28:13,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2023-11-29 02:28:13,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2023-11-29 02:28:13,334 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2023-11-29 02:28:13,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2023-11-29 02:28:13,335 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2023-11-29 02:28:13,335 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2023-11-29 02:28:13,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2023-11-29 02:28:13,335 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2023-11-29 02:28:13,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2023-11-29 02:28:13,336 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_dev_usb_put_dev [2023-11-29 02:28:13,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_dev_usb_put_dev [2023-11-29 02:28:13,336 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2023-11-29 02:28:13,336 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2023-11-29 02:28:13,336 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2023-11-29 02:28:13,337 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2023-11-29 02:28:13,337 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2023-11-29 02:28:13,337 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2023-11-29 02:28:13,337 INFO L130 BoogieDeclarations]: Found specification of procedure parport_generic_irq [2023-11-29 02:28:13,337 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_generic_irq [2023-11-29 02:28:13,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:28:13,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:28:13,338 INFO L130 BoogieDeclarations]: Found specification of procedure get_1284_register [2023-11-29 02:28:13,338 INFO L138 BoogieDeclarations]: Found implementation of procedure get_1284_register [2023-11-29 02:28:13,338 INFO L130 BoogieDeclarations]: Found specification of procedure kref_sub [2023-11-29 02:28:13,338 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_sub [2023-11-29 02:28:13,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#0 [2023-11-29 02:28:13,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#1 [2023-11-29 02:28:13,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#2 [2023-11-29 02:28:13,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#3 [2023-11-29 02:28:13,339 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#4 [2023-11-29 02:28:13,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#5 [2023-11-29 02:28:13,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#6 [2023-11-29 02:28:13,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#7 [2023-11-29 02:28:13,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#8 [2023-11-29 02:28:13,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#9 [2023-11-29 02:28:13,340 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#10 [2023-11-29 02:28:13,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$#11 [2023-11-29 02:28:13,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#0 [2023-11-29 02:28:13,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#1 [2023-11-29 02:28:13,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#2 [2023-11-29 02:28:13,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#3 [2023-11-29 02:28:13,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#4 [2023-11-29 02:28:13,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#5 [2023-11-29 02:28:13,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#6 [2023-11-29 02:28:13,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#7 [2023-11-29 02:28:13,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#8 [2023-11-29 02:28:13,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#9 [2023-11-29 02:28:13,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#10 [2023-11-29 02:28:13,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$#11 [2023-11-29 02:28:13,342 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2023-11-29 02:28:13,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2023-11-29 02:28:13,343 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_asynclock_of_parport_uss720_private [2023-11-29 02:28:13,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_asynclock_of_parport_uss720_private [2023-11-29 02:28:13,343 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2023-11-29 02:28:13,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2023-11-29 02:28:13,343 INFO L130 BoogieDeclarations]: Found specification of procedure set_1284_register [2023-11-29 02:28:13,343 INFO L138 BoogieDeclarations]: Found implementation of procedure set_1284_register [2023-11-29 02:28:13,343 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2023-11-29 02:28:13,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2023-11-29 02:28:13,343 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2023-11-29 02:28:13,343 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2023-11-29 02:28:13,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 02:28:13,344 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2023-11-29 02:28:13,344 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2023-11-29 02:28:13,344 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2023-11-29 02:28:13,344 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2023-11-29 02:28:13,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 02:28:13,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 02:28:13,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 02:28:13,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2023-11-29 02:28:13,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2023-11-29 02:28:13,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2023-11-29 02:28:13,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2023-11-29 02:28:13,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2023-11-29 02:28:13,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2023-11-29 02:28:13,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2023-11-29 02:28:13,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2023-11-29 02:28:13,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2023-11-29 02:28:13,346 INFO L130 BoogieDeclarations]: Found specification of procedure async_complete [2023-11-29 02:28:13,346 INFO L138 BoogieDeclarations]: Found implementation of procedure async_complete [2023-11-29 02:28:13,346 INFO L130 BoogieDeclarations]: Found specification of procedure parport_uss720_read_control [2023-11-29 02:28:13,346 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_uss720_read_control [2023-11-29 02:28:13,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2023-11-29 02:28:13,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2023-11-29 02:28:13,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2023-11-29 02:28:13,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2023-11-29 02:28:13,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2023-11-29 02:28:13,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2023-11-29 02:28:13,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2023-11-29 02:28:13,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2023-11-29 02:28:13,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2023-11-29 02:28:13,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2023-11-29 02:28:13,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2023-11-29 02:28:13,347 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2023-11-29 02:28:13,347 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2023-11-29 02:28:13,347 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2023-11-29 02:28:13,347 INFO L130 BoogieDeclarations]: Found specification of procedure dev_err [2023-11-29 02:28:13,348 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_err [2023-11-29 02:28:13,348 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2023-11-29 02:28:13,348 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2023-11-29 02:28:13,348 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2023-11-29 02:28:13,348 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2023-11-29 02:28:13,348 INFO L130 BoogieDeclarations]: Found specification of procedure parport_uss720_enable_irq [2023-11-29 02:28:13,348 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_uss720_enable_irq [2023-11-29 02:28:13,348 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2023-11-29 02:28:13,348 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2023-11-29 02:28:13,349 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2023-11-29 02:28:13,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2023-11-29 02:28:13,349 INFO L130 BoogieDeclarations]: Found specification of procedure clear_epp_timeout [2023-11-29 02:28:13,349 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_epp_timeout [2023-11-29 02:28:13,349 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2023-11-29 02:28:13,349 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2023-11-29 02:28:13,349 INFO L130 BoogieDeclarations]: Found specification of procedure uss720_disconnect [2023-11-29 02:28:13,349 INFO L138 BoogieDeclarations]: Found implementation of procedure uss720_disconnect [2023-11-29 02:28:13,349 INFO L130 BoogieDeclarations]: Found specification of procedure parport_uss720_data_forward [2023-11-29 02:28:13,349 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_uss720_data_forward [2023-11-29 02:28:13,350 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2023-11-29 02:28:13,350 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2023-11-29 02:28:13,350 INFO L130 BoogieDeclarations]: Found specification of procedure kill_all_async_requests_priv [2023-11-29 02:28:13,350 INFO L138 BoogieDeclarations]: Found implementation of procedure kill_all_async_requests_priv [2023-11-29 02:28:13,350 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2023-11-29 02:28:13,351 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2023-11-29 02:28:13,351 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2023-11-29 02:28:13,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2023-11-29 02:28:13,351 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2023-11-29 02:28:13,351 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2023-11-29 02:28:13,352 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2023-11-29 02:28:13,352 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2023-11-29 02:28:13,352 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2023-11-29 02:28:13,352 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2023-11-29 02:28:13,352 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2023-11-29 02:28:13,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2023-11-29 02:28:13,353 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2023-11-29 02:28:13,353 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2023-11-29 02:28:13,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 02:28:13,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 02:28:13,353 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 02:28:13,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 02:28:13,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 02:28:13,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-11-29 02:28:13,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2023-11-29 02:28:13,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2023-11-29 02:28:13,354 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2023-11-29 02:28:13,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2023-11-29 02:28:13,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2023-11-29 02:28:13,355 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2023-11-29 02:28:13,355 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2023-11-29 02:28:13,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2023-11-29 02:28:13,355 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2023-11-29 02:28:13,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2023-11-29 02:28:13,355 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2023-11-29 02:28:13,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2023-11-29 02:28:13,356 INFO L130 BoogieDeclarations]: Found specification of procedure kref_init [2023-11-29 02:28:13,356 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_init [2023-11-29 02:28:13,356 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2023-11-29 02:28:13,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2023-11-29 02:28:13,356 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2023-11-29 02:28:13,356 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2023-11-29 02:28:13,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 02:28:13,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 02:28:13,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 02:28:13,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 02:28:13,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 02:28:13,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-29 02:28:13,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2023-11-29 02:28:13,357 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2023-11-29 02:28:13,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2023-11-29 02:28:13,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2023-11-29 02:28:13,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2023-11-29 02:28:13,358 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2023-11-29 02:28:14,140 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:28:14,144 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:28:14,485 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2023-11-29 02:28:17,410 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:28:17,754 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:28:17,755 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 02:28:17,756 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:28:17 BoogieIcfgContainer [2023-11-29 02:28:17,756 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:28:17,760 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:28:17,760 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:28:17,764 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:28:17,764 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:28:08" (1/3) ... [2023-11-29 02:28:17,765 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bb52f92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:28:17, skipping insertion in model container [2023-11-29 02:28:17,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:28:11" (2/3) ... [2023-11-29 02:28:17,765 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@bb52f92 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:28:17, skipping insertion in model container [2023-11-29 02:28:17,765 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:28:17" (3/3) ... [2023-11-29 02:28:17,767 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i [2023-11-29 02:28:17,791 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:28:17,791 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 33 error locations. [2023-11-29 02:28:17,902 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:28:17,909 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=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7f9edb7f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:28:17,909 INFO L358 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2023-11-29 02:28:17,921 INFO L276 IsEmpty]: Start isEmpty. Operand has 1017 states, 631 states have (on average 1.4025356576862125) internal successors, (885), 678 states have internal predecessors, (885), 276 states have call successors, (276), 77 states have call predecessors, (276), 76 states have return successors, (272), 266 states have call predecessors, (272), 272 states have call successors, (272) [2023-11-29 02:28:17,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-11-29 02:28:17,936 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:28:17,937 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2023-11-29 02:28:17,938 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2023-11-29 02:28:17,945 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:28:17,945 INFO L85 PathProgramCache]: Analyzing trace with hash -542042920, now seen corresponding path program 1 times [2023-11-29 02:28:17,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:28:17,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578012702] [2023-11-29 02:28:17,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:28:17,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:28:18,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:19,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:28:19,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:19,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 02:28:19,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:19,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 02:28:19,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:19,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 02:28:19,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:19,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:28:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:19,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 02:28:19,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:19,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 02:28:19,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:19,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:28:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:19,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 02:28:19,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:19,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:28:19,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:19,255 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 02:28:19,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:28:19,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1578012702] [2023-11-29 02:28:19,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1578012702] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:28:19,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:28:19,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:28:19,259 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342847473] [2023-11-29 02:28:19,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:28:19,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:28:19,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:28:19,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:28:19,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:28:19,307 INFO L87 Difference]: Start difference. First operand has 1017 states, 631 states have (on average 1.4025356576862125) internal successors, (885), 678 states have internal predecessors, (885), 276 states have call successors, (276), 77 states have call predecessors, (276), 76 states have return successors, (272), 266 states have call predecessors, (272), 272 states have call successors, (272) Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 4 states have internal predecessors, (26), 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) [2023-11-29 02:28:23,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:28:23,945 INFO L93 Difference]: Finished difference Result 1979 states and 2929 transitions. [2023-11-29 02:28:23,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:28:23,948 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 4 states have internal predecessors, (26), 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 55 [2023-11-29 02:28:23,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:28:23,970 INFO L225 Difference]: With dead ends: 1979 [2023-11-29 02:28:23,970 INFO L226 Difference]: Without dead ends: 1003 [2023-11-29 02:28:23,983 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-29 02:28:23,986 INFO L413 NwaCegarLoop]: 564 mSDtfsCounter, 2032 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 2236 mSolverCounterSat, 1026 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2176 SdHoareTripleChecker+Valid, 1478 SdHoareTripleChecker+Invalid, 3262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1026 IncrementalHoareTripleChecker+Valid, 2236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:28:23,986 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2176 Valid, 1478 Invalid, 3262 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1026 Valid, 2236 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2023-11-29 02:28:24,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1003 states. [2023-11-29 02:28:24,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1003 to 1003. [2023-11-29 02:28:24,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1003 states, 624 states have (on average 1.3333333333333333) internal successors, (832), 667 states have internal predecessors, (832), 272 states have call successors, (272), 76 states have call predecessors, (272), 75 states have return successors, (270), 264 states have call predecessors, (270), 270 states have call successors, (270) [2023-11-29 02:28:24,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1003 states to 1003 states and 1374 transitions. [2023-11-29 02:28:24,149 INFO L78 Accepts]: Start accepts. Automaton has 1003 states and 1374 transitions. Word has length 55 [2023-11-29 02:28:24,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:28:24,151 INFO L495 AbstractCegarLoop]: Abstraction has 1003 states and 1374 transitions. [2023-11-29 02:28:24,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 4 states have internal predecessors, (26), 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) [2023-11-29 02:28:24,151 INFO L276 IsEmpty]: Start isEmpty. Operand 1003 states and 1374 transitions. [2023-11-29 02:28:24,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2023-11-29 02:28:24,155 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:28:24,155 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2023-11-29 02:28:24,155 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 02:28:24,156 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2023-11-29 02:28:24,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:28:24,156 INFO L85 PathProgramCache]: Analyzing trace with hash -1453601902, now seen corresponding path program 1 times [2023-11-29 02:28:24,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:28:24,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005133734] [2023-11-29 02:28:24,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:28:24,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:28:24,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:24,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:28:24,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:24,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 02:28:24,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:24,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 02:28:24,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:24,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 02:28:24,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:24,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:28:24,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:24,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 02:28:24,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:24,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 02:28:24,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:24,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:28:24,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:24,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 02:28:24,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:24,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:28:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:24,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:28:24,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:24,663 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 02:28:24,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:28:24,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005133734] [2023-11-29 02:28:24,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005133734] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:28:24,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:28:24,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:28:24,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [741130449] [2023-11-29 02:28:24,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:28:24,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:28:24,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:28:24,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:28:24,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:28:24,667 INFO L87 Difference]: Start difference. First operand 1003 states and 1374 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 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) [2023-11-29 02:28:28,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:28:28,710 INFO L93 Difference]: Finished difference Result 1003 states and 1374 transitions. [2023-11-29 02:28:28,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:28:28,711 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 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 60 [2023-11-29 02:28:28,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:28:28,722 INFO L225 Difference]: With dead ends: 1003 [2023-11-29 02:28:28,722 INFO L226 Difference]: Without dead ends: 1001 [2023-11-29 02:28:28,723 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 [2023-11-29 02:28:28,724 INFO L413 NwaCegarLoop]: 554 mSDtfsCounter, 2003 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 2216 mSolverCounterSat, 1018 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2144 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 3234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1018 IncrementalHoareTripleChecker+Valid, 2216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-11-29 02:28:28,724 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2144 Valid, 1452 Invalid, 3234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1018 Valid, 2216 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-11-29 02:28:28,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1001 states. [2023-11-29 02:28:28,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1001 to 1001. [2023-11-29 02:28:28,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1001 states, 623 states have (on average 1.332263242375602) internal successors, (830), 665 states have internal predecessors, (830), 272 states have call successors, (272), 76 states have call predecessors, (272), 75 states have return successors, (270), 264 states have call predecessors, (270), 270 states have call successors, (270) [2023-11-29 02:28:28,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1001 states to 1001 states and 1372 transitions. [2023-11-29 02:28:28,820 INFO L78 Accepts]: Start accepts. Automaton has 1001 states and 1372 transitions. Word has length 60 [2023-11-29 02:28:28,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:28:28,821 INFO L495 AbstractCegarLoop]: Abstraction has 1001 states and 1372 transitions. [2023-11-29 02:28:28,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 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) [2023-11-29 02:28:28,821 INFO L276 IsEmpty]: Start isEmpty. Operand 1001 states and 1372 transitions. [2023-11-29 02:28:28,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2023-11-29 02:28:28,824 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:28:28,825 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2023-11-29 02:28:28,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 02:28:28,825 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2023-11-29 02:28:28,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:28:28,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1298246515, now seen corresponding path program 1 times [2023-11-29 02:28:28,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:28:28,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1464293366] [2023-11-29 02:28:28,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:28:28,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:28:29,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:29,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:28:29,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:29,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 02:28:29,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:29,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 02:28:29,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:29,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 02:28:29,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:29,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:28:29,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:29,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 02:28:29,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:29,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 02:28:29,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:29,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:28:29,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:29,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 02:28:29,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:29,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:28:29,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:29,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:28:29,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:29,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 02:28:29,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:29,443 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 02:28:29,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:28:29,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1464293366] [2023-11-29 02:28:29,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1464293366] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:28:29,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:28:29,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:28:29,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003173846] [2023-11-29 02:28:29,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:28:29,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:28:29,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:28:29,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:28:29,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:28:29,445 INFO L87 Difference]: Start difference. First operand 1001 states and 1372 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, (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) [2023-11-29 02:28:34,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:28:34,183 INFO L93 Difference]: Finished difference Result 1001 states and 1372 transitions. [2023-11-29 02:28:34,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:28:34,184 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, (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 65 [2023-11-29 02:28:34,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:28:34,195 INFO L225 Difference]: With dead ends: 1001 [2023-11-29 02:28:34,195 INFO L226 Difference]: Without dead ends: 999 [2023-11-29 02:28:34,196 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 [2023-11-29 02:28:34,197 INFO L413 NwaCegarLoop]: 554 mSDtfsCounter, 1997 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 2212 mSolverCounterSat, 1018 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2137 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 3230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1018 IncrementalHoareTripleChecker+Valid, 2212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2023-11-29 02:28:34,198 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2137 Valid, 1452 Invalid, 3230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1018 Valid, 2212 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2023-11-29 02:28:34,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2023-11-29 02:28:34,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 999. [2023-11-29 02:28:34,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 999 states, 622 states have (on average 1.3311897106109325) internal successors, (828), 663 states have internal predecessors, (828), 272 states have call successors, (272), 76 states have call predecessors, (272), 75 states have return successors, (270), 264 states have call predecessors, (270), 270 states have call successors, (270) [2023-11-29 02:28:34,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 999 states to 999 states and 1370 transitions. [2023-11-29 02:28:34,317 INFO L78 Accepts]: Start accepts. Automaton has 999 states and 1370 transitions. Word has length 65 [2023-11-29 02:28:34,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:28:34,317 INFO L495 AbstractCegarLoop]: Abstraction has 999 states and 1370 transitions. [2023-11-29 02:28:34,318 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, (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) [2023-11-29 02:28:34,318 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1370 transitions. [2023-11-29 02:28:34,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2023-11-29 02:28:34,321 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:28:34,321 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2023-11-29 02:28:34,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 02:28:34,322 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2023-11-29 02:28:34,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:28:34,322 INFO L85 PathProgramCache]: Analyzing trace with hash 1201830883, now seen corresponding path program 1 times [2023-11-29 02:28:34,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:28:34,323 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849803637] [2023-11-29 02:28:34,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:28:34,323 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:28:34,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:34,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:28:34,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:34,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 02:28:34,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:34,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 02:28:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:34,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 02:28:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:34,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:28:34,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:34,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 02:28:34,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:34,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 02:28:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:34,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:28:34,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:34,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 02:28:34,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:34,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:28:34,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:34,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:28:34,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:34,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 02:28:34,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:34,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 02:28:34,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:34,958 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 02:28:34,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:28:34,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849803637] [2023-11-29 02:28:34,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849803637] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:28:34,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:28:34,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:28:34,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1928008668] [2023-11-29 02:28:34,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:28:34,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:28:34,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:28:34,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:28:34,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:28:34,961 INFO L87 Difference]: Start difference. First operand 999 states and 1370 transitions. Second operand has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 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) [2023-11-29 02:28:38,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:28:38,929 INFO L93 Difference]: Finished difference Result 999 states and 1370 transitions. [2023-11-29 02:28:38,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:28:38,930 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 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 70 [2023-11-29 02:28:38,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:28:38,941 INFO L225 Difference]: With dead ends: 999 [2023-11-29 02:28:38,941 INFO L226 Difference]: Without dead ends: 997 [2023-11-29 02:28:38,942 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 [2023-11-29 02:28:38,943 INFO L413 NwaCegarLoop]: 554 mSDtfsCounter, 1991 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 2208 mSolverCounterSat, 1018 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2130 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 3226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1018 IncrementalHoareTripleChecker+Valid, 2208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-11-29 02:28:38,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2130 Valid, 1452 Invalid, 3226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1018 Valid, 2208 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-11-29 02:28:38,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 997 states. [2023-11-29 02:28:39,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 997 to 997. [2023-11-29 02:28:39,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 997 states, 621 states have (on average 1.3301127214170692) internal successors, (826), 661 states have internal predecessors, (826), 272 states have call successors, (272), 76 states have call predecessors, (272), 75 states have return successors, (270), 264 states have call predecessors, (270), 270 states have call successors, (270) [2023-11-29 02:28:39,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 997 states to 997 states and 1368 transitions. [2023-11-29 02:28:39,038 INFO L78 Accepts]: Start accepts. Automaton has 997 states and 1368 transitions. Word has length 70 [2023-11-29 02:28:39,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:28:39,038 INFO L495 AbstractCegarLoop]: Abstraction has 997 states and 1368 transitions. [2023-11-29 02:28:39,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.833333333333333) internal successors, (35), 4 states have internal predecessors, (35), 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) [2023-11-29 02:28:39,039 INFO L276 IsEmpty]: Start isEmpty. Operand 997 states and 1368 transitions. [2023-11-29 02:28:39,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2023-11-29 02:28:39,041 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:28:39,042 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2023-11-29 02:28:39,042 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 02:28:39,042 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2023-11-29 02:28:39,042 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:28:39,043 INFO L85 PathProgramCache]: Analyzing trace with hash 772536643, now seen corresponding path program 1 times [2023-11-29 02:28:39,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:28:39,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565956836] [2023-11-29 02:28:39,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:28:39,043 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:28:39,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:39,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:28:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:39,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 02:28:39,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:39,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 02:28:39,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:39,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 02:28:39,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:39,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:28:39,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:39,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 02:28:39,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:39,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 02:28:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:39,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:28:39,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:39,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 02:28:39,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:39,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:28:39,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:39,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:28:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:39,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 02:28:39,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:39,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 02:28:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:39,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 02:28:39,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:39,653 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 02:28:39,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:28:39,654 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565956836] [2023-11-29 02:28:39,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565956836] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:28:39,654 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:28:39,654 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:28:39,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486103198] [2023-11-29 02:28:39,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:28:39,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:28:39,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:28:39,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:28:39,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:28:39,657 INFO L87 Difference]: Start difference. First operand 997 states and 1368 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 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) [2023-11-29 02:28:43,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:28:43,933 INFO L93 Difference]: Finished difference Result 997 states and 1368 transitions. [2023-11-29 02:28:43,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:28:43,934 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 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 75 [2023-11-29 02:28:43,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:28:43,942 INFO L225 Difference]: With dead ends: 997 [2023-11-29 02:28:43,942 INFO L226 Difference]: Without dead ends: 995 [2023-11-29 02:28:43,943 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 [2023-11-29 02:28:43,944 INFO L413 NwaCegarLoop]: 554 mSDtfsCounter, 1985 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 2204 mSolverCounterSat, 1018 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2123 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 3222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1018 IncrementalHoareTripleChecker+Valid, 2204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:28:43,944 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2123 Valid, 1452 Invalid, 3222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1018 Valid, 2204 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-11-29 02:28:43,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 995 states. [2023-11-29 02:28:44,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 995 to 995. [2023-11-29 02:28:44,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 995 states, 620 states have (on average 1.3290322580645162) internal successors, (824), 659 states have internal predecessors, (824), 272 states have call successors, (272), 76 states have call predecessors, (272), 75 states have return successors, (270), 264 states have call predecessors, (270), 270 states have call successors, (270) [2023-11-29 02:28:44,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 995 states to 995 states and 1366 transitions. [2023-11-29 02:28:44,008 INFO L78 Accepts]: Start accepts. Automaton has 995 states and 1366 transitions. Word has length 75 [2023-11-29 02:28:44,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:28:44,008 INFO L495 AbstractCegarLoop]: Abstraction has 995 states and 1366 transitions. [2023-11-29 02:28:44,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 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) [2023-11-29 02:28:44,009 INFO L276 IsEmpty]: Start isEmpty. Operand 995 states and 1366 transitions. [2023-11-29 02:28:44,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2023-11-29 02:28:44,010 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:28:44,011 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2023-11-29 02:28:44,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 02:28:44,011 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2023-11-29 02:28:44,011 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:28:44,011 INFO L85 PathProgramCache]: Analyzing trace with hash -839814247, now seen corresponding path program 1 times [2023-11-29 02:28:44,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:28:44,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1768074275] [2023-11-29 02:28:44,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:28:44,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:28:44,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:44,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:28:44,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:44,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 02:28:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:44,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 02:28:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:44,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 02:28:44,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:44,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:28:44,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:44,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 02:28:44,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:44,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 02:28:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:44,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:28:44,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:44,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 02:28:44,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:44,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:28:44,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:44,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:28:44,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:44,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 02:28:44,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:44,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 02:28:44,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:44,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 02:28:44,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:44,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 02:28:44,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:44,427 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 02:28:44,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:28:44,428 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1768074275] [2023-11-29 02:28:44,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1768074275] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:28:44,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:28:44,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:28:44,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361837225] [2023-11-29 02:28:44,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:28:44,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:28:44,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:28:44,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:28:44,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:28:44,431 INFO L87 Difference]: Start difference. First operand 995 states and 1366 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (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) [2023-11-29 02:28:48,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:28:48,496 INFO L93 Difference]: Finished difference Result 995 states and 1366 transitions. [2023-11-29 02:28:48,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:28:48,497 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (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 80 [2023-11-29 02:28:48,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:28:48,505 INFO L225 Difference]: With dead ends: 995 [2023-11-29 02:28:48,505 INFO L226 Difference]: Without dead ends: 993 [2023-11-29 02:28:48,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-29 02:28:48,507 INFO L413 NwaCegarLoop]: 554 mSDtfsCounter, 1979 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 2200 mSolverCounterSat, 1018 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2116 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 3218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1018 IncrementalHoareTripleChecker+Valid, 2200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:28:48,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2116 Valid, 1452 Invalid, 3218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1018 Valid, 2200 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2023-11-29 02:28:48,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 993 states. [2023-11-29 02:28:48,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 993 to 993. [2023-11-29 02:28:48,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 993 states, 619 states have (on average 1.3279483037156705) internal successors, (822), 657 states have internal predecessors, (822), 272 states have call successors, (272), 76 states have call predecessors, (272), 75 states have return successors, (270), 264 states have call predecessors, (270), 270 states have call successors, (270) [2023-11-29 02:28:48,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 993 states to 993 states and 1364 transitions. [2023-11-29 02:28:48,576 INFO L78 Accepts]: Start accepts. Automaton has 993 states and 1364 transitions. Word has length 80 [2023-11-29 02:28:48,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:28:48,577 INFO L495 AbstractCegarLoop]: Abstraction has 993 states and 1364 transitions. [2023-11-29 02:28:48,577 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (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) [2023-11-29 02:28:48,577 INFO L276 IsEmpty]: Start isEmpty. Operand 993 states and 1364 transitions. [2023-11-29 02:28:48,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-11-29 02:28:48,579 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:28:48,579 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2023-11-29 02:28:48,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 02:28:48,580 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2023-11-29 02:28:48,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:28:48,580 INFO L85 PathProgramCache]: Analyzing trace with hash -154559812, now seen corresponding path program 1 times [2023-11-29 02:28:48,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:28:48,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035931261] [2023-11-29 02:28:48,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:28:48,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:28:48,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:48,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:28:48,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:49,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 02:28:49,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:49,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 02:28:49,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:49,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 02:28:49,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:49,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:28:49,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:49,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 02:28:49,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:49,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 02:28:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:49,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:28:49,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:49,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 02:28:49,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:49,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:28:49,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:49,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:28:49,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:49,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 02:28:49,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:49,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 02:28:49,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:49,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 02:28:49,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:49,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 02:28:49,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:49,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 02:28:49,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:49,157 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 02:28:49,157 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:28:49,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035931261] [2023-11-29 02:28:49,158 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035931261] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:28:49,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:28:49,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:28:49,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955024263] [2023-11-29 02:28:49,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:28:49,159 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:28:49,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:28:49,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:28:49,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:28:49,160 INFO L87 Difference]: Start difference. First operand 993 states and 1364 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, (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) [2023-11-29 02:28:52,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:28:52,794 INFO L93 Difference]: Finished difference Result 993 states and 1364 transitions. [2023-11-29 02:28:52,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:28:52,794 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, (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 85 [2023-11-29 02:28:52,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:28:52,802 INFO L225 Difference]: With dead ends: 993 [2023-11-29 02:28:52,803 INFO L226 Difference]: Without dead ends: 991 [2023-11-29 02:28:52,804 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 [2023-11-29 02:28:52,805 INFO L413 NwaCegarLoop]: 554 mSDtfsCounter, 1973 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 2196 mSolverCounterSat, 1018 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2109 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 3214 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1018 IncrementalHoareTripleChecker+Valid, 2196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2023-11-29 02:28:52,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2109 Valid, 1452 Invalid, 3214 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1018 Valid, 2196 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2023-11-29 02:28:52,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 991 states. [2023-11-29 02:28:52,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 991 to 991. [2023-11-29 02:28:52,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 618 states have (on average 1.3268608414239482) internal successors, (820), 655 states have internal predecessors, (820), 272 states have call successors, (272), 76 states have call predecessors, (272), 75 states have return successors, (270), 264 states have call predecessors, (270), 270 states have call successors, (270) [2023-11-29 02:28:52,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1362 transitions. [2023-11-29 02:28:52,906 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1362 transitions. Word has length 85 [2023-11-29 02:28:52,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:28:52,907 INFO L495 AbstractCegarLoop]: Abstraction has 991 states and 1362 transitions. [2023-11-29 02:28:52,907 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, (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) [2023-11-29 02:28:52,907 INFO L276 IsEmpty]: Start isEmpty. Operand 991 states and 1362 transitions. [2023-11-29 02:28:52,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2023-11-29 02:28:52,910 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:28:52,910 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2023-11-29 02:28:52,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 02:28:52,910 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2023-11-29 02:28:52,911 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:28:52,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1285790847, now seen corresponding path program 1 times [2023-11-29 02:28:52,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:28:52,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [781632928] [2023-11-29 02:28:52,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:28:52,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:28:53,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:53,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:28:53,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:53,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 02:28:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:53,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 02:28:53,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:53,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 02:28:53,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:53,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:28:53,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:53,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 02:28:53,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:53,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 02:28:53,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:53,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:28:53,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:53,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 02:28:53,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:53,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:28:53,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:53,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:28:53,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:53,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 02:28:53,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:53,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 02:28:53,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:53,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 02:28:53,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:53,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 02:28:53,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:53,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 02:28:53,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:53,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 02:28:53,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:28:53,331 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 02:28:53,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:28:53,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [781632928] [2023-11-29 02:28:53,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [781632928] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:28:53,331 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:28:53,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:28:53,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666540773] [2023-11-29 02:28:53,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:28:53,332 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:28:53,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:28:53,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:28:53,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:28:53,334 INFO L87 Difference]: Start difference. First operand 991 states and 1362 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (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) [2023-11-29 02:28:59,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:28:59,840 INFO L93 Difference]: Finished difference Result 1905 states and 2686 transitions. [2023-11-29 02:28:59,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 02:28:59,841 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (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 90 [2023-11-29 02:28:59,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:28:59,857 INFO L225 Difference]: With dead ends: 1905 [2023-11-29 02:28:59,857 INFO L226 Difference]: Without dead ends: 1903 [2023-11-29 02:28:59,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-29 02:28:59,859 INFO L413 NwaCegarLoop]: 581 mSDtfsCounter, 2856 mSDsluCounter, 1244 mSDsCounter, 0 mSdLazyCounter, 3385 mSolverCounterSat, 1697 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2946 SdHoareTripleChecker+Valid, 1825 SdHoareTripleChecker+Invalid, 5082 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1697 IncrementalHoareTripleChecker+Valid, 3385 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:28:59,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2946 Valid, 1825 Invalid, 5082 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1697 Valid, 3385 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2023-11-29 02:28:59,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1903 states. [2023-11-29 02:29:00,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1903 to 1781. [2023-11-29 02:29:00,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1781 states, 1127 states have (on average 1.3354037267080745) internal successors, (1505), 1172 states have internal predecessors, (1505), 490 states have call successors, (490), 139 states have call predecessors, (490), 138 states have return successors, (567), 476 states have call predecessors, (567), 488 states have call successors, (567) [2023-11-29 02:29:00,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1781 states and 2562 transitions. [2023-11-29 02:29:00,035 INFO L78 Accepts]: Start accepts. Automaton has 1781 states and 2562 transitions. Word has length 90 [2023-11-29 02:29:00,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:29:00,036 INFO L495 AbstractCegarLoop]: Abstraction has 1781 states and 2562 transitions. [2023-11-29 02:29:00,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (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) [2023-11-29 02:29:00,037 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 2562 transitions. [2023-11-29 02:29:00,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2023-11-29 02:29:00,039 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:29:00,040 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2023-11-29 02:29:00,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 02:29:00,040 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2023-11-29 02:29:00,040 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:00,041 INFO L85 PathProgramCache]: Analyzing trace with hash -1305427102, now seen corresponding path program 1 times [2023-11-29 02:29:00,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:00,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [594585333] [2023-11-29 02:29:00,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:00,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:00,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:00,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:29:00,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:00,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 02:29:00,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:00,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 02:29:00,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:00,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 02:29:00,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:00,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:29:00,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:00,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 02:29:00,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:00,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 02:29:00,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:00,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:29:00,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:00,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 02:29:00,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:00,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:29:00,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:00,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:29:00,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:00,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 02:29:00,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:00,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 02:29:00,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:00,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 02:29:00,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:00,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 02:29:00,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:00,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 02:29:00,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:00,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 02:29:00,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:00,481 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 02:29:00,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:29:00,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [594585333] [2023-11-29 02:29:00,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [594585333] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:00,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:00,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:29:00,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [240867141] [2023-11-29 02:29:00,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:00,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:29:00,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:29:00,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:29:00,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:29:00,484 INFO L87 Difference]: Start difference. First operand 1781 states and 2562 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (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) [2023-11-29 02:29:04,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:29:04,534 INFO L93 Difference]: Finished difference Result 1781 states and 2562 transitions. [2023-11-29 02:29:04,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:29:04,535 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (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 92 [2023-11-29 02:29:04,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:29:04,547 INFO L225 Difference]: With dead ends: 1781 [2023-11-29 02:29:04,547 INFO L226 Difference]: Without dead ends: 1779 [2023-11-29 02:29:04,548 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 [2023-11-29 02:29:04,549 INFO L413 NwaCegarLoop]: 554 mSDtfsCounter, 1965 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 2192 mSolverCounterSat, 1018 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2100 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 3210 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1018 IncrementalHoareTripleChecker+Valid, 2192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2023-11-29 02:29:04,549 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2100 Valid, 1452 Invalid, 3210 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1018 Valid, 2192 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2023-11-29 02:29:04,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2023-11-29 02:29:04,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 1779. [2023-11-29 02:29:04,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1779 states, 1126 states have (on average 1.3339253996447602) internal successors, (1502), 1170 states have internal predecessors, (1502), 490 states have call successors, (490), 139 states have call predecessors, (490), 138 states have return successors, (567), 476 states have call predecessors, (567), 488 states have call successors, (567) [2023-11-29 02:29:04,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2559 transitions. [2023-11-29 02:29:04,801 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2559 transitions. Word has length 92 [2023-11-29 02:29:04,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:29:04,801 INFO L495 AbstractCegarLoop]: Abstraction has 1779 states and 2559 transitions. [2023-11-29 02:29:04,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (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) [2023-11-29 02:29:04,802 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2559 transitions. [2023-11-29 02:29:04,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-29 02:29:04,805 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:29:04,805 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:29:04,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 02:29:04,805 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2023-11-29 02:29:04,806 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:04,806 INFO L85 PathProgramCache]: Analyzing trace with hash 516291824, now seen corresponding path program 1 times [2023-11-29 02:29:04,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:04,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630113843] [2023-11-29 02:29:04,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:04,806 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:04,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:05,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:29:05,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:05,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 02:29:05,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:05,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 02:29:05,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:05,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 02:29:05,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:05,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:29:05,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:05,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 02:29:05,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:05,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 02:29:05,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:05,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:29:05,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:05,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 02:29:05,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:05,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:29:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:05,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 02:29:05,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:05,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 02:29:05,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:05,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:29:05,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:05,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:29:05,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:05,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:29:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:05,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 02:29:05,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:05,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 02:29:05,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:05,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 02:29:05,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:05,704 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-11-29 02:29:05,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:29:05,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630113843] [2023-11-29 02:29:05,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630113843] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:05,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:05,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 02:29:05,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024568392] [2023-11-29 02:29:05,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:05,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:29:05,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:29:05,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:29:05,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:29:05,707 INFO L87 Difference]: Start difference. First operand 1779 states and 2559 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 02:29:11,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:29:11,951 INFO L93 Difference]: Finished difference Result 1990 states and 2968 transitions. [2023-11-29 02:29:11,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 02:29:11,952 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 104 [2023-11-29 02:29:11,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:29:11,970 INFO L225 Difference]: With dead ends: 1990 [2023-11-29 02:29:11,971 INFO L226 Difference]: Without dead ends: 1988 [2023-11-29 02:29:11,972 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2023-11-29 02:29:11,973 INFO L413 NwaCegarLoop]: 555 mSDtfsCounter, 1537 mSDsluCounter, 1535 mSDsCounter, 0 mSdLazyCounter, 3734 mSolverCounterSat, 1312 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1537 SdHoareTripleChecker+Valid, 2090 SdHoareTripleChecker+Invalid, 5046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1312 IncrementalHoareTripleChecker+Valid, 3734 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:29:11,974 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1537 Valid, 2090 Invalid, 5046 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1312 Valid, 3734 Invalid, 0 Unknown, 0 Unchecked, 5.9s Time] [2023-11-29 02:29:11,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1988 states. [2023-11-29 02:29:12,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1988 to 1785. [2023-11-29 02:29:12,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1785 states, 1131 states have (on average 1.332449160035367) internal successors, (1507), 1176 states have internal predecessors, (1507), 490 states have call successors, (490), 139 states have call predecessors, (490), 139 states have return successors, (570), 476 states have call predecessors, (570), 488 states have call successors, (570) [2023-11-29 02:29:12,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1785 states and 2567 transitions. [2023-11-29 02:29:12,172 INFO L78 Accepts]: Start accepts. Automaton has 1785 states and 2567 transitions. Word has length 104 [2023-11-29 02:29:12,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:29:12,172 INFO L495 AbstractCegarLoop]: Abstraction has 1785 states and 2567 transitions. [2023-11-29 02:29:12,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 02:29:12,173 INFO L276 IsEmpty]: Start isEmpty. Operand 1785 states and 2567 transitions. [2023-11-29 02:29:12,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2023-11-29 02:29:12,175 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:29:12,175 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:29:12,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 02:29:12,175 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2023-11-29 02:29:12,176 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:12,176 INFO L85 PathProgramCache]: Analyzing trace with hash 516232242, now seen corresponding path program 1 times [2023-11-29 02:29:12,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:12,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747096389] [2023-11-29 02:29:12,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:12,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:12,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:12,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:29:12,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:12,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 02:29:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:12,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 02:29:12,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:12,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 02:29:12,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:12,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:29:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:12,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 02:29:12,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:12,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 02:29:12,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:12,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:29:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:12,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 02:29:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:12,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:29:12,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:12,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 02:29:12,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:12,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 02:29:12,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:12,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:29:12,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:12,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:29:12,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:12,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:29:12,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:12,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 02:29:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:12,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 02:29:12,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:12,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2023-11-29 02:29:12,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:12,945 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-11-29 02:29:12,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:29:12,945 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747096389] [2023-11-29 02:29:12,945 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747096389] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:12,945 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:12,945 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 02:29:12,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775239157] [2023-11-29 02:29:12,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:12,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 02:29:12,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:29:12,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 02:29:12,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:29:12,948 INFO L87 Difference]: Start difference. First operand 1785 states and 2567 transitions. Second operand has 9 states, 8 states have (on average 6.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 02:29:20,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:29:20,941 INFO L93 Difference]: Finished difference Result 3713 states and 5708 transitions. [2023-11-29 02:29:20,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 02:29:20,942 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 104 [2023-11-29 02:29:20,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:29:20,961 INFO L225 Difference]: With dead ends: 3713 [2023-11-29 02:29:20,961 INFO L226 Difference]: Without dead ends: 1978 [2023-11-29 02:29:20,979 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2023-11-29 02:29:20,980 INFO L413 NwaCegarLoop]: 555 mSDtfsCounter, 2525 mSDsluCounter, 1785 mSDsCounter, 0 mSdLazyCounter, 4847 mSolverCounterSat, 1610 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2682 SdHoareTripleChecker+Valid, 2340 SdHoareTripleChecker+Invalid, 6457 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1610 IncrementalHoareTripleChecker+Valid, 4847 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2023-11-29 02:29:20,980 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2682 Valid, 2340 Invalid, 6457 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1610 Valid, 4847 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2023-11-29 02:29:20,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1978 states. [2023-11-29 02:29:21,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1978 to 1779. [2023-11-29 02:29:21,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1779 states, 1126 states have (on average 1.330373001776199) internal successors, (1498), 1170 states have internal predecessors, (1498), 490 states have call successors, (490), 139 states have call predecessors, (490), 139 states have return successors, (570), 476 states have call predecessors, (570), 488 states have call successors, (570) [2023-11-29 02:29:21,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2558 transitions. [2023-11-29 02:29:21,256 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2558 transitions. Word has length 104 [2023-11-29 02:29:21,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:29:21,257 INFO L495 AbstractCegarLoop]: Abstraction has 1779 states and 2558 transitions. [2023-11-29 02:29:21,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 6.0) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2023-11-29 02:29:21,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2558 transitions. [2023-11-29 02:29:21,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-29 02:29:21,261 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:29:21,261 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:29:21,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 02:29:21,261 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2023-11-29 02:29:21,262 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:21,262 INFO L85 PathProgramCache]: Analyzing trace with hash 906037786, now seen corresponding path program 1 times [2023-11-29 02:29:21,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:21,262 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712202384] [2023-11-29 02:29:21,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:21,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:21,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:22,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:29:22,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:22,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 02:29:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:22,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 02:29:22,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:22,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 02:29:22,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:22,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:29:22,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:22,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 02:29:22,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:22,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 02:29:22,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:22,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:29:22,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:22,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 02:29:22,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:22,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:29:22,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:22,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 02:29:22,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:22,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 02:29:22,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:22,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:29:22,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:22,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:29:22,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:22,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:29:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:22,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 02:29:22,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:22,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 02:29:22,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:22,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2023-11-29 02:29:22,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:22,341 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-11-29 02:29:22,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:29:22,341 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712202384] [2023-11-29 02:29:22,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1712202384] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:22,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:22,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 02:29:22,342 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643654327] [2023-11-29 02:29:22,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:22,343 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 02:29:22,343 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:29:22,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 02:29:22,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:29:22,344 INFO L87 Difference]: Start difference. First operand 1779 states and 2558 transitions. Second operand has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (20), 5 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 02:29:31,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:29:31,567 INFO L93 Difference]: Finished difference Result 3779 states and 5714 transitions. [2023-11-29 02:29:31,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 02:29:31,568 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (20), 5 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) Word has length 102 [2023-11-29 02:29:31,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:29:31,590 INFO L225 Difference]: With dead ends: 3779 [2023-11-29 02:29:31,591 INFO L226 Difference]: Without dead ends: 2081 [2023-11-29 02:29:31,605 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2023-11-29 02:29:31,606 INFO L413 NwaCegarLoop]: 562 mSDtfsCounter, 1897 mSDsluCounter, 1938 mSDsCounter, 0 mSdLazyCounter, 4949 mSolverCounterSat, 1683 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1897 SdHoareTripleChecker+Valid, 2500 SdHoareTripleChecker+Invalid, 6632 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1683 IncrementalHoareTripleChecker+Valid, 4949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2023-11-29 02:29:31,606 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1897 Valid, 2500 Invalid, 6632 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1683 Valid, 4949 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2023-11-29 02:29:31,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2081 states. [2023-11-29 02:29:31,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2081 to 1823. [2023-11-29 02:29:31,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1823 states, 1156 states have (on average 1.3269896193771626) internal successors, (1534), 1201 states have internal predecessors, (1534), 493 states have call successors, (493), 139 states have call predecessors, (493), 150 states have return successors, (605), 489 states have call predecessors, (605), 491 states have call successors, (605) [2023-11-29 02:29:31,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1823 states to 1823 states and 2632 transitions. [2023-11-29 02:29:31,928 INFO L78 Accepts]: Start accepts. Automaton has 1823 states and 2632 transitions. Word has length 102 [2023-11-29 02:29:31,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:29:31,929 INFO L495 AbstractCegarLoop]: Abstraction has 1823 states and 2632 transitions. [2023-11-29 02:29:31,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.444444444444445) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (20), 5 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2023-11-29 02:29:31,930 INFO L276 IsEmpty]: Start isEmpty. Operand 1823 states and 2632 transitions. [2023-11-29 02:29:31,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-11-29 02:29:31,933 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:29:31,933 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2023-11-29 02:29:31,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 02:29:31,933 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2023-11-29 02:29:31,933 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:31,934 INFO L85 PathProgramCache]: Analyzing trace with hash 820993537, now seen corresponding path program 1 times [2023-11-29 02:29:31,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:31,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879051931] [2023-11-29 02:29:31,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:31,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:32,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:32,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:29:32,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:32,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 02:29:32,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:32,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 02:29:32,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:32,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 02:29:32,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:32,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:29:32,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:32,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 02:29:32,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:32,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 02:29:32,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:32,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:29:32,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:32,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 02:29:32,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:32,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:29:32,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:32,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:29:32,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:32,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 02:29:32,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:32,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 02:29:32,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:32,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 02:29:32,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:32,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 02:29:32,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:32,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 02:29:32,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:32,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 02:29:32,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:32,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 02:29:32,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:32,531 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 02:29:32,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:29:32,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879051931] [2023-11-29 02:29:32,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879051931] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:32,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:32,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:29:32,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062397795] [2023-11-29 02:29:32,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:32,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:29:32,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:29:32,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:29:32,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:29:32,535 INFO L87 Difference]: Start difference. First operand 1823 states and 2632 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, (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) [2023-11-29 02:29:36,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:29:36,583 INFO L93 Difference]: Finished difference Result 1823 states and 2632 transitions. [2023-11-29 02:29:36,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:29:36,584 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, (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 97 [2023-11-29 02:29:36,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:29:36,601 INFO L225 Difference]: With dead ends: 1823 [2023-11-29 02:29:36,601 INFO L226 Difference]: Without dead ends: 1821 [2023-11-29 02:29:36,602 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 [2023-11-29 02:29:36,603 INFO L413 NwaCegarLoop]: 554 mSDtfsCounter, 1952 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 2182 mSolverCounterSat, 1018 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2086 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 3200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1018 IncrementalHoareTripleChecker+Valid, 2182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-11-29 02:29:36,604 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2086 Valid, 1452 Invalid, 3200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1018 Valid, 2182 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2023-11-29 02:29:36,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1821 states. [2023-11-29 02:29:36,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1821 to 1821. [2023-11-29 02:29:36,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1821 states, 1155 states have (on average 1.3264069264069265) internal successors, (1532), 1199 states have internal predecessors, (1532), 493 states have call successors, (493), 139 states have call predecessors, (493), 150 states have return successors, (605), 489 states have call predecessors, (605), 491 states have call successors, (605) [2023-11-29 02:29:36,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1821 states to 1821 states and 2630 transitions. [2023-11-29 02:29:36,889 INFO L78 Accepts]: Start accepts. Automaton has 1821 states and 2630 transitions. Word has length 97 [2023-11-29 02:29:36,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:29:36,890 INFO L495 AbstractCegarLoop]: Abstraction has 1821 states and 2630 transitions. [2023-11-29 02:29:36,890 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, (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) [2023-11-29 02:29:36,890 INFO L276 IsEmpty]: Start isEmpty. Operand 1821 states and 2630 transitions. [2023-11-29 02:29:36,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2023-11-29 02:29:36,892 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:29:36,892 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:29:36,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 02:29:36,893 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2023-11-29 02:29:36,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:36,893 INFO L85 PathProgramCache]: Analyzing trace with hash 192422046, now seen corresponding path program 1 times [2023-11-29 02:29:36,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:36,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212042890] [2023-11-29 02:29:36,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:36,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:37,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:37,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:29:37,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:37,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 02:29:37,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:37,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 02:29:37,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:37,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 02:29:37,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:37,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:29:37,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:37,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 02:29:37,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:37,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 02:29:37,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:37,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:29:37,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:37,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 02:29:37,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:37,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:29:37,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:37,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 02:29:37,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:37,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 02:29:37,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:37,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:29:37,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:37,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:29:37,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:37,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:29:37,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:37,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 02:29:37,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:37,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 02:29:37,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:37,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2023-11-29 02:29:37,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:37,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:29:37,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:37,345 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2023-11-29 02:29:37,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:29:37,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212042890] [2023-11-29 02:29:37,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212042890] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:37,346 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:37,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:29:37,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122479171] [2023-11-29 02:29:37,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:37,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:29:37,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:29:37,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:29:37,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:29:37,348 INFO L87 Difference]: Start difference. First operand 1821 states and 2630 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-29 02:29:41,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:29:41,903 INFO L93 Difference]: Finished difference Result 3779 states and 5858 transitions. [2023-11-29 02:29:41,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:29:41,904 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 110 [2023-11-29 02:29:41,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:29:41,919 INFO L225 Difference]: With dead ends: 3779 [2023-11-29 02:29:41,919 INFO L226 Difference]: Without dead ends: 2008 [2023-11-29 02:29:41,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-29 02:29:41,931 INFO L413 NwaCegarLoop]: 557 mSDtfsCounter, 2496 mSDsluCounter, 729 mSDsCounter, 0 mSdLazyCounter, 1794 mSolverCounterSat, 1615 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2651 SdHoareTripleChecker+Valid, 1286 SdHoareTripleChecker+Invalid, 3409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1615 IncrementalHoareTripleChecker+Valid, 1794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:29:41,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2651 Valid, 1286 Invalid, 3409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1615 Valid, 1794 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2023-11-29 02:29:41,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2008 states. [2023-11-29 02:29:42,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2008 to 1815. [2023-11-29 02:29:42,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1815 states, 1150 states have (on average 1.3243478260869566) internal successors, (1523), 1193 states have internal predecessors, (1523), 493 states have call successors, (493), 139 states have call predecessors, (493), 150 states have return successors, (605), 489 states have call predecessors, (605), 491 states have call successors, (605) [2023-11-29 02:29:42,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1815 states to 1815 states and 2621 transitions. [2023-11-29 02:29:42,177 INFO L78 Accepts]: Start accepts. Automaton has 1815 states and 2621 transitions. Word has length 110 [2023-11-29 02:29:42,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:29:42,178 INFO L495 AbstractCegarLoop]: Abstraction has 1815 states and 2621 transitions. [2023-11-29 02:29:42,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 3 states have internal predecessors, (52), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2023-11-29 02:29:42,178 INFO L276 IsEmpty]: Start isEmpty. Operand 1815 states and 2621 transitions. [2023-11-29 02:29:42,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2023-11-29 02:29:42,180 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:29:42,181 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2023-11-29 02:29:42,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 02:29:42,181 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2023-11-29 02:29:42,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:42,181 INFO L85 PathProgramCache]: Analyzing trace with hash 884806824, now seen corresponding path program 1 times [2023-11-29 02:29:42,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:42,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [721904737] [2023-11-29 02:29:42,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:42,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:42,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:42,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:29:42,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:42,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 02:29:42,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:42,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 02:29:42,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:42,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 02:29:42,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:42,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:29:42,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:42,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 02:29:42,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:42,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 02:29:42,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:42,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:29:42,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:42,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 02:29:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:42,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:29:42,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:42,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:29:42,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:42,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 02:29:42,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:42,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 02:29:42,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:42,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 02:29:42,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:42,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 02:29:42,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:42,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 02:29:42,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:42,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 02:29:42,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:42,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 02:29:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:42,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 02:29:42,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:42,607 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 02:29:42,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:29:42,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [721904737] [2023-11-29 02:29:42,607 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [721904737] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:42,607 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:42,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:29:42,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1361250223] [2023-11-29 02:29:42,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:42,608 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:29:42,608 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:29:42,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:29:42,609 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:29:42,609 INFO L87 Difference]: Start difference. First operand 1815 states and 2621 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 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) [2023-11-29 02:29:46,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:29:46,294 INFO L93 Difference]: Finished difference Result 1815 states and 2621 transitions. [2023-11-29 02:29:46,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:29:46,295 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 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 102 [2023-11-29 02:29:46,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:29:46,306 INFO L225 Difference]: With dead ends: 1815 [2023-11-29 02:29:46,306 INFO L226 Difference]: Without dead ends: 1813 [2023-11-29 02:29:46,307 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 [2023-11-29 02:29:46,308 INFO L413 NwaCegarLoop]: 554 mSDtfsCounter, 1931 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 2168 mSolverCounterSat, 1018 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2064 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 3186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1018 IncrementalHoareTripleChecker+Valid, 2168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:29:46,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2064 Valid, 1452 Invalid, 3186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1018 Valid, 2168 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-11-29 02:29:46,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1813 states. [2023-11-29 02:29:46,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1813 to 1813. [2023-11-29 02:29:46,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1813 states, 1149 states have (on average 1.3237597911227155) internal successors, (1521), 1191 states have internal predecessors, (1521), 493 states have call successors, (493), 139 states have call predecessors, (493), 150 states have return successors, (605), 489 states have call predecessors, (605), 491 states have call successors, (605) [2023-11-29 02:29:46,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1813 states to 1813 states and 2619 transitions. [2023-11-29 02:29:46,532 INFO L78 Accepts]: Start accepts. Automaton has 1813 states and 2619 transitions. Word has length 102 [2023-11-29 02:29:46,532 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:29:46,532 INFO L495 AbstractCegarLoop]: Abstraction has 1813 states and 2619 transitions. [2023-11-29 02:29:46,532 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 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) [2023-11-29 02:29:46,533 INFO L276 IsEmpty]: Start isEmpty. Operand 1813 states and 2619 transitions. [2023-11-29 02:29:46,535 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-29 02:29:46,535 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:29:46,536 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2023-11-29 02:29:46,536 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 02:29:46,536 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_usb_dev_usb_put_devErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2023-11-29 02:29:46,536 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:46,537 INFO L85 PathProgramCache]: Analyzing trace with hash -166888623, now seen corresponding path program 1 times [2023-11-29 02:29:46,537 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:46,537 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032319931] [2023-11-29 02:29:46,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:46,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:46,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:47,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:29:47,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:47,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 02:29:47,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:47,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 02:29:47,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:47,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 02:29:47,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:47,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 02:29:47,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:47,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:29:47,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:47,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:29:47,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:47,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:29:47,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:47,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 02:29:47,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:47,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:29:47,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:47,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:29:47,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:47,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:29:47,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:47,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 02:29:47,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:47,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:29:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:47,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:29:47,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:47,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:29:47,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:47,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 02:29:47,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:47,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:29:47,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:47,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:29:47,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:47,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:29:47,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:47,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 02:29:47,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:47,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:29:47,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:47,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:29:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:47,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:29:47,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:47,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 02:29:47,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:47,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 02:29:47,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:47,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 02:29:47,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:29:47,482 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2023-11-29 02:29:47,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:29:47,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032319931] [2023-11-29 02:29:47,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032319931] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:29:47,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:29:47,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 02:29:47,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402805424] [2023-11-29 02:29:47,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:29:47,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 02:29:47,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:29:47,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 02:29:47,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:29:47,485 INFO L87 Difference]: Start difference. First operand 1813 states and 2619 transitions. Second operand has 8 states, 8 states have (on average 4.625) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2023-11-29 02:29:58,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:29:58,588 INFO L93 Difference]: Finished difference Result 5725 states and 9227 transitions. [2023-11-29 02:29:58,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 02:29:58,589 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 131 [2023-11-29 02:29:58,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:29:58,619 INFO L225 Difference]: With dead ends: 5725 [2023-11-29 02:29:58,620 INFO L226 Difference]: Without dead ends: 3977 [2023-11-29 02:29:58,631 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=223, Unknown=0, NotChecked=0, Total=306 [2023-11-29 02:29:58,632 INFO L413 NwaCegarLoop]: 1113 mSDtfsCounter, 4963 mSDsluCounter, 2641 mSDsCounter, 0 mSdLazyCounter, 7977 mSolverCounterSat, 3510 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5148 SdHoareTripleChecker+Valid, 3754 SdHoareTripleChecker+Invalid, 11487 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3510 IncrementalHoareTripleChecker+Valid, 7977 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:29:58,632 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5148 Valid, 3754 Invalid, 11487 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3510 Valid, 7977 Invalid, 0 Unknown, 0 Unchecked, 10.3s Time] [2023-11-29 02:29:58,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3977 states. [2023-11-29 02:29:59,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3977 to 3558. [2023-11-29 02:29:59,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3558 states, 2271 states have (on average 1.3280493174812857) internal successors, (3016), 2339 states have internal predecessors, (3016), 965 states have call successors, (965), 250 states have call predecessors, (965), 301 states have return successors, (1575), 980 states have call predecessors, (1575), 963 states have call successors, (1575) [2023-11-29 02:29:59,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3558 states to 3558 states and 5556 transitions. [2023-11-29 02:29:59,070 INFO L78 Accepts]: Start accepts. Automaton has 3558 states and 5556 transitions. Word has length 131 [2023-11-29 02:29:59,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:29:59,070 INFO L495 AbstractCegarLoop]: Abstraction has 3558 states and 5556 transitions. [2023-11-29 02:29:59,071 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.625) internal successors, (37), 5 states have internal predecessors, (37), 3 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2023-11-29 02:29:59,071 INFO L276 IsEmpty]: Start isEmpty. Operand 3558 states and 5556 transitions. [2023-11-29 02:29:59,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2023-11-29 02:29:59,074 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:29:59,074 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2023-11-29 02:29:59,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 02:29:59,074 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_usb_dev_usb_put_devErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2023-11-29 02:29:59,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:29:59,075 INFO L85 PathProgramCache]: Analyzing trace with hash -1178005873, now seen corresponding path program 1 times [2023-11-29 02:29:59,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:29:59,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1327058225] [2023-11-29 02:29:59,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:29:59,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:29:59,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:00,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:30:00,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:00,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 02:30:00,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:00,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 02:30:00,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:00,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 02:30:00,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:00,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 02:30:00,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:00,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:30:00,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:00,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:30:00,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:00,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:30:00,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:00,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 02:30:00,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:00,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:30:00,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:00,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:30:00,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:00,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:30:00,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:00,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 02:30:00,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:00,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:30:00,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:00,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:30:00,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:00,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:30:00,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:00,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 02:30:00,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:00,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:30:00,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:00,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:30:00,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:00,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:30:00,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:00,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 02:30:00,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:00,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:30:00,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:00,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:30:00,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:00,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:30:00,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:00,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 02:30:00,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:00,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 02:30:00,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:00,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 02:30:00,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:00,729 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2023-11-29 02:30:00,729 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:30:00,729 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1327058225] [2023-11-29 02:30:00,729 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1327058225] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:30:00,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:30:00,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 02:30:00,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992114436] [2023-11-29 02:30:00,730 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:30:00,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 02:30:00,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:30:00,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 02:30:00,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2023-11-29 02:30:00,732 INFO L87 Difference]: Start difference. First operand 3558 states and 5556 transitions. Second operand has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-29 02:30:12,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:30:12,995 INFO L93 Difference]: Finished difference Result 5672 states and 8802 transitions. [2023-11-29 02:30:12,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 02:30:12,996 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (16), 5 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 131 [2023-11-29 02:30:12,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:30:13,024 INFO L225 Difference]: With dead ends: 5672 [2023-11-29 02:30:13,025 INFO L226 Difference]: Without dead ends: 3809 [2023-11-29 02:30:13,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=74, Invalid=232, Unknown=0, NotChecked=0, Total=306 [2023-11-29 02:30:13,034 INFO L413 NwaCegarLoop]: 632 mSDtfsCounter, 1525 mSDsluCounter, 3061 mSDsCounter, 0 mSdLazyCounter, 6862 mSolverCounterSat, 1297 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1550 SdHoareTripleChecker+Valid, 3693 SdHoareTripleChecker+Invalid, 8159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1297 IncrementalHoareTripleChecker+Valid, 6862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.4s IncrementalHoareTripleChecker+Time [2023-11-29 02:30:13,034 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1550 Valid, 3693 Invalid, 8159 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1297 Valid, 6862 Invalid, 0 Unknown, 0 Unchecked, 11.4s Time] [2023-11-29 02:30:13,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3809 states. [2023-11-29 02:30:13,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3809 to 3566. [2023-11-29 02:30:13,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3566 states, 2276 states have (on average 1.327328646748682) internal successors, (3021), 2346 states have internal predecessors, (3021), 965 states have call successors, (965), 251 states have call predecessors, (965), 304 states have return successors, (1578), 980 states have call predecessors, (1578), 963 states have call successors, (1578) [2023-11-29 02:30:13,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3566 states to 3566 states and 5564 transitions. [2023-11-29 02:30:13,537 INFO L78 Accepts]: Start accepts. Automaton has 3566 states and 5564 transitions. Word has length 131 [2023-11-29 02:30:13,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:30:13,538 INFO L495 AbstractCegarLoop]: Abstraction has 3566 states and 5564 transitions. [2023-11-29 02:30:13,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.111111111111111) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2023-11-29 02:30:13,538 INFO L276 IsEmpty]: Start isEmpty. Operand 3566 states and 5564 transitions. [2023-11-29 02:30:13,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2023-11-29 02:30:13,540 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:30:13,541 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2023-11-29 02:30:13,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 02:30:13,541 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_usb_dev_usb_put_devErr1ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2023-11-29 02:30:13,541 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:30:13,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1466013164, now seen corresponding path program 1 times [2023-11-29 02:30:13,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:30:13,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095924123] [2023-11-29 02:30:13,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:30:13,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:30:13,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:14,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:30:14,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:14,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 02:30:14,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:14,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 02:30:14,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:14,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 02:30:14,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:14,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 02:30:14,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:14,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:30:14,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:14,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:30:14,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:14,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:30:14,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:14,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 02:30:14,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:14,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:30:14,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:14,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:30:14,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:14,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:30:14,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:14,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 02:30:14,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:14,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:30:14,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:14,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:30:14,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:14,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:30:14,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:14,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 02:30:14,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:14,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:30:14,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:14,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:30:14,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:14,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:30:14,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:14,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 02:30:14,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:14,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:30:14,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:14,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:30:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:14,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:30:14,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:14,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 02:30:14,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:14,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 02:30:14,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:14,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 02:30:14,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:14,324 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2023-11-29 02:30:14,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:30:14,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095924123] [2023-11-29 02:30:14,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095924123] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:30:14,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:30:14,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 02:30:14,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174259780] [2023-11-29 02:30:14,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:30:14,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 02:30:14,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:30:14,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 02:30:14,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:30:14,326 INFO L87 Difference]: Start difference. First operand 3566 states and 5564 transitions. Second operand has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2023-11-29 02:30:26,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:30:26,322 INFO L93 Difference]: Finished difference Result 3985 states and 6207 transitions. [2023-11-29 02:30:26,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 02:30:26,323 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 133 [2023-11-29 02:30:26,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:30:26,340 INFO L225 Difference]: With dead ends: 3985 [2023-11-29 02:30:26,340 INFO L226 Difference]: Without dead ends: 3983 [2023-11-29 02:30:26,342 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=251, Unknown=0, NotChecked=0, Total=342 [2023-11-29 02:30:26,343 INFO L413 NwaCegarLoop]: 1109 mSDtfsCounter, 4951 mSDsluCounter, 2890 mSDsCounter, 0 mSdLazyCounter, 9180 mSolverCounterSat, 3489 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5137 SdHoareTripleChecker+Valid, 3999 SdHoareTripleChecker+Invalid, 12669 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3489 IncrementalHoareTripleChecker+Valid, 9180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:30:26,343 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5137 Valid, 3999 Invalid, 12669 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3489 Valid, 9180 Invalid, 0 Unknown, 0 Unchecked, 11.1s Time] [2023-11-29 02:30:26,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3983 states. [2023-11-29 02:30:26,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3983 to 3570. [2023-11-29 02:30:26,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3570 states, 2280 states have (on average 1.3267543859649122) internal successors, (3025), 2350 states have internal predecessors, (3025), 965 states have call successors, (965), 251 states have call predecessors, (965), 304 states have return successors, (1578), 980 states have call predecessors, (1578), 963 states have call successors, (1578) [2023-11-29 02:30:26,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3570 states to 3570 states and 5568 transitions. [2023-11-29 02:30:26,848 INFO L78 Accepts]: Start accepts. Automaton has 3570 states and 5568 transitions. Word has length 133 [2023-11-29 02:30:26,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:30:26,849 INFO L495 AbstractCegarLoop]: Abstraction has 3570 states and 5568 transitions. [2023-11-29 02:30:26,849 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.333333333333333) internal successors, (39), 6 states have internal predecessors, (39), 3 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2023-11-29 02:30:26,849 INFO L276 IsEmpty]: Start isEmpty. Operand 3570 states and 5568 transitions. [2023-11-29 02:30:26,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2023-11-29 02:30:26,853 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:30:26,853 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2023-11-29 02:30:26,853 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 02:30:26,853 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2023-11-29 02:30:26,854 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:30:26,854 INFO L85 PathProgramCache]: Analyzing trace with hash -2119486259, now seen corresponding path program 1 times [2023-11-29 02:30:26,854 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:30:26,854 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600503961] [2023-11-29 02:30:26,854 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:30:26,855 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:30:27,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:27,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:30:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:27,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 02:30:27,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:27,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 02:30:27,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:27,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 02:30:27,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:27,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:30:27,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:27,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 02:30:27,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:27,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 02:30:27,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:27,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:30:27,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:27,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 02:30:27,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:27,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:30:27,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:27,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:30:27,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:27,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 02:30:27,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:27,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 02:30:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:27,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 02:30:27,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:27,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 02:30:27,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:27,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 02:30:27,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:27,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 02:30:27,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:27,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 02:30:27,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:27,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 02:30:27,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:27,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 02:30:27,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:27,500 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 02:30:27,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:30:27,500 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600503961] [2023-11-29 02:30:27,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600503961] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:30:27,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:30:27,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:30:27,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238381881] [2023-11-29 02:30:27,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:30:27,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:30:27,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:30:27,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:30:27,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:30:27,503 INFO L87 Difference]: Start difference. First operand 3570 states and 5568 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, (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) [2023-11-29 02:30:32,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:30:32,348 INFO L93 Difference]: Finished difference Result 3570 states and 5568 transitions. [2023-11-29 02:30:32,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:30:32,348 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, (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 107 [2023-11-29 02:30:32,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:30:32,363 INFO L225 Difference]: With dead ends: 3570 [2023-11-29 02:30:32,363 INFO L226 Difference]: Without dead ends: 3568 [2023-11-29 02:30:32,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-29 02:30:32,366 INFO L413 NwaCegarLoop]: 554 mSDtfsCounter, 1922 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 2162 mSolverCounterSat, 1018 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2054 SdHoareTripleChecker+Valid, 1452 SdHoareTripleChecker+Invalid, 3180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1018 IncrementalHoareTripleChecker+Valid, 2162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:30:32,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2054 Valid, 1452 Invalid, 3180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1018 Valid, 2162 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2023-11-29 02:30:32,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3568 states. [2023-11-29 02:30:32,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3568 to 3568. [2023-11-29 02:30:32,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3568 states, 2279 states have (on average 1.3264589732338745) internal successors, (3023), 2348 states have internal predecessors, (3023), 965 states have call successors, (965), 251 states have call predecessors, (965), 304 states have return successors, (1578), 980 states have call predecessors, (1578), 963 states have call successors, (1578) [2023-11-29 02:30:32,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3568 states to 3568 states and 5566 transitions. [2023-11-29 02:30:32,904 INFO L78 Accepts]: Start accepts. Automaton has 3568 states and 5566 transitions. Word has length 107 [2023-11-29 02:30:32,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:30:32,904 INFO L495 AbstractCegarLoop]: Abstraction has 3568 states and 5566 transitions. [2023-11-29 02:30:32,904 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, (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) [2023-11-29 02:30:32,905 INFO L276 IsEmpty]: Start isEmpty. Operand 3568 states and 5566 transitions. [2023-11-29 02:30:32,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2023-11-29 02:30:32,908 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:30:32,908 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2023-11-29 02:30:32,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 02:30:32,908 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2023-11-29 02:30:32,908 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:30:32,909 INFO L85 PathProgramCache]: Analyzing trace with hash -1456797535, now seen corresponding path program 1 times [2023-11-29 02:30:32,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:30:32,909 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993665809] [2023-11-29 02:30:32,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:30:32,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:30:33,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:33,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:30:33,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:33,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 02:30:33,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:33,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 02:30:33,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:33,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 02:30:33,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:33,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 02:30:33,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:33,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:30:33,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:33,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:30:33,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:33,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:30:33,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:33,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 02:30:33,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:33,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:30:33,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:33,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:30:33,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:33,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:30:33,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:33,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 02:30:33,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:33,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:30:33,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:33,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:30:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:33,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:30:33,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:33,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 02:30:33,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:33,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:30:33,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:33,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:30:33,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:33,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:30:33,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:33,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 02:30:33,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:33,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:30:33,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:33,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:30:33,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:33,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:30:33,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:33,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 02:30:33,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:33,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 02:30:33,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:33,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 02:30:33,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:33,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-29 02:30:33,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:33,351 INFO L134 CoverageAnalysis]: Checked inductivity of 290 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2023-11-29 02:30:33,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:30:33,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993665809] [2023-11-29 02:30:33,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993665809] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:30:33,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:30:33,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 02:30:33,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1286350933] [2023-11-29 02:30:33,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:30:33,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:30:33,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:30:33,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:30:33,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:30:33,354 INFO L87 Difference]: Start difference. First operand 3568 states and 5566 transitions. Second operand has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 02:30:39,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:30:39,479 INFO L93 Difference]: Finished difference Result 7367 states and 11747 transitions. [2023-11-29 02:30:39,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 02:30:39,480 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 136 [2023-11-29 02:30:39,481 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:30:39,508 INFO L225 Difference]: With dead ends: 7367 [2023-11-29 02:30:39,508 INFO L226 Difference]: Without dead ends: 4000 [2023-11-29 02:30:39,528 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2023-11-29 02:30:39,529 INFO L413 NwaCegarLoop]: 397 mSDtfsCounter, 3410 mSDsluCounter, 956 mSDsCounter, 0 mSdLazyCounter, 2335 mSolverCounterSat, 2317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3617 SdHoareTripleChecker+Valid, 1353 SdHoareTripleChecker+Invalid, 4652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2317 IncrementalHoareTripleChecker+Valid, 2335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:30:39,529 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3617 Valid, 1353 Invalid, 4652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2317 Valid, 2335 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2023-11-29 02:30:39,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4000 states. [2023-11-29 02:30:40,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4000 to 3614. [2023-11-29 02:30:40,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3614 states, 2339 states have (on average 1.327917913638307) internal successors, (3106), 2390 states have internal predecessors, (3106), 943 states have call successors, (943), 251 states have call predecessors, (943), 313 states have return successors, (1672), 986 states have call predecessors, (1672), 941 states have call successors, (1672) [2023-11-29 02:30:40,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3614 states to 3614 states and 5721 transitions. [2023-11-29 02:30:40,113 INFO L78 Accepts]: Start accepts. Automaton has 3614 states and 5721 transitions. Word has length 136 [2023-11-29 02:30:40,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:30:40,114 INFO L495 AbstractCegarLoop]: Abstraction has 3614 states and 5721 transitions. [2023-11-29 02:30:40,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.857142857142857) internal successors, (41), 3 states have internal predecessors, (41), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2023-11-29 02:30:40,114 INFO L276 IsEmpty]: Start isEmpty. Operand 3614 states and 5721 transitions. [2023-11-29 02:30:40,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2023-11-29 02:30:40,118 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:30:40,118 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2023-11-29 02:30:40,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 02:30:40,118 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2023-11-29 02:30:40,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:30:40,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1491444202, now seen corresponding path program 1 times [2023-11-29 02:30:40,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:30:40,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [812250971] [2023-11-29 02:30:40,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:30:40,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:30:40,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:40,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:30:40,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:40,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 02:30:40,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:40,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 02:30:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:40,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 02:30:40,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:40,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:30:40,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:40,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 02:30:40,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:40,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 02:30:40,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:40,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:30:40,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:40,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 02:30:40,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:40,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:30:40,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:40,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:30:40,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:40,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 02:30:40,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:40,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 02:30:40,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:40,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 02:30:40,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:40,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 02:30:40,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:40,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 02:30:40,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:40,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 02:30:40,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:40,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 02:30:40,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:40,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 02:30:40,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:40,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 02:30:40,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:40,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-29 02:30:40,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:40,662 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 02:30:40,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:30:40,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [812250971] [2023-11-29 02:30:40,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [812250971] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:30:40,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:30:40,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:30:40,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934610347] [2023-11-29 02:30:40,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:30:40,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:30:40,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:30:40,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:30:40,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:30:40,665 INFO L87 Difference]: Start difference. First operand 3614 states and 5721 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (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) [2023-11-29 02:30:44,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:30:44,828 INFO L93 Difference]: Finished difference Result 3614 states and 5721 transitions. [2023-11-29 02:30:44,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:30:44,828 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (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 112 [2023-11-29 02:30:44,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:30:44,842 INFO L225 Difference]: With dead ends: 3614 [2023-11-29 02:30:44,842 INFO L226 Difference]: Without dead ends: 3612 [2023-11-29 02:30:44,844 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 [2023-11-29 02:30:44,845 INFO L413 NwaCegarLoop]: 549 mSDtfsCounter, 1911 mSDsluCounter, 884 mSDsCounter, 0 mSdLazyCounter, 2157 mSolverCounterSat, 1018 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2042 SdHoareTripleChecker+Valid, 1433 SdHoareTripleChecker+Invalid, 3175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1018 IncrementalHoareTripleChecker+Valid, 2157 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2023-11-29 02:30:44,845 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2042 Valid, 1433 Invalid, 3175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1018 Valid, 2157 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2023-11-29 02:30:44,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3612 states. [2023-11-29 02:30:45,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3612 to 3612. [2023-11-29 02:30:45,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3612 states, 2338 states have (on average 1.3276304533789565) internal successors, (3104), 2388 states have internal predecessors, (3104), 943 states have call successors, (943), 251 states have call predecessors, (943), 313 states have return successors, (1672), 986 states have call predecessors, (1672), 941 states have call successors, (1672) [2023-11-29 02:30:45,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3612 states to 3612 states and 5719 transitions. [2023-11-29 02:30:45,372 INFO L78 Accepts]: Start accepts. Automaton has 3612 states and 5719 transitions. Word has length 112 [2023-11-29 02:30:45,373 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:30:45,373 INFO L495 AbstractCegarLoop]: Abstraction has 3612 states and 5719 transitions. [2023-11-29 02:30:45,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (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) [2023-11-29 02:30:45,373 INFO L276 IsEmpty]: Start isEmpty. Operand 3612 states and 5719 transitions. [2023-11-29 02:30:45,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2023-11-29 02:30:45,377 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:30:45,377 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:30:45,377 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 02:30:45,377 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2023-11-29 02:30:45,377 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:30:45,377 INFO L85 PathProgramCache]: Analyzing trace with hash -354629118, now seen corresponding path program 1 times [2023-11-29 02:30:45,378 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:30:45,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44616919] [2023-11-29 02:30:45,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:30:45,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:30:45,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:45,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:30:45,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:45,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 02:30:45,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:45,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 02:30:45,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:45,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 02:30:45,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:45,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 02:30:45,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:45,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:30:45,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:45,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:30:45,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:45,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:30:45,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:45,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 02:30:45,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:45,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:30:45,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:45,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:30:45,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:45,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:30:45,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:45,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 02:30:45,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:45,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:30:45,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:45,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:30:45,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:45,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:30:45,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:45,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 02:30:45,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:45,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:30:45,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:45,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:30:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:45,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:30:45,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:45,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 02:30:45,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:45,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:30:45,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:45,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:30:45,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:45,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:30:45,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:45,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 02:30:45,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:45,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 02:30:45,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:45,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 02:30:45,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:45,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-29 02:30:45,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:45,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-29 02:30:45,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:46,008 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 291 trivial. 0 not checked. [2023-11-29 02:30:46,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:30:46,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44616919] [2023-11-29 02:30:46,009 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44616919] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:30:46,009 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [985038204] [2023-11-29 02:30:46,009 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:30:46,010 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:30:46,010 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:30:46,012 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:30:46,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 02:30:46,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:46,917 INFO L262 TraceCheckSpWp]: Trace formula consists of 2007 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 02:30:46,933 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:30:47,015 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 290 trivial. 0 not checked. [2023-11-29 02:30:47,015 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:30:47,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [985038204] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:30:47,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 02:30:47,015 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2023-11-29 02:30:47,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511989764] [2023-11-29 02:30:47,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:30:47,017 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:30:47,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:30:47,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:30:47,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:30:47,018 INFO L87 Difference]: Start difference. First operand 3612 states and 5719 transitions. Second operand has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-29 02:30:48,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:30:48,175 INFO L93 Difference]: Finished difference Result 7060 states and 11142 transitions. [2023-11-29 02:30:48,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:30:48,176 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 141 [2023-11-29 02:30:48,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:30:48,191 INFO L225 Difference]: With dead ends: 7060 [2023-11-29 02:30:48,192 INFO L226 Difference]: Without dead ends: 3661 [2023-11-29 02:30:48,204 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:30:48,205 INFO L413 NwaCegarLoop]: 1259 mSDtfsCounter, 1307 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1307 SdHoareTripleChecker+Valid, 1324 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 02:30:48,205 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1307 Valid, 1324 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 02:30:48,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3661 states. [2023-11-29 02:30:48,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3661 to 3658. [2023-11-29 02:30:48,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3658 states, 2359 states have (on average 1.3230182280627385) internal successors, (3121), 2412 states have internal predecessors, (3121), 962 states have call successors, (962), 258 states have call predecessors, (962), 320 states have return successors, (1691), 1003 states have call predecessors, (1691), 960 states have call successors, (1691) [2023-11-29 02:30:48,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3658 states to 3658 states and 5774 transitions. [2023-11-29 02:30:48,713 INFO L78 Accepts]: Start accepts. Automaton has 3658 states and 5774 transitions. Word has length 141 [2023-11-29 02:30:48,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:30:48,713 INFO L495 AbstractCegarLoop]: Abstraction has 3658 states and 5774 transitions. [2023-11-29 02:30:48,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.666666666666666) internal successors, (44), 3 states have internal predecessors, (44), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2023-11-29 02:30:48,713 INFO L276 IsEmpty]: Start isEmpty. Operand 3658 states and 5774 transitions. [2023-11-29 02:30:48,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2023-11-29 02:30:48,717 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:30:48,718 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2023-11-29 02:30:48,731 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 02:30:48,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-29 02:30:48,918 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2023-11-29 02:30:48,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:30:48,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1642300228, now seen corresponding path program 1 times [2023-11-29 02:30:48,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:30:48,919 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403450070] [2023-11-29 02:30:48,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:30:48,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:30:49,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:49,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:30:49,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:49,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 02:30:49,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:49,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 02:30:49,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:49,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 02:30:49,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:49,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:30:49,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:49,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 02:30:49,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:49,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 02:30:49,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:49,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:30:49,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:49,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 02:30:49,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:49,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:30:49,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:49,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:30:49,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:49,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 02:30:49,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:49,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 02:30:49,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:49,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 02:30:49,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:49,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 02:30:49,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:49,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 02:30:49,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:49,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 02:30:49,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:49,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 02:30:49,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:49,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 02:30:49,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:49,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 02:30:49,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:49,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-29 02:30:49,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:49,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-29 02:30:49,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:49,345 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 02:30:49,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:30:49,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403450070] [2023-11-29 02:30:49,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403450070] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:30:49,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:30:49,345 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:30:49,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645651934] [2023-11-29 02:30:49,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:30:49,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:30:49,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:30:49,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:30:49,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:30:49,347 INFO L87 Difference]: Start difference. First operand 3658 states and 5774 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 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) [2023-11-29 02:30:53,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:30:53,064 INFO L93 Difference]: Finished difference Result 3658 states and 5774 transitions. [2023-11-29 02:30:53,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:30:53,064 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 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 117 [2023-11-29 02:30:53,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:30:53,081 INFO L225 Difference]: With dead ends: 3658 [2023-11-29 02:30:53,081 INFO L226 Difference]: Without dead ends: 3656 [2023-11-29 02:30:53,082 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 [2023-11-29 02:30:53,083 INFO L413 NwaCegarLoop]: 544 mSDtfsCounter, 1900 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 2152 mSolverCounterSat, 1018 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2030 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 3170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1018 IncrementalHoareTripleChecker+Valid, 2152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:30:53,083 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2030 Valid, 1414 Invalid, 3170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1018 Valid, 2152 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2023-11-29 02:30:53,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3656 states. [2023-11-29 02:30:53,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3656 to 3656. [2023-11-29 02:30:53,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3656 states, 2358 states have (on average 1.3227311280746394) internal successors, (3119), 2410 states have internal predecessors, (3119), 962 states have call successors, (962), 258 states have call predecessors, (962), 320 states have return successors, (1691), 1003 states have call predecessors, (1691), 960 states have call successors, (1691) [2023-11-29 02:30:53,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3656 states to 3656 states and 5772 transitions. [2023-11-29 02:30:53,797 INFO L78 Accepts]: Start accepts. Automaton has 3656 states and 5772 transitions. Word has length 117 [2023-11-29 02:30:53,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:30:53,797 INFO L495 AbstractCegarLoop]: Abstraction has 3656 states and 5772 transitions. [2023-11-29 02:30:53,797 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 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) [2023-11-29 02:30:53,797 INFO L276 IsEmpty]: Start isEmpty. Operand 3656 states and 5772 transitions. [2023-11-29 02:30:53,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2023-11-29 02:30:53,800 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:30:53,800 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 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] [2023-11-29 02:30:53,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 02:30:53,800 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting destroy_asyncErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2023-11-29 02:30:53,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:30:53,801 INFO L85 PathProgramCache]: Analyzing trace with hash 859907668, now seen corresponding path program 1 times [2023-11-29 02:30:53,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:30:53,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [500406662] [2023-11-29 02:30:53,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:30:53,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:30:53,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:54,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:30:54,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:54,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 02:30:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:54,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 02:30:54,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:54,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 02:30:54,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:54,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:30:54,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:54,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 02:30:54,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:54,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 02:30:54,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:54,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:30:54,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:54,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 02:30:54,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:54,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:30:54,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:54,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 02:30:54,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:54,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 02:30:54,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:54,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:30:54,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:54,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:30:54,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:54,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:30:54,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:54,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 02:30:54,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:54,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 02:30:54,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:54,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 02:30:54,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:54,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2023-11-29 02:30:54,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:54,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2023-11-29 02:30:54,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:54,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2023-11-29 02:30:54,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:30:54,532 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2023-11-29 02:30:54,532 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:30:54,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [500406662] [2023-11-29 02:30:54,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [500406662] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:30:54,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:30:54,533 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 02:30:54,533 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158245816] [2023-11-29 02:30:54,533 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:30:54,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 02:30:54,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:30:54,534 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 02:30:54,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:30:54,534 INFO L87 Difference]: Start difference. First operand 3656 states and 5772 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (26), 6 states have call predecessors, (26), 2 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-29 02:31:02,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:31:02,665 INFO L93 Difference]: Finished difference Result 7695 states and 13729 transitions. [2023-11-29 02:31:02,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 02:31:02,666 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (26), 6 states have call predecessors, (26), 2 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) Word has length 128 [2023-11-29 02:31:02,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:31:02,680 INFO L225 Difference]: With dead ends: 7695 [2023-11-29 02:31:02,680 INFO L226 Difference]: Without dead ends: 4200 [2023-11-29 02:31:02,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2023-11-29 02:31:02,704 INFO L413 NwaCegarLoop]: 556 mSDtfsCounter, 1843 mSDsluCounter, 1880 mSDsCounter, 0 mSdLazyCounter, 4904 mSolverCounterSat, 1719 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1843 SdHoareTripleChecker+Valid, 2436 SdHoareTripleChecker+Invalid, 6623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1719 IncrementalHoareTripleChecker+Valid, 4904 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:31:02,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1843 Valid, 2436 Invalid, 6623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1719 Valid, 4904 Invalid, 0 Unknown, 0 Unchecked, 7.0s Time] [2023-11-29 02:31:02,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4200 states. [2023-11-29 02:31:03,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4200 to 3662. [2023-11-29 02:31:03,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3662 states, 2366 states have (on average 1.319949281487743) internal successors, (3123), 2412 states have internal predecessors, (3123), 960 states have call successors, (960), 258 states have call predecessors, (960), 320 states have return successors, (1685), 1007 states have call predecessors, (1685), 958 states have call successors, (1685) [2023-11-29 02:31:03,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3662 states to 3662 states and 5768 transitions. [2023-11-29 02:31:03,246 INFO L78 Accepts]: Start accepts. Automaton has 3662 states and 5768 transitions. Word has length 128 [2023-11-29 02:31:03,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:31:03,246 INFO L495 AbstractCegarLoop]: Abstraction has 3662 states and 5768 transitions. [2023-11-29 02:31:03,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (26), 6 states have call predecessors, (26), 2 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2023-11-29 02:31:03,246 INFO L276 IsEmpty]: Start isEmpty. Operand 3662 states and 5768 transitions. [2023-11-29 02:31:03,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2023-11-29 02:31:03,250 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:31:03,250 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2023-11-29 02:31:03,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 02:31:03,250 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2023-11-29 02:31:03,251 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:31:03,251 INFO L85 PathProgramCache]: Analyzing trace with hash -89990977, now seen corresponding path program 1 times [2023-11-29 02:31:03,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:31:03,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910483370] [2023-11-29 02:31:03,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:31:03,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:31:03,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:03,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:31:03,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:03,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 02:31:03,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:03,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 02:31:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:03,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 02:31:03,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:03,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:31:03,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:03,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 02:31:03,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:03,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 02:31:03,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:03,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:31:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:03,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 02:31:03,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:03,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:31:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:03,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:31:03,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:03,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 02:31:03,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:03,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 02:31:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:03,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 02:31:03,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:03,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 02:31:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:03,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 02:31:03,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:03,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 02:31:03,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:03,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 02:31:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:03,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 02:31:03,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:03,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 02:31:03,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:03,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-29 02:31:03,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:03,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-29 02:31:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:03,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 02:31:03,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:03,710 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 02:31:03,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:31:03,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910483370] [2023-11-29 02:31:03,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910483370] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:31:03,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:31:03,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:31:03,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377640776] [2023-11-29 02:31:03,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:31:03,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:31:03,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:31:03,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:31:03,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:31:03,712 INFO L87 Difference]: Start difference. First operand 3662 states and 5768 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (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) [2023-11-29 02:31:07,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:31:07,288 INFO L93 Difference]: Finished difference Result 3662 states and 5768 transitions. [2023-11-29 02:31:07,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:31:07,289 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (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 122 [2023-11-29 02:31:07,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:31:07,302 INFO L225 Difference]: With dead ends: 3662 [2023-11-29 02:31:07,302 INFO L226 Difference]: Without dead ends: 3660 [2023-11-29 02:31:07,303 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 [2023-11-29 02:31:07,304 INFO L413 NwaCegarLoop]: 544 mSDtfsCounter, 1894 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 2148 mSolverCounterSat, 1018 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2023 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 3166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1018 IncrementalHoareTripleChecker+Valid, 2148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:31:07,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2023 Valid, 1414 Invalid, 3166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1018 Valid, 2148 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-11-29 02:31:07,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3660 states. [2023-11-29 02:31:07,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3660 to 3660. [2023-11-29 02:31:07,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3660 states, 2365 states have (on average 1.3196617336152219) internal successors, (3121), 2410 states have internal predecessors, (3121), 960 states have call successors, (960), 258 states have call predecessors, (960), 320 states have return successors, (1685), 1007 states have call predecessors, (1685), 958 states have call successors, (1685) [2023-11-29 02:31:07,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3660 states to 3660 states and 5766 transitions. [2023-11-29 02:31:07,820 INFO L78 Accepts]: Start accepts. Automaton has 3660 states and 5766 transitions. Word has length 122 [2023-11-29 02:31:07,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:31:07,821 INFO L495 AbstractCegarLoop]: Abstraction has 3660 states and 5766 transitions. [2023-11-29 02:31:07,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (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) [2023-11-29 02:31:07,821 INFO L276 IsEmpty]: Start isEmpty. Operand 3660 states and 5766 transitions. [2023-11-29 02:31:07,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2023-11-29 02:31:07,825 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:31:07,825 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:31:07,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-29 02:31:07,825 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_linux_usb_dev_usb_put_devErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2023-11-29 02:31:07,825 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:31:07,826 INFO L85 PathProgramCache]: Analyzing trace with hash -569609366, now seen corresponding path program 1 times [2023-11-29 02:31:07,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:31:07,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292199872] [2023-11-29 02:31:07,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:31:07,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:31:08,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:09,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:31:09,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:09,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 02:31:09,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:09,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 02:31:09,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:09,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 02:31:09,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:09,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 02:31:09,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:09,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:31:09,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:09,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:31:09,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:09,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:31:09,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:09,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 02:31:09,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:09,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:31:09,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:09,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:31:09,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:09,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:31:09,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:09,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 02:31:09,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:09,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:31:09,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:09,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:31:09,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:09,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:31:09,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:09,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 02:31:09,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:09,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:31:09,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:09,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:31:09,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:09,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:31:09,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:09,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 02:31:09,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:09,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:31:09,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:09,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:31:09,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:09,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:31:09,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:09,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 02:31:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:09,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 02:31:09,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:09,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 02:31:09,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:09,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-29 02:31:09,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:09,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-29 02:31:09,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:09,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:31:09,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:09,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:31:09,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:09,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:31:09,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:09,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 02:31:09,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:09,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 02:31:09,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:09,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:31:09,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:09,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:31:09,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:09,344 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2023-11-29 02:31:09,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:31:09,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292199872] [2023-11-29 02:31:09,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292199872] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:31:09,345 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:31:09,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 02:31:09,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [845850038] [2023-11-29 02:31:09,346 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:31:09,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 02:31:09,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:31:09,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 02:31:09,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:31:09,348 INFO L87 Difference]: Start difference. First operand 3660 states and 5766 transitions. Second operand has 11 states, 10 states have (on average 6.2) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (25), 6 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2023-11-29 02:31:20,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:31:20,698 INFO L93 Difference]: Finished difference Result 6115 states and 9773 transitions. [2023-11-29 02:31:20,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 02:31:20,698 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (25), 6 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 176 [2023-11-29 02:31:20,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:31:20,713 INFO L225 Difference]: With dead ends: 6115 [2023-11-29 02:31:20,713 INFO L226 Difference]: Without dead ends: 4206 [2023-11-29 02:31:20,721 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 72 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=93, Invalid=287, Unknown=0, NotChecked=0, Total=380 [2023-11-29 02:31:20,722 INFO L413 NwaCegarLoop]: 621 mSDtfsCounter, 1591 mSDsluCounter, 3219 mSDsCounter, 0 mSdLazyCounter, 7476 mSolverCounterSat, 1341 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1615 SdHoareTripleChecker+Valid, 3840 SdHoareTripleChecker+Invalid, 8817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1341 IncrementalHoareTripleChecker+Valid, 7476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:31:20,722 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1615 Valid, 3840 Invalid, 8817 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1341 Valid, 7476 Invalid, 0 Unknown, 0 Unchecked, 10.3s Time] [2023-11-29 02:31:20,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4206 states. [2023-11-29 02:31:21,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4206 to 3664. [2023-11-29 02:31:21,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3664 states, 2368 states have (on average 1.3192567567567568) internal successors, (3124), 2413 states have internal predecessors, (3124), 960 states have call successors, (960), 259 states have call predecessors, (960), 321 states have return successors, (1684), 1007 states have call predecessors, (1684), 958 states have call successors, (1684) [2023-11-29 02:31:21,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3664 states to 3664 states and 5768 transitions. [2023-11-29 02:31:21,270 INFO L78 Accepts]: Start accepts. Automaton has 3664 states and 5768 transitions. Word has length 176 [2023-11-29 02:31:21,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:31:21,271 INFO L495 AbstractCegarLoop]: Abstraction has 3664 states and 5768 transitions. [2023-11-29 02:31:21,271 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 6.2) internal successors, (62), 6 states have internal predecessors, (62), 3 states have call successors, (25), 6 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2023-11-29 02:31:21,271 INFO L276 IsEmpty]: Start isEmpty. Operand 3664 states and 5768 transitions. [2023-11-29 02:31:21,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2023-11-29 02:31:21,274 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:31:21,274 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2023-11-29 02:31:21,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-29 02:31:21,274 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2023-11-29 02:31:21,274 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:31:21,274 INFO L85 PathProgramCache]: Analyzing trace with hash -1066861074, now seen corresponding path program 1 times [2023-11-29 02:31:21,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:31:21,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103116395] [2023-11-29 02:31:21,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:31:21,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:31:21,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:21,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:31:21,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:21,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 02:31:21,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:21,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 02:31:21,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:21,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 02:31:21,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:21,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:31:21,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:21,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 02:31:21,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:21,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 02:31:21,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:21,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:31:21,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:21,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 02:31:21,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:21,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:31:21,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:21,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:31:21,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:21,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 02:31:21,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:21,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 02:31:21,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:21,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 02:31:21,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:21,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 02:31:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:21,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 02:31:21,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:21,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 02:31:21,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:21,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 02:31:21,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:21,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 02:31:21,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:21,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 02:31:21,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:21,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-29 02:31:21,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:21,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-29 02:31:21,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:21,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 02:31:21,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:21,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-29 02:31:21,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:21,788 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 02:31:21,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:31:21,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103116395] [2023-11-29 02:31:21,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103116395] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:31:21,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:31:21,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:31:21,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1874316586] [2023-11-29 02:31:21,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:31:21,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:31:21,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:31:21,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:31:21,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:31:21,790 INFO L87 Difference]: Start difference. First operand 3664 states and 5768 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, (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) [2023-11-29 02:31:25,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:31:25,386 INFO L93 Difference]: Finished difference Result 3664 states and 5768 transitions. [2023-11-29 02:31:25,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:31:25,386 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, (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 127 [2023-11-29 02:31:25,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:31:25,397 INFO L225 Difference]: With dead ends: 3664 [2023-11-29 02:31:25,397 INFO L226 Difference]: Without dead ends: 3662 [2023-11-29 02:31:25,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-29 02:31:25,400 INFO L413 NwaCegarLoop]: 544 mSDtfsCounter, 1888 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 2144 mSolverCounterSat, 1018 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2016 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 3162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1018 IncrementalHoareTripleChecker+Valid, 2144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:31:25,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2016 Valid, 1414 Invalid, 3162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1018 Valid, 2144 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-11-29 02:31:25,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3662 states. [2023-11-29 02:31:25,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3662 to 3662. [2023-11-29 02:31:25,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3662 states, 2367 states have (on average 1.3189691592733417) internal successors, (3122), 2411 states have internal predecessors, (3122), 960 states have call successors, (960), 259 states have call predecessors, (960), 321 states have return successors, (1684), 1007 states have call predecessors, (1684), 958 states have call successors, (1684) [2023-11-29 02:31:25,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3662 states to 3662 states and 5766 transitions. [2023-11-29 02:31:25,946 INFO L78 Accepts]: Start accepts. Automaton has 3662 states and 5766 transitions. Word has length 127 [2023-11-29 02:31:25,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:31:25,946 INFO L495 AbstractCegarLoop]: Abstraction has 3662 states and 5766 transitions. [2023-11-29 02:31:25,946 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, (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) [2023-11-29 02:31:25,946 INFO L276 IsEmpty]: Start isEmpty. Operand 3662 states and 5766 transitions. [2023-11-29 02:31:25,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2023-11-29 02:31:25,949 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:31:25,949 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2023-11-29 02:31:25,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2023-11-29 02:31:25,949 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2023-11-29 02:31:25,949 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:31:25,950 INFO L85 PathProgramCache]: Analyzing trace with hash -2027882608, now seen corresponding path program 1 times [2023-11-29 02:31:25,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:31:25,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452004508] [2023-11-29 02:31:25,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:31:25,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:31:26,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:26,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:31:26,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:26,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 02:31:26,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:26,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 02:31:26,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:26,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 02:31:26,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:26,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:31:26,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:26,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 02:31:26,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:26,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 02:31:26,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:26,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:31:26,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:26,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 02:31:26,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:26,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:31:26,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:26,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:31:26,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:26,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 02:31:26,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:26,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 02:31:26,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:26,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 02:31:26,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:26,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 02:31:26,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:26,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 02:31:26,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:26,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 02:31:26,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:26,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 02:31:26,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:26,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 02:31:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:26,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 02:31:26,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:26,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-29 02:31:26,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:26,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-29 02:31:26,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:26,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 02:31:26,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:26,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-29 02:31:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:26,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-29 02:31:26,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:26,290 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 02:31:26,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:31:26,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452004508] [2023-11-29 02:31:26,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452004508] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:31:26,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:31:26,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:31:26,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974587122] [2023-11-29 02:31:26,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:31:26,291 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:31:26,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:31:26,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:31:26,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:31:26,292 INFO L87 Difference]: Start difference. First operand 3662 states and 5766 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 4 states have internal predecessors, (73), 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) [2023-11-29 02:31:30,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:31:30,152 INFO L93 Difference]: Finished difference Result 3662 states and 5766 transitions. [2023-11-29 02:31:30,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:31:30,153 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 4 states have internal predecessors, (73), 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 132 [2023-11-29 02:31:30,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:31:30,164 INFO L225 Difference]: With dead ends: 3662 [2023-11-29 02:31:30,164 INFO L226 Difference]: Without dead ends: 3660 [2023-11-29 02:31:30,166 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 [2023-11-29 02:31:30,167 INFO L413 NwaCegarLoop]: 544 mSDtfsCounter, 1882 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 2140 mSolverCounterSat, 1018 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2009 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 3158 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1018 IncrementalHoareTripleChecker+Valid, 2140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:31:30,167 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2009 Valid, 1414 Invalid, 3158 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1018 Valid, 2140 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2023-11-29 02:31:30,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3660 states. [2023-11-29 02:31:30,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3660 to 3660. [2023-11-29 02:31:30,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3660 states, 2366 states have (on average 1.3186813186813187) internal successors, (3120), 2409 states have internal predecessors, (3120), 960 states have call successors, (960), 259 states have call predecessors, (960), 321 states have return successors, (1684), 1007 states have call predecessors, (1684), 958 states have call successors, (1684) [2023-11-29 02:31:30,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3660 states to 3660 states and 5764 transitions. [2023-11-29 02:31:30,698 INFO L78 Accepts]: Start accepts. Automaton has 3660 states and 5764 transitions. Word has length 132 [2023-11-29 02:31:30,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:31:30,698 INFO L495 AbstractCegarLoop]: Abstraction has 3660 states and 5764 transitions. [2023-11-29 02:31:30,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 4 states have internal predecessors, (73), 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) [2023-11-29 02:31:30,698 INFO L276 IsEmpty]: Start isEmpty. Operand 3660 states and 5764 transitions. [2023-11-29 02:31:30,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2023-11-29 02:31:30,701 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:31:30,701 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2023-11-29 02:31:30,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-29 02:31:30,702 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2023-11-29 02:31:30,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:31:30,702 INFO L85 PathProgramCache]: Analyzing trace with hash 212945054, now seen corresponding path program 1 times [2023-11-29 02:31:30,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:31:30,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2004806575] [2023-11-29 02:31:30,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:31:30,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:31:30,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:30,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:31:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:30,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 02:31:30,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:30,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 02:31:30,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:30,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 02:31:30,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:30,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:31:30,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:30,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 02:31:30,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:30,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 02:31:30,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:30,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:31:30,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:30,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 02:31:30,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:30,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:31:30,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:30,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:31:30,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:30,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 02:31:30,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:30,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 02:31:30,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:30,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 02:31:30,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:30,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 02:31:30,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:30,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 02:31:30,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:30,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 02:31:30,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:30,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 02:31:30,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:30,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 02:31:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:31,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 02:31:31,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:31,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-29 02:31:31,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:31,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-29 02:31:31,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:31,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 02:31:31,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:31,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-29 02:31:31,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:31,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-29 02:31:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:31,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-29 02:31:31,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:31,038 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 02:31:31,038 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:31:31,038 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2004806575] [2023-11-29 02:31:31,038 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2004806575] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:31:31,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:31:31,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:31:31,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353247139] [2023-11-29 02:31:31,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:31:31,039 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:31:31,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:31:31,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:31:31,040 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:31:31,040 INFO L87 Difference]: Start difference. First operand 3660 states and 5764 transitions. Second operand has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 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) [2023-11-29 02:31:35,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:31:35,054 INFO L93 Difference]: Finished difference Result 3660 states and 5764 transitions. [2023-11-29 02:31:35,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:31:35,054 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 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 137 [2023-11-29 02:31:35,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:31:35,069 INFO L225 Difference]: With dead ends: 3660 [2023-11-29 02:31:35,069 INFO L226 Difference]: Without dead ends: 3658 [2023-11-29 02:31:35,072 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-29 02:31:35,072 INFO L413 NwaCegarLoop]: 544 mSDtfsCounter, 1876 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 2136 mSolverCounterSat, 1018 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2002 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 3154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1018 IncrementalHoareTripleChecker+Valid, 2136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:31:35,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2002 Valid, 1414 Invalid, 3154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1018 Valid, 2136 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2023-11-29 02:31:35,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3658 states. [2023-11-29 02:31:35,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3658 to 3658. [2023-11-29 02:31:35,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3658 states, 2365 states have (on average 1.3183932346723044) internal successors, (3118), 2407 states have internal predecessors, (3118), 960 states have call successors, (960), 259 states have call predecessors, (960), 321 states have return successors, (1684), 1007 states have call predecessors, (1684), 958 states have call successors, (1684) [2023-11-29 02:31:35,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3658 states to 3658 states and 5762 transitions. [2023-11-29 02:31:35,651 INFO L78 Accepts]: Start accepts. Automaton has 3658 states and 5762 transitions. Word has length 137 [2023-11-29 02:31:35,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:31:35,651 INFO L495 AbstractCegarLoop]: Abstraction has 3658 states and 5762 transitions. [2023-11-29 02:31:35,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.666666666666666) internal successors, (76), 4 states have internal predecessors, (76), 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) [2023-11-29 02:31:35,651 INFO L276 IsEmpty]: Start isEmpty. Operand 3658 states and 5762 transitions. [2023-11-29 02:31:35,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2023-11-29 02:31:35,655 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:31:35,655 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2023-11-29 02:31:35,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2023-11-29 02:31:35,655 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2023-11-29 02:31:35,655 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:31:35,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1350601373, now seen corresponding path program 1 times [2023-11-29 02:31:35,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:31:35,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1315297488] [2023-11-29 02:31:35,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:31:35,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:31:35,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:35,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:31:35,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:35,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 02:31:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:35,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 02:31:35,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:35,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 02:31:35,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:35,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:31:35,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:35,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 02:31:35,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:35,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 02:31:35,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:35,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:31:35,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:35,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 02:31:35,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:35,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:31:35,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:35,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:31:35,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:35,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 02:31:35,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:35,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 02:31:35,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:35,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 02:31:35,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:35,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 02:31:35,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:35,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 02:31:35,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:35,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 02:31:35,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:35,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 02:31:35,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:35,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 02:31:35,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:35,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 02:31:35,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:35,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-29 02:31:35,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:35,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-29 02:31:35,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:35,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 02:31:35,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:35,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-29 02:31:35,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:35,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-29 02:31:35,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:35,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-29 02:31:35,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:35,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 02:31:36,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:36,003 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 02:31:36,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:31:36,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1315297488] [2023-11-29 02:31:36,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1315297488] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:31:36,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:31:36,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:31:36,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1061487568] [2023-11-29 02:31:36,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:31:36,004 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:31:36,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:31:36,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:31:36,005 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:31:36,005 INFO L87 Difference]: Start difference. First operand 3658 states and 5762 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2023-11-29 02:31:39,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:31:39,566 INFO L93 Difference]: Finished difference Result 3658 states and 5762 transitions. [2023-11-29 02:31:39,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:31:39,566 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 142 [2023-11-29 02:31:39,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:31:39,578 INFO L225 Difference]: With dead ends: 3658 [2023-11-29 02:31:39,578 INFO L226 Difference]: Without dead ends: 3656 [2023-11-29 02:31:39,580 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-29 02:31:39,581 INFO L413 NwaCegarLoop]: 544 mSDtfsCounter, 1870 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 2132 mSolverCounterSat, 1018 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1995 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 3150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1018 IncrementalHoareTripleChecker+Valid, 2132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:31:39,581 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1995 Valid, 1414 Invalid, 3150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1018 Valid, 2132 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-11-29 02:31:39,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3656 states. [2023-11-29 02:31:40,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3656 to 3656. [2023-11-29 02:31:40,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3656 states, 2364 states have (on average 1.3181049069373942) internal successors, (3116), 2405 states have internal predecessors, (3116), 960 states have call successors, (960), 259 states have call predecessors, (960), 321 states have return successors, (1684), 1007 states have call predecessors, (1684), 958 states have call successors, (1684) [2023-11-29 02:31:40,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3656 states to 3656 states and 5760 transitions. [2023-11-29 02:31:40,186 INFO L78 Accepts]: Start accepts. Automaton has 3656 states and 5760 transitions. Word has length 142 [2023-11-29 02:31:40,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:31:40,187 INFO L495 AbstractCegarLoop]: Abstraction has 3656 states and 5760 transitions. [2023-11-29 02:31:40,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2023-11-29 02:31:40,187 INFO L276 IsEmpty]: Start isEmpty. Operand 3656 states and 5760 transitions. [2023-11-29 02:31:40,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2023-11-29 02:31:40,190 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:31:40,191 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2023-11-29 02:31:40,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-29 02:31:40,191 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2023-11-29 02:31:40,191 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:31:40,191 INFO L85 PathProgramCache]: Analyzing trace with hash 1308884467, now seen corresponding path program 1 times [2023-11-29 02:31:40,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:31:40,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600857774] [2023-11-29 02:31:40,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:31:40,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:31:40,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:40,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:31:40,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:40,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 02:31:40,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:40,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 02:31:40,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:40,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 02:31:40,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:40,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:31:40,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:40,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 02:31:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:40,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 02:31:40,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:40,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:31:40,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:40,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 02:31:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:40,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:31:40,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:40,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:31:40,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:40,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 02:31:40,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:40,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 02:31:40,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:40,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 02:31:40,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:40,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 02:31:40,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:40,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 02:31:40,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:40,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 02:31:40,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:40,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 02:31:40,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:40,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 02:31:40,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:40,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 02:31:40,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:40,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-29 02:31:40,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:40,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-29 02:31:40,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:40,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 02:31:40,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:40,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-29 02:31:40,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:40,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-29 02:31:40,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:40,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-29 02:31:40,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:40,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 02:31:40,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:40,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-29 02:31:40,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:40,563 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 02:31:40,563 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:31:40,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600857774] [2023-11-29 02:31:40,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600857774] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:31:40,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:31:40,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:31:40,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723802814] [2023-11-29 02:31:40,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:31:40,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:31:40,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:31:40,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:31:40,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:31:40,565 INFO L87 Difference]: Start difference. First operand 3656 states and 5760 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, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2023-11-29 02:31:44,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:31:44,321 INFO L93 Difference]: Finished difference Result 3656 states and 5760 transitions. [2023-11-29 02:31:44,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:31:44,321 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, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 147 [2023-11-29 02:31:44,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:31:44,333 INFO L225 Difference]: With dead ends: 3656 [2023-11-29 02:31:44,333 INFO L226 Difference]: Without dead ends: 3654 [2023-11-29 02:31:44,335 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2023-11-29 02:31:44,335 INFO L413 NwaCegarLoop]: 544 mSDtfsCounter, 1864 mSDsluCounter, 870 mSDsCounter, 0 mSdLazyCounter, 2128 mSolverCounterSat, 1018 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1988 SdHoareTripleChecker+Valid, 1414 SdHoareTripleChecker+Invalid, 3146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1018 IncrementalHoareTripleChecker+Valid, 2128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-11-29 02:31:44,335 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1988 Valid, 1414 Invalid, 3146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1018 Valid, 2128 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2023-11-29 02:31:44,338 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3654 states. [2023-11-29 02:31:44,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3654 to 3654. [2023-11-29 02:31:44,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3654 states, 2363 states have (on average 1.3178163351671603) internal successors, (3114), 2403 states have internal predecessors, (3114), 960 states have call successors, (960), 259 states have call predecessors, (960), 321 states have return successors, (1684), 1007 states have call predecessors, (1684), 958 states have call successors, (1684) [2023-11-29 02:31:45,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3654 states to 3654 states and 5758 transitions. [2023-11-29 02:31:45,006 INFO L78 Accepts]: Start accepts. Automaton has 3654 states and 5758 transitions. Word has length 147 [2023-11-29 02:31:45,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:31:45,006 INFO L495 AbstractCegarLoop]: Abstraction has 3654 states and 5758 transitions. [2023-11-29 02:31:45,007 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, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2023-11-29 02:31:45,007 INFO L276 IsEmpty]: Start isEmpty. Operand 3654 states and 5758 transitions. [2023-11-29 02:31:45,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2023-11-29 02:31:45,011 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:31:45,011 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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] [2023-11-29 02:31:45,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-29 02:31:45,011 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2023-11-29 02:31:45,012 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:31:45,012 INFO L85 PathProgramCache]: Analyzing trace with hash -1327940702, now seen corresponding path program 1 times [2023-11-29 02:31:45,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:31:45,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537786052] [2023-11-29 02:31:45,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:31:45,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:31:45,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:45,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:31:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:45,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 02:31:45,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:45,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 02:31:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:45,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 02:31:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:45,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 02:31:45,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:45,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:31:45,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:45,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:31:45,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:45,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:31:45,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:45,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 02:31:45,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:45,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:31:45,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:45,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:31:45,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:45,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:31:45,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:45,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 02:31:45,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:45,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:31:45,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:45,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:31:45,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:45,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:31:45,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:45,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 02:31:45,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:45,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:31:45,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:45,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:31:45,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:45,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:31:45,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:45,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 02:31:45,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:45,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:31:45,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:45,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:31:45,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:45,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:31:45,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:45,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 02:31:45,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:45,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 02:31:45,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:45,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 02:31:45,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:45,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-29 02:31:45,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:45,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-29 02:31:45,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:45,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:31:45,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:45,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:31:45,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:45,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:31:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:45,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 02:31:45,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:45,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 02:31:45,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:45,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:31:45,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:45,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:31:45,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:45,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2023-11-29 02:31:45,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:45,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2023-11-29 02:31:45,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:45,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2023-11-29 02:31:45,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:45,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:31:45,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:45,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2023-11-29 02:31:45,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:45,776 INFO L134 CoverageAnalysis]: Checked inductivity of 302 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 302 trivial. 0 not checked. [2023-11-29 02:31:45,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:31:45,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537786052] [2023-11-29 02:31:45,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537786052] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:31:45,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:31:45,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 02:31:45,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507006] [2023-11-29 02:31:45,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:31:45,778 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 02:31:45,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:31:45,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 02:31:45,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2023-11-29 02:31:45,779 INFO L87 Difference]: Start difference. First operand 3654 states and 5758 transitions. Second operand has 10 states, 10 states have (on average 7.4) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (32), 8 states have call predecessors, (32), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2023-11-29 02:31:54,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:31:54,240 INFO L93 Difference]: Finished difference Result 4447 states and 7376 transitions. [2023-11-29 02:31:54,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 02:31:54,241 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (32), 8 states have call predecessors, (32), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 201 [2023-11-29 02:31:54,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:31:54,255 INFO L225 Difference]: With dead ends: 4447 [2023-11-29 02:31:54,255 INFO L226 Difference]: Without dead ends: 4445 [2023-11-29 02:31:54,257 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2023-11-29 02:31:54,258 INFO L413 NwaCegarLoop]: 546 mSDtfsCounter, 3097 mSDsluCounter, 1916 mSDsCounter, 0 mSdLazyCounter, 4913 mSolverCounterSat, 2180 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3184 SdHoareTripleChecker+Valid, 2462 SdHoareTripleChecker+Invalid, 7093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2180 IncrementalHoareTripleChecker+Valid, 4913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:31:54,258 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3184 Valid, 2462 Invalid, 7093 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2180 Valid, 4913 Invalid, 0 Unknown, 0 Unchecked, 7.3s Time] [2023-11-29 02:31:54,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4445 states. [2023-11-29 02:31:54,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4445 to 3792. [2023-11-29 02:31:54,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3792 states, 2471 states have (on average 1.3193039255362202) internal successors, (3260), 2506 states have internal predecessors, (3260), 972 states have call successors, (972), 267 states have call predecessors, (972), 340 states have return successors, (1789), 1033 states have call predecessors, (1789), 970 states have call successors, (1789) [2023-11-29 02:31:54,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3792 states to 3792 states and 6021 transitions. [2023-11-29 02:31:54,969 INFO L78 Accepts]: Start accepts. Automaton has 3792 states and 6021 transitions. Word has length 201 [2023-11-29 02:31:54,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:31:54,969 INFO L495 AbstractCegarLoop]: Abstraction has 3792 states and 6021 transitions. [2023-11-29 02:31:54,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 7.4) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (32), 8 states have call predecessors, (32), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2023-11-29 02:31:54,969 INFO L276 IsEmpty]: Start isEmpty. Operand 3792 states and 6021 transitions. [2023-11-29 02:31:54,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2023-11-29 02:31:54,973 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:31:54,973 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 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] [2023-11-29 02:31:54,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-11-29 02:31:54,973 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ldv_linux_usb_urb_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2023-11-29 02:31:54,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:31:54,974 INFO L85 PathProgramCache]: Analyzing trace with hash -853517192, now seen corresponding path program 1 times [2023-11-29 02:31:54,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:31:54,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031602409] [2023-11-29 02:31:54,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:31:54,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:31:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:55,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:31:55,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:55,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 02:31:55,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:55,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 02:31:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:55,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 02:31:55,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:55,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:31:55,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:55,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 02:31:55,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:55,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 02:31:55,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:55,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:31:55,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:55,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 02:31:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:55,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:31:55,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:55,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2023-11-29 02:31:55,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:55,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2023-11-29 02:31:55,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:55,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2023-11-29 02:31:55,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:55,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2023-11-29 02:31:55,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:55,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2023-11-29 02:31:55,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:55,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 02:31:55,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:55,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2023-11-29 02:31:55,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:55,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2023-11-29 02:31:55,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:55,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 02:31:55,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:55,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2023-11-29 02:31:55,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:55,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2023-11-29 02:31:55,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:55,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2023-11-29 02:31:55,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:55,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 02:31:55,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:55,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2023-11-29 02:31:55,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:55,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2023-11-29 02:31:55,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:55,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2023-11-29 02:31:55,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:55,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2023-11-29 02:31:55,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:55,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2023-11-29 02:31:55,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:55,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-29 02:31:55,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:31:55,372 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2023-11-29 02:31:55,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:31:55,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031602409] [2023-11-29 02:31:55,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031602409] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:31:55,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:31:55,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:31:55,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628200386] [2023-11-29 02:31:55,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:31:55,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:31:55,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:31:55,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:31:55,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:31:55,373 INFO L87 Difference]: Start difference. First operand 3792 states and 6021 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2023-11-29 02:32:03,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:32:03,265 INFO L93 Difference]: Finished difference Result 7419 states and 12790 transitions. [2023-11-29 02:32:03,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 02:32:03,266 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 152 [2023-11-29 02:32:03,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:32:03,294 INFO L225 Difference]: With dead ends: 7419 [2023-11-29 02:32:03,294 INFO L226 Difference]: Without dead ends: 7289 [2023-11-29 02:32:03,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:32:03,301 INFO L413 NwaCegarLoop]: 572 mSDtfsCounter, 2407 mSDsluCounter, 1207 mSDsCounter, 0 mSdLazyCounter, 3771 mSolverCounterSat, 1501 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2485 SdHoareTripleChecker+Valid, 1779 SdHoareTripleChecker+Invalid, 5272 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1501 IncrementalHoareTripleChecker+Valid, 3771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:32:03,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2485 Valid, 1779 Invalid, 5272 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1501 Valid, 3771 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2023-11-29 02:32:03,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7289 states. [2023-11-29 02:32:04,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7289 to 7265. [2023-11-29 02:32:04,999 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7265 states, 4764 states have (on average 1.3249370277078085) internal successors, (6312), 4813 states have internal predecessors, (6312), 1841 states have call successors, (1841), 505 states have call predecessors, (1841), 651 states have return successors, (4459), 1972 states have call predecessors, (4459), 1837 states have call successors, (4459) [2023-11-29 02:32:05,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7265 states to 7265 states and 12612 transitions. [2023-11-29 02:32:05,040 INFO L78 Accepts]: Start accepts. Automaton has 7265 states and 12612 transitions. Word has length 152 [2023-11-29 02:32:05,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:32:05,040 INFO L495 AbstractCegarLoop]: Abstraction has 7265 states and 12612 transitions. [2023-11-29 02:32:05,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2023-11-29 02:32:05,040 INFO L276 IsEmpty]: Start isEmpty. Operand 7265 states and 12612 transitions. [2023-11-29 02:32:05,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 220 [2023-11-29 02:32:05,044 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:32:05,044 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 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] [2023-11-29 02:32:05,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2023-11-29 02:32:05,045 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2023-11-29 02:32:05,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:32:05,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1192155840, now seen corresponding path program 1 times [2023-11-29 02:32:05,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:32:05,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345242884] [2023-11-29 02:32:05,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:32:05,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:32:05,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:05,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:32:05,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:05,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 02:32:05,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:05,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 02:32:05,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:05,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 02:32:05,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:05,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 02:32:05,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:05,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:32:05,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:05,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:32:05,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:05,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:32:05,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:05,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 02:32:05,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:05,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:32:05,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:05,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:32:05,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:05,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:32:05,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:05,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 02:32:05,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:05,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:32:05,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:05,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:32:05,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:05,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:32:05,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:05,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 02:32:05,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:05,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:32:05,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:05,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:32:05,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:05,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:32:05,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:05,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 02:32:05,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:05,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:32:05,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:05,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:32:05,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:05,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:32:05,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:05,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 02:32:05,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:05,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 02:32:05,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:05,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 02:32:05,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:05,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-29 02:32:05,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:05,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-29 02:32:05,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:05,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:32:05,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:05,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:32:05,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:05,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:32:05,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:05,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 02:32:05,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:05,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 02:32:05,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:05,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:32:05,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:05,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:32:05,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:05,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2023-11-29 02:32:05,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:05,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2023-11-29 02:32:05,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:05,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2023-11-29 02:32:05,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:05,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:32:05,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:05,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2023-11-29 02:32:05,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:05,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-11-29 02:32:05,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:05,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 02:32:05,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:05,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:32:05,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:05,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 208 [2023-11-29 02:32:05,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:05,674 INFO L134 CoverageAnalysis]: Checked inductivity of 338 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 338 trivial. 0 not checked. [2023-11-29 02:32:05,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:32:05,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345242884] [2023-11-29 02:32:05,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345242884] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:32:05,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:32:05,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 02:32:05,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330407552] [2023-11-29 02:32:05,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:32:05,675 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 02:32:05,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:32:05,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 02:32:05,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:32:05,677 INFO L87 Difference]: Start difference. First operand 7265 states and 12612 transitions. Second operand has 11 states, 10 states have (on average 8.2) internal successors, (82), 4 states have internal predecessors, (82), 3 states have call successors, (36), 9 states have call predecessors, (36), 2 states have return successors, (33), 2 states have call predecessors, (33), 3 states have call successors, (33) [2023-11-29 02:32:16,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:32:16,598 INFO L93 Difference]: Finished difference Result 10175 states and 21933 transitions. [2023-11-29 02:32:16,598 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-29 02:32:16,598 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 8.2) internal successors, (82), 4 states have internal predecessors, (82), 3 states have call successors, (36), 9 states have call predecessors, (36), 2 states have return successors, (33), 2 states have call predecessors, (33), 3 states have call successors, (33) Word has length 219 [2023-11-29 02:32:16,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:32:16,697 INFO L225 Difference]: With dead ends: 10175 [2023-11-29 02:32:16,697 INFO L226 Difference]: Without dead ends: 10173 [2023-11-29 02:32:16,707 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=217, Invalid=539, Unknown=0, NotChecked=0, Total=756 [2023-11-29 02:32:16,707 INFO L413 NwaCegarLoop]: 545 mSDtfsCounter, 2949 mSDsluCounter, 2549 mSDsCounter, 0 mSdLazyCounter, 6257 mSolverCounterSat, 2469 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2949 SdHoareTripleChecker+Valid, 3094 SdHoareTripleChecker+Invalid, 8726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2469 IncrementalHoareTripleChecker+Valid, 6257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2023-11-29 02:32:16,707 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2949 Valid, 3094 Invalid, 8726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2469 Valid, 6257 Invalid, 0 Unknown, 0 Unchecked, 8.8s Time] [2023-11-29 02:32:16,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10173 states. [2023-11-29 02:32:18,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10173 to 7522. [2023-11-29 02:32:18,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7522 states, 4952 states have (on average 1.3233037156704361) internal successors, (6553), 5006 states have internal predecessors, (6553), 1871 states have call successors, (1871), 505 states have call predecessors, (1871), 691 states have return successors, (4673), 2035 states have call predecessors, (4673), 1867 states have call successors, (4673) [2023-11-29 02:32:18,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7522 states to 7522 states and 13097 transitions. [2023-11-29 02:32:18,387 INFO L78 Accepts]: Start accepts. Automaton has 7522 states and 13097 transitions. Word has length 219 [2023-11-29 02:32:18,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:32:18,388 INFO L495 AbstractCegarLoop]: Abstraction has 7522 states and 13097 transitions. [2023-11-29 02:32:18,388 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 8.2) internal successors, (82), 4 states have internal predecessors, (82), 3 states have call successors, (36), 9 states have call predecessors, (36), 2 states have return successors, (33), 2 states have call predecessors, (33), 3 states have call successors, (33) [2023-11-29 02:32:18,388 INFO L276 IsEmpty]: Start isEmpty. Operand 7522 states and 13097 transitions. [2023-11-29 02:32:18,394 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2023-11-29 02:32:18,394 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:32:18,394 INFO L195 NwaCegarLoop]: trace histogram [8, 7, 7, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:32:18,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2023-11-29 02:32:18,394 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting destroy_asyncErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2023-11-29 02:32:18,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:32:18,395 INFO L85 PathProgramCache]: Analyzing trace with hash 208672837, now seen corresponding path program 1 times [2023-11-29 02:32:18,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:32:18,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230747995] [2023-11-29 02:32:18,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:32:18,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:32:18,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:19,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:32:19,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:19,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 02:32:19,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:19,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 02:32:19,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:19,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 02:32:19,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:19,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2023-11-29 02:32:19,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:19,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2023-11-29 02:32:19,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:19,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2023-11-29 02:32:19,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:19,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:32:19,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:19,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 02:32:19,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:19,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2023-11-29 02:32:19,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:19,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2023-11-29 02:32:19,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:19,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2023-11-29 02:32:19,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:19,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:32:19,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:19,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:32:19,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:19,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:32:19,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:19,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2023-11-29 02:32:19,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:19,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2023-11-29 02:32:19,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:19,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2023-11-29 02:32:19,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:19,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:32:19,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:19,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:32:19,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:19,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:32:19,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:19,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 02:32:19,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:19,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 02:32:19,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:19,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:32:19,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:19,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:32:19,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:19,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-29 02:32:19,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:19,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2023-11-29 02:32:19,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:19,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2023-11-29 02:32:19,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:19,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:32:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:19,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 02:32:19,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:19,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2023-11-29 02:32:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:19,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:32:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:19,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-11-29 02:32:19,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:19,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-11-29 02:32:19,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:19,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2023-11-29 02:32:19,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:19,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:32:19,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:19,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2023-11-29 02:32:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:19,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2023-11-29 02:32:19,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:19,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 201 [2023-11-29 02:32:19,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:19,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 219 [2023-11-29 02:32:19,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:19,527 INFO L134 CoverageAnalysis]: Checked inductivity of 155 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2023-11-29 02:32:19,527 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:32:19,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230747995] [2023-11-29 02:32:19,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [230747995] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:32:19,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:32:19,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-29 02:32:19,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201958646] [2023-11-29 02:32:19,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:32:19,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 02:32:19,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:32:19,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 02:32:19,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2023-11-29 02:32:19,529 INFO L87 Difference]: Start difference. First operand 7522 states and 13097 transitions. Second operand has 14 states, 12 states have (on average 8.833333333333334) internal successors, (106), 7 states have internal predecessors, (106), 3 states have call successors, (46), 7 states have call predecessors, (46), 3 states have return successors, (39), 5 states have call predecessors, (39), 3 states have call successors, (39) [2023-11-29 02:32:31,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:32:31,941 INFO L93 Difference]: Finished difference Result 15432 states and 30237 transitions. [2023-11-29 02:32:31,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 02:32:31,941 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 8.833333333333334) internal successors, (106), 7 states have internal predecessors, (106), 3 states have call successors, (46), 7 states have call predecessors, (46), 3 states have return successors, (39), 5 states have call predecessors, (39), 3 states have call successors, (39) Word has length 227 [2023-11-29 02:32:31,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:32:31,972 INFO L225 Difference]: With dead ends: 15432 [2023-11-29 02:32:31,972 INFO L226 Difference]: Without dead ends: 8075 [2023-11-29 02:32:32,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2023-11-29 02:32:32,021 INFO L413 NwaCegarLoop]: 546 mSDtfsCounter, 2181 mSDsluCounter, 3670 mSDsCounter, 0 mSdLazyCounter, 8952 mSolverCounterSat, 1911 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2181 SdHoareTripleChecker+Valid, 4216 SdHoareTripleChecker+Invalid, 10863 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1911 IncrementalHoareTripleChecker+Valid, 8952 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:32:32,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2181 Valid, 4216 Invalid, 10863 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1911 Valid, 8952 Invalid, 0 Unknown, 0 Unchecked, 10.3s Time] [2023-11-29 02:32:32,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8075 states. [2023-11-29 02:32:33,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8075 to 7624. [2023-11-29 02:32:33,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7624 states, 5010 states have (on average 1.3187624750499003) internal successors, (6607), 5080 states have internal predecessors, (6607), 1875 states have call successors, (1875), 505 states have call predecessors, (1875), 731 states have return successors, (4794), 2059 states have call predecessors, (4794), 1871 states have call successors, (4794) [2023-11-29 02:32:33,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7624 states to 7624 states and 13276 transitions. [2023-11-29 02:32:33,333 INFO L78 Accepts]: Start accepts. Automaton has 7624 states and 13276 transitions. Word has length 227 [2023-11-29 02:32:33,333 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:32:33,333 INFO L495 AbstractCegarLoop]: Abstraction has 7624 states and 13276 transitions. [2023-11-29 02:32:33,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 8.833333333333334) internal successors, (106), 7 states have internal predecessors, (106), 3 states have call successors, (46), 7 states have call predecessors, (46), 3 states have return successors, (39), 5 states have call predecessors, (39), 3 states have call successors, (39) [2023-11-29 02:32:33,334 INFO L276 IsEmpty]: Start isEmpty. Operand 7624 states and 13276 transitions. [2023-11-29 02:32:33,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2023-11-29 02:32:33,339 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:32:33,340 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:32:33,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2023-11-29 02:32:33,340 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting destroy_asyncErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2023-11-29 02:32:33,340 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:32:33,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1216476970, now seen corresponding path program 1 times [2023-11-29 02:32:33,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:32:33,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632022563] [2023-11-29 02:32:33,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:32:33,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:32:33,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:33,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:32:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:33,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 02:32:33,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:33,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 02:32:33,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:33,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 02:32:33,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:33,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 02:32:33,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:33,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:32:33,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:33,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:32:33,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:33,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:32:33,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:33,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 02:32:33,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:33,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:32:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:33,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:32:33,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:33,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:32:33,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:33,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 02:32:33,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:33,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:32:33,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:33,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:32:33,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:33,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:32:33,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:33,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 02:32:33,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:33,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:32:33,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:33,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:32:33,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:33,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:32:33,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:33,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 02:32:33,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:33,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:32:33,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:33,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:32:33,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:33,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:32:33,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:33,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 02:32:33,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:33,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 02:32:33,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:33,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 02:32:33,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:34,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-29 02:32:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:34,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-29 02:32:34,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:34,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-29 02:32:34,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:34,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-29 02:32:34,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:34,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:32:34,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:34,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-29 02:32:34,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:34,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-11-29 02:32:34,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:34,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2023-11-29 02:32:34,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:34,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-11-29 02:32:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:34,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2023-11-29 02:32:34,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:34,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2023-11-29 02:32:34,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:34,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-11-29 02:32:34,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:34,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2023-11-29 02:32:34,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:34,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:32:34,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:34,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 02:32:34,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:34,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:32:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:34,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:32:34,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:34,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:32:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:34,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:32:34,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:34,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 02:32:34,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:34,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2023-11-29 02:32:34,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:34,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2023-11-29 02:32:34,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:34,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 251 [2023-11-29 02:32:34,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:34,117 INFO L134 CoverageAnalysis]: Checked inductivity of 496 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-11-29 02:32:34,118 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:32:34,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632022563] [2023-11-29 02:32:34,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [632022563] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:32:34,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:32:34,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-29 02:32:34,118 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639833306] [2023-11-29 02:32:34,118 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:32:34,119 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 02:32:34,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:32:34,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 02:32:34,120 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=156, Unknown=0, NotChecked=0, Total=182 [2023-11-29 02:32:34,120 INFO L87 Difference]: Start difference. First operand 7624 states and 13276 transitions. Second operand has 14 states, 13 states have (on average 7.538461538461538) internal successors, (98), 5 states have internal predecessors, (98), 5 states have call successors, (43), 12 states have call predecessors, (43), 1 states have return successors, (38), 3 states have call predecessors, (38), 4 states have call successors, (38) [2023-11-29 02:32:45,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:32:45,841 INFO L93 Difference]: Finished difference Result 17138 states and 35908 transitions. [2023-11-29 02:32:45,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-29 02:32:45,842 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 7.538461538461538) internal successors, (98), 5 states have internal predecessors, (98), 5 states have call successors, (43), 12 states have call predecessors, (43), 1 states have return successors, (38), 3 states have call predecessors, (38), 4 states have call successors, (38) Word has length 259 [2023-11-29 02:32:45,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:32:45,886 INFO L225 Difference]: With dead ends: 17138 [2023-11-29 02:32:45,886 INFO L226 Difference]: Without dead ends: 9679 [2023-11-29 02:32:45,928 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 320 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=382, Invalid=1178, Unknown=0, NotChecked=0, Total=1560 [2023-11-29 02:32:45,928 INFO L413 NwaCegarLoop]: 545 mSDtfsCounter, 4382 mSDsluCounter, 3362 mSDsCounter, 0 mSdLazyCounter, 8129 mSolverCounterSat, 3512 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4382 SdHoareTripleChecker+Valid, 3907 SdHoareTripleChecker+Invalid, 11641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3512 IncrementalHoareTripleChecker+Valid, 8129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2023-11-29 02:32:45,928 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4382 Valid, 3907 Invalid, 11641 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3512 Valid, 8129 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2023-11-29 02:32:45,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9679 states. [2023-11-29 02:32:47,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9679 to 7922. [2023-11-29 02:32:47,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7922 states, 5214 states have (on average 1.311277330264672) internal successors, (6837), 5284 states have internal predecessors, (6837), 1939 states have call successors, (1939), 529 states have call predecessors, (1939), 761 states have return successors, (4742), 2129 states have call predecessors, (4742), 1935 states have call successors, (4742) [2023-11-29 02:32:47,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7922 states to 7922 states and 13518 transitions. [2023-11-29 02:32:47,472 INFO L78 Accepts]: Start accepts. Automaton has 7922 states and 13518 transitions. Word has length 259 [2023-11-29 02:32:47,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:32:47,473 INFO L495 AbstractCegarLoop]: Abstraction has 7922 states and 13518 transitions. [2023-11-29 02:32:47,473 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 7.538461538461538) internal successors, (98), 5 states have internal predecessors, (98), 5 states have call successors, (43), 12 states have call predecessors, (43), 1 states have return successors, (38), 3 states have call predecessors, (38), 4 states have call successors, (38) [2023-11-29 02:32:47,473 INFO L276 IsEmpty]: Start isEmpty. Operand 7922 states and 13518 transitions. [2023-11-29 02:32:47,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2023-11-29 02:32:47,478 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:32:47,478 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:32:47,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2023-11-29 02:32:47,478 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ldv_linux_usb_dev_usb_put_devErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2023-11-29 02:32:47,479 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:32:47,479 INFO L85 PathProgramCache]: Analyzing trace with hash 980005238, now seen corresponding path program 1 times [2023-11-29 02:32:47,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:32:47,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355178907] [2023-11-29 02:32:47,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:32:47,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:32:48,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:32:48,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 02:32:48,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 02:32:48,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 02:32:48,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 02:32:48,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:32:48,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:32:48,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:32:48,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 02:32:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:32:48,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:32:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:32:48,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 02:32:48,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:32:48,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:32:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:32:48,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 02:32:48,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:32:48,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:32:48,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:32:48,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 02:32:48,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:32:48,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:32:48,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:32:48,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 02:32:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 02:32:48,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 02:32:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-29 02:32:48,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2023-11-29 02:32:48,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2023-11-29 02:32:48,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2023-11-29 02:32:48,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:32:48,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 152 [2023-11-29 02:32:48,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2023-11-29 02:32:48,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2023-11-29 02:32:48,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2023-11-29 02:32:48,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 174 [2023-11-29 02:32:48,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2023-11-29 02:32:48,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 183 [2023-11-29 02:32:48,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2023-11-29 02:32:48,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:32:48,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 02:32:48,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:32:48,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:32:48,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:32:48,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:32:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 02:32:48,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2023-11-29 02:32:48,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2023-11-29 02:32:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 249 [2023-11-29 02:32:48,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:32:48,623 INFO L134 CoverageAnalysis]: Checked inductivity of 498 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 496 trivial. 0 not checked. [2023-11-29 02:32:48,623 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:32:48,623 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355178907] [2023-11-29 02:32:48,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355178907] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:32:48,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:32:48,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-29 02:32:48,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2124922257] [2023-11-29 02:32:48,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:32:48,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 02:32:48,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:32:48,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 02:32:48,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:32:48,625 INFO L87 Difference]: Start difference. First operand 7922 states and 13518 transitions. Second operand has 11 states, 11 states have (on average 9.0) internal successors, (99), 4 states have internal predecessors, (99), 3 states have call successors, (43), 9 states have call predecessors, (43), 1 states have return successors, (38), 2 states have call predecessors, (38), 3 states have call successors, (38) [2023-11-29 02:32:59,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:32:59,373 INFO L93 Difference]: Finished difference Result 17516 states and 36077 transitions. [2023-11-29 02:32:59,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 02:32:59,374 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.0) internal successors, (99), 4 states have internal predecessors, (99), 3 states have call successors, (43), 9 states have call predecessors, (43), 1 states have return successors, (38), 2 states have call predecessors, (38), 3 states have call successors, (38) Word has length 260 [2023-11-29 02:32:59,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:32:59,422 INFO L225 Difference]: With dead ends: 17516 [2023-11-29 02:32:59,422 INFO L226 Difference]: Without dead ends: 9759 [2023-11-29 02:32:59,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=190, Invalid=512, Unknown=0, NotChecked=0, Total=702 [2023-11-29 02:32:59,468 INFO L413 NwaCegarLoop]: 546 mSDtfsCounter, 4040 mSDsluCounter, 2408 mSDsCounter, 0 mSdLazyCounter, 5567 mSolverCounterSat, 3159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4040 SdHoareTripleChecker+Valid, 2954 SdHoareTripleChecker+Invalid, 8726 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3159 IncrementalHoareTripleChecker+Valid, 5567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.4s IncrementalHoareTripleChecker+Time [2023-11-29 02:32:59,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4040 Valid, 2954 Invalid, 8726 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3159 Valid, 5567 Invalid, 0 Unknown, 0 Unchecked, 8.4s Time] [2023-11-29 02:32:59,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9759 states. [2023-11-29 02:33:01,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9759 to 7962. [2023-11-29 02:33:01,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7962 states, 5250 states have (on average 1.3091428571428572) internal successors, (6873), 5324 states have internal predecessors, (6873), 1939 states have call successors, (1939), 529 states have call predecessors, (1939), 765 states have return successors, (4746), 2129 states have call predecessors, (4746), 1935 states have call successors, (4746) [2023-11-29 02:33:01,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7962 states to 7962 states and 13558 transitions. [2023-11-29 02:33:01,273 INFO L78 Accepts]: Start accepts. Automaton has 7962 states and 13558 transitions. Word has length 260 [2023-11-29 02:33:01,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:33:01,274 INFO L495 AbstractCegarLoop]: Abstraction has 7962 states and 13558 transitions. [2023-11-29 02:33:01,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.0) internal successors, (99), 4 states have internal predecessors, (99), 3 states have call successors, (43), 9 states have call predecessors, (43), 1 states have return successors, (38), 2 states have call predecessors, (38), 3 states have call successors, (38) [2023-11-29 02:33:01,274 INFO L276 IsEmpty]: Start isEmpty. Operand 7962 states and 13558 transitions. [2023-11-29 02:33:01,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 266 [2023-11-29 02:33:01,282 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:33:01,282 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:33:01,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2023-11-29 02:33:01,282 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ldv_linux_usb_dev_usb_put_devErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2023-11-29 02:33:01,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:33:01,283 INFO L85 PathProgramCache]: Analyzing trace with hash -897390405, now seen corresponding path program 1 times [2023-11-29 02:33:01,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:33:01,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1897173217] [2023-11-29 02:33:01,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:33:01,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:33:01,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:33:02,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 02:33:02,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 02:33:02,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 02:33:02,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 02:33:02,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:33:02,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:33:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:33:02,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2023-11-29 02:33:02,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:33:02,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:33:02,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:33:02,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2023-11-29 02:33:02,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:33:02,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:33:02,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:33:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2023-11-29 02:33:02,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:33:02,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:33:02,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:33:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2023-11-29 02:33:02,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:33:02,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:33:02,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:33:02,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2023-11-29 02:33:02,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2023-11-29 02:33:02,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 02:33:02,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2023-11-29 02:33:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-29 02:33:02,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:33:02,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:33:02,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:33:02,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 02:33:02,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2023-11-29 02:33:02,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:33:02,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2023-11-29 02:33:02,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2023-11-29 02:33:02,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2023-11-29 02:33:02,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2023-11-29 02:33:02,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:33:02,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 190 [2023-11-29 02:33:02,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2023-11-29 02:33:02,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:33:02,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 02:33:02,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:33:02,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:33:02,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:33:02,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:33:02,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 02:33:02,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2023-11-29 02:33:02,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 238 [2023-11-29 02:33:02,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 254 [2023-11-29 02:33:02,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:02,932 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 395 trivial. 0 not checked. [2023-11-29 02:33:02,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:33:02,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1897173217] [2023-11-29 02:33:02,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1897173217] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:33:02,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:33:02,933 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-29 02:33:02,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761704511] [2023-11-29 02:33:02,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:33:02,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-11-29 02:33:02,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:33:02,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-11-29 02:33:02,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2023-11-29 02:33:02,935 INFO L87 Difference]: Start difference. First operand 7962 states and 13558 transitions. Second operand has 15 states, 13 states have (on average 8.307692307692308) internal successors, (108), 7 states have internal predecessors, (108), 4 states have call successors, (44), 8 states have call predecessors, (44), 3 states have return successors, (40), 5 states have call predecessors, (40), 4 states have call successors, (40) [2023-11-29 02:33:18,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:33:18,491 INFO L93 Difference]: Finished difference Result 17546 states and 32794 transitions. [2023-11-29 02:33:18,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 02:33:18,491 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 8.307692307692308) internal successors, (108), 7 states have internal predecessors, (108), 4 states have call successors, (44), 8 states have call predecessors, (44), 3 states have return successors, (40), 5 states have call predecessors, (40), 4 states have call successors, (40) Word has length 265 [2023-11-29 02:33:18,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:33:18,544 INFO L225 Difference]: With dead ends: 17546 [2023-11-29 02:33:18,544 INFO L226 Difference]: Without dead ends: 9723 [2023-11-29 02:33:18,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=192, Invalid=620, Unknown=0, NotChecked=0, Total=812 [2023-11-29 02:33:18,579 INFO L413 NwaCegarLoop]: 544 mSDtfsCounter, 2708 mSDsluCounter, 4093 mSDsCounter, 0 mSdLazyCounter, 9927 mSolverCounterSat, 2205 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 12.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2709 SdHoareTripleChecker+Valid, 4637 SdHoareTripleChecker+Invalid, 12132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2205 IncrementalHoareTripleChecker+Valid, 9927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:33:18,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2709 Valid, 4637 Invalid, 12132 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2205 Valid, 9927 Invalid, 0 Unknown, 0 Unchecked, 13.3s Time] [2023-11-29 02:33:18,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9723 states. [2023-11-29 02:33:20,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9723 to 7966. [2023-11-29 02:33:20,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7966 states, 5254 states have (on average 1.308907499048344) internal successors, (6877), 5326 states have internal predecessors, (6877), 1939 states have call successors, (1939), 529 states have call predecessors, (1939), 765 states have return successors, (4746), 2131 states have call predecessors, (4746), 1935 states have call successors, (4746) [2023-11-29 02:33:20,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7966 states to 7966 states and 13562 transitions. [2023-11-29 02:33:20,190 INFO L78 Accepts]: Start accepts. Automaton has 7966 states and 13562 transitions. Word has length 265 [2023-11-29 02:33:20,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:33:20,191 INFO L495 AbstractCegarLoop]: Abstraction has 7966 states and 13562 transitions. [2023-11-29 02:33:20,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 8.307692307692308) internal successors, (108), 7 states have internal predecessors, (108), 4 states have call successors, (44), 8 states have call predecessors, (44), 3 states have return successors, (40), 5 states have call predecessors, (40), 4 states have call successors, (40) [2023-11-29 02:33:20,191 INFO L276 IsEmpty]: Start isEmpty. Operand 7966 states and 13562 transitions. [2023-11-29 02:33:20,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-11-29 02:33:20,198 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:33:20,198 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 5, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:33:20,198 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2023-11-29 02:33:20,199 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting destroy_asyncErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2023-11-29 02:33:20,199 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:33:20,199 INFO L85 PathProgramCache]: Analyzing trace with hash -485937251, now seen corresponding path program 1 times [2023-11-29 02:33:20,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:33:20,199 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716747573] [2023-11-29 02:33:20,199 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:33:20,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:33:20,379 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 02:33:20,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1166131151] [2023-11-29 02:33:20,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:33:20,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:33:20,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:33:20,380 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:33:20,381 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 02:33:21,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:21,311 INFO L262 TraceCheckSpWp]: Trace formula consists of 2673 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 02:33:21,329 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:33:21,531 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 96 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2023-11-29 02:33:21,531 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:33:21,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:33:21,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716747573] [2023-11-29 02:33:21,531 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 02:33:21,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166131151] [2023-11-29 02:33:21,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166131151] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:33:21,532 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:33:21,532 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2023-11-29 02:33:21,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800756875] [2023-11-29 02:33:21,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:33:21,533 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 02:33:21,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:33:21,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 02:33:21,534 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2023-11-29 02:33:21,534 INFO L87 Difference]: Start difference. First operand 7966 states and 13562 transitions. Second operand has 14 states, 11 states have (on average 10.454545454545455) internal successors, (115), 13 states have internal predecessors, (115), 7 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (43), 7 states have call predecessors, (43), 7 states have call successors, (43) [2023-11-29 02:33:27,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:33:27,060 INFO L93 Difference]: Finished difference Result 15863 states and 27025 transitions. [2023-11-29 02:33:27,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 02:33:27,061 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 11 states have (on average 10.454545454545455) internal successors, (115), 13 states have internal predecessors, (115), 7 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (43), 7 states have call predecessors, (43), 7 states have call successors, (43) Word has length 244 [2023-11-29 02:33:27,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:33:27,094 INFO L225 Difference]: With dead ends: 15863 [2023-11-29 02:33:27,094 INFO L226 Difference]: Without dead ends: 7910 [2023-11-29 02:33:27,129 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 252 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=426, Unknown=0, NotChecked=0, Total=506 [2023-11-29 02:33:27,130 INFO L413 NwaCegarLoop]: 1153 mSDtfsCounter, 26 mSDsluCounter, 13797 mSDsCounter, 0 mSdLazyCounter, 2159 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 14950 SdHoareTripleChecker+Invalid, 2178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2023-11-29 02:33:27,130 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 14950 Invalid, 2178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2159 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2023-11-29 02:33:27,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7910 states. [2023-11-29 02:33:28,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7910 to 7910. [2023-11-29 02:33:28,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7910 states, 5224 states have (on average 1.3097243491577335) internal successors, (6842), 5292 states have internal predecessors, (6842), 1920 states have call successors, (1920), 522 states have call predecessors, (1920), 758 states have return successors, (4727), 2114 states have call predecessors, (4727), 1916 states have call successors, (4727) [2023-11-29 02:33:28,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7910 states to 7910 states and 13489 transitions. [2023-11-29 02:33:28,566 INFO L78 Accepts]: Start accepts. Automaton has 7910 states and 13489 transitions. Word has length 244 [2023-11-29 02:33:28,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:33:28,566 INFO L495 AbstractCegarLoop]: Abstraction has 7910 states and 13489 transitions. [2023-11-29 02:33:28,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 11 states have (on average 10.454545454545455) internal successors, (115), 13 states have internal predecessors, (115), 7 states have call successors, (50), 2 states have call predecessors, (50), 4 states have return successors, (43), 7 states have call predecessors, (43), 7 states have call successors, (43) [2023-11-29 02:33:28,567 INFO L276 IsEmpty]: Start isEmpty. Operand 7910 states and 13489 transitions. [2023-11-29 02:33:28,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2023-11-29 02:33:28,572 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:33:28,573 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 5, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:33:28,581 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 02:33:28,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2023-11-29 02:33:28,773 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting destroy_asyncErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2023-11-29 02:33:28,773 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:33:28,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1417726427, now seen corresponding path program 1 times [2023-11-29 02:33:28,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:33:28,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994231011] [2023-11-29 02:33:28,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:33:28,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:33:28,895 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 02:33:28,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2141144848] [2023-11-29 02:33:28,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:33:28,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:33:28,896 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:33:28,897 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:33:28,899 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 02:33:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:29,758 INFO L262 TraceCheckSpWp]: Trace formula consists of 2671 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 02:33:29,765 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:33:29,798 INFO L134 CoverageAnalysis]: Checked inductivity of 204 backedges. 68 proven. 0 refuted. 0 times theorem prover too weak. 136 trivial. 0 not checked. [2023-11-29 02:33:29,798 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:33:29,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:33:29,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994231011] [2023-11-29 02:33:29,799 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 02:33:29,799 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2141144848] [2023-11-29 02:33:29,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2141144848] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:33:29,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:33:29,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:33:29,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000071588] [2023-11-29 02:33:29,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:33:29,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:33:29,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:33:29,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:33:29,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:33:29,801 INFO L87 Difference]: Start difference. First operand 7910 states and 13489 transitions. Second operand has 6 states, 5 states have (on average 23.0) internal successors, (115), 6 states have internal predecessors, (115), 3 states have call successors, (50), 2 states have call predecessors, (50), 3 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2023-11-29 02:33:32,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:33:32,760 INFO L93 Difference]: Finished difference Result 11731 states and 19802 transitions. [2023-11-29 02:33:32,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:33:32,761 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 23.0) internal successors, (115), 6 states have internal predecessors, (115), 3 states have call successors, (50), 2 states have call predecessors, (50), 3 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) Word has length 244 [2023-11-29 02:33:32,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:33:32,790 INFO L225 Difference]: With dead ends: 11731 [2023-11-29 02:33:32,790 INFO L226 Difference]: Without dead ends: 7910 [2023-11-29 02:33:32,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 245 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 02:33:32,804 INFO L413 NwaCegarLoop]: 1156 mSDtfsCounter, 383 mSDsluCounter, 4091 mSDsCounter, 0 mSdLazyCounter, 735 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 484 SdHoareTripleChecker+Valid, 5247 SdHoareTripleChecker+Invalid, 829 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 735 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2023-11-29 02:33:32,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [484 Valid, 5247 Invalid, 829 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 735 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2023-11-29 02:33:32,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7910 states. [2023-11-29 02:33:34,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7910 to 7908. [2023-11-29 02:33:34,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7908 states, 5223 states have (on average 1.3095921883974728) internal successors, (6840), 5291 states have internal predecessors, (6840), 1919 states have call successors, (1919), 522 states have call predecessors, (1919), 758 states have return successors, (4726), 2113 states have call predecessors, (4726), 1915 states have call successors, (4726) [2023-11-29 02:33:34,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7908 states to 7908 states and 13485 transitions. [2023-11-29 02:33:34,184 INFO L78 Accepts]: Start accepts. Automaton has 7908 states and 13485 transitions. Word has length 244 [2023-11-29 02:33:34,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:33:34,185 INFO L495 AbstractCegarLoop]: Abstraction has 7908 states and 13485 transitions. [2023-11-29 02:33:34,185 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 23.0) internal successors, (115), 6 states have internal predecessors, (115), 3 states have call successors, (50), 2 states have call predecessors, (50), 3 states have return successors, (43), 3 states have call predecessors, (43), 3 states have call successors, (43) [2023-11-29 02:33:34,185 INFO L276 IsEmpty]: Start isEmpty. Operand 7908 states and 13485 transitions. [2023-11-29 02:33:34,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2023-11-29 02:33:34,190 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:33:34,191 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:33:34,200 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 02:33:34,391 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2023-11-29 02:33:34,391 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ldv_linux_usb_dev_usb_put_devErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2023-11-29 02:33:34,392 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:33:34,392 INFO L85 PathProgramCache]: Analyzing trace with hash 2102505073, now seen corresponding path program 1 times [2023-11-29 02:33:34,392 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:33:34,392 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796893203] [2023-11-29 02:33:34,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:33:34,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:33:34,557 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 02:33:34,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [24209035] [2023-11-29 02:33:34,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:33:34,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:33:34,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:33:34,558 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:33:34,559 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 02:33:35,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:35,853 INFO L262 TraceCheckSpWp]: Trace formula consists of 2901 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-29 02:33:35,861 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:33:35,982 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 194 proven. 2 refuted. 0 times theorem prover too weak. 296 trivial. 0 not checked. [2023-11-29 02:33:35,982 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:33:36,472 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 4 proven. 46 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2023-11-29 02:33:36,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:33:36,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796893203] [2023-11-29 02:33:36,473 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 02:33:36,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24209035] [2023-11-29 02:33:36,473 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24209035] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:33:36,473 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:33:36,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2023-11-29 02:33:36,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528845203] [2023-11-29 02:33:36,474 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:33:36,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 02:33:36,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:33:36,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 02:33:36,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2023-11-29 02:33:36,476 INFO L87 Difference]: Start difference. First operand 7908 states and 13485 transitions. Second operand has 14 states, 10 states have (on average 17.8) internal successors, (178), 12 states have internal predecessors, (178), 5 states have call successors, (92), 2 states have call predecessors, (92), 5 states have return successors, (90), 6 states have call predecessors, (90), 5 states have call successors, (90) [2023-11-29 02:33:40,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:33:40,646 INFO L93 Difference]: Finished difference Result 15800 states and 26947 transitions. [2023-11-29 02:33:40,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 02:33:40,646 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 17.8) internal successors, (178), 12 states have internal predecessors, (178), 5 states have call successors, (92), 2 states have call predecessors, (92), 5 states have return successors, (90), 6 states have call predecessors, (90), 5 states have call successors, (90) Word has length 282 [2023-11-29 02:33:40,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:33:40,686 INFO L225 Difference]: With dead ends: 15800 [2023-11-29 02:33:40,686 INFO L226 Difference]: Without dead ends: 7908 [2023-11-29 02:33:40,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 564 GetRequests, 550 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2023-11-29 02:33:40,725 INFO L413 NwaCegarLoop]: 1152 mSDtfsCounter, 84 mSDsluCounter, 10108 mSDsCounter, 0 mSdLazyCounter, 1561 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 11260 SdHoareTripleChecker+Invalid, 1561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1561 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2023-11-29 02:33:40,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 11260 Invalid, 1561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1561 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2023-11-29 02:33:40,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7908 states. [2023-11-29 02:33:42,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7908 to 7908. [2023-11-29 02:33:42,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7908 states, 5223 states have (on average 1.3094007275512158) internal successors, (6839), 5290 states have internal predecessors, (6839), 1919 states have call successors, (1919), 522 states have call predecessors, (1919), 758 states have return successors, (4726), 2113 states have call predecessors, (4726), 1915 states have call successors, (4726) [2023-11-29 02:33:42,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7908 states to 7908 states and 13484 transitions. [2023-11-29 02:33:42,230 INFO L78 Accepts]: Start accepts. Automaton has 7908 states and 13484 transitions. Word has length 282 [2023-11-29 02:33:42,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:33:42,230 INFO L495 AbstractCegarLoop]: Abstraction has 7908 states and 13484 transitions. [2023-11-29 02:33:42,230 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 17.8) internal successors, (178), 12 states have internal predecessors, (178), 5 states have call successors, (92), 2 states have call predecessors, (92), 5 states have return successors, (90), 6 states have call predecessors, (90), 5 states have call successors, (90) [2023-11-29 02:33:42,230 INFO L276 IsEmpty]: Start isEmpty. Operand 7908 states and 13484 transitions. [2023-11-29 02:33:42,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2023-11-29 02:33:42,235 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:33:42,235 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:33:42,248 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 02:33:42,435 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:33:42,436 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ldv_linux_usb_dev_usb_put_devErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2023-11-29 02:33:42,436 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:33:42,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1009636694, now seen corresponding path program 1 times [2023-11-29 02:33:42,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:33:42,436 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1983342165] [2023-11-29 02:33:42,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:33:42,436 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:33:42,612 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 02:33:42,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [102922422] [2023-11-29 02:33:42,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:33:42,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:33:42,612 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:33:42,613 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:33:42,614 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 02:33:53,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:33:53,493 INFO L262 TraceCheckSpWp]: Trace formula consists of 2918 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-29 02:33:53,500 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:33:53,608 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 260 proven. 2 refuted. 0 times theorem prover too weak. 230 trivial. 0 not checked. [2023-11-29 02:33:53,608 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:33:54,019 INFO L134 CoverageAnalysis]: Checked inductivity of 492 backedges. 13 proven. 37 refuted. 0 times theorem prover too weak. 442 trivial. 0 not checked. [2023-11-29 02:33:54,019 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:33:54,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1983342165] [2023-11-29 02:33:54,019 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 02:33:54,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [102922422] [2023-11-29 02:33:54,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [102922422] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:33:54,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 02:33:54,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 14 [2023-11-29 02:33:54,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242010361] [2023-11-29 02:33:54,020 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 02:33:54,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 02:33:54,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:33:54,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 02:33:54,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2023-11-29 02:33:54,023 INFO L87 Difference]: Start difference. First operand 7908 states and 13484 transitions. Second operand has 14 states, 10 states have (on average 17.9) internal successors, (179), 12 states have internal predecessors, (179), 5 states have call successors, (92), 2 states have call predecessors, (92), 5 states have return successors, (90), 6 states have call predecessors, (90), 5 states have call successors, (90) [2023-11-29 02:33:57,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:33:57,787 INFO L93 Difference]: Finished difference Result 15795 states and 26938 transitions. [2023-11-29 02:33:57,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 02:33:57,788 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 10 states have (on average 17.9) internal successors, (179), 12 states have internal predecessors, (179), 5 states have call successors, (92), 2 states have call predecessors, (92), 5 states have return successors, (90), 6 states have call predecessors, (90), 5 states have call successors, (90) Word has length 285 [2023-11-29 02:33:57,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:33:57,815 INFO L225 Difference]: With dead ends: 15795 [2023-11-29 02:33:57,815 INFO L226 Difference]: Without dead ends: 7908 [2023-11-29 02:33:57,839 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 570 GetRequests, 556 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2023-11-29 02:33:57,840 INFO L413 NwaCegarLoop]: 1151 mSDtfsCounter, 156 mSDsluCounter, 7926 mSDsCounter, 0 mSdLazyCounter, 1248 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 9077 SdHoareTripleChecker+Invalid, 1290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:33:57,840 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 9077 Invalid, 1290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1248 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2023-11-29 02:33:57,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7908 states. [2023-11-29 02:33:59,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7908 to 7908. [2023-11-29 02:33:59,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7908 states, 5223 states have (on average 1.3092092667049589) internal successors, (6838), 5289 states have internal predecessors, (6838), 1919 states have call successors, (1919), 522 states have call predecessors, (1919), 758 states have return successors, (4726), 2113 states have call predecessors, (4726), 1915 states have call successors, (4726) [2023-11-29 02:33:59,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7908 states to 7908 states and 13483 transitions. [2023-11-29 02:33:59,205 INFO L78 Accepts]: Start accepts. Automaton has 7908 states and 13483 transitions. Word has length 285 [2023-11-29 02:33:59,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:33:59,206 INFO L495 AbstractCegarLoop]: Abstraction has 7908 states and 13483 transitions. [2023-11-29 02:33:59,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 10 states have (on average 17.9) internal successors, (179), 12 states have internal predecessors, (179), 5 states have call successors, (92), 2 states have call predecessors, (92), 5 states have return successors, (90), 6 states have call predecessors, (90), 5 states have call successors, (90) [2023-11-29 02:33:59,206 INFO L276 IsEmpty]: Start isEmpty. Operand 7908 states and 13483 transitions. [2023-11-29 02:33:59,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 267 [2023-11-29 02:33:59,210 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:33:59,210 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:33:59,227 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 02:33:59,411 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:33:59,412 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ldv_linux_usb_dev_usb_put_devErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2023-11-29 02:33:59,413 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:33:59,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1751494430, now seen corresponding path program 1 times [2023-11-29 02:33:59,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:33:59,414 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [169546369] [2023-11-29 02:33:59,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:33:59,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:33:59,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:34:00,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 02:34:00,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-29 02:34:00,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2023-11-29 02:34:00,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2023-11-29 02:34:00,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:34:00,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:34:00,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:34:00,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2023-11-29 02:34:00,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2023-11-29 02:34:00,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:34:00,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:34:00,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:34:00,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2023-11-29 02:34:00,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2023-11-29 02:34:00,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:34:00,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:34:00,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:34:00,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2023-11-29 02:34:00,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:34:00,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:34:00,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:34:00,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2023-11-29 02:34:00,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:34:00,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:34:00,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2023-11-29 02:34:00,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2023-11-29 02:34:00,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2023-11-29 02:34:00,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2023-11-29 02:34:00,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2023-11-29 02:34:00,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2023-11-29 02:34:00,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2023-11-29 02:34:00,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2023-11-29 02:34:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:34:00,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 158 [2023-11-29 02:34:00,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2023-11-29 02:34:00,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2023-11-29 02:34:00,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2023-11-29 02:34:00,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 180 [2023-11-29 02:34:00,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 185 [2023-11-29 02:34:00,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2023-11-29 02:34:00,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2023-11-29 02:34:00,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:34:00,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2023-11-29 02:34:00,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2023-11-29 02:34:00,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2023-11-29 02:34:00,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2023-11-29 02:34:00,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2023-11-29 02:34:00,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2023-11-29 02:34:00,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2023-11-29 02:34:00,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2023-11-29 02:34:00,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2023-11-29 02:34:00,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:00,827 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 28 proven. 4 refuted. 0 times theorem prover too weak. 472 trivial. 0 not checked. [2023-11-29 02:34:00,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:34:00,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [169546369] [2023-11-29 02:34:00,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [169546369] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:34:00,827 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [57772181] [2023-11-29 02:34:00,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:34:00,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:34:00,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:34:00,828 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:34:00,830 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 02:34:01,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:01,904 INFO L262 TraceCheckSpWp]: Trace formula consists of 2956 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-29 02:34:01,911 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:34:01,981 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 128 proven. 0 refuted. 0 times theorem prover too weak. 376 trivial. 0 not checked. [2023-11-29 02:34:01,981 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:34:01,981 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [57772181] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:34:01,981 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 02:34:01,981 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [18] total 19 [2023-11-29 02:34:01,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448812738] [2023-11-29 02:34:01,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:34:01,982 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 02:34:01,982 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:34:01,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 02:34:01,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2023-11-29 02:34:01,984 INFO L87 Difference]: Start difference. First operand 7908 states and 13483 transitions. Second operand has 11 states, 8 states have (on average 13.125) internal successors, (105), 10 states have internal predecessors, (105), 6 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (40), 6 states have call predecessors, (40), 6 states have call successors, (40) [2023-11-29 02:34:06,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:34:06,456 INFO L93 Difference]: Finished difference Result 16900 states and 29858 transitions. [2023-11-29 02:34:06,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 02:34:06,457 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 13.125) internal successors, (105), 10 states have internal predecessors, (105), 6 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (40), 6 states have call predecessors, (40), 6 states have call successors, (40) Word has length 266 [2023-11-29 02:34:06,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:34:06,495 INFO L225 Difference]: With dead ends: 16900 [2023-11-29 02:34:06,495 INFO L226 Difference]: Without dead ends: 9451 [2023-11-29 02:34:06,521 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 384 GetRequests, 361 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=527, Unknown=0, NotChecked=0, Total=600 [2023-11-29 02:34:06,522 INFO L413 NwaCegarLoop]: 1149 mSDtfsCounter, 222 mSDsluCounter, 10300 mSDsCounter, 0 mSdLazyCounter, 1638 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 11449 SdHoareTripleChecker+Invalid, 1657 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 1638 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2023-11-29 02:34:06,522 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [303 Valid, 11449 Invalid, 1657 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 1638 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2023-11-29 02:34:06,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9451 states. [2023-11-29 02:34:07,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9451 to 7934. [2023-11-29 02:34:07,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7934 states, 5239 states have (on average 1.3082649360564993) internal successors, (6854), 5305 states have internal predecessors, (6854), 1929 states have call successors, (1929), 522 states have call predecessors, (1929), 758 states have return successors, (4736), 2123 states have call predecessors, (4736), 1925 states have call successors, (4736) [2023-11-29 02:34:08,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7934 states to 7934 states and 13519 transitions. [2023-11-29 02:34:08,025 INFO L78 Accepts]: Start accepts. Automaton has 7934 states and 13519 transitions. Word has length 266 [2023-11-29 02:34:08,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:34:08,026 INFO L495 AbstractCegarLoop]: Abstraction has 7934 states and 13519 transitions. [2023-11-29 02:34:08,026 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 13.125) internal successors, (105), 10 states have internal predecessors, (105), 6 states have call successors, (45), 2 states have call predecessors, (45), 4 states have return successors, (40), 6 states have call predecessors, (40), 6 states have call successors, (40) [2023-11-29 02:34:08,026 INFO L276 IsEmpty]: Start isEmpty. Operand 7934 states and 13519 transitions. [2023-11-29 02:34:08,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2023-11-29 02:34:08,031 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:34:08,031 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:34:08,043 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 02:34:08,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:34:08,232 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ldv_linux_usb_dev_usb_put_devErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2023-11-29 02:34:08,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:34:08,232 INFO L85 PathProgramCache]: Analyzing trace with hash -912458407, now seen corresponding path program 1 times [2023-11-29 02:34:08,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:34:08,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840182748] [2023-11-29 02:34:08,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:34:08,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:34:08,371 ERROR L246 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2023-11-29 02:34:08,371 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [67840374] [2023-11-29 02:34:08,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:34:08,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:34:08,371 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:34:08,372 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:34:08,373 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_88fd0b1d-018c-4315-9ce2-31872b742cb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 02:34:11,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:34:11,215 INFO L262 TraceCheckSpWp]: Trace formula consists of 2935 conjuncts, 62 conjunts are in the unsatisfiable core [2023-11-29 02:34:11,223 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:34:11,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-11-29 02:34:11,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2023-11-29 02:34:54,229 INFO L134 CoverageAnalysis]: Checked inductivity of 494 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 389 trivial. 0 not checked. [2023-11-29 02:34:54,229 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:34:54,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:34:54,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840182748] [2023-11-29 02:34:54,229 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2023-11-29 02:34:54,229 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67840374] [2023-11-29 02:34:54,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67840374] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:34:54,230 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:34:54,230 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2023-11-29 02:34:54,230 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159911613] [2023-11-29 02:34:54,230 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:34:54,230 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 02:34:54,231 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:34:54,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 02:34:54,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=56, Unknown=8, NotChecked=0, Total=90 [2023-11-29 02:34:54,232 INFO L87 Difference]: Start difference. First operand 7934 states and 13519 transitions. Second operand has 10 states, 8 states have (on average 14.875) internal successors, (119), 10 states have internal predecessors, (119), 7 states have call successors, (50), 4 states have call predecessors, (50), 6 states have return successors, (46), 7 states have call predecessors, (46), 7 states have call successors, (46) [2023-11-29 02:34:58,310 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:35:02,347 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:35:06,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:35:10,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:35:14,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:35:18,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:35:22,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:35:26,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:35:30,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:35:34,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:35:38,803 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:35:42,820 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:35:46,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:35:51,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:35:55,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:35:59,345 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:36:03,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:36:07,559 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:36:11,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:36:15,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:36:19,776 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:36:23,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:36:27,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:36:31,845 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:36:35,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:36:39,918 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:36:43,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:36:48,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:36:52,086 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:36:56,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:37:00,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:37:04,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:37:08,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:37:12,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:37:16,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:37:20,338 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:37:24,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.15s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:37:28,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:37:32,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:37:36,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:37:40,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:37:44,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:37:48,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:37:52,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:37:56,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:38:00,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:38:05,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:38:09,149 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:38:13,192 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:38:17,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:38:21,335 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:38:25,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:38:29,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:38:33,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:38:37,492 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:38:41,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:38:45,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:38:49,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:38:53,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:38:57,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:39:01,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:39:06,050 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:39:10,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:39:14,211 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:39:18,239 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:39:22,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:39:26,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:39:30,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:39:34,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:39:38,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:39:42,535 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:39:46,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:39:50,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:40:02,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:40:06,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:40:10,960 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:40:14,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:40:19,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:40:23,067 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:40:27,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:40:31,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:40:35,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:40:39,291 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:40:43,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:40:47,455 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0]