./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--input--misc--ims-pcu.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 5e519f3a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/bin/uautomizer-Dbtcem3rbc/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/bin/uautomizer-Dbtcem3rbc/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/bin/uautomizer-Dbtcem3rbc/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/bin/uautomizer-Dbtcem3rbc/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/bin/uautomizer-Dbtcem3rbc --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash e0c2b6cb89e48a11e817cc51933cd8194bf8c1187502e8ea2a988dbf620106e5 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-5e519f3 [2022-11-02 21:00:24,934 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-02 21:00:24,940 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-02 21:00:24,989 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-02 21:00:24,990 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-02 21:00:24,994 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-02 21:00:24,996 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-02 21:00:24,999 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-02 21:00:25,003 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-02 21:00:25,008 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-02 21:00:25,009 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-02 21:00:25,011 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-02 21:00:25,011 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-02 21:00:25,013 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-02 21:00:25,015 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-02 21:00:25,017 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-02 21:00:25,018 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-02 21:00:25,019 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-02 21:00:25,020 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-02 21:00:25,027 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-02 21:00:25,029 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-02 21:00:25,030 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-02 21:00:25,033 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-02 21:00:25,034 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-02 21:00:25,043 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-02 21:00:25,044 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-02 21:00:25,044 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-02 21:00:25,046 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-02 21:00:25,046 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-02 21:00:25,047 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-02 21:00:25,047 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-02 21:00:25,049 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-02 21:00:25,050 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-02 21:00:25,051 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-02 21:00:25,052 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-02 21:00:25,053 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-02 21:00:25,053 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-02 21:00:25,053 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-02 21:00:25,054 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-02 21:00:25,054 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-02 21:00:25,055 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-02 21:00:25,056 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/bin/uautomizer-Dbtcem3rbc/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-02 21:00:25,099 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-02 21:00:25,099 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-02 21:00:25,100 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-02 21:00:25,100 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-02 21:00:25,101 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-02 21:00:25,101 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-02 21:00:25,101 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-02 21:00:25,102 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-02 21:00:25,102 INFO L138 SettingsManager]: * Use SBE=true [2022-11-02 21:00:25,102 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-02 21:00:25,103 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-02 21:00:25,103 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-02 21:00:25,103 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-02 21:00:25,104 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-02 21:00:25,104 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-02 21:00:25,104 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-02 21:00:25,104 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-02 21:00:25,104 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-02 21:00:25,104 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-02 21:00:25,105 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-02 21:00:25,105 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-02 21:00:25,105 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:00:25,105 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-02 21:00:25,105 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-02 21:00:25,106 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-02 21:00:25,106 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-02 21:00:25,106 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-02 21:00:25,106 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-02 21:00:25,106 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-02 21:00:25,106 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-02 21:00:25,107 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/bin/uautomizer-Dbtcem3rbc/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/bin/uautomizer-Dbtcem3rbc Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! 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 -> e0c2b6cb89e48a11e817cc51933cd8194bf8c1187502e8ea2a988dbf620106e5 [2022-11-02 21:00:25,429 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-02 21:00:25,458 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-02 21:00:25,461 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-02 21:00:25,462 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-02 21:00:25,463 INFO L275 PluginConnector]: CDTParser initialized [2022-11-02 21:00:25,464 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/bin/uautomizer-Dbtcem3rbc/../../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i [2022-11-02 21:00:25,529 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/bin/uautomizer-Dbtcem3rbc/data/128e26af9/3a2fc86556314c26ad877c2831116606/FLAG488faeaa1 [2022-11-02 21:00:26,533 INFO L306 CDTParser]: Found 1 translation units. [2022-11-02 21:00:26,534 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i [2022-11-02 21:00:26,587 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/bin/uautomizer-Dbtcem3rbc/data/128e26af9/3a2fc86556314c26ad877c2831116606/FLAG488faeaa1 [2022-11-02 21:00:26,903 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/bin/uautomizer-Dbtcem3rbc/data/128e26af9/3a2fc86556314c26ad877c2831116606 [2022-11-02 21:00:26,906 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-02 21:00:26,908 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-02 21:00:26,909 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-02 21:00:26,910 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-02 21:00:26,913 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-02 21:00:26,914 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:00:26" (1/1) ... [2022-11-02 21:00:26,915 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6eb9cae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:26, skipping insertion in model container [2022-11-02 21:00:26,916 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.11 09:00:26" (1/1) ... [2022-11-02 21:00:26,923 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-02 21:00:27,046 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-02 21:00:30,340 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[341006,341019] [2022-11-02 21:00:30,343 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[341151,341164] [2022-11-02 21:00:30,344 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[341297,341310] [2022-11-02 21:00:30,344 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[341462,341475] [2022-11-02 21:00:30,345 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[341620,341633] [2022-11-02 21:00:30,345 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[341778,341791] [2022-11-02 21:00:30,346 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[341936,341949] [2022-11-02 21:00:30,346 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[342096,342109] [2022-11-02 21:00:30,347 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[342255,342268] [2022-11-02 21:00:30,348 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[342394,342407] [2022-11-02 21:00:30,348 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[342536,342549] [2022-11-02 21:00:30,349 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[342685,342698] [2022-11-02 21:00:30,349 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[342824,342837] [2022-11-02 21:00:30,350 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[342979,342992] [2022-11-02 21:00:30,350 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[343139,343152] [2022-11-02 21:00:30,351 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[343290,343303] [2022-11-02 21:00:30,351 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[343441,343454] [2022-11-02 21:00:30,352 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[343593,343606] [2022-11-02 21:00:30,353 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[343742,343755] [2022-11-02 21:00:30,353 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[343890,343903] [2022-11-02 21:00:30,354 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[344047,344060] [2022-11-02 21:00:30,354 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[344196,344209] [2022-11-02 21:00:30,355 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[344352,344365] [2022-11-02 21:00:30,355 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[344505,344518] [2022-11-02 21:00:30,356 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[344651,344664] [2022-11-02 21:00:30,356 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[344794,344807] [2022-11-02 21:00:30,357 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[344946,344959] [2022-11-02 21:00:30,358 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[345092,345105] [2022-11-02 21:00:30,358 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[345237,345250] [2022-11-02 21:00:30,359 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[345391,345404] [2022-11-02 21:00:30,359 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[345542,345555] [2022-11-02 21:00:30,360 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[345697,345710] [2022-11-02 21:00:30,360 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[345849,345862] [2022-11-02 21:00:30,361 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[346004,346017] [2022-11-02 21:00:30,361 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[346168,346181] [2022-11-02 21:00:30,362 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[346324,346337] [2022-11-02 21:00:30,362 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[346488,346501] [2022-11-02 21:00:30,363 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[346630,346643] [2022-11-02 21:00:30,363 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[346788,346801] [2022-11-02 21:00:30,364 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[346955,346968] [2022-11-02 21:00:30,365 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[347114,347127] [2022-11-02 21:00:30,365 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[347273,347286] [2022-11-02 21:00:30,366 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[347422,347435] [2022-11-02 21:00:30,366 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[347569,347582] [2022-11-02 21:00:30,367 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[347708,347721] [2022-11-02 21:00:30,367 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[347871,347884] [2022-11-02 21:00:30,368 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[348037,348050] [2022-11-02 21:00:30,369 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[348201,348214] [2022-11-02 21:00:30,369 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[348366,348379] [2022-11-02 21:00:30,370 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[348531,348544] [2022-11-02 21:00:30,370 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[348697,348710] [2022-11-02 21:00:30,371 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[348862,348875] [2022-11-02 21:00:30,371 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[349029,349042] [2022-11-02 21:00:30,372 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[349189,349202] [2022-11-02 21:00:30,372 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[349351,349364] [2022-11-02 21:00:30,373 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[349510,349523] [2022-11-02 21:00:30,373 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[349656,349669] [2022-11-02 21:00:30,374 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[349799,349812] [2022-11-02 21:00:30,374 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[349943,349956] [2022-11-02 21:00:30,375 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[350086,350099] [2022-11-02 21:00:30,375 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[350230,350243] [2022-11-02 21:00:30,376 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[350371,350384] [2022-11-02 21:00:30,376 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[350509,350522] [2022-11-02 21:00:30,377 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[350667,350680] [2022-11-02 21:00:30,377 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[350826,350839] [2022-11-02 21:00:30,378 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[350982,350995] [2022-11-02 21:00:30,378 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[351131,351144] [2022-11-02 21:00:30,379 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[351283,351296] [2022-11-02 21:00:30,379 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[351434,351447] [2022-11-02 21:00:30,380 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[351583,351596] [2022-11-02 21:00:30,380 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[351735,351748] [2022-11-02 21:00:30,380 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[351883,351896] [2022-11-02 21:00:30,381 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[352036,352049] [2022-11-02 21:00:30,381 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[352187,352200] [2022-11-02 21:00:30,382 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[352337,352350] [2022-11-02 21:00:30,382 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[352484,352497] [2022-11-02 21:00:30,382 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[352635,352648] [2022-11-02 21:00:30,383 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[352786,352799] [2022-11-02 21:00:30,383 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[352934,352947] [2022-11-02 21:00:30,384 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[353100,353113] [2022-11-02 21:00:30,384 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[353269,353282] [2022-11-02 21:00:30,384 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[353436,353449] [2022-11-02 21:00:30,385 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[353604,353617] [2022-11-02 21:00:30,385 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[353754,353767] [2022-11-02 21:00:30,386 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[353901,353914] [2022-11-02 21:00:30,387 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[354062,354075] [2022-11-02 21:00:30,387 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[354232,354245] [2022-11-02 21:00:30,388 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[354394,354407] [2022-11-02 21:00:30,396 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:00:30,432 INFO L203 MainTranslator]: Completed pre-run [2022-11-02 21:00:30,815 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[341006,341019] [2022-11-02 21:00:30,815 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[341151,341164] [2022-11-02 21:00:30,817 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[341297,341310] [2022-11-02 21:00:30,817 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[341462,341475] [2022-11-02 21:00:30,819 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[341620,341633] [2022-11-02 21:00:30,820 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[341778,341791] [2022-11-02 21:00:30,821 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[341936,341949] [2022-11-02 21:00:30,822 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[342096,342109] [2022-11-02 21:00:30,823 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[342255,342268] [2022-11-02 21:00:30,824 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[342394,342407] [2022-11-02 21:00:30,824 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[342536,342549] [2022-11-02 21:00:30,825 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[342685,342698] [2022-11-02 21:00:30,825 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[342824,342837] [2022-11-02 21:00:30,826 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[342979,342992] [2022-11-02 21:00:30,826 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[343139,343152] [2022-11-02 21:00:30,826 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[343290,343303] [2022-11-02 21:00:30,827 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[343441,343454] [2022-11-02 21:00:30,827 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[343593,343606] [2022-11-02 21:00:30,828 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[343742,343755] [2022-11-02 21:00:30,829 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[343890,343903] [2022-11-02 21:00:30,829 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[344047,344060] [2022-11-02 21:00:30,830 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[344196,344209] [2022-11-02 21:00:30,831 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[344352,344365] [2022-11-02 21:00:30,833 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[344505,344518] [2022-11-02 21:00:30,833 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[344651,344664] [2022-11-02 21:00:30,834 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[344794,344807] [2022-11-02 21:00:30,834 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[344946,344959] [2022-11-02 21:00:30,835 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[345092,345105] [2022-11-02 21:00:30,835 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[345237,345250] [2022-11-02 21:00:30,836 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[345391,345404] [2022-11-02 21:00:30,836 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[345542,345555] [2022-11-02 21:00:30,837 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[345697,345710] [2022-11-02 21:00:30,837 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[345849,345862] [2022-11-02 21:00:30,838 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[346004,346017] [2022-11-02 21:00:30,838 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[346168,346181] [2022-11-02 21:00:30,839 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[346324,346337] [2022-11-02 21:00:30,840 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[346488,346501] [2022-11-02 21:00:30,840 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[346630,346643] [2022-11-02 21:00:30,841 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[346788,346801] [2022-11-02 21:00:30,841 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[346955,346968] [2022-11-02 21:00:30,843 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[347114,347127] [2022-11-02 21:00:30,844 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[347273,347286] [2022-11-02 21:00:30,844 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[347422,347435] [2022-11-02 21:00:30,845 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[347569,347582] [2022-11-02 21:00:30,845 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[347708,347721] [2022-11-02 21:00:30,850 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[347871,347884] [2022-11-02 21:00:30,851 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[348037,348050] [2022-11-02 21:00:30,852 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[348201,348214] [2022-11-02 21:00:30,852 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[348366,348379] [2022-11-02 21:00:30,853 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[348531,348544] [2022-11-02 21:00:30,855 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[348697,348710] [2022-11-02 21:00:30,855 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[348862,348875] [2022-11-02 21:00:30,856 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[349029,349042] [2022-11-02 21:00:30,856 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[349189,349202] [2022-11-02 21:00:30,857 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[349351,349364] [2022-11-02 21:00:30,857 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[349510,349523] [2022-11-02 21:00:30,858 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[349656,349669] [2022-11-02 21:00:30,858 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[349799,349812] [2022-11-02 21:00:30,859 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[349943,349956] [2022-11-02 21:00:30,860 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[350086,350099] [2022-11-02 21:00:30,860 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[350230,350243] [2022-11-02 21:00:30,861 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[350371,350384] [2022-11-02 21:00:30,863 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[350509,350522] [2022-11-02 21:00:30,868 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[350667,350680] [2022-11-02 21:00:30,871 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[350826,350839] [2022-11-02 21:00:30,872 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[350982,350995] [2022-11-02 21:00:30,873 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[351131,351144] [2022-11-02 21:00:30,873 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[351283,351296] [2022-11-02 21:00:30,874 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[351434,351447] [2022-11-02 21:00:30,875 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[351583,351596] [2022-11-02 21:00:30,875 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[351735,351748] [2022-11-02 21:00:30,876 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[351883,351896] [2022-11-02 21:00:30,876 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[352036,352049] [2022-11-02 21:00:30,882 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[352187,352200] [2022-11-02 21:00:30,882 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[352337,352350] [2022-11-02 21:00:30,883 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[352484,352497] [2022-11-02 21:00:30,883 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[352635,352648] [2022-11-02 21:00:30,884 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[352786,352799] [2022-11-02 21:00:30,885 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[352934,352947] [2022-11-02 21:00:30,886 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[353100,353113] [2022-11-02 21:00:30,887 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[353269,353282] [2022-11-02 21:00:30,888 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[353436,353449] [2022-11-02 21:00:30,888 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[353604,353617] [2022-11-02 21:00:30,889 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[353754,353767] [2022-11-02 21:00:30,889 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[353901,353914] [2022-11-02 21:00:30,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[354062,354075] [2022-11-02 21:00:30,890 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[354232,354245] [2022-11-02 21:00:30,891 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i[354394,354407] [2022-11-02 21:00:30,895 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-02 21:00:31,242 INFO L208 MainTranslator]: Completed translation [2022-11-02 21:00:31,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:31 WrapperNode [2022-11-02 21:00:31,243 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-02 21:00:31,244 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-02 21:00:31,244 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-02 21:00:31,244 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-02 21:00:31,252 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:31" (1/1) ... [2022-11-02 21:00:31,370 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:31" (1/1) ... [2022-11-02 21:00:31,532 INFO L138 Inliner]: procedures = 609, calls = 2320, calls flagged for inlining = 291, calls inlined = 202, statements flattened = 4611 [2022-11-02 21:00:31,533 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-02 21:00:31,534 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-02 21:00:31,534 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-02 21:00:31,534 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-02 21:00:31,544 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:31" (1/1) ... [2022-11-02 21:00:31,544 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:31" (1/1) ... [2022-11-02 21:00:31,576 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:31" (1/1) ... [2022-11-02 21:00:31,577 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:31" (1/1) ... [2022-11-02 21:00:31,728 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:31" (1/1) ... [2022-11-02 21:00:31,742 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:31" (1/1) ... [2022-11-02 21:00:31,763 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:31" (1/1) ... [2022-11-02 21:00:31,774 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:31" (1/1) ... [2022-11-02 21:00:31,802 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-02 21:00:31,803 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-02 21:00:31,803 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-02 21:00:31,803 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-02 21:00:31,804 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:31" (1/1) ... [2022-11-02 21:00:31,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-02 21:00:31,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:00:31,833 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-02 21:00:31,862 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/bin/uautomizer-Dbtcem3rbc/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-02 21:00:31,882 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_nonpositive [2022-11-02 21:00:31,882 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_nonpositive [2022-11-02 21:00:31,882 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-11-02 21:00:31,883 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-11-02 21:00:31,883 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-02 21:00:31,884 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-02 21:00:31,884 INFO L130 BoogieDeclarations]: Found specification of procedure ims_pcu_handle_firmware_update [2022-11-02 21:00:31,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ims_pcu_handle_firmware_update [2022-11-02 21:00:31,884 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-02 21:00:31,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-02 21:00:31,884 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-11-02 21:00:31,884 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-11-02 21:00:31,885 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_usb_alloc_coherent [2022-11-02 21:00:31,885 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_usb_alloc_coherent [2022-11-02 21:00:31,886 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-11-02 21:00:31,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-11-02 21:00:31,886 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-11-02 21:00:31,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-11-02 21:00:31,887 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-11-02 21:00:31,887 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_sysfs_create_group [2022-11-02 21:00:31,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_sysfs_create_group [2022-11-02 21:00:31,888 INFO L130 BoogieDeclarations]: Found specification of procedure ihex_next_binrec [2022-11-02 21:00:31,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ihex_next_binrec [2022-11-02 21:00:31,888 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-11-02 21:00:31,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-11-02 21:00:31,888 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-11-02 21:00:31,888 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-11-02 21:00:31,889 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-11-02 21:00:31,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-11-02 21:00:31,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-02 21:00:31,889 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-11-02 21:00:31,889 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-11-02 21:00:31,889 INFO L130 BoogieDeclarations]: Found specification of procedure __ims_pcu_execute_bl_command [2022-11-02 21:00:31,889 INFO L138 BoogieDeclarations]: Found implementation of procedure __ims_pcu_execute_bl_command [2022-11-02 21:00:31,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-11-02 21:00:31,890 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-02 21:00:31,890 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-11-02 21:00:31,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-11-02 21:00:31,890 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-11-02 21:00:31,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-11-02 21:00:31,890 INFO L130 BoogieDeclarations]: Found specification of procedure input_free_device [2022-11-02 21:00:31,891 INFO L138 BoogieDeclarations]: Found implementation of procedure input_free_device [2022-11-02 21:00:31,891 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-11-02 21:00:31,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-11-02 21:00:31,891 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-02 21:00:31,891 INFO L130 BoogieDeclarations]: Found specification of procedure ims_pcu_ofn_bit_store [2022-11-02 21:00:31,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ims_pcu_ofn_bit_store [2022-11-02 21:00:31,892 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-11-02 21:00:31,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-11-02 21:00:31,892 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2022-11-02 21:00:31,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2022-11-02 21:00:31,892 INFO L130 BoogieDeclarations]: Found specification of procedure ims_pcu_destroy_backlight [2022-11-02 21:00:31,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ims_pcu_destroy_backlight [2022-11-02 21:00:31,892 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-11-02 21:00:31,892 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-11-02 21:00:31,893 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-11-02 21:00:31,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-11-02 21:00:31,893 INFO L130 BoogieDeclarations]: Found specification of procedure ims_pcu_resume [2022-11-02 21:00:31,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ims_pcu_resume [2022-11-02 21:00:31,894 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-11-02 21:00:31,894 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-11-02 21:00:31,894 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-11-02 21:00:31,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-11-02 21:00:31,894 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_completion_94 [2022-11-02 21:00:31,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_completion_94 [2022-11-02 21:00:31,895 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-11-02 21:00:31,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-11-02 21:00:31,895 INFO L130 BoogieDeclarations]: Found specification of procedure usb_to_input_id [2022-11-02 21:00:31,895 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_to_input_id [2022-11-02 21:00:31,895 INFO L130 BoogieDeclarations]: Found specification of procedure kstrtoint [2022-11-02 21:00:31,895 INFO L138 BoogieDeclarations]: Found implementation of procedure kstrtoint [2022-11-02 21:00:31,896 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-11-02 21:00:31,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-11-02 21:00:31,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-02 21:00:31,900 INFO L130 BoogieDeclarations]: Found specification of procedure ims_pcu_line_setup [2022-11-02 21:00:31,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ims_pcu_line_setup [2022-11-02 21:00:31,901 INFO L130 BoogieDeclarations]: Found specification of procedure complete [2022-11-02 21:00:31,901 INFO L138 BoogieDeclarations]: Found implementation of procedure complete [2022-11-02 21:00:31,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-02 21:00:31,901 INFO L130 BoogieDeclarations]: Found specification of procedure ims_pcu_stop_io [2022-11-02 21:00:31,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ims_pcu_stop_io [2022-11-02 21:00:31,902 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-11-02 21:00:31,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-11-02 21:00:31,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-02 21:00:31,903 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-11-02 21:00:31,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-11-02 21:00:31,903 INFO L130 BoogieDeclarations]: Found specification of procedure usb_control_msg [2022-11-02 21:00:31,903 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_control_msg [2022-11-02 21:00:31,903 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_cmd_mutex_of_ims_pcu [2022-11-02 21:00:31,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_cmd_mutex_of_ims_pcu [2022-11-02 21:00:31,904 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-11-02 21:00:31,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-11-02 21:00:31,904 INFO L130 BoogieDeclarations]: Found specification of procedure input_unregister_device [2022-11-02 21:00:31,904 INFO L138 BoogieDeclarations]: Found implementation of procedure input_unregister_device [2022-11-02 21:00:31,904 INFO L130 BoogieDeclarations]: Found specification of procedure ims_pcu_write_ofn_config [2022-11-02 21:00:31,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ims_pcu_write_ofn_config [2022-11-02 21:00:31,905 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-11-02 21:00:31,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-11-02 21:00:31,905 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_sysfs_remove_group [2022-11-02 21:00:31,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_sysfs_remove_group [2022-11-02 21:00:31,905 INFO L130 BoogieDeclarations]: Found specification of procedure ims_pcu_disconnect [2022-11-02 21:00:31,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ims_pcu_disconnect [2022-11-02 21:00:31,905 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-02 21:00:31,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-02 21:00:31,906 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2022-11-02 21:00:31,906 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2022-11-02 21:00:31,906 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2022-11-02 21:00:31,906 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2022-11-02 21:00:31,906 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-02 21:00:31,906 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-02 21:00:31,906 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-02 21:00:31,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-02 21:00:31,907 INFO L130 BoogieDeclarations]: Found specification of procedure put_unaligned_le32 [2022-11-02 21:00:31,907 INFO L138 BoogieDeclarations]: Found implementation of procedure put_unaligned_le32 [2022-11-02 21:00:31,907 INFO L130 BoogieDeclarations]: Found specification of procedure usb_make_path [2022-11-02 21:00:31,907 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_make_path [2022-11-02 21:00:31,907 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_maxp [2022-11-02 21:00:31,907 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_maxp [2022-11-02 21:00:31,908 INFO L130 BoogieDeclarations]: Found specification of procedure ims_pcu_get_info [2022-11-02 21:00:31,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ims_pcu_get_info [2022-11-02 21:00:31,908 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2022-11-02 21:00:31,909 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2022-11-02 21:00:31,909 INFO L130 BoogieDeclarations]: Found specification of procedure ims_pcu_ofn_reg_addr_store [2022-11-02 21:00:31,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ims_pcu_ofn_reg_addr_store [2022-11-02 21:00:31,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-02 21:00:31,909 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-02 21:00:31,910 INFO L130 BoogieDeclarations]: Found specification of procedure get_unaligned_le16 [2022-11-02 21:00:31,910 INFO L138 BoogieDeclarations]: Found implementation of procedure get_unaligned_le16 [2022-11-02 21:00:31,910 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-11-02 21:00:31,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-11-02 21:00:31,910 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_free_urb [2022-11-02 21:00:31,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_free_urb [2022-11-02 21:00:31,910 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_cmd_mutex_of_ims_pcu [2022-11-02 21:00:31,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_cmd_mutex_of_ims_pcu [2022-11-02 21:00:31,911 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-11-02 21:00:31,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-11-02 21:00:31,911 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-02 21:00:31,911 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-11-02 21:00:31,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-11-02 21:00:31,911 INFO L130 BoogieDeclarations]: Found specification of procedure ims_pcu_buffers_free [2022-11-02 21:00:31,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ims_pcu_buffers_free [2022-11-02 21:00:31,912 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-02 21:00:31,912 INFO L130 BoogieDeclarations]: Found specification of procedure usb_ifnum_to_if [2022-11-02 21:00:31,912 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_ifnum_to_if [2022-11-02 21:00:31,912 INFO L130 BoogieDeclarations]: Found specification of procedure input_allocate_device [2022-11-02 21:00:31,912 INFO L138 BoogieDeclarations]: Found implementation of procedure input_allocate_device [2022-11-02 21:00:31,912 INFO L130 BoogieDeclarations]: Found specification of procedure get_unaligned_le32 [2022-11-02 21:00:31,912 INFO L138 BoogieDeclarations]: Found implementation of procedure get_unaligned_le32 [2022-11-02 21:00:31,913 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_usb_free_coherent [2022-11-02 21:00:31,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_usb_free_coherent [2022-11-02 21:00:31,913 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_cmd_mutex_of_ims_pcu [2022-11-02 21:00:31,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_cmd_mutex_of_ims_pcu [2022-11-02 21:00:31,913 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-02 21:00:31,913 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_sched_completion__wait_without_init [2022-11-02 21:00:31,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_sched_completion__wait_without_init [2022-11-02 21:00:31,914 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-11-02 21:00:31,914 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-11-02 21:00:31,914 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab16 [2022-11-02 21:00:31,914 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab16 [2022-11-02 21:00:31,914 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-11-02 21:00:31,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-11-02 21:00:31,915 INFO L130 BoogieDeclarations]: Found specification of procedure __ims_pcu_execute_command [2022-11-02 21:00:31,915 INFO L138 BoogieDeclarations]: Found implementation of procedure __ims_pcu_execute_command [2022-11-02 21:00:31,915 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-11-02 21:00:31,915 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-11-02 21:00:31,915 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-11-02 21:00:31,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-11-02 21:00:31,916 INFO L130 BoogieDeclarations]: Found specification of procedure release_firmware [2022-11-02 21:00:31,916 INFO L138 BoogieDeclarations]: Found implementation of procedure release_firmware [2022-11-02 21:00:31,916 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-11-02 21:00:31,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-11-02 21:00:31,916 INFO L130 BoogieDeclarations]: Found specification of procedure ims_pcu_read_ofn_config [2022-11-02 21:00:31,916 INFO L138 BoogieDeclarations]: Found implementation of procedure ims_pcu_read_ofn_config [2022-11-02 21:00:31,916 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-11-02 21:00:31,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-11-02 21:00:31,917 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_alloc_urb [2022-11-02 21:00:31,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_alloc_urb [2022-11-02 21:00:31,917 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-11-02 21:00:31,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-11-02 21:00:31,917 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-11-02 21:00:31,917 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-11-02 21:00:31,918 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-11-02 21:00:31,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-11-02 21:00:31,918 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_bulk [2022-11-02 21:00:31,918 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_bulk [2022-11-02 21:00:31,918 INFO L130 BoogieDeclarations]: Found specification of procedure ims_pcu_ofn_bit_show [2022-11-02 21:00:31,918 INFO L138 BoogieDeclarations]: Found implementation of procedure ims_pcu_ofn_bit_show [2022-11-02 21:00:31,918 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-11-02 21:00:31,919 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-11-02 21:00:31,919 INFO L130 BoogieDeclarations]: Found specification of procedure ims_pcu_destroy_buttons [2022-11-02 21:00:31,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ims_pcu_destroy_buttons [2022-11-02 21:00:31,919 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-11-02 21:00:31,919 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-11-02 21:00:31,919 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-02 21:00:31,919 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-02 21:00:31,920 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-11-02 21:00:31,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-11-02 21:00:31,920 INFO L130 BoogieDeclarations]: Found specification of procedure ims_pcu_start_io [2022-11-02 21:00:31,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ims_pcu_start_io [2022-11-02 21:00:31,920 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-02 21:00:31,920 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-11-02 21:00:31,920 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-11-02 21:00:31,921 INFO L130 BoogieDeclarations]: Found specification of procedure ims_pcu_send_cmd_chunk [2022-11-02 21:00:31,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ims_pcu_send_cmd_chunk [2022-11-02 21:00:31,921 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-02 21:00:31,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-02 21:00:31,921 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-11-02 21:00:31,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-11-02 21:00:31,921 INFO L130 BoogieDeclarations]: Found specification of procedure input_register_device [2022-11-02 21:00:31,922 INFO L138 BoogieDeclarations]: Found implementation of procedure input_register_device [2022-11-02 21:00:31,923 INFO L130 BoogieDeclarations]: Found specification of procedure ims_pcu_byte_needs_escape [2022-11-02 21:00:31,923 INFO L138 BoogieDeclarations]: Found implementation of procedure ims_pcu_byte_needs_escape [2022-11-02 21:00:31,923 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-11-02 21:00:31,923 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-11-02 21:00:31,923 INFO L130 BoogieDeclarations]: Found specification of procedure __set_bit [2022-11-02 21:00:31,923 INFO L138 BoogieDeclarations]: Found implementation of procedure __set_bit [2022-11-02 21:00:31,923 INFO L130 BoogieDeclarations]: Found specification of procedure ihex_validate_fw [2022-11-02 21:00:31,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ihex_validate_fw [2022-11-02 21:00:31,924 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-11-02 21:00:31,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-11-02 21:00:31,924 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-11-02 21:00:31,924 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-11-02 21:00:31,924 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-02 21:00:31,924 INFO L130 BoogieDeclarations]: Found specification of procedure kstrtou8 [2022-11-02 21:00:31,925 INFO L138 BoogieDeclarations]: Found implementation of procedure kstrtou8 [2022-11-02 21:00:32,851 INFO L235 CfgBuilder]: Building ICFG [2022-11-02 21:00:32,854 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-02 21:00:32,993 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-02 21:00:36,997 INFO L276 CfgBuilder]: Performing block encoding [2022-11-02 21:00:37,026 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-02 21:00:37,027 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-02 21:00:37,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:00:37 BoogieIcfgContainer [2022-11-02 21:00:37,031 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-02 21:00:37,034 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-02 21:00:37,035 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-02 21:00:37,038 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-02 21:00:37,039 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.11 09:00:26" (1/3) ... [2022-11-02 21:00:37,039 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66079fcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:00:37, skipping insertion in model container [2022-11-02 21:00:37,040 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.11 09:00:31" (2/3) ... [2022-11-02 21:00:37,040 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66079fcd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.11 09:00:37, skipping insertion in model container [2022-11-02 21:00:37,041 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.11 09:00:37" (3/3) ... [2022-11-02 21:00:37,043 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--input--misc--ims-pcu.ko.cil.i [2022-11-02 21:00:37,062 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-02 21:00:37,063 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2022-11-02 21:00:37,182 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-02 21:00:37,190 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@253604b6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-02 21:00:37,190 INFO L358 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2022-11-02 21:00:37,199 INFO L276 IsEmpty]: Start isEmpty. Operand has 1491 states, 971 states have (on average 1.258496395468589) internal successors, (1222), 1027 states have internal predecessors, (1222), 385 states have call successors, (385), 104 states have call predecessors, (385), 103 states have return successors, (382), 382 states have call predecessors, (382), 382 states have call successors, (382) [2022-11-02 21:00:37,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-11-02 21:00:37,210 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:37,210 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:00:37,211 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-11-02 21:00:37,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:37,216 INFO L85 PathProgramCache]: Analyzing trace with hash -1443060829, now seen corresponding path program 1 times [2022-11-02 21:00:37,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:37,226 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692933032] [2022-11-02 21:00:37,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:37,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:37,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:38,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:00:38,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:38,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:00:38,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:38,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:00:38,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:38,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:00:38,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:38,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 21:00:38,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:38,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 21:00:38,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:38,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 21:00:38,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:38,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:00:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:38,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 21:00:38,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:38,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 21:00:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:38,600 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 21:00:38,600 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:38,601 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692933032] [2022-11-02 21:00:38,602 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [692933032] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:00:38,602 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:00:38,602 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:00:38,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683631217] [2022-11-02 21:00:38,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:00:38,611 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:00:38,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:38,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:00:38,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:00:38,655 INFO L87 Difference]: Start difference. First operand has 1491 states, 971 states have (on average 1.258496395468589) internal successors, (1222), 1027 states have internal predecessors, (1222), 385 states have call successors, (385), 104 states have call predecessors, (385), 103 states have return successors, (382), 382 states have call predecessors, (382), 382 states have call successors, (382) Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-02 21:00:42,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:42,645 INFO L93 Difference]: Finished difference Result 2933 states and 4046 transitions. [2022-11-02 21:00:42,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:00:42,647 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 71 [2022-11-02 21:00:42,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:00:42,673 INFO L225 Difference]: With dead ends: 2933 [2022-11-02 21:00:42,673 INFO L226 Difference]: Without dead ends: 1475 [2022-11-02 21:00:42,686 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:00:42,689 INFO L413 NwaCegarLoop]: 1830 mSDtfsCounter, 2704 mSDsluCounter, 1898 mSDsCounter, 0 mSdLazyCounter, 1794 mSolverCounterSat, 1252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2956 SdHoareTripleChecker+Valid, 3728 SdHoareTripleChecker+Invalid, 3046 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1252 IncrementalHoareTripleChecker+Valid, 1794 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:00:42,690 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2956 Valid, 3728 Invalid, 3046 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1252 Valid, 1794 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-11-02 21:00:42,712 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1475 states. [2022-11-02 21:00:42,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1475 to 1475. [2022-11-02 21:00:42,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1475 states, 961 states have (on average 1.2247658688865766) internal successors, (1177), 1014 states have internal predecessors, (1177), 382 states have call successors, (382), 103 states have call predecessors, (382), 102 states have return successors, (380), 380 states have call predecessors, (380), 380 states have call successors, (380) [2022-11-02 21:00:42,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1475 states to 1475 states and 1939 transitions. [2022-11-02 21:00:42,904 INFO L78 Accepts]: Start accepts. Automaton has 1475 states and 1939 transitions. Word has length 71 [2022-11-02 21:00:42,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:00:42,907 INFO L495 AbstractCegarLoop]: Abstraction has 1475 states and 1939 transitions. [2022-11-02 21:00:42,907 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-11-02 21:00:42,907 INFO L276 IsEmpty]: Start isEmpty. Operand 1475 states and 1939 transitions. [2022-11-02 21:00:42,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-11-02 21:00:42,920 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:42,920 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:00:42,921 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-02 21:00:42,921 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-11-02 21:00:42,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:42,922 INFO L85 PathProgramCache]: Analyzing trace with hash -191390958, now seen corresponding path program 1 times [2022-11-02 21:00:42,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:42,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088716565] [2022-11-02 21:00:42,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:42,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:43,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:43,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:00:43,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:43,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:00:43,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:43,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:00:43,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:43,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:00:43,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:43,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 21:00:43,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:43,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 21:00:43,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:43,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 21:00:43,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:43,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:00:43,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:43,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 21:00:43,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:43,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 21:00:43,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:43,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 21:00:43,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:43,562 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 21:00:43,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:43,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088716565] [2022-11-02 21:00:43,562 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088716565] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:00:43,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:00:43,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:00:43,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2000701812] [2022-11-02 21:00:43,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:00:43,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:00:43,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:43,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:00:43,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:00:43,565 INFO L87 Difference]: Start difference. First operand 1475 states and 1939 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 21:00:47,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:47,160 INFO L93 Difference]: Finished difference Result 1475 states and 1939 transitions. [2022-11-02 21:00:47,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:00:47,160 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 77 [2022-11-02 21:00:47,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:00:47,169 INFO L225 Difference]: With dead ends: 1475 [2022-11-02 21:00:47,169 INFO L226 Difference]: Without dead ends: 1473 [2022-11-02 21:00:47,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:00:47,171 INFO L413 NwaCegarLoop]: 1814 mSDtfsCounter, 2674 mSDsluCounter, 1886 mSDsCounter, 0 mSdLazyCounter, 1780 mSolverCounterSat, 1246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2923 SdHoareTripleChecker+Valid, 3700 SdHoareTripleChecker+Invalid, 3026 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1246 IncrementalHoareTripleChecker+Valid, 1780 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:00:47,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2923 Valid, 3700 Invalid, 3026 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1246 Valid, 1780 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-11-02 21:00:47,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states. [2022-11-02 21:00:47,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 1473. [2022-11-02 21:00:47,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1473 states, 960 states have (on average 1.2239583333333333) internal successors, (1175), 1012 states have internal predecessors, (1175), 382 states have call successors, (382), 103 states have call predecessors, (382), 102 states have return successors, (380), 380 states have call predecessors, (380), 380 states have call successors, (380) [2022-11-02 21:00:47,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1473 states to 1473 states and 1937 transitions. [2022-11-02 21:00:47,267 INFO L78 Accepts]: Start accepts. Automaton has 1473 states and 1937 transitions. Word has length 77 [2022-11-02 21:00:47,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:00:47,269 INFO L495 AbstractCegarLoop]: Abstraction has 1473 states and 1937 transitions. [2022-11-02 21:00:47,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-11-02 21:00:47,270 INFO L276 IsEmpty]: Start isEmpty. Operand 1473 states and 1937 transitions. [2022-11-02 21:00:47,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-02 21:00:47,271 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:47,271 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:00:47,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-02 21:00:47,272 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-11-02 21:00:47,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:47,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1554937333, now seen corresponding path program 1 times [2022-11-02 21:00:47,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:47,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995370879] [2022-11-02 21:00:47,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:47,273 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:47,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:47,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:00:47,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:47,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:00:47,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:47,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:00:47,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:47,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:00:47,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:47,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 21:00:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:47,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 21:00:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:47,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 21:00:47,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:47,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:00:47,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:47,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 21:00:47,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:47,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 21:00:47,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:47,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 21:00:47,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:47,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 21:00:47,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:47,944 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 21:00:47,944 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:47,944 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995370879] [2022-11-02 21:00:47,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995370879] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:00:47,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:00:47,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:00:47,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671725307] [2022-11-02 21:00:47,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:00:47,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:00:47,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:47,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:00:47,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:00:47,948 INFO L87 Difference]: Start difference. First operand 1473 states and 1937 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-02 21:00:51,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:51,565 INFO L93 Difference]: Finished difference Result 1473 states and 1937 transitions. [2022-11-02 21:00:51,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:00:51,566 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2022-11-02 21:00:51,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:00:51,574 INFO L225 Difference]: With dead ends: 1473 [2022-11-02 21:00:51,574 INFO L226 Difference]: Without dead ends: 1471 [2022-11-02 21:00:51,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:00:51,578 INFO L413 NwaCegarLoop]: 1812 mSDtfsCounter, 2668 mSDsluCounter, 1886 mSDsCounter, 0 mSdLazyCounter, 1778 mSolverCounterSat, 1246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2916 SdHoareTripleChecker+Valid, 3698 SdHoareTripleChecker+Invalid, 3024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1246 IncrementalHoareTripleChecker+Valid, 1778 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:00:51,582 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2916 Valid, 3698 Invalid, 3024 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1246 Valid, 1778 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-11-02 21:00:51,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1471 states. [2022-11-02 21:00:51,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1471 to 1471. [2022-11-02 21:00:51,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1471 states, 959 states have (on average 1.2231491136600625) internal successors, (1173), 1010 states have internal predecessors, (1173), 382 states have call successors, (382), 103 states have call predecessors, (382), 102 states have return successors, (380), 380 states have call predecessors, (380), 380 states have call successors, (380) [2022-11-02 21:00:51,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1471 states to 1471 states and 1935 transitions. [2022-11-02 21:00:51,676 INFO L78 Accepts]: Start accepts. Automaton has 1471 states and 1935 transitions. Word has length 83 [2022-11-02 21:00:51,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:00:51,679 INFO L495 AbstractCegarLoop]: Abstraction has 1471 states and 1935 transitions. [2022-11-02 21:00:51,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-02 21:00:51,679 INFO L276 IsEmpty]: Start isEmpty. Operand 1471 states and 1935 transitions. [2022-11-02 21:00:51,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-11-02 21:00:51,682 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:51,682 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:00:51,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-02 21:00:51,683 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-11-02 21:00:51,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:51,684 INFO L85 PathProgramCache]: Analyzing trace with hash -1601048255, now seen corresponding path program 1 times [2022-11-02 21:00:51,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:51,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881472904] [2022-11-02 21:00:51,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:51,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:51,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:52,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:00:52,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:52,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:00:52,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:52,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:00:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:52,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:00:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:52,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 21:00:52,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:52,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 21:00:52,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:52,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 21:00:52,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:52,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:00:52,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:52,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 21:00:52,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:52,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 21:00:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:52,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 21:00:52,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:52,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 21:00:52,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:52,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 21:00:52,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:52,279 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 21:00:52,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:52,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881472904] [2022-11-02 21:00:52,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881472904] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:00:52,280 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:00:52,280 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:00:52,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1689066354] [2022-11-02 21:00:52,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:00:52,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:00:52,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:52,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:00:52,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:00:52,282 INFO L87 Difference]: Start difference. First operand 1471 states and 1935 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-02 21:00:55,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:55,580 INFO L93 Difference]: Finished difference Result 1471 states and 1935 transitions. [2022-11-02 21:00:55,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:00:55,581 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 89 [2022-11-02 21:00:55,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:00:55,589 INFO L225 Difference]: With dead ends: 1471 [2022-11-02 21:00:55,590 INFO L226 Difference]: Without dead ends: 1469 [2022-11-02 21:00:55,591 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:00:55,592 INFO L413 NwaCegarLoop]: 1810 mSDtfsCounter, 2662 mSDsluCounter, 1886 mSDsCounter, 0 mSdLazyCounter, 1776 mSolverCounterSat, 1246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2909 SdHoareTripleChecker+Valid, 3696 SdHoareTripleChecker+Invalid, 3022 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1246 IncrementalHoareTripleChecker+Valid, 1776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:00:55,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2909 Valid, 3696 Invalid, 3022 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1246 Valid, 1776 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-11-02 21:00:55,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2022-11-02 21:00:55,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1469. [2022-11-02 21:00:55,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1469 states, 958 states have (on average 1.2223382045929019) internal successors, (1171), 1008 states have internal predecessors, (1171), 382 states have call successors, (382), 103 states have call predecessors, (382), 102 states have return successors, (380), 380 states have call predecessors, (380), 380 states have call successors, (380) [2022-11-02 21:00:55,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1469 states to 1469 states and 1933 transitions. [2022-11-02 21:00:55,693 INFO L78 Accepts]: Start accepts. Automaton has 1469 states and 1933 transitions. Word has length 89 [2022-11-02 21:00:55,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:00:55,694 INFO L495 AbstractCegarLoop]: Abstraction has 1469 states and 1933 transitions. [2022-11-02 21:00:55,694 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-11-02 21:00:55,694 INFO L276 IsEmpty]: Start isEmpty. Operand 1469 states and 1933 transitions. [2022-11-02 21:00:55,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-02 21:00:55,696 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:55,696 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:00:55,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-02 21:00:55,697 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-11-02 21:00:55,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:55,697 INFO L85 PathProgramCache]: Analyzing trace with hash 1359531351, now seen corresponding path program 1 times [2022-11-02 21:00:55,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:55,697 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292499490] [2022-11-02 21:00:55,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:55,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:55,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:56,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:00:56,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:56,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:00:56,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:56,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:00:56,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:56,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:00:56,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:56,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 21:00:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:56,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 21:00:56,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:56,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 21:00:56,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:56,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:00:56,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:56,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 21:00:56,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:56,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 21:00:56,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:56,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 21:00:56,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:56,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 21:00:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:56,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 21:00:56,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:56,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 21:00:56,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:00:56,254 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 21:00:56,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:00:56,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292499490] [2022-11-02 21:00:56,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1292499490] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:00:56,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:00:56,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:00:56,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [944203993] [2022-11-02 21:00:56,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:00:56,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:00:56,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:00:56,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:00:56,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:00:56,256 INFO L87 Difference]: Start difference. First operand 1469 states and 1933 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-02 21:00:59,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:00:59,546 INFO L93 Difference]: Finished difference Result 1469 states and 1933 transitions. [2022-11-02 21:00:59,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:00:59,547 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 95 [2022-11-02 21:00:59,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:00:59,555 INFO L225 Difference]: With dead ends: 1469 [2022-11-02 21:00:59,556 INFO L226 Difference]: Without dead ends: 1467 [2022-11-02 21:00:59,557 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:00:59,558 INFO L413 NwaCegarLoop]: 1808 mSDtfsCounter, 2656 mSDsluCounter, 1886 mSDsCounter, 0 mSdLazyCounter, 1774 mSolverCounterSat, 1246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2902 SdHoareTripleChecker+Valid, 3694 SdHoareTripleChecker+Invalid, 3020 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1246 IncrementalHoareTripleChecker+Valid, 1774 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:00:59,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2902 Valid, 3694 Invalid, 3020 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1246 Valid, 1774 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-11-02 21:00:59,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1467 states. [2022-11-02 21:00:59,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1467 to 1467. [2022-11-02 21:00:59,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1467 states, 957 states have (on average 1.2215256008359456) internal successors, (1169), 1006 states have internal predecessors, (1169), 382 states have call successors, (382), 103 states have call predecessors, (382), 102 states have return successors, (380), 380 states have call predecessors, (380), 380 states have call successors, (380) [2022-11-02 21:00:59,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1467 states to 1467 states and 1931 transitions. [2022-11-02 21:00:59,704 INFO L78 Accepts]: Start accepts. Automaton has 1467 states and 1931 transitions. Word has length 95 [2022-11-02 21:00:59,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:00:59,704 INFO L495 AbstractCegarLoop]: Abstraction has 1467 states and 1931 transitions. [2022-11-02 21:00:59,705 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-02 21:00:59,705 INFO L276 IsEmpty]: Start isEmpty. Operand 1467 states and 1931 transitions. [2022-11-02 21:00:59,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-02 21:00:59,707 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:00:59,707 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:00:59,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-02 21:00:59,708 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-11-02 21:00:59,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:00:59,710 INFO L85 PathProgramCache]: Analyzing trace with hash 1567667439, now seen corresponding path program 1 times [2022-11-02 21:00:59,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:00:59,710 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828521969] [2022-11-02 21:00:59,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:00:59,710 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:00:59,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:00,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:01:00,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:00,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:01:00,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:00,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:01:00,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:00,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:01:00,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:00,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 21:01:00,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:00,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 21:01:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:00,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 21:01:00,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:00,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:01:00,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:00,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 21:01:00,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:00,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 21:01:00,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:00,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 21:01:00,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:00,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 21:01:00,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:00,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 21:01:00,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:00,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 21:01:00,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:00,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 21:01:00,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:00,400 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 21:01:00,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:00,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828521969] [2022-11-02 21:01:00,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828521969] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:00,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:00,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:01:00,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1999973504] [2022-11-02 21:01:00,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:00,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:01:00,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:00,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:01:00,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:01:00,403 INFO L87 Difference]: Start difference. First operand 1467 states and 1931 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-02 21:01:03,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:03,626 INFO L93 Difference]: Finished difference Result 1467 states and 1931 transitions. [2022-11-02 21:01:03,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:01:03,627 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 101 [2022-11-02 21:01:03,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:03,634 INFO L225 Difference]: With dead ends: 1467 [2022-11-02 21:01:03,634 INFO L226 Difference]: Without dead ends: 1465 [2022-11-02 21:01:03,635 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:01:03,637 INFO L413 NwaCegarLoop]: 1806 mSDtfsCounter, 2650 mSDsluCounter, 1886 mSDsCounter, 0 mSdLazyCounter, 1772 mSolverCounterSat, 1246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2895 SdHoareTripleChecker+Valid, 3692 SdHoareTripleChecker+Invalid, 3018 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1246 IncrementalHoareTripleChecker+Valid, 1772 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:03,638 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2895 Valid, 3692 Invalid, 3018 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1246 Valid, 1772 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-11-02 21:01:03,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1465 states. [2022-11-02 21:01:03,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1465 to 1465. [2022-11-02 21:01:03,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1465 states, 956 states have (on average 1.2207112970711298) internal successors, (1167), 1004 states have internal predecessors, (1167), 382 states have call successors, (382), 103 states have call predecessors, (382), 102 states have return successors, (380), 380 states have call predecessors, (380), 380 states have call successors, (380) [2022-11-02 21:01:03,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1465 states to 1465 states and 1929 transitions. [2022-11-02 21:01:03,757 INFO L78 Accepts]: Start accepts. Automaton has 1465 states and 1929 transitions. Word has length 101 [2022-11-02 21:01:03,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:03,758 INFO L495 AbstractCegarLoop]: Abstraction has 1465 states and 1929 transitions. [2022-11-02 21:01:03,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-02 21:01:03,758 INFO L276 IsEmpty]: Start isEmpty. Operand 1465 states and 1929 transitions. [2022-11-02 21:01:03,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-11-02 21:01:03,761 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:03,761 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:01:03,761 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-02 21:01:03,761 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-11-02 21:01:03,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:03,762 INFO L85 PathProgramCache]: Analyzing trace with hash -960086196, now seen corresponding path program 1 times [2022-11-02 21:01:03,762 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:03,762 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584973494] [2022-11-02 21:01:03,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:03,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:03,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:04,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:01:04,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:04,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:01:04,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:04,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:01:04,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:04,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:01:04,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:04,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 21:01:04,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:04,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 21:01:04,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:04,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 21:01:04,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:04,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:01:04,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:04,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 21:01:04,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:04,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 21:01:04,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:04,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 21:01:04,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:04,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 21:01:04,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:04,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 21:01:04,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:04,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 21:01:04,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:04,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 21:01:04,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:04,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 21:01:04,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:04,299 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 21:01:04,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:04,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584973494] [2022-11-02 21:01:04,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1584973494] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:04,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:04,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:01:04,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627334618] [2022-11-02 21:01:04,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:04,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:01:04,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:04,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:01:04,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:01:04,302 INFO L87 Difference]: Start difference. First operand 1465 states and 1929 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-02 21:01:10,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:10,112 INFO L93 Difference]: Finished difference Result 2692 states and 3514 transitions. [2022-11-02 21:01:10,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 21:01:10,113 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 107 [2022-11-02 21:01:10,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:10,129 INFO L225 Difference]: With dead ends: 2692 [2022-11-02 21:01:10,130 INFO L226 Difference]: Without dead ends: 2690 [2022-11-02 21:01:10,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:01:10,132 INFO L413 NwaCegarLoop]: 2194 mSDtfsCounter, 3684 mSDsluCounter, 2816 mSDsCounter, 0 mSdLazyCounter, 3678 mSolverCounterSat, 1969 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3924 SdHoareTripleChecker+Valid, 5010 SdHoareTripleChecker+Invalid, 5647 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1969 IncrementalHoareTripleChecker+Valid, 3678 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:10,133 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3924 Valid, 5010 Invalid, 5647 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1969 Valid, 3678 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-11-02 21:01:10,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2690 states. [2022-11-02 21:01:10,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2690 to 2546. [2022-11-02 21:01:10,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2546 states, 1674 states have (on average 1.2180406212664276) internal successors, (2039), 1741 states have internal predecessors, (2039), 662 states have call successors, (662), 186 states have call predecessors, (662), 185 states have return successors, (663), 659 states have call predecessors, (663), 660 states have call successors, (663) [2022-11-02 21:01:10,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2546 states to 2546 states and 3364 transitions. [2022-11-02 21:01:10,405 INFO L78 Accepts]: Start accepts. Automaton has 2546 states and 3364 transitions. Word has length 107 [2022-11-02 21:01:10,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:10,406 INFO L495 AbstractCegarLoop]: Abstraction has 2546 states and 3364 transitions. [2022-11-02 21:01:10,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-02 21:01:10,406 INFO L276 IsEmpty]: Start isEmpty. Operand 2546 states and 3364 transitions. [2022-11-02 21:01:10,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-02 21:01:10,408 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:10,408 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:01:10,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-02 21:01:10,408 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-11-02 21:01:10,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:10,409 INFO L85 PathProgramCache]: Analyzing trace with hash -1041772623, now seen corresponding path program 1 times [2022-11-02 21:01:10,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:10,409 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455627247] [2022-11-02 21:01:10,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:10,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:10,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:10,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:01:10,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:10,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:01:10,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:10,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:01:10,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:10,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:01:10,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:10,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 21:01:10,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:10,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 21:01:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:10,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 21:01:10,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:10,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:01:10,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:10,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 21:01:10,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:10,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 21:01:10,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:10,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 21:01:10,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:10,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 21:01:10,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:10,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 21:01:10,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:10,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 21:01:10,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:10,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 21:01:10,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:10,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 21:01:10,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:10,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 21:01:10,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:10,930 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 21:01:10,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:10,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455627247] [2022-11-02 21:01:10,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455627247] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:10,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:10,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:01:10,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740996129] [2022-11-02 21:01:10,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:10,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:01:10,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:10,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:01:10,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:01:10,933 INFO L87 Difference]: Start difference. First operand 2546 states and 3364 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-02 21:01:14,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:14,289 INFO L93 Difference]: Finished difference Result 2546 states and 3364 transitions. [2022-11-02 21:01:14,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:01:14,290 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 113 [2022-11-02 21:01:14,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:14,303 INFO L225 Difference]: With dead ends: 2546 [2022-11-02 21:01:14,303 INFO L226 Difference]: Without dead ends: 2544 [2022-11-02 21:01:14,305 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:01:14,305 INFO L413 NwaCegarLoop]: 1804 mSDtfsCounter, 2648 mSDsluCounter, 1886 mSDsCounter, 0 mSdLazyCounter, 1766 mSolverCounterSat, 1246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2891 SdHoareTripleChecker+Valid, 3690 SdHoareTripleChecker+Invalid, 3012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1246 IncrementalHoareTripleChecker+Valid, 1766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:14,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2891 Valid, 3690 Invalid, 3012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1246 Valid, 1766 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-11-02 21:01:14,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2544 states. [2022-11-02 21:01:14,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2544 to 2544. [2022-11-02 21:01:14,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2544 states, 1673 states have (on average 1.217573221757322) internal successors, (2037), 1739 states have internal predecessors, (2037), 662 states have call successors, (662), 186 states have call predecessors, (662), 185 states have return successors, (663), 659 states have call predecessors, (663), 660 states have call successors, (663) [2022-11-02 21:01:14,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2544 states to 2544 states and 3362 transitions. [2022-11-02 21:01:14,535 INFO L78 Accepts]: Start accepts. Automaton has 2544 states and 3362 transitions. Word has length 113 [2022-11-02 21:01:14,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:14,536 INFO L495 AbstractCegarLoop]: Abstraction has 2544 states and 3362 transitions. [2022-11-02 21:01:14,536 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-02 21:01:14,536 INFO L276 IsEmpty]: Start isEmpty. Operand 2544 states and 3362 transitions. [2022-11-02 21:01:14,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-11-02 21:01:14,539 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:14,539 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:01:14,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-02 21:01:14,540 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-11-02 21:01:14,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:14,540 INFO L85 PathProgramCache]: Analyzing trace with hash -415972780, now seen corresponding path program 1 times [2022-11-02 21:01:14,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:14,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164970909] [2022-11-02 21:01:14,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:14,541 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:14,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:14,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:01:14,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:14,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:01:14,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:14,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:01:14,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:14,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:01:14,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:15,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 21:01:15,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:15,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 21:01:15,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:15,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 21:01:15,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:15,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:01:15,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:15,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 21:01:15,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:15,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 21:01:15,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:15,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 21:01:15,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:15,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 21:01:15,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:15,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 21:01:15,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:15,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 21:01:15,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:15,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 21:01:15,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:15,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 21:01:15,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:15,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 21:01:15,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:15,132 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 21:01:15,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:15,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164970909] [2022-11-02 21:01:15,132 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164970909] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:15,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:15,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:01:15,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2028114497] [2022-11-02 21:01:15,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:15,134 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:01:15,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:15,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:01:15,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:01:15,135 INFO L87 Difference]: Start difference. First operand 2544 states and 3362 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-02 21:01:18,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:18,548 INFO L93 Difference]: Finished difference Result 2544 states and 3362 transitions. [2022-11-02 21:01:18,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:01:18,549 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 115 [2022-11-02 21:01:18,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:18,563 INFO L225 Difference]: With dead ends: 2544 [2022-11-02 21:01:18,563 INFO L226 Difference]: Without dead ends: 2542 [2022-11-02 21:01:18,565 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:01:18,568 INFO L413 NwaCegarLoop]: 1802 mSDtfsCounter, 2636 mSDsluCounter, 1886 mSDsCounter, 0 mSdLazyCounter, 1768 mSolverCounterSat, 1246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2879 SdHoareTripleChecker+Valid, 3688 SdHoareTripleChecker+Invalid, 3014 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1246 IncrementalHoareTripleChecker+Valid, 1768 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:18,568 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2879 Valid, 3688 Invalid, 3014 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1246 Valid, 1768 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-11-02 21:01:18,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2542 states. [2022-11-02 21:01:18,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2542 to 2542. [2022-11-02 21:01:18,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2542 states, 1672 states have (on average 1.2171052631578947) internal successors, (2035), 1737 states have internal predecessors, (2035), 662 states have call successors, (662), 186 states have call predecessors, (662), 185 states have return successors, (663), 659 states have call predecessors, (663), 660 states have call successors, (663) [2022-11-02 21:01:18,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2542 states to 2542 states and 3360 transitions. [2022-11-02 21:01:18,845 INFO L78 Accepts]: Start accepts. Automaton has 2542 states and 3360 transitions. Word has length 115 [2022-11-02 21:01:18,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:18,846 INFO L495 AbstractCegarLoop]: Abstraction has 2542 states and 3360 transitions. [2022-11-02 21:01:18,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-11-02 21:01:18,846 INFO L276 IsEmpty]: Start isEmpty. Operand 2542 states and 3360 transitions. [2022-11-02 21:01:18,849 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-11-02 21:01:18,849 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:18,849 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:01:18,849 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-02 21:01:18,850 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-11-02 21:01:18,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:18,850 INFO L85 PathProgramCache]: Analyzing trace with hash -14146037, now seen corresponding path program 1 times [2022-11-02 21:01:18,850 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:18,851 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1864841739] [2022-11-02 21:01:18,851 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:18,851 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:19,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:01:19,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:19,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:01:19,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:19,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:01:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:19,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:01:19,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:19,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 21:01:19,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:19,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:01:19,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:19,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:01:19,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:19,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:01:19,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:19,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-02 21:01:19,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:19,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:01:19,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:19,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:01:19,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:19,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:01:19,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:19,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 21:01:19,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:19,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:01:19,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:19,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:01:19,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:19,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:01:19,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:19,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-02 21:01:19,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:19,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:01:19,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:19,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:01:19,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:19,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:01:19,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:19,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-02 21:01:19,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:19,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:01:19,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:19,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:01:19,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:19,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:01:19,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:19,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-02 21:01:19,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:19,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 21:01:19,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:19,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-02 21:01:19,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:19,574 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-11-02 21:01:19,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:19,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1864841739] [2022-11-02 21:01:19,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1864841739] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:19,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:19,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:01:19,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2085109861] [2022-11-02 21:01:19,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:19,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:01:19,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:19,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:01:19,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:01:19,576 INFO L87 Difference]: Start difference. First operand 2542 states and 3360 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, (18), 4 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2022-11-02 21:01:23,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:23,902 INFO L93 Difference]: Finished difference Result 2607 states and 3452 transitions. [2022-11-02 21:01:23,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-02 21:01:23,903 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, (18), 4 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 164 [2022-11-02 21:01:23,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:23,916 INFO L225 Difference]: With dead ends: 2607 [2022-11-02 21:01:23,917 INFO L226 Difference]: Without dead ends: 2605 [2022-11-02 21:01:23,918 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2022-11-02 21:01:23,919 INFO L413 NwaCegarLoop]: 1794 mSDtfsCounter, 1691 mSDsluCounter, 3191 mSDsCounter, 0 mSdLazyCounter, 3537 mSolverCounterSat, 1495 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1691 SdHoareTripleChecker+Valid, 4985 SdHoareTripleChecker+Invalid, 5032 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1495 IncrementalHoareTripleChecker+Valid, 3537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:23,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1691 Valid, 4985 Invalid, 5032 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1495 Valid, 3537 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-11-02 21:01:23,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2605 states. [2022-11-02 21:01:24,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2605 to 2548. [2022-11-02 21:01:24,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2548 states, 1677 states have (on average 1.2164579606440071) internal successors, (2040), 1742 states have internal predecessors, (2040), 662 states have call successors, (662), 186 states have call predecessors, (662), 186 states have return successors, (664), 659 states have call predecessors, (664), 660 states have call successors, (664) [2022-11-02 21:01:24,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2548 states to 2548 states and 3366 transitions. [2022-11-02 21:01:24,182 INFO L78 Accepts]: Start accepts. Automaton has 2548 states and 3366 transitions. Word has length 164 [2022-11-02 21:01:24,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:24,185 INFO L495 AbstractCegarLoop]: Abstraction has 2548 states and 3366 transitions. [2022-11-02 21:01:24,186 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, (18), 4 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2022-11-02 21:01:24,186 INFO L276 IsEmpty]: Start isEmpty. Operand 2548 states and 3366 transitions. [2022-11-02 21:01:24,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-11-02 21:01:24,189 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:24,189 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:01:24,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-02 21:01:24,189 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-11-02 21:01:24,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:24,190 INFO L85 PathProgramCache]: Analyzing trace with hash -14205619, now seen corresponding path program 1 times [2022-11-02 21:01:24,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:24,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401746470] [2022-11-02 21:01:24,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:24,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:24,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:24,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:01:24,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:24,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:01:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:24,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:01:24,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:24,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:01:24,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:24,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 21:01:24,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:24,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:01:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:24,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:01:24,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:24,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:01:24,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:24,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-02 21:01:24,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:24,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:01:24,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:24,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:01:24,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:24,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:01:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:24,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 21:01:24,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:24,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:01:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:24,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:01:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:24,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:01:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:24,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-02 21:01:24,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:24,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:01:24,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:24,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:01:24,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:24,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:01:24,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:24,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-02 21:01:24,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:24,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:01:24,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:24,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:01:24,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:24,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:01:24,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:24,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-02 21:01:24,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:24,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 21:01:24,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:25,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-11-02 21:01:25,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:25,020 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-11-02 21:01:25,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:25,020 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401746470] [2022-11-02 21:01:25,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1401746470] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:25,021 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:25,021 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-02 21:01:25,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971063380] [2022-11-02 21:01:25,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:25,022 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-02 21:01:25,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:25,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-02 21:01:25,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-02 21:01:25,023 INFO L87 Difference]: Start difference. First operand 2548 states and 3366 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-02 21:01:30,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:30,334 INFO L93 Difference]: Finished difference Result 5102 states and 6775 transitions. [2022-11-02 21:01:30,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:01:30,335 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 164 [2022-11-02 21:01:30,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:30,351 INFO L225 Difference]: With dead ends: 5102 [2022-11-02 21:01:30,351 INFO L226 Difference]: Without dead ends: 2593 [2022-11-02 21:01:30,360 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2022-11-02 21:01:30,361 INFO L413 NwaCegarLoop]: 1793 mSDtfsCounter, 3065 mSDsluCounter, 3734 mSDsCounter, 0 mSdLazyCounter, 4927 mSolverCounterSat, 1757 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3326 SdHoareTripleChecker+Valid, 5527 SdHoareTripleChecker+Invalid, 6684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1757 IncrementalHoareTripleChecker+Valid, 4927 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:30,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3326 Valid, 5527 Invalid, 6684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1757 Valid, 4927 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-11-02 21:01:30,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2593 states. [2022-11-02 21:01:30,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2593 to 2542. [2022-11-02 21:01:30,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2542 states, 1672 states have (on average 1.2147129186602872) internal successors, (2031), 1736 states have internal predecessors, (2031), 662 states have call successors, (662), 186 states have call predecessors, (662), 186 states have return successors, (664), 659 states have call predecessors, (664), 660 states have call successors, (664) [2022-11-02 21:01:30,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2542 states to 2542 states and 3357 transitions. [2022-11-02 21:01:30,623 INFO L78 Accepts]: Start accepts. Automaton has 2542 states and 3357 transitions. Word has length 164 [2022-11-02 21:01:30,624 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:30,624 INFO L495 AbstractCegarLoop]: Abstraction has 2542 states and 3357 transitions. [2022-11-02 21:01:30,624 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-11-02 21:01:30,624 INFO L276 IsEmpty]: Start isEmpty. Operand 2542 states and 3357 transitions. [2022-11-02 21:01:30,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-11-02 21:01:30,626 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:30,626 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:01:30,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-02 21:01:30,627 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-11-02 21:01:30,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:30,627 INFO L85 PathProgramCache]: Analyzing trace with hash -698388096, now seen corresponding path program 1 times [2022-11-02 21:01:30,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:30,628 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344897052] [2022-11-02 21:01:30,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:30,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:30,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:01:30,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:30,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:01:30,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:30,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:01:30,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:31,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:01:31,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:31,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 21:01:31,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:31,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 21:01:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:31,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 21:01:31,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:31,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:01:31,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:31,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 21:01:31,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:31,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 21:01:31,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:31,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 21:01:31,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:31,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 21:01:31,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:31,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 21:01:31,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:31,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 21:01:31,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:31,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 21:01:31,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:31,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 21:01:31,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:31,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 21:01:31,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:31,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 21:01:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:31,125 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 21:01:31,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:31,126 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344897052] [2022-11-02 21:01:31,126 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1344897052] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:31,126 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:31,126 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:01:31,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2093051285] [2022-11-02 21:01:31,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:31,127 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:01:31,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:31,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:01:31,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:01:31,128 INFO L87 Difference]: Start difference. First operand 2542 states and 3357 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-02 21:01:34,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:34,271 INFO L93 Difference]: Finished difference Result 2542 states and 3357 transitions. [2022-11-02 21:01:34,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:01:34,271 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 121 [2022-11-02 21:01:34,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:34,282 INFO L225 Difference]: With dead ends: 2542 [2022-11-02 21:01:34,282 INFO L226 Difference]: Without dead ends: 2540 [2022-11-02 21:01:34,284 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:01:34,285 INFO L413 NwaCegarLoop]: 1797 mSDtfsCounter, 2623 mSDsluCounter, 1886 mSDsCounter, 0 mSdLazyCounter, 1763 mSolverCounterSat, 1246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2865 SdHoareTripleChecker+Valid, 3683 SdHoareTripleChecker+Invalid, 3009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1246 IncrementalHoareTripleChecker+Valid, 1763 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:34,285 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2865 Valid, 3683 Invalid, 3009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1246 Valid, 1763 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-02 21:01:34,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2540 states. [2022-11-02 21:01:34,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2540 to 2540. [2022-11-02 21:01:34,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2540 states, 1671 states have (on average 1.2142429682824656) internal successors, (2029), 1734 states have internal predecessors, (2029), 662 states have call successors, (662), 186 states have call predecessors, (662), 186 states have return successors, (664), 659 states have call predecessors, (664), 660 states have call successors, (664) [2022-11-02 21:01:34,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2540 states to 2540 states and 3355 transitions. [2022-11-02 21:01:34,545 INFO L78 Accepts]: Start accepts. Automaton has 2540 states and 3355 transitions. Word has length 121 [2022-11-02 21:01:34,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:34,546 INFO L495 AbstractCegarLoop]: Abstraction has 2540 states and 3355 transitions. [2022-11-02 21:01:34,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-11-02 21:01:34,546 INFO L276 IsEmpty]: Start isEmpty. Operand 2540 states and 3355 transitions. [2022-11-02 21:01:34,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-11-02 21:01:34,549 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:34,549 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:01:34,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-02 21:01:34,549 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-11-02 21:01:34,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:34,550 INFO L85 PathProgramCache]: Analyzing trace with hash -317742788, now seen corresponding path program 1 times [2022-11-02 21:01:34,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:34,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1385061369] [2022-11-02 21:01:34,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:34,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:34,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:34,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:01:34,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:34,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:01:34,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:34,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:01:34,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:34,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:01:34,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:34,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 21:01:34,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:34,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 21:01:34,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:34,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 21:01:34,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:34,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:01:34,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:34,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 21:01:34,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:35,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 21:01:35,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:35,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 21:01:35,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:35,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 21:01:35,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:35,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 21:01:35,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:35,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 21:01:35,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:35,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 21:01:35,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:35,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 21:01:35,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:35,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 21:01:35,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:35,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 21:01:35,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:35,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-02 21:01:35,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:35,084 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 21:01:35,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:35,084 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1385061369] [2022-11-02 21:01:35,085 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1385061369] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:35,085 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:35,085 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:01:35,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981901607] [2022-11-02 21:01:35,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:35,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:01:35,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:35,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:01:35,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:01:35,087 INFO L87 Difference]: Start difference. First operand 2540 states and 3355 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-02 21:01:38,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:38,275 INFO L93 Difference]: Finished difference Result 2540 states and 3355 transitions. [2022-11-02 21:01:38,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:01:38,275 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 127 [2022-11-02 21:01:38,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:38,288 INFO L225 Difference]: With dead ends: 2540 [2022-11-02 21:01:38,288 INFO L226 Difference]: Without dead ends: 2538 [2022-11-02 21:01:38,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:01:38,291 INFO L413 NwaCegarLoop]: 1795 mSDtfsCounter, 2617 mSDsluCounter, 1886 mSDsCounter, 0 mSdLazyCounter, 1761 mSolverCounterSat, 1246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2858 SdHoareTripleChecker+Valid, 3681 SdHoareTripleChecker+Invalid, 3007 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1246 IncrementalHoareTripleChecker+Valid, 1761 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:38,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2858 Valid, 3681 Invalid, 3007 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1246 Valid, 1761 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-02 21:01:38,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2538 states. [2022-11-02 21:01:38,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2538 to 2538. [2022-11-02 21:01:38,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2538 states, 1670 states have (on average 1.2137724550898203) internal successors, (2027), 1732 states have internal predecessors, (2027), 662 states have call successors, (662), 186 states have call predecessors, (662), 186 states have return successors, (664), 659 states have call predecessors, (664), 660 states have call successors, (664) [2022-11-02 21:01:38,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2538 states to 2538 states and 3353 transitions. [2022-11-02 21:01:38,598 INFO L78 Accepts]: Start accepts. Automaton has 2538 states and 3353 transitions. Word has length 127 [2022-11-02 21:01:38,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:38,599 INFO L495 AbstractCegarLoop]: Abstraction has 2538 states and 3353 transitions. [2022-11-02 21:01:38,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-11-02 21:01:38,599 INFO L276 IsEmpty]: Start isEmpty. Operand 2538 states and 3353 transitions. [2022-11-02 21:01:38,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-11-02 21:01:38,602 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:38,603 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:01:38,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-02 21:01:38,603 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-11-02 21:01:38,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:38,604 INFO L85 PathProgramCache]: Analyzing trace with hash 997131382, now seen corresponding path program 1 times [2022-11-02 21:01:38,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:38,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002409740] [2022-11-02 21:01:38,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:38,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:38,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:38,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:01:38,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:38,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:01:38,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:38,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:01:38,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:38,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:01:38,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:38,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 21:01:38,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:38,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:01:38,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:38,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:01:38,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:38,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:01:38,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:38,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-02 21:01:38,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:38,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:01:38,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:38,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:01:38,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:38,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:01:38,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:38,970 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 21:01:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:38,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:01:38,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:38,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:01:38,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:38,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:01:38,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:38,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-02 21:01:39,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:39,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:01:39,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:39,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:01:39,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:39,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:01:39,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:39,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-02 21:01:39,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:39,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:01:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:39,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:01:39,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:39,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:01:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:39,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-02 21:01:39,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:39,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 21:01:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:39,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-02 21:01:39,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:39,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:01:39,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:39,098 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-11-02 21:01:39,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:39,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002409740] [2022-11-02 21:01:39,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002409740] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:39,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:39,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:01:39,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [247991512] [2022-11-02 21:01:39,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:39,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:01:39,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:39,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:01:39,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:01:39,101 INFO L87 Difference]: Start difference. First operand 2538 states and 3353 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-02 21:01:42,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:42,038 INFO L93 Difference]: Finished difference Result 5082 states and 6749 transitions. [2022-11-02 21:01:42,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:01:42,038 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 171 [2022-11-02 21:01:42,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:42,051 INFO L225 Difference]: With dead ends: 5082 [2022-11-02 21:01:42,051 INFO L226 Difference]: Without dead ends: 2583 [2022-11-02 21:01:42,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:01:42,060 INFO L413 NwaCegarLoop]: 1786 mSDtfsCounter, 3031 mSDsluCounter, 1581 mSDsCounter, 0 mSdLazyCounter, 1288 mSolverCounterSat, 1752 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3291 SdHoareTripleChecker+Valid, 3367 SdHoareTripleChecker+Invalid, 3040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1752 IncrementalHoareTripleChecker+Valid, 1288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:42,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3291 Valid, 3367 Invalid, 3040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1752 Valid, 1288 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2022-11-02 21:01:42,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2583 states. [2022-11-02 21:01:42,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2583 to 2532. [2022-11-02 21:01:42,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2532 states, 1665 states have (on average 1.212012012012012) internal successors, (2018), 1726 states have internal predecessors, (2018), 662 states have call successors, (662), 186 states have call predecessors, (662), 186 states have return successors, (664), 659 states have call predecessors, (664), 660 states have call successors, (664) [2022-11-02 21:01:42,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2532 states to 2532 states and 3344 transitions. [2022-11-02 21:01:42,345 INFO L78 Accepts]: Start accepts. Automaton has 2532 states and 3344 transitions. Word has length 171 [2022-11-02 21:01:42,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:42,346 INFO L495 AbstractCegarLoop]: Abstraction has 2532 states and 3344 transitions. [2022-11-02 21:01:42,347 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-11-02 21:01:42,347 INFO L276 IsEmpty]: Start isEmpty. Operand 2532 states and 3344 transitions. [2022-11-02 21:01:42,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-11-02 21:01:42,349 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:42,349 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 6, 6, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:01:42,350 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-02 21:01:42,350 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-11-02 21:01:42,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:42,350 INFO L85 PathProgramCache]: Analyzing trace with hash -1008346903, now seen corresponding path program 1 times [2022-11-02 21:01:42,351 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:42,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020127937] [2022-11-02 21:01:42,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:42,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:42,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:43,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:01:43,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:43,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:01:43,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:43,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:01:43,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:43,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:01:43,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:43,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 21:01:43,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:43,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 21:01:43,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:43,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 21:01:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:43,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:01:43,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:43,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 21:01:43,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:43,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 21:01:43,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:43,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 21:01:43,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:43,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-02 21:01:43,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:43,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:01:43,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:43,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:01:43,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:43,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:01:43,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:43,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-02 21:01:43,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:43,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-02 21:01:43,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:43,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:01:43,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:43,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:01:43,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:43,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:01:43,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:43,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-02 21:01:43,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:43,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-02 21:01:43,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:43,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:01:43,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:43,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:01:43,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:43,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:01:43,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:43,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-02 21:01:43,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:43,301 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 258 trivial. 0 not checked. [2022-11-02 21:01:43,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:43,301 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020127937] [2022-11-02 21:01:43,302 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020127937] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:43,302 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:43,302 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-02 21:01:43,302 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001173802] [2022-11-02 21:01:43,302 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:43,303 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-02 21:01:43,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:43,304 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-02 21:01:43,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-02 21:01:43,304 INFO L87 Difference]: Start difference. First operand 2532 states and 3344 transitions. Second operand has 8 states, 8 states have (on average 7.375) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (22), 6 states have call predecessors, (22), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-11-02 21:01:50,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:50,148 INFO L93 Difference]: Finished difference Result 3774 states and 4986 transitions. [2022-11-02 21:01:50,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-11-02 21:01:50,149 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (22), 6 states have call predecessors, (22), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 162 [2022-11-02 21:01:50,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:50,168 INFO L225 Difference]: With dead ends: 3774 [2022-11-02 21:01:50,168 INFO L226 Difference]: Without dead ends: 3772 [2022-11-02 21:01:50,170 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2022-11-02 21:01:50,170 INFO L413 NwaCegarLoop]: 2149 mSDtfsCounter, 3433 mSDsluCounter, 3662 mSDsCounter, 0 mSdLazyCounter, 5432 mSolverCounterSat, 2219 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3666 SdHoareTripleChecker+Valid, 5811 SdHoareTripleChecker+Invalid, 7651 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2219 IncrementalHoareTripleChecker+Valid, 5432 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.2s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:50,171 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3666 Valid, 5811 Invalid, 7651 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2219 Valid, 5432 Invalid, 0 Unknown, 0 Unchecked, 6.2s Time] [2022-11-02 21:01:50,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3772 states. [2022-11-02 21:01:50,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3772 to 3666. [2022-11-02 21:01:50,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3666 states, 2419 states have (on average 1.2153782554774701) internal successors, (2940), 2518 states have internal predecessors, (2940), 954 states have call successors, (954), 278 states have call predecessors, (954), 274 states have return successors, (968), 925 states have call predecessors, (968), 952 states have call successors, (968) [2022-11-02 21:01:50,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3666 states to 3666 states and 4862 transitions. [2022-11-02 21:01:50,590 INFO L78 Accepts]: Start accepts. Automaton has 3666 states and 4862 transitions. Word has length 162 [2022-11-02 21:01:50,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:50,591 INFO L495 AbstractCegarLoop]: Abstraction has 3666 states and 4862 transitions. [2022-11-02 21:01:50,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.375) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (22), 6 states have call predecessors, (22), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-11-02 21:01:50,591 INFO L276 IsEmpty]: Start isEmpty. Operand 3666 states and 4862 transitions. [2022-11-02 21:01:50,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-11-02 21:01:50,593 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:50,593 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:01:50,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-02 21:01:50,594 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-11-02 21:01:50,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:50,594 INFO L85 PathProgramCache]: Analyzing trace with hash -55283042, now seen corresponding path program 1 times [2022-11-02 21:01:50,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:50,595 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456699619] [2022-11-02 21:01:50,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:50,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:50,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:50,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:01:50,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:50,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:01:50,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:50,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:01:50,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:50,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:01:50,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:50,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 21:01:50,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:50,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 21:01:50,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:50,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 21:01:50,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:50,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:01:51,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:51,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 21:01:51,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:51,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 21:01:51,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:51,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 21:01:51,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:51,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 21:01:51,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:51,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 21:01:51,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:51,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 21:01:51,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:51,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 21:01:51,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:51,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 21:01:51,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:51,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 21:01:51,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:51,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 21:01:51,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:51,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-02 21:01:51,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:51,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-02 21:01:51,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:51,087 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 21:01:51,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:51,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456699619] [2022-11-02 21:01:51,089 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456699619] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:51,089 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:51,089 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:01:51,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940274633] [2022-11-02 21:01:51,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:51,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:01:51,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:51,091 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:01:51,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:01:51,092 INFO L87 Difference]: Start difference. First operand 3666 states and 4862 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-11-02 21:01:54,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:54,259 INFO L93 Difference]: Finished difference Result 3666 states and 4862 transitions. [2022-11-02 21:01:54,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:01:54,260 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 133 [2022-11-02 21:01:54,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:54,276 INFO L225 Difference]: With dead ends: 3666 [2022-11-02 21:01:54,276 INFO L226 Difference]: Without dead ends: 3664 [2022-11-02 21:01:54,278 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:01:54,279 INFO L413 NwaCegarLoop]: 1788 mSDtfsCounter, 2596 mSDsluCounter, 1886 mSDsCounter, 0 mSdLazyCounter, 1754 mSolverCounterSat, 1246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2836 SdHoareTripleChecker+Valid, 3674 SdHoareTripleChecker+Invalid, 3000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1246 IncrementalHoareTripleChecker+Valid, 1754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:54,279 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2836 Valid, 3674 Invalid, 3000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1246 Valid, 1754 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-11-02 21:01:54,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3664 states. [2022-11-02 21:01:54,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3664 to 3664. [2022-11-02 21:01:54,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3664 states, 2418 states have (on average 1.2146401985111663) internal successors, (2937), 2516 states have internal predecessors, (2937), 954 states have call successors, (954), 278 states have call predecessors, (954), 274 states have return successors, (968), 925 states have call predecessors, (968), 952 states have call successors, (968) [2022-11-02 21:01:54,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3664 states to 3664 states and 4859 transitions. [2022-11-02 21:01:54,680 INFO L78 Accepts]: Start accepts. Automaton has 3664 states and 4859 transitions. Word has length 133 [2022-11-02 21:01:54,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:54,680 INFO L495 AbstractCegarLoop]: Abstraction has 3664 states and 4859 transitions. [2022-11-02 21:01:54,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-11-02 21:01:54,681 INFO L276 IsEmpty]: Start isEmpty. Operand 3664 states and 4859 transitions. [2022-11-02 21:01:54,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-11-02 21:01:54,683 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:54,683 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:01:54,683 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-02 21:01:54,683 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-11-02 21:01:54,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:54,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1607864734, now seen corresponding path program 1 times [2022-11-02 21:01:54,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:54,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283023799] [2022-11-02 21:01:54,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:54,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:54,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:54,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:01:54,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:55,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:01:55,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:55,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:01:55,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:55,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:01:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:55,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 21:01:55,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:55,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 21:01:55,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:55,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 21:01:55,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:55,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:01:55,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:55,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 21:01:55,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:55,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 21:01:55,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:55,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 21:01:55,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:55,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 21:01:55,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:55,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 21:01:55,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:55,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 21:01:55,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:55,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 21:01:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:55,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 21:01:55,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:55,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 21:01:55,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:55,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 21:01:55,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:55,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-02 21:01:55,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:55,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-02 21:01:55,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:55,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-02 21:01:55,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:55,143 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 21:01:55,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:55,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283023799] [2022-11-02 21:01:55,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283023799] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:55,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:55,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:01:55,145 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1317514136] [2022-11-02 21:01:55,145 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:55,146 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:01:55,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:55,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:01:55,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:01:55,147 INFO L87 Difference]: Start difference. First operand 3664 states and 4859 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-02 21:01:58,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:01:58,380 INFO L93 Difference]: Finished difference Result 3664 states and 4859 transitions. [2022-11-02 21:01:58,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:01:58,380 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 139 [2022-11-02 21:01:58,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:01:58,390 INFO L225 Difference]: With dead ends: 3664 [2022-11-02 21:01:58,390 INFO L226 Difference]: Without dead ends: 3662 [2022-11-02 21:01:58,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:01:58,392 INFO L413 NwaCegarLoop]: 1786 mSDtfsCounter, 2590 mSDsluCounter, 1886 mSDsCounter, 0 mSdLazyCounter, 1752 mSolverCounterSat, 1246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2829 SdHoareTripleChecker+Valid, 3672 SdHoareTripleChecker+Invalid, 2998 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1246 IncrementalHoareTripleChecker+Valid, 1752 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-02 21:01:58,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2829 Valid, 3672 Invalid, 2998 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1246 Valid, 1752 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-11-02 21:01:58,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3662 states. [2022-11-02 21:01:58,731 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3662 to 3662. [2022-11-02 21:01:58,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3662 states, 2417 states have (on average 1.2139015308233347) internal successors, (2934), 2514 states have internal predecessors, (2934), 954 states have call successors, (954), 278 states have call predecessors, (954), 274 states have return successors, (968), 925 states have call predecessors, (968), 952 states have call successors, (968) [2022-11-02 21:01:58,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3662 states to 3662 states and 4856 transitions. [2022-11-02 21:01:58,750 INFO L78 Accepts]: Start accepts. Automaton has 3662 states and 4856 transitions. Word has length 139 [2022-11-02 21:01:58,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:01:58,750 INFO L495 AbstractCegarLoop]: Abstraction has 3662 states and 4856 transitions. [2022-11-02 21:01:58,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-11-02 21:01:58,751 INFO L276 IsEmpty]: Start isEmpty. Operand 3662 states and 4856 transitions. [2022-11-02 21:01:58,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-11-02 21:01:58,753 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:01:58,754 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:01:58,754 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-02 21:01:58,754 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-11-02 21:01:58,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:01:58,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1463516612, now seen corresponding path program 1 times [2022-11-02 21:01:58,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:01:58,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171083533] [2022-11-02 21:01:58,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:01:58,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:01:58,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:59,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:01:59,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:59,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:01:59,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:59,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:01:59,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:59,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:01:59,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:59,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 21:01:59,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:59,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 21:01:59,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:59,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 21:01:59,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:59,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:01:59,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:59,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 21:01:59,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:59,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 21:01:59,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:59,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 21:01:59,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:59,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 21:01:59,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:59,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 21:01:59,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:59,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 21:01:59,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:59,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 21:01:59,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:59,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 21:01:59,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:59,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 21:01:59,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:59,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 21:01:59,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:59,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-02 21:01:59,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:59,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-02 21:01:59,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:59,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-02 21:01:59,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:59,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-02 21:01:59,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:01:59,215 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 21:01:59,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:01:59,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [171083533] [2022-11-02 21:01:59,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [171083533] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:01:59,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:01:59,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:01:59,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [393454230] [2022-11-02 21:01:59,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:01:59,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:01:59,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:01:59,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:01:59,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:01:59,218 INFO L87 Difference]: Start difference. First operand 3662 states and 4856 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-02 21:02:02,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:02,558 INFO L93 Difference]: Finished difference Result 3662 states and 4856 transitions. [2022-11-02 21:02:02,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:02:02,559 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 145 [2022-11-02 21:02:02,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:02,573 INFO L225 Difference]: With dead ends: 3662 [2022-11-02 21:02:02,573 INFO L226 Difference]: Without dead ends: 3660 [2022-11-02 21:02:02,576 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:02:02,577 INFO L413 NwaCegarLoop]: 1784 mSDtfsCounter, 2584 mSDsluCounter, 1886 mSDsCounter, 0 mSdLazyCounter, 1750 mSolverCounterSat, 1246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2822 SdHoareTripleChecker+Valid, 3670 SdHoareTripleChecker+Invalid, 2996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1246 IncrementalHoareTripleChecker+Valid, 1750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:02,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2822 Valid, 3670 Invalid, 2996 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1246 Valid, 1750 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-11-02 21:02:02,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3660 states. [2022-11-02 21:02:02,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3660 to 3660. [2022-11-02 21:02:02,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3660 states, 2416 states have (on average 1.213162251655629) internal successors, (2931), 2512 states have internal predecessors, (2931), 954 states have call successors, (954), 278 states have call predecessors, (954), 274 states have return successors, (968), 925 states have call predecessors, (968), 952 states have call successors, (968) [2022-11-02 21:02:02,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3660 states to 3660 states and 4853 transitions. [2022-11-02 21:02:02,967 INFO L78 Accepts]: Start accepts. Automaton has 3660 states and 4853 transitions. Word has length 145 [2022-11-02 21:02:02,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:02,968 INFO L495 AbstractCegarLoop]: Abstraction has 3660 states and 4853 transitions. [2022-11-02 21:02:02,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-02 21:02:02,968 INFO L276 IsEmpty]: Start isEmpty. Operand 3660 states and 4853 transitions. [2022-11-02 21:02:02,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-11-02 21:02:02,971 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:02,971 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:02,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-02 21:02:02,972 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-11-02 21:02:02,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:02,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1503938958, now seen corresponding path program 1 times [2022-11-02 21:02:02,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:02,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171722398] [2022-11-02 21:02:02,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:02,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:03,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:03,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:02:03,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:03,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:02:03,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:03,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:02:03,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:03,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:02:03,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:03,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 21:02:03,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:03,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 21:02:03,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:03,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 21:02:03,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:03,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:02:03,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:03,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 21:02:03,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:03,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 21:02:03,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:03,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 21:02:03,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:03,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 21:02:03,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:03,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 21:02:03,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:03,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 21:02:03,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:03,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 21:02:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:03,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 21:02:03,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:03,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 21:02:03,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:03,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 21:02:03,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:03,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-02 21:02:03,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:03,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-02 21:02:03,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:03,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-02 21:02:03,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:03,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-02 21:02:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:03,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 21:02:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:03,548 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 21:02:03,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:03,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171722398] [2022-11-02 21:02:03,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171722398] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:03,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:03,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:02:03,550 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [576393510] [2022-11-02 21:02:03,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:03,551 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:02:03,551 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:03,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:02:03,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:02:03,553 INFO L87 Difference]: Start difference. First operand 3660 states and 4853 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-11-02 21:02:07,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:07,047 INFO L93 Difference]: Finished difference Result 3660 states and 4853 transitions. [2022-11-02 21:02:07,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:02:07,047 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 151 [2022-11-02 21:02:07,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:07,060 INFO L225 Difference]: With dead ends: 3660 [2022-11-02 21:02:07,061 INFO L226 Difference]: Without dead ends: 3658 [2022-11-02 21:02:07,062 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:02:07,063 INFO L413 NwaCegarLoop]: 1782 mSDtfsCounter, 2578 mSDsluCounter, 1886 mSDsCounter, 0 mSdLazyCounter, 1748 mSolverCounterSat, 1246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2815 SdHoareTripleChecker+Valid, 3668 SdHoareTripleChecker+Invalid, 2994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1246 IncrementalHoareTripleChecker+Valid, 1748 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:07,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2815 Valid, 3668 Invalid, 2994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1246 Valid, 1748 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-02 21:02:07,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3658 states. [2022-11-02 21:02:07,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3658 to 3658. [2022-11-02 21:02:07,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3658 states, 2415 states have (on average 1.2124223602484472) internal successors, (2928), 2510 states have internal predecessors, (2928), 954 states have call successors, (954), 278 states have call predecessors, (954), 274 states have return successors, (968), 925 states have call predecessors, (968), 952 states have call successors, (968) [2022-11-02 21:02:07,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3658 states to 3658 states and 4850 transitions. [2022-11-02 21:02:07,460 INFO L78 Accepts]: Start accepts. Automaton has 3658 states and 4850 transitions. Word has length 151 [2022-11-02 21:02:07,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:07,460 INFO L495 AbstractCegarLoop]: Abstraction has 3658 states and 4850 transitions. [2022-11-02 21:02:07,461 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-11-02 21:02:07,461 INFO L276 IsEmpty]: Start isEmpty. Operand 3658 states and 4850 transitions. [2022-11-02 21:02:07,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-11-02 21:02:07,463 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:07,464 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:07,464 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-02 21:02:07,464 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-11-02 21:02:07,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:07,465 INFO L85 PathProgramCache]: Analyzing trace with hash 1417507331, now seen corresponding path program 1 times [2022-11-02 21:02:07,465 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:07,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1233877921] [2022-11-02 21:02:07,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:07,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:07,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:08,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:02:08,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:08,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:02:08,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:08,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:02:08,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:08,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:02:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:08,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 21:02:08,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:08,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 21:02:08,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:08,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 21:02:08,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:08,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:02:08,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:08,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 21:02:08,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:08,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 21:02:08,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:08,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 21:02:08,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:08,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 21:02:08,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:08,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 21:02:08,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:08,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 21:02:08,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:08,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 21:02:08,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:08,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 21:02:08,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:08,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 21:02:08,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:08,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 21:02:08,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:08,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-02 21:02:08,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:08,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-02 21:02:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:08,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-02 21:02:08,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:08,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-02 21:02:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:08,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 21:02:08,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:08,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-02 21:02:08,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:08,227 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 21:02:08,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:08,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1233877921] [2022-11-02 21:02:08,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1233877921] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:08,228 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:08,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:02:08,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [778294015] [2022-11-02 21:02:08,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:08,229 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:02:08,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:08,230 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:02:08,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:02:08,230 INFO L87 Difference]: Start difference. First operand 3658 states and 4850 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-11-02 21:02:11,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:11,741 INFO L93 Difference]: Finished difference Result 3658 states and 4850 transitions. [2022-11-02 21:02:11,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:02:11,742 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 157 [2022-11-02 21:02:11,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:11,753 INFO L225 Difference]: With dead ends: 3658 [2022-11-02 21:02:11,754 INFO L226 Difference]: Without dead ends: 3656 [2022-11-02 21:02:11,755 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 [2022-11-02 21:02:11,756 INFO L413 NwaCegarLoop]: 1780 mSDtfsCounter, 2572 mSDsluCounter, 1886 mSDsCounter, 0 mSdLazyCounter, 1746 mSolverCounterSat, 1246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2808 SdHoareTripleChecker+Valid, 3666 SdHoareTripleChecker+Invalid, 2992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1246 IncrementalHoareTripleChecker+Valid, 1746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:11,756 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2808 Valid, 3666 Invalid, 2992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1246 Valid, 1746 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-11-02 21:02:11,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3656 states. [2022-11-02 21:02:12,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3656 to 3656. [2022-11-02 21:02:12,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3656 states, 2414 states have (on average 1.211681855840928) internal successors, (2925), 2508 states have internal predecessors, (2925), 954 states have call successors, (954), 278 states have call predecessors, (954), 274 states have return successors, (968), 925 states have call predecessors, (968), 952 states have call successors, (968) [2022-11-02 21:02:12,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3656 states to 3656 states and 4847 transitions. [2022-11-02 21:02:12,309 INFO L78 Accepts]: Start accepts. Automaton has 3656 states and 4847 transitions. Word has length 157 [2022-11-02 21:02:12,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:12,310 INFO L495 AbstractCegarLoop]: Abstraction has 3656 states and 4847 transitions. [2022-11-02 21:02:12,310 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-11-02 21:02:12,310 INFO L276 IsEmpty]: Start isEmpty. Operand 3656 states and 4847 transitions. [2022-11-02 21:02:12,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2022-11-02 21:02:12,313 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:12,313 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:12,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-02 21:02:12,314 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-11-02 21:02:12,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:12,314 INFO L85 PathProgramCache]: Analyzing trace with hash -1969499330, now seen corresponding path program 1 times [2022-11-02 21:02:12,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:12,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556923780] [2022-11-02 21:02:12,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:12,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:12,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:12,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:02:12,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:12,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:02:12,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:12,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:02:12,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:12,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:02:12,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:12,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 21:02:12,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:12,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:02:12,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:12,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:02:12,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:12,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:02:12,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:12,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-02 21:02:12,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:12,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:02:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:12,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:02:12,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:12,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:02:12,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:12,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 21:02:12,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:12,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:02:12,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:12,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:02:12,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:12,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:02:12,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:12,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-02 21:02:12,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:12,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:02:12,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:12,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:02:12,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:12,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:02:12,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:12,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-02 21:02:12,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:12,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:02:12,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:12,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:02:12,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:12,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:02:12,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:12,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-02 21:02:12,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:12,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 21:02:12,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:12,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-11-02 21:02:12,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:12,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:02:12,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:12,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:02:12,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:12,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:02:12,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:12,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 21:02:12,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:12,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:02:12,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:12,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:02:12,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:12,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 21:02:12,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:12,752 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2022-11-02 21:02:12,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:12,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556923780] [2022-11-02 21:02:12,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556923780] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:12,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:12,754 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-02 21:02:12,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518810734] [2022-11-02 21:02:12,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:12,755 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-02 21:02:12,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:12,756 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-02 21:02:12,756 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-02 21:02:12,756 INFO L87 Difference]: Start difference. First operand 3656 states and 4847 transitions. Second operand has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (22), 5 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-02 21:02:17,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:17,318 INFO L93 Difference]: Finished difference Result 6739 states and 8945 transitions. [2022-11-02 21:02:17,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:02:17,319 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (22), 5 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 200 [2022-11-02 21:02:17,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:17,336 INFO L225 Difference]: With dead ends: 6739 [2022-11-02 21:02:17,337 INFO L226 Difference]: Without dead ends: 3745 [2022-11-02 21:02:17,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 68 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:02:17,349 INFO L413 NwaCegarLoop]: 1490 mSDtfsCounter, 3020 mSDsluCounter, 1988 mSDsCounter, 0 mSdLazyCounter, 2326 mSolverCounterSat, 1824 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3296 SdHoareTripleChecker+Valid, 3478 SdHoareTripleChecker+Invalid, 4150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1824 IncrementalHoareTripleChecker+Valid, 2326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:17,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3296 Valid, 3478 Invalid, 4150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1824 Valid, 2326 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-11-02 21:02:17,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3745 states. [2022-11-02 21:02:17,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3745 to 3650. [2022-11-02 21:02:17,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3650 states, 2409 states have (on average 1.2104607721046077) internal successors, (2916), 2502 states have internal predecessors, (2916), 954 states have call successors, (954), 278 states have call predecessors, (954), 274 states have return successors, (968), 925 states have call predecessors, (968), 952 states have call successors, (968) [2022-11-02 21:02:17,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3650 states to 3650 states and 4838 transitions. [2022-11-02 21:02:17,874 INFO L78 Accepts]: Start accepts. Automaton has 3650 states and 4838 transitions. Word has length 200 [2022-11-02 21:02:17,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:17,875 INFO L495 AbstractCegarLoop]: Abstraction has 3650 states and 4838 transitions. [2022-11-02 21:02:17,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 10.142857142857142) internal successors, (71), 3 states have internal predecessors, (71), 2 states have call successors, (22), 5 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-11-02 21:02:17,875 INFO L276 IsEmpty]: Start isEmpty. Operand 3650 states and 4838 transitions. [2022-11-02 21:02:17,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-11-02 21:02:17,878 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:17,879 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:17,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-02 21:02:17,879 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-11-02 21:02:17,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:17,880 INFO L85 PathProgramCache]: Analyzing trace with hash -767542750, now seen corresponding path program 1 times [2022-11-02 21:02:17,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:17,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346245491] [2022-11-02 21:02:17,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:17,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:17,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:18,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:02:18,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:18,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:02:18,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:18,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:02:18,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:18,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:02:18,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:18,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 21:02:18,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:18,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 21:02:18,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:18,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 21:02:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:18,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:02:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:18,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 21:02:18,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:18,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 21:02:18,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:18,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 21:02:18,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:18,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 21:02:18,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:18,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 21:02:18,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:18,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 21:02:18,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:18,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 21:02:18,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:18,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 21:02:18,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:18,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 21:02:18,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:18,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 21:02:18,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:18,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-02 21:02:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:18,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-02 21:02:18,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:18,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-02 21:02:18,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:18,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-02 21:02:18,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:18,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 21:02:18,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:18,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-02 21:02:18,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:18,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-02 21:02:18,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:18,379 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 21:02:18,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:18,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346245491] [2022-11-02 21:02:18,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [346245491] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:18,380 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:18,380 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:02:18,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455331408] [2022-11-02 21:02:18,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:18,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:02:18,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:18,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:02:18,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:02:18,383 INFO L87 Difference]: Start difference. First operand 3650 states and 4838 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-11-02 21:02:21,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:21,750 INFO L93 Difference]: Finished difference Result 3650 states and 4838 transitions. [2022-11-02 21:02:21,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:02:21,753 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 163 [2022-11-02 21:02:21,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:21,767 INFO L225 Difference]: With dead ends: 3650 [2022-11-02 21:02:21,767 INFO L226 Difference]: Without dead ends: 3648 [2022-11-02 21:02:21,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:02:21,771 INFO L413 NwaCegarLoop]: 1773 mSDtfsCounter, 2561 mSDsluCounter, 1872 mSDsCounter, 0 mSdLazyCounter, 1743 mSolverCounterSat, 1246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2796 SdHoareTripleChecker+Valid, 3645 SdHoareTripleChecker+Invalid, 2989 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1246 IncrementalHoareTripleChecker+Valid, 1743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:21,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2796 Valid, 3645 Invalid, 2989 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1246 Valid, 1743 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-11-02 21:02:21,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3648 states. [2022-11-02 21:02:22,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3648 to 3648. [2022-11-02 21:02:22,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3648 states, 2408 states have (on average 1.209717607973422) internal successors, (2913), 2500 states have internal predecessors, (2913), 954 states have call successors, (954), 278 states have call predecessors, (954), 274 states have return successors, (968), 925 states have call predecessors, (968), 952 states have call successors, (968) [2022-11-02 21:02:22,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3648 states to 3648 states and 4835 transitions. [2022-11-02 21:02:22,398 INFO L78 Accepts]: Start accepts. Automaton has 3648 states and 4835 transitions. Word has length 163 [2022-11-02 21:02:22,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:22,398 INFO L495 AbstractCegarLoop]: Abstraction has 3648 states and 4835 transitions. [2022-11-02 21:02:22,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-11-02 21:02:22,399 INFO L276 IsEmpty]: Start isEmpty. Operand 3648 states and 4835 transitions. [2022-11-02 21:02:22,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2022-11-02 21:02:22,402 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:22,402 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:22,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-02 21:02:22,402 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-11-02 21:02:22,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:22,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1635627661, now seen corresponding path program 1 times [2022-11-02 21:02:22,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:22,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413566444] [2022-11-02 21:02:22,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:22,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:22,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:22,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:02:22,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:22,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:02:22,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:22,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:02:22,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:22,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:02:22,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:22,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-11-02 21:02:22,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:22,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:02:22,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:22,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:02:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:22,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:02:22,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:22,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-02 21:02:22,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:22,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:02:22,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:22,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:02:22,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:22,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:02:22,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:22,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-02 21:02:22,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:22,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:02:22,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:22,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:02:22,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:22,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:02:22,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:22,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-11-02 21:02:22,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:22,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:02:22,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:22,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:02:22,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:22,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:02:22,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:22,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-11-02 21:02:22,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:22,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:02:22,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:22,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:02:22,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:22,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:02:22,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:22,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-11-02 21:02:22,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:22,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 21:02:22,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:22,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-11-02 21:02:22,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:22,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:02:22,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:22,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:02:22,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:22,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:02:22,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:22,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-02 21:02:22,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:22,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:02:22,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:22,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:02:22,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:22,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-02 21:02:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:22,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-11-02 21:02:22,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:22,973 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2022-11-02 21:02:22,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:22,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413566444] [2022-11-02 21:02:22,974 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413566444] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-02 21:02:22,974 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069171459] [2022-11-02 21:02:22,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:22,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-02 21:02:22,974 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/bin/uautomizer-Dbtcem3rbc/z3 [2022-11-02 21:02:22,976 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-02 21:02:22,982 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-02 21:02:23,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:23,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 3192 conjuncts, 2 conjunts are in the unsatisfiable core [2022-11-02 21:02:23,930 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-02 21:02:24,065 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-11-02 21:02:24,065 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-02 21:02:24,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069171459] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:24,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-02 21:02:24,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-11-02 21:02:24,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1581134800] [2022-11-02 21:02:24,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:24,067 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-02 21:02:24,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:24,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-02 21:02:24,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:02:24,068 INFO L87 Difference]: Start difference. First operand 3648 states and 4835 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-11-02 21:02:24,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:24,727 INFO L93 Difference]: Finished difference Result 6678 states and 8812 transitions. [2022-11-02 21:02:24,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-02 21:02:24,728 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 206 [2022-11-02 21:02:24,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:24,742 INFO L225 Difference]: With dead ends: 6678 [2022-11-02 21:02:24,742 INFO L226 Difference]: Without dead ends: 3698 [2022-11-02 21:02:24,753 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:02:24,753 INFO L413 NwaCegarLoop]: 1955 mSDtfsCounter, 1829 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1829 SdHoareTripleChecker+Valid, 2022 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:24,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1829 Valid, 2022 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-02 21:02:24,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3698 states. [2022-11-02 21:02:25,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3698 to 3695. [2022-11-02 21:02:25,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3695 states, 2435 states have (on average 1.206981519507187) internal successors, (2939), 2530 states have internal predecessors, (2939), 969 states have call successors, (969), 284 states have call predecessors, (969), 280 states have return successors, (983), 938 states have call predecessors, (983), 967 states have call successors, (983) [2022-11-02 21:02:25,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3695 states to 3695 states and 4891 transitions. [2022-11-02 21:02:25,356 INFO L78 Accepts]: Start accepts. Automaton has 3695 states and 4891 transitions. Word has length 206 [2022-11-02 21:02:25,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:25,357 INFO L495 AbstractCegarLoop]: Abstraction has 3695 states and 4891 transitions. [2022-11-02 21:02:25,357 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-11-02 21:02:25,357 INFO L276 IsEmpty]: Start isEmpty. Operand 3695 states and 4891 transitions. [2022-11-02 21:02:25,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-11-02 21:02:25,360 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:25,361 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:25,404 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-02 21:02:25,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4f8738bd-73d0-4516-ac6c-71aa5c0b2410/bin/uautomizer-Dbtcem3rbc/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2022-11-02 21:02:25,575 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-11-02 21:02:25,575 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:25,575 INFO L85 PathProgramCache]: Analyzing trace with hash 874405140, now seen corresponding path program 1 times [2022-11-02 21:02:25,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:25,575 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [66648598] [2022-11-02 21:02:25,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:25,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:25,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:25,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:02:25,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:25,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:02:25,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:25,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:02:25,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:25,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:02:25,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:25,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 21:02:25,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:25,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 21:02:25,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:25,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 21:02:25,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:25,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:02:25,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:25,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 21:02:25,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:25,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 21:02:25,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:25,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 21:02:25,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:25,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 21:02:25,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:25,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 21:02:26,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:26,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 21:02:26,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:26,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 21:02:26,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:26,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 21:02:26,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:26,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 21:02:26,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:26,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 21:02:26,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:26,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-02 21:02:26,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:26,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-02 21:02:26,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:26,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-02 21:02:26,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:26,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-02 21:02:26,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:26,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 21:02:26,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:26,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-02 21:02:26,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:26,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-02 21:02:26,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:26,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-02 21:02:26,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:26,099 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 21:02:26,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:26,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [66648598] [2022-11-02 21:02:26,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [66648598] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:26,100 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:26,100 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:02:26,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682608334] [2022-11-02 21:02:26,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:26,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:02:26,101 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:26,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:02:26,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:02:26,101 INFO L87 Difference]: Start difference. First operand 3695 states and 4891 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-11-02 21:02:29,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:29,764 INFO L93 Difference]: Finished difference Result 3695 states and 4891 transitions. [2022-11-02 21:02:29,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:02:29,765 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 169 [2022-11-02 21:02:29,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:29,775 INFO L225 Difference]: With dead ends: 3695 [2022-11-02 21:02:29,775 INFO L226 Difference]: Without dead ends: 3693 [2022-11-02 21:02:29,777 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:02:29,777 INFO L413 NwaCegarLoop]: 1766 mSDtfsCounter, 2550 mSDsluCounter, 1858 mSDsCounter, 0 mSdLazyCounter, 1740 mSolverCounterSat, 1246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2784 SdHoareTripleChecker+Valid, 3624 SdHoareTripleChecker+Invalid, 2986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1246 IncrementalHoareTripleChecker+Valid, 1740 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:29,778 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2784 Valid, 3624 Invalid, 2986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1246 Valid, 1740 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-11-02 21:02:29,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3693 states. [2022-11-02 21:02:30,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3693 to 3693. [2022-11-02 21:02:30,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3693 states, 2434 states have (on average 1.2062448644207067) internal successors, (2936), 2528 states have internal predecessors, (2936), 969 states have call successors, (969), 284 states have call predecessors, (969), 280 states have return successors, (983), 938 states have call predecessors, (983), 967 states have call successors, (983) [2022-11-02 21:02:30,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3693 states to 3693 states and 4888 transitions. [2022-11-02 21:02:30,428 INFO L78 Accepts]: Start accepts. Automaton has 3693 states and 4888 transitions. Word has length 169 [2022-11-02 21:02:30,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:30,428 INFO L495 AbstractCegarLoop]: Abstraction has 3693 states and 4888 transitions. [2022-11-02 21:02:30,428 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-11-02 21:02:30,429 INFO L276 IsEmpty]: Start isEmpty. Operand 3693 states and 4888 transitions. [2022-11-02 21:02:30,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-11-02 21:02:30,432 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:30,432 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:30,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-02 21:02:30,433 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-11-02 21:02:30,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:30,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1568901775, now seen corresponding path program 1 times [2022-11-02 21:02:30,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:30,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691149866] [2022-11-02 21:02:30,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:30,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:30,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:02:30,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:30,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:02:30,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:30,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:02:30,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:30,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:02:30,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:30,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 21:02:30,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:30,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 21:02:30,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:30,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 21:02:30,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:30,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:02:30,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:30,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 21:02:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:30,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 21:02:30,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:30,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 21:02:30,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:30,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 21:02:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:30,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 21:02:30,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:30,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 21:02:30,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:30,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 21:02:30,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:30,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 21:02:30,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:30,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 21:02:30,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:30,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 21:02:30,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:30,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-02 21:02:30,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:30,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-02 21:02:30,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:30,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-02 21:02:30,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:30,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-02 21:02:30,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:30,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 21:02:30,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:30,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-02 21:02:30,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:30,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-02 21:02:30,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:30,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-02 21:02:30,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:30,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-11-02 21:02:30,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:30,938 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 21:02:30,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:30,939 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691149866] [2022-11-02 21:02:30,939 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691149866] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:30,939 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:30,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:02:30,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771320799] [2022-11-02 21:02:30,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:30,940 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:02:30,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:30,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:02:30,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:02:30,941 INFO L87 Difference]: Start difference. First operand 3693 states and 4888 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-11-02 21:02:37,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:37,765 INFO L93 Difference]: Finished difference Result 7226 states and 9569 transitions. [2022-11-02 21:02:37,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-02 21:02:37,765 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 175 [2022-11-02 21:02:37,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:37,788 INFO L225 Difference]: With dead ends: 7226 [2022-11-02 21:02:37,788 INFO L226 Difference]: Without dead ends: 7224 [2022-11-02 21:02:37,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:02:37,792 INFO L413 NwaCegarLoop]: 2468 mSDtfsCounter, 3362 mSDsluCounter, 3143 mSDsCounter, 0 mSdLazyCounter, 3976 mSolverCounterSat, 1971 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3589 SdHoareTripleChecker+Valid, 5611 SdHoareTripleChecker+Invalid, 5947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1971 IncrementalHoareTripleChecker+Valid, 3976 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:37,792 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3589 Valid, 5611 Invalid, 5947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1971 Valid, 3976 Invalid, 0 Unknown, 0 Unchecked, 5.4s Time] [2022-11-02 21:02:37,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7224 states. [2022-11-02 21:02:38,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7224 to 7185. [2022-11-02 21:02:38,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7185 states, 4736 states have (on average 1.2052364864864864) internal successors, (5708), 4909 states have internal predecessors, (5708), 1890 states have call successors, (1890), 556 states have call predecessors, (1890), 549 states have return successors, (1933), 1831 states have call predecessors, (1933), 1888 states have call successors, (1933) [2022-11-02 21:02:38,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7185 states to 7185 states and 9531 transitions. [2022-11-02 21:02:38,827 INFO L78 Accepts]: Start accepts. Automaton has 7185 states and 9531 transitions. Word has length 175 [2022-11-02 21:02:38,828 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:38,828 INFO L495 AbstractCegarLoop]: Abstraction has 7185 states and 9531 transitions. [2022-11-02 21:02:38,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-11-02 21:02:38,828 INFO L276 IsEmpty]: Start isEmpty. Operand 7185 states and 9531 transitions. [2022-11-02 21:02:38,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-11-02 21:02:38,832 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:38,832 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:38,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-02 21:02:38,833 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-11-02 21:02:38,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:38,833 INFO L85 PathProgramCache]: Analyzing trace with hash 1393068135, now seen corresponding path program 1 times [2022-11-02 21:02:38,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:38,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [956252588] [2022-11-02 21:02:38,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:38,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:38,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:39,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:02:39,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:39,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:02:39,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:39,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:02:39,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:39,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:02:39,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:39,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 21:02:39,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:39,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 21:02:39,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:39,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 21:02:39,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:39,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:02:39,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:39,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 21:02:39,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:39,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 21:02:39,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:39,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 21:02:39,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:39,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 21:02:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:39,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 21:02:39,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:39,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 21:02:39,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:39,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 21:02:39,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:39,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 21:02:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:39,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 21:02:39,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:39,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 21:02:39,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:39,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-02 21:02:39,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:39,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-02 21:02:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:39,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-02 21:02:39,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:39,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-02 21:02:39,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:39,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 21:02:39,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:39,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-02 21:02:39,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:39,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-02 21:02:39,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:39,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-02 21:02:39,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:39,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-11-02 21:02:39,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:39,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-11-02 21:02:39,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:39,310 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 21:02:39,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:39,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [956252588] [2022-11-02 21:02:39,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [956252588] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:39,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:39,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:02:39,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239545870] [2022-11-02 21:02:39,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:39,311 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:02:39,312 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:39,312 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:02:39,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:02:39,313 INFO L87 Difference]: Start difference. First operand 7185 states and 9531 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-11-02 21:02:43,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:43,308 INFO L93 Difference]: Finished difference Result 7185 states and 9531 transitions. [2022-11-02 21:02:43,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-02 21:02:43,309 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 181 [2022-11-02 21:02:43,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:43,324 INFO L225 Difference]: With dead ends: 7185 [2022-11-02 21:02:43,324 INFO L226 Difference]: Without dead ends: 7183 [2022-11-02 21:02:43,327 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-02 21:02:43,327 INFO L413 NwaCegarLoop]: 1764 mSDtfsCounter, 2544 mSDsluCounter, 1858 mSDsCounter, 0 mSdLazyCounter, 1738 mSolverCounterSat, 1246 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2776 SdHoareTripleChecker+Valid, 3622 SdHoareTripleChecker+Invalid, 2984 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1246 IncrementalHoareTripleChecker+Valid, 1738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:43,327 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2776 Valid, 3622 Invalid, 2984 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1246 Valid, 1738 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-11-02 21:02:43,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7183 states. [2022-11-02 21:02:44,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7183 to 7183. [2022-11-02 21:02:44,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7183 states, 4735 states have (on average 1.2048574445617741) internal successors, (5705), 4907 states have internal predecessors, (5705), 1890 states have call successors, (1890), 556 states have call predecessors, (1890), 549 states have return successors, (1933), 1831 states have call predecessors, (1933), 1888 states have call successors, (1933) [2022-11-02 21:02:44,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7183 states to 7183 states and 9528 transitions. [2022-11-02 21:02:44,642 INFO L78 Accepts]: Start accepts. Automaton has 7183 states and 9528 transitions. Word has length 181 [2022-11-02 21:02:44,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:44,642 INFO L495 AbstractCegarLoop]: Abstraction has 7183 states and 9528 transitions. [2022-11-02 21:02:44,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-11-02 21:02:44,643 INFO L276 IsEmpty]: Start isEmpty. Operand 7183 states and 9528 transitions. [2022-11-02 21:02:44,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-11-02 21:02:44,646 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:44,647 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:44,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-02 21:02:44,647 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_linux_usb_urb_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-11-02 21:02:44,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:44,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1300630891, now seen corresponding path program 1 times [2022-11-02 21:02:44,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:44,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105423050] [2022-11-02 21:02:44,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:44,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:44,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:44,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:02:44,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:44,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:02:44,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:44,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:02:44,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:44,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:02:44,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:44,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 21:02:44,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:44,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 21:02:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:44,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 21:02:44,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:44,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:02:44,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:44,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 21:02:44,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:44,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 21:02:44,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:44,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-02 21:02:44,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:44,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-02 21:02:45,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:45,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-02 21:02:45,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:45,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-02 21:02:45,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:45,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-02 21:02:45,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:45,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-02 21:02:45,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:45,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-02 21:02:45,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:45,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-02 21:02:45,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:45,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-11-02 21:02:45,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:45,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-11-02 21:02:45,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:45,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-11-02 21:02:45,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:45,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-02 21:02:45,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:45,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-11-02 21:02:45,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:45,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-02 21:02:45,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:45,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-11-02 21:02:45,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:45,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-02 21:02:45,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:45,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-11-02 21:02:45,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:45,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-11-02 21:02:45,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:45,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-11-02 21:02:45,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:45,109 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-11-02 21:02:45,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:45,109 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105423050] [2022-11-02 21:02:45,109 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105423050] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:45,110 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:45,110 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-02 21:02:45,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1961079955] [2022-11-02 21:02:45,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:45,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-02 21:02:45,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:45,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-02 21:02:45,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-02 21:02:45,112 INFO L87 Difference]: Start difference. First operand 7183 states and 9528 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-11-02 21:02:53,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:02:53,011 INFO L93 Difference]: Finished difference Result 14186 states and 18832 transitions. [2022-11-02 21:02:53,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-02 21:02:53,011 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 187 [2022-11-02 21:02:53,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:02:53,058 INFO L225 Difference]: With dead ends: 14186 [2022-11-02 21:02:53,058 INFO L226 Difference]: Without dead ends: 13863 [2022-11-02 21:02:53,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:02:53,068 INFO L413 NwaCegarLoop]: 2196 mSDtfsCounter, 3535 mSDsluCounter, 2777 mSDsCounter, 0 mSdLazyCounter, 3827 mSolverCounterSat, 2089 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3761 SdHoareTripleChecker+Valid, 4973 SdHoareTripleChecker+Invalid, 5916 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2089 IncrementalHoareTripleChecker+Valid, 3827 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:02:53,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3761 Valid, 4973 Invalid, 5916 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2089 Valid, 3827 Invalid, 0 Unknown, 0 Unchecked, 5.3s Time] [2022-11-02 21:02:53,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13863 states. [2022-11-02 21:02:55,266 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13863 to 13833. [2022-11-02 21:02:55,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13833 states, 9118 states have (on average 1.207501645097609) internal successors, (11010), 9443 states have internal predecessors, (11010), 3659 states have call successors, (3659), 1062 states have call predecessors, (3659), 1047 states have return successors, (3771), 3547 states have call predecessors, (3771), 3653 states have call successors, (3771) [2022-11-02 21:02:55,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13833 states to 13833 states and 18440 transitions. [2022-11-02 21:02:55,314 INFO L78 Accepts]: Start accepts. Automaton has 13833 states and 18440 transitions. Word has length 187 [2022-11-02 21:02:55,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:02:55,314 INFO L495 AbstractCegarLoop]: Abstraction has 13833 states and 18440 transitions. [2022-11-02 21:02:55,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-11-02 21:02:55,315 INFO L276 IsEmpty]: Start isEmpty. Operand 13833 states and 18440 transitions. [2022-11-02 21:02:55,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2022-11-02 21:02:55,318 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:02:55,318 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 7, 7, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:02:55,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-11-02 21:02:55,319 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_assert_linux_kernel_sched_completion__wait_without_initErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-11-02 21:02:55,319 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:02:55,319 INFO L85 PathProgramCache]: Analyzing trace with hash 256543429, now seen corresponding path program 1 times [2022-11-02 21:02:55,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:02:55,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1349091369] [2022-11-02 21:02:55,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:02:55,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:02:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:55,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:02:55,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:55,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:02:55,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:55,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:02:55,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:55,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:02:55,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:55,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 21:02:55,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:55,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 21:02:55,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:55,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 21:02:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:55,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:02:55,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:55,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 21:02:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:55,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 21:02:56,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:56,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 21:02:56,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:56,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-02 21:02:56,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:56,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:02:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:56,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:02:56,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:56,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:02:56,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:56,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-02 21:02:56,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:56,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-02 21:02:56,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:56,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:02:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:56,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:02:56,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:56,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:02:56,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:56,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-02 21:02:56,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:56,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-02 21:02:56,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:56,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:02:56,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:56,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:02:56,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:56,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:02:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:56,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-11-02 21:02:56,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:56,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-11-02 21:02:56,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:56,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:02:56,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:56,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:02:56,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:56,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:02:56,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:56,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2022-11-02 21:02:56,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:56,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-11-02 21:02:56,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:56,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-11-02 21:02:56,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:56,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:02:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:56,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 202 [2022-11-02 21:02:56,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:56,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2022-11-02 21:02:56,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:56,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 217 [2022-11-02 21:02:56,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:56,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-11-02 21:02:56,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:56,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:02:56,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:02:56,216 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2022-11-02 21:02:56,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:02:56,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1349091369] [2022-11-02 21:02:56,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1349091369] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:02:56,217 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:02:56,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-11-02 21:02:56,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604010020] [2022-11-02 21:02:56,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:02:56,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-02 21:02:56,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:02:56,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-02 21:02:56,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-02 21:02:56,219 INFO L87 Difference]: Start difference. First operand 13833 states and 18440 transitions. Second operand has 11 states, 11 states have (on average 9.181818181818182) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (33), 8 states have call predecessors, (33), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2022-11-02 21:03:13,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:13,778 INFO L93 Difference]: Finished difference Result 28731 states and 39621 transitions. [2022-11-02 21:03:13,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-11-02 21:03:13,778 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.181818181818182) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (33), 8 states have call predecessors, (33), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 247 [2022-11-02 21:03:13,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:13,903 INFO L225 Difference]: With dead ends: 28731 [2022-11-02 21:03:13,904 INFO L226 Difference]: Without dead ends: 28729 [2022-11-02 21:03:13,922 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 270 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=330, Invalid=792, Unknown=0, NotChecked=0, Total=1122 [2022-11-02 21:03:13,923 INFO L413 NwaCegarLoop]: 2415 mSDtfsCounter, 5304 mSDsluCounter, 6958 mSDsCounter, 0 mSdLazyCounter, 10044 mSolverCounterSat, 4331 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5548 SdHoareTripleChecker+Valid, 9373 SdHoareTripleChecker+Invalid, 14375 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4331 IncrementalHoareTripleChecker+Valid, 10044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.3s IncrementalHoareTripleChecker+Time [2022-11-02 21:03:13,923 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5548 Valid, 9373 Invalid, 14375 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4331 Valid, 10044 Invalid, 0 Unknown, 0 Unchecked, 12.3s Time] [2022-11-02 21:03:13,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28729 states. [2022-11-02 21:03:18,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28729 to 26750. [2022-11-02 21:03:18,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26750 states, 17666 states have (on average 1.2218951658553152) internal successors, (21586), 18346 states have internal predecessors, (21586), 7064 states have call successors, (7064), 1878 states have call predecessors, (7064), 2011 states have return successors, (8248), 6953 states have call predecessors, (8248), 7058 states have call successors, (8248) [2022-11-02 21:03:18,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26750 states to 26750 states and 36898 transitions. [2022-11-02 21:03:18,341 INFO L78 Accepts]: Start accepts. Automaton has 26750 states and 36898 transitions. Word has length 247 [2022-11-02 21:03:18,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:18,342 INFO L495 AbstractCegarLoop]: Abstraction has 26750 states and 36898 transitions. [2022-11-02 21:03:18,342 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.181818181818182) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (33), 8 states have call predecessors, (33), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2022-11-02 21:03:18,342 INFO L276 IsEmpty]: Start isEmpty. Operand 26750 states and 36898 transitions. [2022-11-02 21:03:18,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2022-11-02 21:03:18,345 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:18,346 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 7, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:03:18,346 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-11-02 21:03:18,346 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-11-02 21:03:18,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:18,347 INFO L85 PathProgramCache]: Analyzing trace with hash -725895826, now seen corresponding path program 1 times [2022-11-02 21:03:18,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:18,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451406405] [2022-11-02 21:03:18,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:18,347 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:18,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:18,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:03:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:18,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:03:18,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:18,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:03:18,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:18,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:03:18,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:18,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 21:03:18,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:18,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 21:03:18,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:18,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 21:03:18,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:18,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:03:18,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:18,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 21:03:18,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:18,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 21:03:18,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:18,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 21:03:18,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:18,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-02 21:03:18,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:18,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:03:18,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:18,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:03:18,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:18,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:03:18,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:18,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-02 21:03:18,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:18,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-02 21:03:18,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:18,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:03:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:18,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:03:18,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:18,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:03:18,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:18,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-02 21:03:18,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:18,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-02 21:03:18,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:18,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:03:18,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:18,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:03:18,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:18,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:03:18,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:18,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-11-02 21:03:18,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:18,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-11-02 21:03:18,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:18,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-11-02 21:03:18,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:18,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:03:18,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:19,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-11-02 21:03:19,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:19,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:03:19,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:19,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:03:19,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:19,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:03:19,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:19,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-02 21:03:19,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:19,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2022-11-02 21:03:19,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:19,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:03:19,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:19,386 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2022-11-02 21:03:19,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:19,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451406405] [2022-11-02 21:03:19,387 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451406405] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:19,387 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:19,387 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-11-02 21:03:19,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [947522369] [2022-11-02 21:03:19,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:19,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-11-02 21:03:19,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:19,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-11-02 21:03:19,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=129, Unknown=0, NotChecked=0, Total=156 [2022-11-02 21:03:19,389 INFO L87 Difference]: Start difference. First operand 26750 states and 36898 transitions. Second operand has 13 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (32), 9 states have call predecessors, (32), 3 states have return successors, (30), 3 states have call predecessors, (30), 1 states have call successors, (30) [2022-11-02 21:03:33,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-02 21:03:33,155 INFO L93 Difference]: Finished difference Result 53851 states and 76176 transitions. [2022-11-02 21:03:33,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-02 21:03:33,156 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (32), 9 states have call predecessors, (32), 3 states have return successors, (30), 3 states have call predecessors, (30), 1 states have call successors, (30) Word has length 227 [2022-11-02 21:03:33,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-02 21:03:33,250 INFO L225 Difference]: With dead ends: 53851 [2022-11-02 21:03:33,250 INFO L226 Difference]: Without dead ends: 27969 [2022-11-02 21:03:33,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 132 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=162, Invalid=594, Unknown=0, NotChecked=0, Total=756 [2022-11-02 21:03:33,350 INFO L413 NwaCegarLoop]: 1755 mSDtfsCounter, 2327 mSDsluCounter, 6593 mSDsCounter, 0 mSdLazyCounter, 8416 mSolverCounterSat, 2174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2327 SdHoareTripleChecker+Valid, 8348 SdHoareTripleChecker+Invalid, 10590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2174 IncrementalHoareTripleChecker+Valid, 8416 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.8s IncrementalHoareTripleChecker+Time [2022-11-02 21:03:33,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2327 Valid, 8348 Invalid, 10590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2174 Valid, 8416 Invalid, 0 Unknown, 0 Unchecked, 8.8s Time] [2022-11-02 21:03:33,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27969 states. [2022-11-02 21:03:37,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27969 to 26878. [2022-11-02 21:03:37,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26878 states, 17778 states have (on average 1.2204972437844528) internal successors, (21698), 18442 states have internal predecessors, (21698), 7064 states have call successors, (7064), 1878 states have call predecessors, (7064), 2027 states have return successors, (8344), 6985 states have call predecessors, (8344), 7058 states have call successors, (8344) [2022-11-02 21:03:38,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26878 states to 26878 states and 37106 transitions. [2022-11-02 21:03:38,078 INFO L78 Accepts]: Start accepts. Automaton has 26878 states and 37106 transitions. Word has length 227 [2022-11-02 21:03:38,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-02 21:03:38,079 INFO L495 AbstractCegarLoop]: Abstraction has 26878 states and 37106 transitions. [2022-11-02 21:03:38,079 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 7.6923076923076925) internal successors, (100), 5 states have internal predecessors, (100), 2 states have call successors, (32), 9 states have call predecessors, (32), 3 states have return successors, (30), 3 states have call predecessors, (30), 1 states have call successors, (30) [2022-11-02 21:03:38,079 INFO L276 IsEmpty]: Start isEmpty. Operand 26878 states and 37106 transitions. [2022-11-02 21:03:38,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2022-11-02 21:03:38,083 INFO L187 NwaCegarLoop]: Found error trace [2022-11-02 21:03:38,083 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 7, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-02 21:03:38,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-11-02 21:03:38,083 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 29 more)] === [2022-11-02 21:03:38,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-02 21:03:38,084 INFO L85 PathProgramCache]: Analyzing trace with hash -1836835878, now seen corresponding path program 1 times [2022-11-02 21:03:38,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-02 21:03:38,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331516936] [2022-11-02 21:03:38,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-02 21:03:38,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-02 21:03:38,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:38,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-02 21:03:38,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:38,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-11-02 21:03:38,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:38,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:03:38,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:38,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-11-02 21:03:38,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:38,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-02 21:03:38,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:38,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-02 21:03:38,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:38,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-11-02 21:03:38,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:38,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:03:38,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:38,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-02 21:03:38,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:38,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-02 21:03:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:38,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-11-02 21:03:38,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:38,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-02 21:03:38,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:38,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:03:38,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:38,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:03:38,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:38,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:03:38,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:38,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-02 21:03:38,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:38,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-11-02 21:03:38,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:38,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:03:38,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:38,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:03:38,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:38,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:03:38,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:38,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-02 21:03:38,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:38,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2022-11-02 21:03:38,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:38,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:03:38,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:38,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-02 21:03:38,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:38,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-02 21:03:38,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:38,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-11-02 21:03:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:38,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-11-02 21:03:38,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:38,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-11-02 21:03:38,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:38,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:03:38,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:38,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-11-02 21:03:38,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:38,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:03:38,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:38,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:03:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:38,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-11-02 21:03:38,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:38,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-02 21:03:38,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:38,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2022-11-02 21:03:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:39,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-02 21:03:39,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-02 21:03:39,013 INFO L134 CoverageAnalysis]: Checked inductivity of 279 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 279 trivial. 0 not checked. [2022-11-02 21:03:39,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-02 21:03:39,014 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331516936] [2022-11-02 21:03:39,014 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331516936] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-02 21:03:39,014 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-02 21:03:39,014 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-02 21:03:39,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58758389] [2022-11-02 21:03:39,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-02 21:03:39,015 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-02 21:03:39,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-02 21:03:39,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-02 21:03:39,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2022-11-02 21:03:39,016 INFO L87 Difference]: Start difference. First operand 26878 states and 37106 transitions. Second operand has 12 states, 12 states have (on average 8.333333333333334) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (32), 9 states have call predecessors, (32), 3 states have return successors, (30), 3 states have call predecessors, (30), 1 states have call successors, (30)