./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash d9035b4ec3c8be0c8a62b9c4cf3880a262fca73149d78c2d88c8226ff5942d9e --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-14 04:50:46,597 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 04:50:46,599 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 04:50:46,623 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 04:50:46,628 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 04:50:46,629 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 04:50:46,630 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 04:50:46,633 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 04:50:46,634 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 04:50:46,638 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 04:50:46,638 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 04:50:46,639 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 04:50:46,639 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 04:50:46,640 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 04:50:46,641 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 04:50:46,643 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 04:50:46,643 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 04:50:46,644 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 04:50:46,645 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 04:50:46,646 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 04:50:46,647 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 04:50:46,656 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 04:50:46,657 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 04:50:46,658 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 04:50:46,658 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 04:50:46,660 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 04:50:46,660 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 04:50:46,661 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 04:50:46,661 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 04:50:46,662 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 04:50:46,662 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 04:50:46,662 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 04:50:46,663 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 04:50:46,663 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 04:50:46,664 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 04:50:46,664 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 04:50:46,664 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 04:50:46,665 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 04:50:46,665 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 04:50:46,665 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 04:50:46,666 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 04:50:46,669 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 04:50:46,669 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-14 04:50:46,688 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 04:50:46,688 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 04:50:46,689 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 04:50:46,689 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 04:50:46,689 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 04:50:46,690 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 04:50:46,690 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 04:50:46,690 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 04:50:46,690 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 04:50:46,690 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 04:50:46,691 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 04:50:46,691 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 04:50:46,691 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 04:50:46,691 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 04:50:46,691 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 04:50:46,691 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 04:50:46,691 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 04:50:46,692 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 04:50:46,692 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 04:50:46,692 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 04:50:46,692 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 04:50:46,692 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 04:50:46,693 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 04:50:46,693 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 04:50:46,693 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 04:50:46,693 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 04:50:46,693 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 04:50:46,694 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-14 04:50:46,694 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-14 04:50:46,694 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 04:50:46,694 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> d9035b4ec3c8be0c8a62b9c4cf3880a262fca73149d78c2d88c8226ff5942d9e [2022-07-14 04:50:46,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 04:50:46,950 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 04:50:46,952 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 04:50:46,953 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 04:50:46,954 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 04:50:46,955 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i [2022-07-14 04:50:47,003 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8291580b3/ce03ae6b91d745edaf76cbfdfeacaaeb/FLAG698f5ddf8 [2022-07-14 04:50:47,685 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 04:50:47,686 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i [2022-07-14 04:50:47,720 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8291580b3/ce03ae6b91d745edaf76cbfdfeacaaeb/FLAG698f5ddf8 [2022-07-14 04:50:48,028 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8291580b3/ce03ae6b91d745edaf76cbfdfeacaaeb [2022-07-14 04:50:48,030 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 04:50:48,031 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 04:50:48,032 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 04:50:48,032 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 04:50:48,035 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 04:50:48,036 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:50:48" (1/1) ... [2022-07-14 04:50:48,037 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6615593f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:50:48, skipping insertion in model container [2022-07-14 04:50:48,038 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:50:48" (1/1) ... [2022-07-14 04:50:48,044 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 04:50:48,139 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 04:50:50,814 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[374560,374573] [2022-07-14 04:50:50,817 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[374705,374718] [2022-07-14 04:50:50,817 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[374851,374864] [2022-07-14 04:50:50,818 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[375016,375029] [2022-07-14 04:50:50,818 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[375174,375187] [2022-07-14 04:50:50,819 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[375332,375345] [2022-07-14 04:50:50,819 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[375490,375503] [2022-07-14 04:50:50,819 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[375650,375663] [2022-07-14 04:50:50,820 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[375809,375822] [2022-07-14 04:50:50,820 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[375948,375961] [2022-07-14 04:50:50,821 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[376090,376103] [2022-07-14 04:50:50,821 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[376239,376252] [2022-07-14 04:50:50,821 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[376378,376391] [2022-07-14 04:50:50,822 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[376533,376546] [2022-07-14 04:50:50,822 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[376693,376706] [2022-07-14 04:50:50,823 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[376844,376857] [2022-07-14 04:50:50,823 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[376995,377008] [2022-07-14 04:50:50,823 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[377147,377160] [2022-07-14 04:50:50,824 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[377296,377309] [2022-07-14 04:50:50,824 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[377444,377457] [2022-07-14 04:50:50,824 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[377601,377614] [2022-07-14 04:50:50,826 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[377750,377763] [2022-07-14 04:50:50,826 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[377906,377919] [2022-07-14 04:50:50,827 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[378059,378072] [2022-07-14 04:50:50,829 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[378205,378218] [2022-07-14 04:50:50,831 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[378348,378361] [2022-07-14 04:50:50,831 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[378500,378513] [2022-07-14 04:50:50,832 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[378646,378659] [2022-07-14 04:50:50,832 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[378791,378804] [2022-07-14 04:50:50,834 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[378945,378958] [2022-07-14 04:50:50,835 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[379096,379109] [2022-07-14 04:50:50,835 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[379251,379264] [2022-07-14 04:50:50,835 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[379403,379416] [2022-07-14 04:50:50,836 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[379558,379571] [2022-07-14 04:50:50,837 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[379722,379735] [2022-07-14 04:50:50,837 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[379878,379891] [2022-07-14 04:50:50,837 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[380042,380055] [2022-07-14 04:50:50,837 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[380184,380197] [2022-07-14 04:50:50,838 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[380342,380355] [2022-07-14 04:50:50,838 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[380509,380522] [2022-07-14 04:50:50,838 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[380668,380681] [2022-07-14 04:50:50,839 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[380827,380840] [2022-07-14 04:50:50,839 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[380976,380989] [2022-07-14 04:50:50,839 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[381123,381136] [2022-07-14 04:50:50,839 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[381262,381275] [2022-07-14 04:50:50,840 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[381425,381438] [2022-07-14 04:50:50,840 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[381591,381604] [2022-07-14 04:50:50,841 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[381755,381768] [2022-07-14 04:50:50,841 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[381920,381933] [2022-07-14 04:50:50,845 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[382085,382098] [2022-07-14 04:50:50,845 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[382251,382264] [2022-07-14 04:50:50,846 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[382416,382429] [2022-07-14 04:50:50,846 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[382583,382596] [2022-07-14 04:50:50,847 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[382743,382756] [2022-07-14 04:50:50,847 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[382905,382918] [2022-07-14 04:50:50,848 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[383064,383077] [2022-07-14 04:50:50,848 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[383210,383223] [2022-07-14 04:50:50,848 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[383353,383366] [2022-07-14 04:50:50,849 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[383497,383510] [2022-07-14 04:50:50,849 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[383640,383653] [2022-07-14 04:50:50,849 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[383784,383797] [2022-07-14 04:50:50,850 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[383925,383938] [2022-07-14 04:50:50,851 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[384063,384076] [2022-07-14 04:50:50,851 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[384221,384234] [2022-07-14 04:50:50,851 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[384380,384393] [2022-07-14 04:50:50,852 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[384536,384549] [2022-07-14 04:50:50,852 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[384685,384698] [2022-07-14 04:50:50,852 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[384837,384850] [2022-07-14 04:50:50,853 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[384988,385001] [2022-07-14 04:50:50,853 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[385137,385150] [2022-07-14 04:50:50,853 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[385289,385302] [2022-07-14 04:50:50,854 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[385437,385450] [2022-07-14 04:50:50,854 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[385590,385603] [2022-07-14 04:50:50,854 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[385741,385754] [2022-07-14 04:50:50,855 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[385891,385904] [2022-07-14 04:50:50,855 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[386038,386051] [2022-07-14 04:50:50,855 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[386189,386202] [2022-07-14 04:50:50,856 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[386340,386353] [2022-07-14 04:50:50,856 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[386488,386501] [2022-07-14 04:50:50,857 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[386654,386667] [2022-07-14 04:50:50,857 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[386823,386836] [2022-07-14 04:50:50,857 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[386990,387003] [2022-07-14 04:50:50,858 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[387158,387171] [2022-07-14 04:50:50,858 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[387308,387321] [2022-07-14 04:50:50,858 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[387455,387468] [2022-07-14 04:50:50,858 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[387616,387629] [2022-07-14 04:50:50,869 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[387786,387799] [2022-07-14 04:50:50,870 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[387948,387961] [2022-07-14 04:50:50,874 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 04:50:50,912 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 04:50:51,268 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[374560,374573] [2022-07-14 04:50:51,269 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[374705,374718] [2022-07-14 04:50:51,270 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[374851,374864] [2022-07-14 04:50:51,270 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[375016,375029] [2022-07-14 04:50:51,271 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[375174,375187] [2022-07-14 04:50:51,274 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[375332,375345] [2022-07-14 04:50:51,274 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[375490,375503] [2022-07-14 04:50:51,275 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[375650,375663] [2022-07-14 04:50:51,275 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[375809,375822] [2022-07-14 04:50:51,276 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[375948,375961] [2022-07-14 04:50:51,276 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[376090,376103] [2022-07-14 04:50:51,276 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[376239,376252] [2022-07-14 04:50:51,276 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[376378,376391] [2022-07-14 04:50:51,277 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[376533,376546] [2022-07-14 04:50:51,277 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[376693,376706] [2022-07-14 04:50:51,277 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[376844,376857] [2022-07-14 04:50:51,278 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[376995,377008] [2022-07-14 04:50:51,278 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[377147,377160] [2022-07-14 04:50:51,279 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[377296,377309] [2022-07-14 04:50:51,279 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[377444,377457] [2022-07-14 04:50:51,279 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[377601,377614] [2022-07-14 04:50:51,280 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[377750,377763] [2022-07-14 04:50:51,280 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[377906,377919] [2022-07-14 04:50:51,281 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[378059,378072] [2022-07-14 04:50:51,281 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[378205,378218] [2022-07-14 04:50:51,285 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[378348,378361] [2022-07-14 04:50:51,286 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[378500,378513] [2022-07-14 04:50:51,286 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[378646,378659] [2022-07-14 04:50:51,286 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[378791,378804] [2022-07-14 04:50:51,287 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[378945,378958] [2022-07-14 04:50:51,287 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[379096,379109] [2022-07-14 04:50:51,287 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[379251,379264] [2022-07-14 04:50:51,287 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[379403,379416] [2022-07-14 04:50:51,288 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[379558,379571] [2022-07-14 04:50:51,288 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[379722,379735] [2022-07-14 04:50:51,289 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[379878,379891] [2022-07-14 04:50:51,289 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[380042,380055] [2022-07-14 04:50:51,289 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[380184,380197] [2022-07-14 04:50:51,290 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[380342,380355] [2022-07-14 04:50:51,291 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[380509,380522] [2022-07-14 04:50:51,292 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[380668,380681] [2022-07-14 04:50:51,292 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[380827,380840] [2022-07-14 04:50:51,292 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[380976,380989] [2022-07-14 04:50:51,293 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[381123,381136] [2022-07-14 04:50:51,293 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[381262,381275] [2022-07-14 04:50:51,293 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[381425,381438] [2022-07-14 04:50:51,294 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[381591,381604] [2022-07-14 04:50:51,294 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[381755,381768] [2022-07-14 04:50:51,294 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[381920,381933] [2022-07-14 04:50:51,294 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[382085,382098] [2022-07-14 04:50:51,295 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[382251,382264] [2022-07-14 04:50:51,295 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[382416,382429] [2022-07-14 04:50:51,295 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[382583,382596] [2022-07-14 04:50:51,296 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[382743,382756] [2022-07-14 04:50:51,296 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[382905,382918] [2022-07-14 04:50:51,296 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[383064,383077] [2022-07-14 04:50:51,296 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[383210,383223] [2022-07-14 04:50:51,297 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[383353,383366] [2022-07-14 04:50:51,297 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[383497,383510] [2022-07-14 04:50:51,297 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[383640,383653] [2022-07-14 04:50:51,297 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[383784,383797] [2022-07-14 04:50:51,298 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[383925,383938] [2022-07-14 04:50:51,299 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[384063,384076] [2022-07-14 04:50:51,301 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[384221,384234] [2022-07-14 04:50:51,301 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[384380,384393] [2022-07-14 04:50:51,302 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[384536,384549] [2022-07-14 04:50:51,302 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[384685,384698] [2022-07-14 04:50:51,303 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[384837,384850] [2022-07-14 04:50:51,307 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[384988,385001] [2022-07-14 04:50:51,308 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[385137,385150] [2022-07-14 04:50:51,308 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[385289,385302] [2022-07-14 04:50:51,309 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[385437,385450] [2022-07-14 04:50:51,316 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[385590,385603] [2022-07-14 04:50:51,316 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[385741,385754] [2022-07-14 04:50:51,316 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[385891,385904] [2022-07-14 04:50:51,316 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[386038,386051] [2022-07-14 04:50:51,317 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[386189,386202] [2022-07-14 04:50:51,317 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[386340,386353] [2022-07-14 04:50:51,317 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[386488,386501] [2022-07-14 04:50:51,317 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[386654,386667] [2022-07-14 04:50:51,318 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[386823,386836] [2022-07-14 04:50:51,318 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[386990,387003] [2022-07-14 04:50:51,318 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[387158,387171] [2022-07-14 04:50:51,318 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[387308,387321] [2022-07-14 04:50:51,318 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[387455,387468] [2022-07-14 04:50:51,319 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[387616,387629] [2022-07-14 04:50:51,319 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[387786,387799] [2022-07-14 04:50:51,319 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i[387948,387961] [2022-07-14 04:50:51,321 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 04:50:51,499 INFO L208 MainTranslator]: Completed translation [2022-07-14 04:50:51,500 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:50:51 WrapperNode [2022-07-14 04:50:51,500 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 04:50:51,502 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 04:50:51,502 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 04:50:51,502 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 04:50:51,509 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:50:51" (1/1) ... [2022-07-14 04:50:51,599 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:50:51" (1/1) ... [2022-07-14 04:50:51,937 INFO L137 Inliner]: procedures = 640, calls = 2778, calls flagged for inlining = 295, calls inlined = 219, statements flattened = 6490 [2022-07-14 04:50:51,938 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 04:50:51,939 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 04:50:51,939 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 04:50:51,939 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 04:50:51,952 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:50:51" (1/1) ... [2022-07-14 04:50:51,952 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:50:51" (1/1) ... [2022-07-14 04:50:52,005 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:50:51" (1/1) ... [2022-07-14 04:50:52,006 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:50:51" (1/1) ... [2022-07-14 04:50:52,126 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:50:51" (1/1) ... [2022-07-14 04:50:52,212 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:50:51" (1/1) ... [2022-07-14 04:50:52,282 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:50:51" (1/1) ... [2022-07-14 04:50:52,430 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 04:50:52,431 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 04:50:52,432 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 04:50:52,432 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 04:50:52,433 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:50:51" (1/1) ... [2022-07-14 04:50:52,459 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 04:50:52,482 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:50:52,521 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-14 04:50:52,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-14 04:50:52,600 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_97 [2022-07-14 04:50:52,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_97 [2022-07-14 04:50:52,600 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-14 04:50:52,600 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-14 04:50:52,601 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-14 04:50:52,601 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-14 04:50:52,601 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_wakeup [2022-07-14 04:50:52,601 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_wakeup [2022-07-14 04:50:52,601 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_read_fifo [2022-07-14 04:50:52,601 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_read_fifo [2022-07-14 04:50:52,601 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_write_fifo [2022-07-14 04:50:52,601 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_write_fifo [2022-07-14 04:50:52,601 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-14 04:50:52,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-14 04:50:52,602 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_net2272 [2022-07-14 04:50:52,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_lock_of_net2272 [2022-07-14 04:50:52,602 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_io_mem_remap [2022-07-14 04:50:52,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_io_mem_remap [2022-07-14 04:50:52,602 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-14 04:50:52,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-14 04:50:52,602 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2022-07-14 04:50:52,602 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2022-07-14 04:50:52,602 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-14 04:50:52,603 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-14 04:50:52,603 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_read [2022-07-14 04:50:52,603 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_read [2022-07-14 04:50:52,603 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_in [2022-07-14 04:50:52,603 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_in [2022-07-14 04:50:52,603 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_enable [2022-07-14 04:50:52,603 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_enable [2022-07-14 04:50:52,603 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_pio_advance [2022-07-14 04:50:52,603 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_pio_advance [2022-07-14 04:50:52,604 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-14 04:50:52,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-14 04:50:52,604 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-14 04:50:52,604 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-14 04:50:52,604 INFO L130 BoogieDeclarations]: Found specification of procedure set_fifo_bytecount [2022-07-14 04:50:52,604 INFO L138 BoogieDeclarations]: Found implementation of procedure set_fifo_bytecount [2022-07-14 04:50:52,604 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_usb_reset [2022-07-14 04:50:52,604 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_usb_reset [2022-07-14 04:50:52,604 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-14 04:50:52,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-14 04:50:52,605 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-14 04:50:52,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-14 04:50:52,605 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-14 04:50:52,605 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-14 04:50:52,605 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_usb_reinit [2022-07-14 04:50:52,605 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_usb_reinit [2022-07-14 04:50:52,605 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_pci_unregister [2022-07-14 04:50:52,605 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_pci_unregister [2022-07-14 04:50:52,605 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_resource [2022-07-14 04:50:52,606 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_resource [2022-07-14 04:50:52,606 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 04:50:52,606 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_101 [2022-07-14 04:50:52,606 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_101 [2022-07-14 04:50:52,607 INFO L130 BoogieDeclarations]: Found specification of procedure type_string [2022-07-14 04:50:52,607 INFO L138 BoogieDeclarations]: Found implementation of procedure type_string [2022-07-14 04:50:52,607 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_gadget_release [2022-07-14 04:50:52,607 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_gadget_release [2022-07-14 04:50:52,607 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-14 04:50:52,607 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-14 04:50:52,607 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_handle_dma [2022-07-14 04:50:52,607 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_handle_dma [2022-07-14 04:50:52,608 INFO L130 BoogieDeclarations]: Found specification of procedure allow_status [2022-07-14 04:50:52,608 INFO L138 BoogieDeclarations]: Found implementation of procedure allow_status [2022-07-14 04:50:52,608 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-07-14 04:50:52,608 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-07-14 04:50:52,608 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-14 04:50:52,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-14 04:50:52,608 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-14 04:50:52,608 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-14 04:50:52,609 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_request_dma [2022-07-14 04:50:52,612 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_request_dma [2022-07-14 04:50:52,612 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-14 04:50:52,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-14 04:50:52,612 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 04:50:52,612 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-14 04:50:52,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-14 04:50:52,612 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-14 04:50:52,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-14 04:50:52,613 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2022-07-14 04:50:52,613 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2022-07-14 04:50:52,614 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_ep_read [2022-07-14 04:50:52,615 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_ep_read [2022-07-14 04:50:52,615 INFO L130 BoogieDeclarations]: Found specification of procedure list_add_tail [2022-07-14 04:50:52,615 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add_tail [2022-07-14 04:50:52,615 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-14 04:50:52,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-14 04:50:52,615 INFO L130 BoogieDeclarations]: Found specification of procedure pci_disable_device [2022-07-14 04:50:52,615 INFO L138 BoogieDeclarations]: Found implementation of procedure pci_disable_device [2022-07-14 04:50:52,615 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-14 04:50:52,615 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-14 04:50:52,616 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_check_return_value_probe [2022-07-14 04:50:52,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_check_return_value_probe [2022-07-14 04:50:52,616 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_set_halt_and_wedge [2022-07-14 04:50:52,616 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_set_halt_and_wedge [2022-07-14 04:50:52,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 04:50:52,616 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_interrupt_interrupt_instance_0 [2022-07-14 04:50:52,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_interrupt_interrupt_instance_0 [2022-07-14 04:50:52,616 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_check_return_value_probe [2022-07-14 04:50:52,616 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_check_return_value_probe [2022-07-14 04:50:52,616 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 04:50:52,617 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-14 04:50:52,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-14 04:50:52,617 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2022-07-14 04:50:52,617 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2022-07-14 04:50:52,617 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 04:50:52,617 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-14 04:50:52,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-14 04:50:52,617 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-14 04:50:52,617 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-14 04:50:52,617 INFO L130 BoogieDeclarations]: Found specification of procedure set_halt [2022-07-14 04:50:52,618 INFO L138 BoogieDeclarations]: Found implementation of procedure set_halt [2022-07-14 04:50:52,618 INFO L130 BoogieDeclarations]: Found specification of procedure usb_ep_set_maxpacket_limit [2022-07-14 04:50:52,618 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_ep_set_maxpacket_limit [2022-07-14 04:50:52,618 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-14 04:50:52,618 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-14 04:50:52,618 INFO L130 BoogieDeclarations]: Found specification of procedure writel [2022-07-14 04:50:52,618 INFO L138 BoogieDeclarations]: Found implementation of procedure writel [2022-07-14 04:50:52,618 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_set_wedge [2022-07-14 04:50:52,619 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_set_wedge [2022-07-14 04:50:52,619 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_ep_reset [2022-07-14 04:50:52,619 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_ep_reset [2022-07-14 04:50:52,619 INFO L130 BoogieDeclarations]: Found specification of procedure writeb [2022-07-14 04:50:52,619 INFO L138 BoogieDeclarations]: Found implementation of procedure writeb [2022-07-14 04:50:52,620 INFO L130 BoogieDeclarations]: Found specification of procedure writew [2022-07-14 04:50:52,620 INFO L138 BoogieDeclarations]: Found implementation of procedure writew [2022-07-14 04:50:52,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 04:50:52,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 04:50:52,620 INFO L130 BoogieDeclarations]: Found specification of procedure stop_activity [2022-07-14 04:50:52,620 INFO L138 BoogieDeclarations]: Found implementation of procedure stop_activity [2022-07-14 04:50:52,620 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2022-07-14 04:50:52,620 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2022-07-14 04:50:52,620 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-14 04:50:52,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-14 04:50:52,621 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_irq [2022-07-14 04:50:52,621 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_irq [2022-07-14 04:50:52,621 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_handle_ep [2022-07-14 04:50:52,621 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_handle_ep [2022-07-14 04:50:52,621 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_start [2022-07-14 04:50:52,621 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_start [2022-07-14 04:50:52,621 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_ep_write [2022-07-14 04:50:52,621 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_ep_write [2022-07-14 04:50:52,622 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_pci_probe [2022-07-14 04:50:52,622 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_pci_probe [2022-07-14 04:50:52,622 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-14 04:50:52,622 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-14 04:50:52,622 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_probe_fin [2022-07-14 04:50:52,622 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_probe_fin [2022-07-14 04:50:52,622 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_fifo_flush [2022-07-14 04:50:52,622 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_fifo_flush [2022-07-14 04:50:52,622 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_done [2022-07-14 04:50:52,623 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_done [2022-07-14 04:50:52,623 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_cancel_dma [2022-07-14 04:50:52,623 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_cancel_dma [2022-07-14 04:50:52,623 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_io_mem_unmap [2022-07-14 04:50:52,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_io_mem_unmap [2022-07-14 04:50:52,623 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_dequeue_all [2022-07-14 04:50:52,623 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_dequeue_all [2022-07-14 04:50:52,623 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_post_probe [2022-07-14 04:50:52,623 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_post_probe [2022-07-14 04:50:52,623 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_probe_init [2022-07-14 04:50:52,624 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_probe_init [2022-07-14 04:50:52,624 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-14 04:50:52,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-14 04:50:52,624 INFO L130 BoogieDeclarations]: Found specification of procedure ERR_PTR [2022-07-14 04:50:52,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ERR_PTR [2022-07-14 04:50:52,624 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_remove [2022-07-14 04:50:52,624 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_remove [2022-07-14 04:50:52,624 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-14 04:50:52,624 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-14 04:50:52,625 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 04:50:52,625 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-07-14 04:50:52,625 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-07-14 04:50:52,625 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-14 04:50:52,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-14 04:50:52,625 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_fifo_status [2022-07-14 04:50:52,625 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_fifo_status [2022-07-14 04:50:52,625 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 04:50:52,625 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_request_irq_130 [2022-07-14 04:50:52,625 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_request_irq_130 [2022-07-14 04:50:52,626 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_xfer_isoc [2022-07-14 04:50:52,626 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_xfer_isoc [2022-07-14 04:50:52,626 INFO L130 BoogieDeclarations]: Found specification of procedure buf_state_string [2022-07-14 04:50:52,626 INFO L138 BoogieDeclarations]: Found implementation of procedure buf_state_string [2022-07-14 04:50:52,626 INFO L130 BoogieDeclarations]: Found specification of procedure clear_halt [2022-07-14 04:50:52,626 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_halt [2022-07-14 04:50:52,626 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2022-07-14 04:50:52,626 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2022-07-14 04:50:52,626 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_stop [2022-07-14 04:50:52,627 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_stop [2022-07-14 04:50:52,627 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 04:50:52,627 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-07-14 04:50:52,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~~structbegin~int~structend~~TO~int [2022-07-14 04:50:52,627 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_pre_probe [2022-07-14 04:50:52,627 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_pre_probe [2022-07-14 04:50:52,627 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_reg_addr [2022-07-14 04:50:52,627 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_reg_addr [2022-07-14 04:50:52,627 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_net2272 [2022-07-14 04:50:52,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_lock_of_net2272 [2022-07-14 04:50:52,628 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-14 04:50:52,628 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-14 04:50:52,628 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_plat_probe [2022-07-14 04:50:52,628 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_plat_probe [2022-07-14 04:50:52,628 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-14 04:50:52,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-14 04:50:52,628 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_request_irq [2022-07-14 04:50:52,628 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_request_irq [2022-07-14 04:50:52,628 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dispatch_irq_register_11_2 [2022-07-14 04:50:52,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dispatch_irq_register_11_2 [2022-07-14 04:50:52,629 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-14 04:50:52,629 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-14 04:50:52,630 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_write [2022-07-14 04:50:52,630 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_write [2022-07-14 04:50:52,630 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_irq [2022-07-14 04:50:52,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_irq [2022-07-14 04:50:52,630 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-14 04:50:52,630 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-14 04:50:52,630 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_plat_remove [2022-07-14 04:50:52,630 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_plat_remove [2022-07-14 04:50:52,630 INFO L130 BoogieDeclarations]: Found specification of procedure list_empty [2022-07-14 04:50:52,630 INFO L138 BoogieDeclarations]: Found implementation of procedure list_empty [2022-07-14 04:50:52,631 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_ep0_start [2022-07-14 04:50:52,631 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_ep0_start [2022-07-14 04:50:52,631 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-14 04:50:52,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-14 04:50:52,631 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-14 04:50:52,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-14 04:50:52,631 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-14 04:50:52,631 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-14 04:50:52,631 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_pci_remove [2022-07-14 04:50:52,631 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_pci_remove [2022-07-14 04:50:52,632 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_disable [2022-07-14 04:50:52,632 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_disable [2022-07-14 04:50:52,632 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-14 04:50:52,632 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-14 04:50:52,632 INFO L130 BoogieDeclarations]: Found specification of procedure __release_region [2022-07-14 04:50:52,632 INFO L138 BoogieDeclarations]: Found implementation of procedure __release_region [2022-07-14 04:50:52,632 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-14 04:50:52,632 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-14 04:50:52,632 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 04:50:52,632 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_handle_stat0_irqs [2022-07-14 04:50:52,633 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_handle_stat0_irqs [2022-07-14 04:50:52,633 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-14 04:50:52,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-14 04:50:52,633 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-14 04:50:52,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-14 04:50:52,633 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_get_frame [2022-07-14 04:50:52,633 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_get_frame [2022-07-14 04:50:52,633 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-14 04:50:52,633 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-14 04:50:52,633 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_102 [2022-07-14 04:50:52,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_102 [2022-07-14 04:50:52,634 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_get_ep_by_addr [2022-07-14 04:50:52,634 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_get_ep_by_addr [2022-07-14 04:50:52,634 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2022-07-14 04:50:52,634 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2022-07-14 04:50:52,634 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-14 04:50:52,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-14 04:50:52,634 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-14 04:50:52,634 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-14 04:50:52,635 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_interrupt_instance_handler_0_5 [2022-07-14 04:50:52,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_interrupt_instance_handler_0_5 [2022-07-14 04:50:52,635 INFO L130 BoogieDeclarations]: Found specification of procedure readw [2022-07-14 04:50:52,635 INFO L138 BoogieDeclarations]: Found implementation of procedure readw [2022-07-14 04:50:52,635 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_kick_dma [2022-07-14 04:50:52,635 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_kick_dma [2022-07-14 04:50:52,635 INFO L130 BoogieDeclarations]: Found specification of procedure net2272_dequeue [2022-07-14 04:50:52,635 INFO L138 BoogieDeclarations]: Found implementation of procedure net2272_dequeue [2022-07-14 04:50:52,635 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-14 04:50:52,635 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-14 04:50:52,636 INFO L130 BoogieDeclarations]: Found specification of procedure readl [2022-07-14 04:50:52,636 INFO L138 BoogieDeclarations]: Found implementation of procedure readl [2022-07-14 04:50:52,636 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 04:50:52,636 INFO L130 BoogieDeclarations]: Found specification of procedure __request_region [2022-07-14 04:50:52,636 INFO L138 BoogieDeclarations]: Found implementation of procedure __request_region [2022-07-14 04:50:52,636 INFO L130 BoogieDeclarations]: Found specification of procedure resource_size [2022-07-14 04:50:52,636 INFO L138 BoogieDeclarations]: Found implementation of procedure resource_size [2022-07-14 04:50:52,636 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2022-07-14 04:50:52,636 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2022-07-14 04:50:52,636 INFO L130 BoogieDeclarations]: Found specification of procedure readb [2022-07-14 04:50:52,637 INFO L138 BoogieDeclarations]: Found implementation of procedure readb [2022-07-14 04:50:53,357 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 04:50:53,359 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 04:50:53,661 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-14 04:50:53,961 WARN L811 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-07-14 04:50:54,100 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L4822: SUMMARY for call assert_out_naking_#t~ret118#1 := ldv__builtin_expect(assert_out_naking_#t~mem117#1 % 256, 0); srcloc: null [2022-07-14 04:50:54,100 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L4822-1: assume -9223372036854775808 <= assert_out_naking_#t~ret118#1 && assert_out_naking_#t~ret118#1 <= 9223372036854775807;assert_out_naking_~tmp___0~4#1 := assert_out_naking_#t~ret118#1;havoc assert_out_naking_#t~mem117#1;havoc assert_out_naking_#t~ret118#1; [2022-07-14 04:50:54,100 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L4814: call ULTIMATE.dealloc(assert_out_naking_~#descriptor~0#1.base, assert_out_naking_~#descriptor~0#1.offset);havoc assert_out_naking_~#descriptor~0#1.base, assert_out_naking_~#descriptor~0#1.offset; [2022-07-14 04:50:54,100 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L4832: SUMMARY for call net2272_ep_write(assert_out_naking_~ep#1.base, assert_out_naking_~ep#1.offset, 15, 128); srcloc: null [2022-07-14 04:50:54,100 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L4824: goto; [2022-07-14 04:50:54,101 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint L4824: assume 0 != assert_out_naking_~tmp___0~4#1;call assert_out_naking_#t~mem119#1.base, assert_out_naking_#t~mem119#1.offset := read~$Pointer$(assert_out_naking_~ep#1.base, 65 + assert_out_naking_~ep#1.offset, 8);call assert_out_naking_#t~mem120#1.base, assert_out_naking_#t~mem120#1.offset := read~$Pointer$(assert_out_naking_#t~mem119#1.base, 1481 + assert_out_naking_#t~mem119#1.offset, 8);call assert_out_naking_#t~mem121#1.base, assert_out_naking_#t~mem121#1.offset := read~$Pointer$(assert_out_naking_~ep#1.base, 8 + assert_out_naking_~ep#1.offset, 8);havoc assert_out_naking_#t~mem119#1.base, assert_out_naking_#t~mem119#1.offset;havoc assert_out_naking_#t~mem120#1.base, assert_out_naking_#t~mem120#1.offset;havoc assert_out_naking_#t~mem121#1.base, assert_out_naking_#t~mem121#1.offset; [2022-07-14 04:50:54,101 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##47: assume !(0 != assert_out_naking_~tmp___0~4#1); [2022-07-14 04:50:54,101 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##45: assume !(0 == (if 0 == assert_out_naking_~tmp~9#1 % 256 then 0 else (if 1 == assert_out_naking_~tmp~9#1 % 256 then 0 else ~bitwiseAnd(assert_out_naking_~tmp~9#1 % 256, 32)))); [2022-07-14 04:50:54,101 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##44: assume 0 == (if 0 == assert_out_naking_~tmp~9#1 % 256 then 0 else (if 1 == assert_out_naking_~tmp~9#1 % 256 then 0 else ~bitwiseAnd(assert_out_naking_~tmp~9#1 % 256, 32)));call write~$Pointer$(4, 0, assert_out_naking_~#descriptor~0#1.base, assert_out_naking_~#descriptor~0#1.offset, 8);call write~$Pointer$(5, 0, assert_out_naking_~#descriptor~0#1.base, 8 + assert_out_naking_~#descriptor~0#1.offset, 8);call write~$Pointer$(6, 0, assert_out_naking_~#descriptor~0#1.base, 16 + assert_out_naking_~#descriptor~0#1.offset, 8);call write~$Pointer$(7, 0, assert_out_naking_~#descriptor~0#1.base, 24 + assert_out_naking_~#descriptor~0#1.offset, 8);call write~int(131, assert_out_naking_~#descriptor~0#1.base, 32 + assert_out_naking_~#descriptor~0#1.offset, 4);call write~int(0, assert_out_naking_~#descriptor~0#1.base, 36 + assert_out_naking_~#descriptor~0#1.offset, 1);call assert_out_naking_#t~mem117#1 := read~int(assert_out_naking_~#descriptor~0#1.base, 36 + assert_out_naking_~#descriptor~0#1.offset, 1); [2022-07-14 04:50:56,813 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 04:50:56,837 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 04:50:56,837 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-14 04:50:56,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:50:56 BoogieIcfgContainer [2022-07-14 04:50:56,841 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 04:50:56,844 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 04:50:56,844 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 04:50:56,846 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 04:50:56,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 04:50:48" (1/3) ... [2022-07-14 04:50:56,847 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6503c539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 04:50:56, skipping insertion in model container [2022-07-14 04:50:56,847 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:50:51" (2/3) ... [2022-07-14 04:50:56,848 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6503c539 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 04:50:56, skipping insertion in model container [2022-07-14 04:50:56,848 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:50:56" (3/3) ... [2022-07-14 04:50:56,849 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--usb--gadget--udc--net2272.ko.cil.i [2022-07-14 04:50:56,860 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 04:50:56,860 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 28 error locations. [2022-07-14 04:50:56,940 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 04:50:56,944 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@41e937da, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3a9f745c [2022-07-14 04:50:56,945 INFO L358 AbstractCegarLoop]: Starting to check reachability of 28 error locations. [2022-07-14 04:50:56,954 INFO L276 IsEmpty]: Start isEmpty. Operand has 2572 states, 1698 states have (on average 1.3409893992932862) internal successors, (2277), 1788 states have internal predecessors, (2277), 711 states have call successors, (711), 135 states have call predecessors, (711), 134 states have return successors, (703), 687 states have call predecessors, (703), 703 states have call successors, (703) [2022-07-14 04:50:56,963 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2022-07-14 04:50:56,963 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:50:56,964 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-14 04:50:56,964 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-14 04:50:56,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:50:56,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1907190920, now seen corresponding path program 1 times [2022-07-14 04:50:56,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:50:56,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224309016] [2022-07-14 04:50:56,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:50:56,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:50:57,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:57,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:50:57,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:57,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:50:57,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:57,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:50:57,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:57,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 04:50:57,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:57,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 04:50:57,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:57,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:50:57,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:57,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:50:57,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:57,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 04:50:57,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:57,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 04:50:57,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:50:57,620 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:50:57,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:50:57,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224309016] [2022-07-14 04:50:57,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224309016] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:50:57,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:50:57,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:50:57,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037768687] [2022-07-14 04:50:57,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:50:57,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:50:57,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:50:57,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:50:57,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:50:57,654 INFO L87 Difference]: Start difference. First operand has 2572 states, 1698 states have (on average 1.3409893992932862) internal successors, (2277), 1788 states have internal predecessors, (2277), 711 states have call successors, (711), 135 states have call predecessors, (711), 134 states have return successors, (703), 687 states have call predecessors, (703), 703 states have call successors, (703) Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-14 04:51:08,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:51:08,585 INFO L93 Difference]: Finished difference Result 7591 states and 11348 transitions. [2022-07-14 04:51:08,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 04:51:08,587 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 66 [2022-07-14 04:51:08,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:51:08,637 INFO L225 Difference]: With dead ends: 7591 [2022-07-14 04:51:08,638 INFO L226 Difference]: Without dead ends: 5012 [2022-07-14 04:51:08,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-14 04:51:08,664 INFO L413 NwaCegarLoop]: 3514 mSDtfsCounter, 8535 mSDsluCounter, 2967 mSDsCounter, 0 mSdLazyCounter, 8331 mSolverCounterSat, 5578 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8729 SdHoareTripleChecker+Valid, 6481 SdHoareTripleChecker+Invalid, 13909 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5578 IncrementalHoareTripleChecker+Valid, 8331 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:51:08,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8729 Valid, 6481 Invalid, 13909 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5578 Valid, 8331 Invalid, 0 Unknown, 0 Unchecked, 10.1s Time] [2022-07-14 04:51:08,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5012 states. [2022-07-14 04:51:08,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5012 to 4815. [2022-07-14 04:51:08,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4815 states, 3202 states have (on average 1.2951280449718925) internal successors, (4147), 3346 states have internal predecessors, (4147), 1341 states have call successors, (1341), 248 states have call predecessors, (1341), 244 states have return successors, (1397), 1299 states have call predecessors, (1397), 1339 states have call successors, (1397) [2022-07-14 04:51:08,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4815 states to 4815 states and 6885 transitions. [2022-07-14 04:51:08,957 INFO L78 Accepts]: Start accepts. Automaton has 4815 states and 6885 transitions. Word has length 66 [2022-07-14 04:51:08,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:51:08,959 INFO L495 AbstractCegarLoop]: Abstraction has 4815 states and 6885 transitions. [2022-07-14 04:51:08,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-14 04:51:08,959 INFO L276 IsEmpty]: Start isEmpty. Operand 4815 states and 6885 transitions. [2022-07-14 04:51:08,967 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-07-14 04:51:08,967 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:51:08,967 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-14 04:51:08,968 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 04:51:08,968 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-14 04:51:08,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:51:08,969 INFO L85 PathProgramCache]: Analyzing trace with hash 259434772, now seen corresponding path program 1 times [2022-07-14 04:51:08,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:51:08,969 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058315897] [2022-07-14 04:51:08,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:51:08,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:51:09,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:09,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:51:09,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:09,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:51:09,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:09,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:51:09,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:09,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 04:51:09,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:09,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 04:51:09,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:09,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:51:09,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:09,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:09,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:09,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 04:51:09,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:09,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 04:51:09,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:09,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 04:51:09,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:09,325 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:51:09,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:51:09,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058315897] [2022-07-14 04:51:09,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1058315897] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:51:09,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:51:09,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:51:09,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289590799] [2022-07-14 04:51:09,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:51:09,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:51:09,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:51:09,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:51:09,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:51:09,328 INFO L87 Difference]: Start difference. First operand 4815 states and 6885 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-14 04:51:15,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:51:15,272 INFO L93 Difference]: Finished difference Result 4815 states and 6885 transitions. [2022-07-14 04:51:15,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:51:15,272 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 72 [2022-07-14 04:51:15,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:51:15,306 INFO L225 Difference]: With dead ends: 4815 [2022-07-14 04:51:15,306 INFO L226 Difference]: Without dead ends: 4813 [2022-07-14 04:51:15,313 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:51:15,315 INFO L413 NwaCegarLoop]: 3102 mSDtfsCounter, 5580 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3714 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5802 SdHoareTripleChecker+Valid, 5058 SdHoareTripleChecker+Invalid, 6996 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3282 IncrementalHoareTripleChecker+Valid, 3714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-07-14 04:51:15,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5802 Valid, 5058 Invalid, 6996 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3282 Valid, 3714 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-07-14 04:51:15,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4813 states. [2022-07-14 04:51:15,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4813 to 4813. [2022-07-14 04:51:15,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4813 states, 3201 states have (on average 1.2949078412995938) internal successors, (4145), 3344 states have internal predecessors, (4145), 1341 states have call successors, (1341), 248 states have call predecessors, (1341), 244 states have return successors, (1397), 1299 states have call predecessors, (1397), 1339 states have call successors, (1397) [2022-07-14 04:51:15,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4813 states to 4813 states and 6883 transitions. [2022-07-14 04:51:15,513 INFO L78 Accepts]: Start accepts. Automaton has 4813 states and 6883 transitions. Word has length 72 [2022-07-14 04:51:15,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:51:15,514 INFO L495 AbstractCegarLoop]: Abstraction has 4813 states and 6883 transitions. [2022-07-14 04:51:15,514 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-14 04:51:15,514 INFO L276 IsEmpty]: Start isEmpty. Operand 4813 states and 6883 transitions. [2022-07-14 04:51:15,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2022-07-14 04:51:15,516 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:51:15,516 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-14 04:51:15,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 04:51:15,517 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-14 04:51:15,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:51:15,518 INFO L85 PathProgramCache]: Analyzing trace with hash -458841926, now seen corresponding path program 1 times [2022-07-14 04:51:15,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:51:15,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [900380240] [2022-07-14 04:51:15,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:51:15,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:51:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:15,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:51:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:15,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:51:15,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:15,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:51:15,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:15,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 04:51:15,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:15,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 04:51:15,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:15,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:51:15,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:15,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:15,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:15,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 04:51:15,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:15,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 04:51:15,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:15,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 04:51:15,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:15,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-14 04:51:15,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:15,850 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:51:15,851 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:51:15,851 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [900380240] [2022-07-14 04:51:15,851 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [900380240] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:51:15,851 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:51:15,851 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:51:15,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183662457] [2022-07-14 04:51:15,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:51:15,852 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:51:15,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:51:15,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:51:15,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:51:15,853 INFO L87 Difference]: Start difference. First operand 4813 states and 6883 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-14 04:51:20,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:51:20,845 INFO L93 Difference]: Finished difference Result 4813 states and 6883 transitions. [2022-07-14 04:51:20,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:51:20,847 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 78 [2022-07-14 04:51:20,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:51:20,871 INFO L225 Difference]: With dead ends: 4813 [2022-07-14 04:51:20,872 INFO L226 Difference]: Without dead ends: 4811 [2022-07-14 04:51:20,877 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:51:20,878 INFO L413 NwaCegarLoop]: 3100 mSDtfsCounter, 5574 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3712 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5795 SdHoareTripleChecker+Valid, 5056 SdHoareTripleChecker+Invalid, 6994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3282 IncrementalHoareTripleChecker+Valid, 3712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-07-14 04:51:20,878 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5795 Valid, 5056 Invalid, 6994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3282 Valid, 3712 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-07-14 04:51:20,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4811 states. [2022-07-14 04:51:21,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4811 to 4811. [2022-07-14 04:51:21,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4811 states, 3200 states have (on average 1.2946875) internal successors, (4143), 3342 states have internal predecessors, (4143), 1341 states have call successors, (1341), 248 states have call predecessors, (1341), 244 states have return successors, (1397), 1299 states have call predecessors, (1397), 1339 states have call successors, (1397) [2022-07-14 04:51:21,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4811 states to 4811 states and 6881 transitions. [2022-07-14 04:51:21,140 INFO L78 Accepts]: Start accepts. Automaton has 4811 states and 6881 transitions. Word has length 78 [2022-07-14 04:51:21,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:51:21,140 INFO L495 AbstractCegarLoop]: Abstraction has 4811 states and 6881 transitions. [2022-07-14 04:51:21,141 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-14 04:51:21,141 INFO L276 IsEmpty]: Start isEmpty. Operand 4811 states and 6881 transitions. [2022-07-14 04:51:21,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2022-07-14 04:51:21,143 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:51:21,143 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-14 04:51:21,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 04:51:21,143 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-14 04:51:21,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:51:21,145 INFO L85 PathProgramCache]: Analyzing trace with hash 134960499, now seen corresponding path program 1 times [2022-07-14 04:51:21,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:51:21,145 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798783925] [2022-07-14 04:51:21,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:51:21,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:51:21,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:21,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:51:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:21,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:51:21,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:21,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:51:21,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:21,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 04:51:21,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:21,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 04:51:21,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:21,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:51:21,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:21,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:21,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:21,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 04:51:21,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:21,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 04:51:21,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:21,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 04:51:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:21,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-14 04:51:21,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:21,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-14 04:51:21,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:21,365 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:51:21,366 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:51:21,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798783925] [2022-07-14 04:51:21,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798783925] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:51:21,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:51:21,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:51:21,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1846235726] [2022-07-14 04:51:21,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:51:21,367 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:51:21,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:51:21,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:51:21,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:51:21,368 INFO L87 Difference]: Start difference. First operand 4811 states and 6881 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-14 04:51:26,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:51:26,469 INFO L93 Difference]: Finished difference Result 4811 states and 6881 transitions. [2022-07-14 04:51:26,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:51:26,470 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 84 [2022-07-14 04:51:26,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:51:26,514 INFO L225 Difference]: With dead ends: 4811 [2022-07-14 04:51:26,514 INFO L226 Difference]: Without dead ends: 4809 [2022-07-14 04:51:26,519 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:51:26,520 INFO L413 NwaCegarLoop]: 3098 mSDtfsCounter, 5568 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3710 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5788 SdHoareTripleChecker+Valid, 5054 SdHoareTripleChecker+Invalid, 6992 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3282 IncrementalHoareTripleChecker+Valid, 3710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-07-14 04:51:26,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5788 Valid, 5054 Invalid, 6992 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3282 Valid, 3710 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-07-14 04:51:26,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4809 states. [2022-07-14 04:51:26,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4809 to 4809. [2022-07-14 04:51:26,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4809 states, 3199 states have (on average 1.294467020944045) internal successors, (4141), 3340 states have internal predecessors, (4141), 1341 states have call successors, (1341), 248 states have call predecessors, (1341), 244 states have return successors, (1397), 1299 states have call predecessors, (1397), 1339 states have call successors, (1397) [2022-07-14 04:51:26,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4809 states to 4809 states and 6879 transitions. [2022-07-14 04:51:26,803 INFO L78 Accepts]: Start accepts. Automaton has 4809 states and 6879 transitions. Word has length 84 [2022-07-14 04:51:26,804 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:51:26,804 INFO L495 AbstractCegarLoop]: Abstraction has 4809 states and 6879 transitions. [2022-07-14 04:51:26,804 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-14 04:51:26,804 INFO L276 IsEmpty]: Start isEmpty. Operand 4809 states and 6879 transitions. [2022-07-14 04:51:26,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-07-14 04:51:26,806 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:51:26,806 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-14 04:51:26,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 04:51:26,807 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-14 04:51:26,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:51:26,808 INFO L85 PathProgramCache]: Analyzing trace with hash 1947085320, now seen corresponding path program 1 times [2022-07-14 04:51:26,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:51:26,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866003501] [2022-07-14 04:51:26,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:51:26,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:51:26,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:26,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:51:26,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:26,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:51:26,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:26,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:51:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:27,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 04:51:27,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:27,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 04:51:27,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:27,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:51:27,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:27,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:27,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:27,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 04:51:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:27,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 04:51:27,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:27,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 04:51:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:27,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-14 04:51:27,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:27,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-14 04:51:27,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:27,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:51:27,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:27,097 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:51:27,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:51:27,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866003501] [2022-07-14 04:51:27,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866003501] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:51:27,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:51:27,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:51:27,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501530313] [2022-07-14 04:51:27,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:51:27,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:51:27,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:51:27,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:51:27,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:51:27,100 INFO L87 Difference]: Start difference. First operand 4809 states and 6879 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-14 04:51:32,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:51:32,029 INFO L93 Difference]: Finished difference Result 4809 states and 6879 transitions. [2022-07-14 04:51:32,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:51:32,030 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 90 [2022-07-14 04:51:32,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:51:32,053 INFO L225 Difference]: With dead ends: 4809 [2022-07-14 04:51:32,053 INFO L226 Difference]: Without dead ends: 4807 [2022-07-14 04:51:32,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:51:32,058 INFO L413 NwaCegarLoop]: 3096 mSDtfsCounter, 5562 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3708 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5781 SdHoareTripleChecker+Valid, 5052 SdHoareTripleChecker+Invalid, 6990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3282 IncrementalHoareTripleChecker+Valid, 3708 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-07-14 04:51:32,058 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5781 Valid, 5052 Invalid, 6990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3282 Valid, 3708 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-07-14 04:51:32,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4807 states. [2022-07-14 04:51:32,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4807 to 4807. [2022-07-14 04:51:32,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4807 states, 3198 states have (on average 1.2942464040025015) internal successors, (4139), 3338 states have internal predecessors, (4139), 1341 states have call successors, (1341), 248 states have call predecessors, (1341), 244 states have return successors, (1397), 1299 states have call predecessors, (1397), 1339 states have call successors, (1397) [2022-07-14 04:51:32,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4807 states to 4807 states and 6877 transitions. [2022-07-14 04:51:32,273 INFO L78 Accepts]: Start accepts. Automaton has 4807 states and 6877 transitions. Word has length 90 [2022-07-14 04:51:32,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:51:32,274 INFO L495 AbstractCegarLoop]: Abstraction has 4807 states and 6877 transitions. [2022-07-14 04:51:32,274 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-14 04:51:32,275 INFO L276 IsEmpty]: Start isEmpty. Operand 4807 states and 6877 transitions. [2022-07-14 04:51:32,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-14 04:51:32,280 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:51:32,280 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2022-07-14 04:51:32,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 04:51:32,281 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting kzallocErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-14 04:51:32,281 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:51:32,281 INFO L85 PathProgramCache]: Analyzing trace with hash 674168724, now seen corresponding path program 1 times [2022-07-14 04:51:32,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:51:32,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067812904] [2022-07-14 04:51:32,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:51:32,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:51:32,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:32,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:51:32,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:32,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:51:32,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:32,445 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:51:32,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:32,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:51:32,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:32,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:32,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:32,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:51:32,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:32,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:51:32,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:32,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:51:32,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:32,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:32,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:32,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:51:32,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:32,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:51:32,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:32,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-14 04:51:32,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:32,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:32,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:32,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:51:32,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:32,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:51:32,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:32,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:51:32,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:32,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:51:32,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:32,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:51:32,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:32,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-14 04:51:32,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:32,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-14 04:51:32,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:32,559 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-14 04:51:32,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:51:32,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067812904] [2022-07-14 04:51:32,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2067812904] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:51:32,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:51:32,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 04:51:32,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [44470396] [2022-07-14 04:51:32,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:51:32,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 04:51:32,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:51:32,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 04:51:32,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-14 04:51:32,561 INFO L87 Difference]: Start difference. First operand 4807 states and 6877 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-14 04:51:45,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:51:45,634 INFO L93 Difference]: Finished difference Result 12257 states and 17686 transitions. [2022-07-14 04:51:45,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 04:51:45,634 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) Word has length 120 [2022-07-14 04:51:45,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:51:45,679 INFO L225 Difference]: With dead ends: 12257 [2022-07-14 04:51:45,680 INFO L226 Difference]: Without dead ends: 7471 [2022-07-14 04:51:45,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=109, Invalid=271, Unknown=0, NotChecked=0, Total=380 [2022-07-14 04:51:45,711 INFO L413 NwaCegarLoop]: 3215 mSDtfsCounter, 8990 mSDsluCounter, 3899 mSDsCounter, 0 mSdLazyCounter, 14909 mSolverCounterSat, 6115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9189 SdHoareTripleChecker+Valid, 7114 SdHoareTripleChecker+Invalid, 21024 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6115 IncrementalHoareTripleChecker+Valid, 14909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:51:45,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9189 Valid, 7114 Invalid, 21024 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6115 Valid, 14909 Invalid, 0 Unknown, 0 Unchecked, 12.4s Time] [2022-07-14 04:51:45,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7471 states. [2022-07-14 04:51:46,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7471 to 7257. [2022-07-14 04:51:46,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7257 states, 4810 states have (on average 1.286070686070686) internal successors, (6186), 4996 states have internal predecessors, (6186), 1987 states have call successors, (1987), 419 states have call predecessors, (1987), 436 states have return successors, (2154), 1949 states have call predecessors, (2154), 1985 states have call successors, (2154) [2022-07-14 04:51:46,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7257 states to 7257 states and 10327 transitions. [2022-07-14 04:51:46,068 INFO L78 Accepts]: Start accepts. Automaton has 7257 states and 10327 transitions. Word has length 120 [2022-07-14 04:51:46,070 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:51:46,070 INFO L495 AbstractCegarLoop]: Abstraction has 7257 states and 10327 transitions. [2022-07-14 04:51:46,070 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 5 states have internal predecessors, (42), 2 states have call successors, (17), 5 states have call predecessors, (17), 2 states have return successors, (14), 3 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-14 04:51:46,070 INFO L276 IsEmpty]: Start isEmpty. Operand 7257 states and 10327 transitions. [2022-07-14 04:51:46,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2022-07-14 04:51:46,072 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:51:46,072 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2022-07-14 04:51:46,072 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 04:51:46,072 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting kzallocErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-14 04:51:46,073 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:51:46,073 INFO L85 PathProgramCache]: Analyzing trace with hash 674228306, now seen corresponding path program 1 times [2022-07-14 04:51:46,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:51:46,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1234047015] [2022-07-14 04:51:46,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:51:46,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:51:46,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:46,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:51:46,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:46,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:51:46,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:46,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:51:46,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:46,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:51:46,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:46,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:46,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:46,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:51:46,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:46,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:51:46,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:46,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:51:46,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:46,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:46,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:46,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:51:46,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:46,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:51:46,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:46,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-14 04:51:46,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:46,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:46,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:46,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:51:46,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:46,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:51:46,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:46,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:51:46,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:46,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:51:46,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:46,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:51:46,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:46,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-14 04:51:46,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:46,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-14 04:51:46,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:46,380 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-14 04:51:46,380 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:51:46,380 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1234047015] [2022-07-14 04:51:46,380 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1234047015] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:51:46,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:51:46,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-14 04:51:46,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621367783] [2022-07-14 04:51:46,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:51:46,381 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-14 04:51:46,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:51:46,382 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-14 04:51:46,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-14 04:51:46,382 INFO L87 Difference]: Start difference. First operand 7257 states and 10327 transitions. Second operand has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-07-14 04:51:54,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:51:54,886 INFO L93 Difference]: Finished difference Result 7487 states and 10683 transitions. [2022-07-14 04:51:54,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-14 04:51:54,887 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) Word has length 120 [2022-07-14 04:51:54,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:51:54,916 INFO L225 Difference]: With dead ends: 7487 [2022-07-14 04:51:54,917 INFO L226 Difference]: Without dead ends: 7485 [2022-07-14 04:51:54,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=159, Unknown=0, NotChecked=0, Total=240 [2022-07-14 04:51:54,924 INFO L413 NwaCegarLoop]: 3113 mSDtfsCounter, 4433 mSDsluCounter, 3325 mSDsCounter, 0 mSdLazyCounter, 7948 mSolverCounterSat, 3515 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4433 SdHoareTripleChecker+Valid, 6438 SdHoareTripleChecker+Invalid, 11463 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3515 IncrementalHoareTripleChecker+Valid, 7948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-07-14 04:51:54,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4433 Valid, 6438 Invalid, 11463 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3515 Valid, 7948 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2022-07-14 04:51:54,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7485 states. [2022-07-14 04:51:55,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7485 to 7261. [2022-07-14 04:51:55,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7261 states, 4814 states have (on average 1.2854175321977566) internal successors, (6188), 5000 states have internal predecessors, (6188), 1987 states have call successors, (1987), 419 states have call predecessors, (1987), 436 states have return successors, (2154), 1949 states have call predecessors, (2154), 1985 states have call successors, (2154) [2022-07-14 04:51:55,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7261 states to 7261 states and 10329 transitions. [2022-07-14 04:51:55,255 INFO L78 Accepts]: Start accepts. Automaton has 7261 states and 10329 transitions. Word has length 120 [2022-07-14 04:51:55,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:51:55,255 INFO L495 AbstractCegarLoop]: Abstraction has 7261 states and 10329 transitions. [2022-07-14 04:51:55,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.0) internal successors, (42), 4 states have internal predecessors, (42), 1 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (14), 1 states have call predecessors, (14), 1 states have call successors, (14) [2022-07-14 04:51:55,255 INFO L276 IsEmpty]: Start isEmpty. Operand 7261 states and 10329 transitions. [2022-07-14 04:51:55,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-07-14 04:51:55,257 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:51:55,257 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-14 04:51:55,257 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 04:51:55,258 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-14 04:51:55,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:51:55,258 INFO L85 PathProgramCache]: Analyzing trace with hash -1135512486, now seen corresponding path program 1 times [2022-07-14 04:51:55,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:51:55,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [147827179] [2022-07-14 04:51:55,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:51:55,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:51:55,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:55,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:51:55,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:55,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:51:55,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:55,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:51:55,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:55,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 04:51:55,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:55,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 04:51:55,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:55,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:51:55,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:55,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:51:55,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:55,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 04:51:55,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:55,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 04:51:55,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:55,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 04:51:55,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:55,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-14 04:51:55,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:55,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-14 04:51:55,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:55,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:51:55,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:55,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:51:55,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:51:55,455 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:51:55,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:51:55,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [147827179] [2022-07-14 04:51:55,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [147827179] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:51:55,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:51:55,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:51:55,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128900098] [2022-07-14 04:51:55,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:51:55,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:51:55,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:51:55,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:51:55,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:51:55,458 INFO L87 Difference]: Start difference. First operand 7261 states and 10329 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-14 04:52:00,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:52:00,829 INFO L93 Difference]: Finished difference Result 7261 states and 10329 transitions. [2022-07-14 04:52:00,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:52:00,829 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 96 [2022-07-14 04:52:00,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:52:00,857 INFO L225 Difference]: With dead ends: 7261 [2022-07-14 04:52:00,857 INFO L226 Difference]: Without dead ends: 7259 [2022-07-14 04:52:00,863 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-07-14 04:52:00,863 INFO L413 NwaCegarLoop]: 3094 mSDtfsCounter, 5556 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3706 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5774 SdHoareTripleChecker+Valid, 5050 SdHoareTripleChecker+Invalid, 6988 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3282 IncrementalHoareTripleChecker+Valid, 3706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-07-14 04:52:00,863 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5774 Valid, 5050 Invalid, 6988 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3282 Valid, 3706 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-07-14 04:52:00,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7259 states. [2022-07-14 04:52:01,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7259 to 7259. [2022-07-14 04:52:01,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7259 states, 4813 states have (on average 1.2852690629544983) internal successors, (6186), 4998 states have internal predecessors, (6186), 1987 states have call successors, (1987), 419 states have call predecessors, (1987), 436 states have return successors, (2154), 1949 states have call predecessors, (2154), 1985 states have call successors, (2154) [2022-07-14 04:52:01,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7259 states to 7259 states and 10327 transitions. [2022-07-14 04:52:01,210 INFO L78 Accepts]: Start accepts. Automaton has 7259 states and 10327 transitions. Word has length 96 [2022-07-14 04:52:01,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:52:01,210 INFO L495 AbstractCegarLoop]: Abstraction has 7259 states and 10327 transitions. [2022-07-14 04:52:01,210 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-14 04:52:01,210 INFO L276 IsEmpty]: Start isEmpty. Operand 7259 states and 10327 transitions. [2022-07-14 04:52:01,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-14 04:52:01,212 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:52:01,213 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 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] [2022-07-14 04:52:01,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 04:52:01,213 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting kzallocErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-14 04:52:01,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:52:01,213 INFO L85 PathProgramCache]: Analyzing trace with hash 1329569048, now seen corresponding path program 1 times [2022-07-14 04:52:01,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:52:01,214 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122516745] [2022-07-14 04:52:01,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:52:01,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:52:01,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:01,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:52:01,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:01,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:52:01,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:01,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:52:01,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:01,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:52:01,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:01,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:01,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:01,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:52:01,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:01,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:52:01,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:01,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:52:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:01,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:01,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:52:01,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:01,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:52:01,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:01,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-14 04:52:01,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:01,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:01,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:01,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:52:01,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:01,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:52:01,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:01,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:52:01,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:01,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:52:01,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:01,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:52:01,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:01,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-14 04:52:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:01,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-14 04:52:01,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:01,432 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-07-14 04:52:01,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:52:01,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122516745] [2022-07-14 04:52:01,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2122516745] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:52:01,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:52:01,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:52:01,433 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1203951185] [2022-07-14 04:52:01,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:52:01,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:52:01,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:52:01,434 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:52:01,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:52:01,435 INFO L87 Difference]: Start difference. First operand 7259 states and 10327 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-14 04:52:06,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:52:06,534 INFO L93 Difference]: Finished difference Result 14673 states and 21127 transitions. [2022-07-14 04:52:06,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:52:06,534 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 124 [2022-07-14 04:52:06,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:52:06,559 INFO L225 Difference]: With dead ends: 14673 [2022-07-14 04:52:06,560 INFO L226 Difference]: Without dead ends: 7435 [2022-07-14 04:52:06,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:52:06,593 INFO L413 NwaCegarLoop]: 3106 mSDtfsCounter, 6756 mSDsluCounter, 1709 mSDsCounter, 0 mSdLazyCounter, 2309 mSolverCounterSat, 4524 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6983 SdHoareTripleChecker+Valid, 4815 SdHoareTripleChecker+Invalid, 6833 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4524 IncrementalHoareTripleChecker+Valid, 2309 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-07-14 04:52:06,593 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6983 Valid, 4815 Invalid, 6833 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4524 Valid, 2309 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-07-14 04:52:06,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7435 states. [2022-07-14 04:52:06,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7435 to 7249. [2022-07-14 04:52:06,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7249 states, 4804 states have (on average 1.2841382181515404) internal successors, (6169), 4988 states have internal predecessors, (6169), 1987 states have call successors, (1987), 419 states have call predecessors, (1987), 436 states have return successors, (2154), 1949 states have call predecessors, (2154), 1985 states have call successors, (2154) [2022-07-14 04:52:06,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7249 states to 7249 states and 10310 transitions. [2022-07-14 04:52:06,900 INFO L78 Accepts]: Start accepts. Automaton has 7249 states and 10310 transitions. Word has length 124 [2022-07-14 04:52:06,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:52:06,902 INFO L495 AbstractCegarLoop]: Abstraction has 7249 states and 10310 transitions. [2022-07-14 04:52:06,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 3 states have internal predecessors, (46), 2 states have call successors, (17), 5 states have call predecessors, (17), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-14 04:52:06,902 INFO L276 IsEmpty]: Start isEmpty. Operand 7249 states and 10310 transitions. [2022-07-14 04:52:06,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-14 04:52:06,903 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:52:06,903 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:52:06,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 04:52:06,904 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_net_register_check_return_value_probeErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-14 04:52:06,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:52:06,904 INFO L85 PathProgramCache]: Analyzing trace with hash -336041078, now seen corresponding path program 1 times [2022-07-14 04:52:06,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:52:06,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913398302] [2022-07-14 04:52:06,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:52:06,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:52:06,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:07,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:52:07,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:07,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:52:07,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:07,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:52:07,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:07,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 04:52:07,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:07,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 04:52:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:07,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:52:07,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:07,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:07,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:07,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 04:52:07,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:07,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 04:52:07,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:07,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:52:07,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:07,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:52:07,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:07,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:07,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:07,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:52:07,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:07,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:52:07,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:07,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-14 04:52:07,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:07,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-14 04:52:07,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:07,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-14 04:52:07,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:07,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:52:07,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:07,096 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-07-14 04:52:07,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:52:07,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913398302] [2022-07-14 04:52:07,097 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913398302] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:52:07,097 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:52:07,097 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:52:07,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [854684089] [2022-07-14 04:52:07,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:52:07,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:52:07,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:52:07,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:52:07,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:52:07,098 INFO L87 Difference]: Start difference. First operand 7249 states and 10310 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), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-14 04:52:12,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:52:12,076 INFO L93 Difference]: Finished difference Result 14657 states and 20892 transitions. [2022-07-14 04:52:12,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-14 04:52:12,077 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), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 113 [2022-07-14 04:52:12,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:52:12,103 INFO L225 Difference]: With dead ends: 14657 [2022-07-14 04:52:12,103 INFO L226 Difference]: Without dead ends: 7429 [2022-07-14 04:52:12,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-14 04:52:12,125 INFO L413 NwaCegarLoop]: 2848 mSDtfsCounter, 6755 mSDsluCounter, 1709 mSDsCounter, 0 mSdLazyCounter, 2558 mSolverCounterSat, 4537 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6983 SdHoareTripleChecker+Valid, 4557 SdHoareTripleChecker+Invalid, 7095 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4537 IncrementalHoareTripleChecker+Valid, 2558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-07-14 04:52:12,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6983 Valid, 4557 Invalid, 7095 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4537 Valid, 2558 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-07-14 04:52:12,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7429 states. [2022-07-14 04:52:12,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7429 to 7243. [2022-07-14 04:52:12,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7243 states, 4799 states have (on average 1.2836007501562825) internal successors, (6160), 4982 states have internal predecessors, (6160), 1987 states have call successors, (1987), 419 states have call predecessors, (1987), 436 states have return successors, (2154), 1949 states have call predecessors, (2154), 1985 states have call successors, (2154) [2022-07-14 04:52:12,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7243 states to 7243 states and 10301 transitions. [2022-07-14 04:52:12,384 INFO L78 Accepts]: Start accepts. Automaton has 7243 states and 10301 transitions. Word has length 113 [2022-07-14 04:52:12,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:52:12,386 INFO L495 AbstractCegarLoop]: Abstraction has 7243 states and 10301 transitions. [2022-07-14 04:52:12,386 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), 2 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-14 04:52:12,387 INFO L276 IsEmpty]: Start isEmpty. Operand 7243 states and 10301 transitions. [2022-07-14 04:52:12,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2022-07-14 04:52:12,388 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:52:12,388 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-14 04:52:12,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 04:52:12,388 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-14 04:52:12,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:52:12,389 INFO L85 PathProgramCache]: Analyzing trace with hash 5687637, now seen corresponding path program 1 times [2022-07-14 04:52:12,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:52:12,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392390749] [2022-07-14 04:52:12,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:52:12,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:52:12,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:12,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:52:12,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:12,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:52:12,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:12,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:52:12,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:12,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 04:52:12,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:12,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 04:52:12,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:12,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:52:12,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:12,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:12,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:12,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 04:52:12,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:12,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 04:52:12,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:12,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 04:52:12,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:12,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-14 04:52:12,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:12,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-14 04:52:12,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:12,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:52:12,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:12,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:52:12,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:12,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:52:12,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:12,573 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:52:12,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:52:12,574 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392390749] [2022-07-14 04:52:12,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392390749] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:52:12,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:52:12,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:52:12,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001525304] [2022-07-14 04:52:12,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:52:12,575 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:52:12,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:52:12,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:52:12,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:52:12,576 INFO L87 Difference]: Start difference. First operand 7243 states and 10301 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-14 04:52:17,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:52:17,275 INFO L93 Difference]: Finished difference Result 7243 states and 10301 transitions. [2022-07-14 04:52:17,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:52:17,280 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 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 102 [2022-07-14 04:52:17,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:52:17,302 INFO L225 Difference]: With dead ends: 7243 [2022-07-14 04:52:17,303 INFO L226 Difference]: Without dead ends: 7241 [2022-07-14 04:52:17,307 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:52:17,308 INFO L413 NwaCegarLoop]: 3083 mSDtfsCounter, 5520 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3693 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5737 SdHoareTripleChecker+Valid, 5039 SdHoareTripleChecker+Invalid, 6975 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3282 IncrementalHoareTripleChecker+Valid, 3693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:52:17,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5737 Valid, 5039 Invalid, 6975 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3282 Valid, 3693 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-07-14 04:52:17,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7241 states. [2022-07-14 04:52:17,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7241 to 7241. [2022-07-14 04:52:17,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7241 states, 4798 states have (on average 1.283451438099208) internal successors, (6158), 4980 states have internal predecessors, (6158), 1987 states have call successors, (1987), 419 states have call predecessors, (1987), 436 states have return successors, (2154), 1949 states have call predecessors, (2154), 1985 states have call successors, (2154) [2022-07-14 04:52:17,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7241 states to 7241 states and 10299 transitions. [2022-07-14 04:52:17,585 INFO L78 Accepts]: Start accepts. Automaton has 7241 states and 10299 transitions. Word has length 102 [2022-07-14 04:52:17,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:52:17,586 INFO L495 AbstractCegarLoop]: Abstraction has 7241 states and 10299 transitions. [2022-07-14 04:52:17,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-14 04:52:17,586 INFO L276 IsEmpty]: Start isEmpty. Operand 7241 states and 10299 transitions. [2022-07-14 04:52:17,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-07-14 04:52:17,588 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:52:17,588 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:52:17,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 04:52:17,588 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-14 04:52:17,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:52:17,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1765061470, now seen corresponding path program 1 times [2022-07-14 04:52:17,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:52:17,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714010117] [2022-07-14 04:52:17,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:52:17,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:52:17,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:17,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:52:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:17,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:52:17,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:17,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:52:17,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:17,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 04:52:17,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:17,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 04:52:17,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:17,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:52:17,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:17,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:17,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:17,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 04:52:17,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:17,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 04:52:17,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:17,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:52:17,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:17,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:52:17,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:17,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:17,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:17,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:52:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:17,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:52:17,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:17,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-14 04:52:17,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:17,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-14 04:52:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:17,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-14 04:52:17,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:17,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:52:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:17,877 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-14 04:52:17,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:52:17,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714010117] [2022-07-14 04:52:17,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714010117] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:52:17,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:52:17,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 04:52:17,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768024874] [2022-07-14 04:52:17,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:52:17,878 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 04:52:17,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:52:17,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 04:52:17,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-14 04:52:17,879 INFO L87 Difference]: Start difference. First operand 7241 states and 10299 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (22), 6 states have call predecessors, (22), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-14 04:52:29,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:52:29,898 INFO L93 Difference]: Finished difference Result 10926 states and 15450 transitions. [2022-07-14 04:52:29,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-14 04:52:29,899 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (22), 6 states have call predecessors, (22), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 119 [2022-07-14 04:52:29,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:52:29,935 INFO L225 Difference]: With dead ends: 10926 [2022-07-14 04:52:29,935 INFO L226 Difference]: Without dead ends: 10924 [2022-07-14 04:52:29,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 43 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-07-14 04:52:29,940 INFO L413 NwaCegarLoop]: 3486 mSDtfsCounter, 7242 mSDsluCounter, 3511 mSDsCounter, 0 mSdLazyCounter, 11776 mSolverCounterSat, 5289 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7373 SdHoareTripleChecker+Valid, 6997 SdHoareTripleChecker+Invalid, 17065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 5289 IncrementalHoareTripleChecker+Valid, 11776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.3s IncrementalHoareTripleChecker+Time [2022-07-14 04:52:29,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7373 Valid, 6997 Invalid, 17065 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [5289 Valid, 11776 Invalid, 0 Unknown, 0 Unchecked, 11.3s Time] [2022-07-14 04:52:29,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10924 states. [2022-07-14 04:52:30,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10924 to 10550. [2022-07-14 04:52:30,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10550 states, 6975 states have (on average 1.2732616487455197) internal successors, (8881), 7227 states have internal predecessors, (8881), 2842 states have call successors, (2842), 711 states have call predecessors, (2842), 713 states have return successors, (3151), 2744 states have call predecessors, (3151), 2840 states have call successors, (3151) [2022-07-14 04:52:30,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10550 states to 10550 states and 14874 transitions. [2022-07-14 04:52:30,328 INFO L78 Accepts]: Start accepts. Automaton has 10550 states and 14874 transitions. Word has length 119 [2022-07-14 04:52:30,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:52:30,329 INFO L495 AbstractCegarLoop]: Abstraction has 10550 states and 14874 transitions. [2022-07-14 04:52:30,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 4 states have internal predecessors, (54), 2 states have call successors, (22), 6 states have call predecessors, (22), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-14 04:52:30,329 INFO L276 IsEmpty]: Start isEmpty. Operand 10550 states and 14874 transitions. [2022-07-14 04:52:30,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-07-14 04:52:30,330 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:52:30,330 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-14 04:52:30,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 04:52:30,331 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-14 04:52:30,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:52:30,331 INFO L85 PathProgramCache]: Analyzing trace with hash -1282682864, now seen corresponding path program 1 times [2022-07-14 04:52:30,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:52:30,332 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772213874] [2022-07-14 04:52:30,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:52:30,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:52:30,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:30,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:52:30,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:30,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:52:30,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:30,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:52:30,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:30,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 04:52:30,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:30,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 04:52:30,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:30,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:52:30,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:30,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:30,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:30,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 04:52:30,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:30,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 04:52:30,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:30,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 04:52:30,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:30,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-14 04:52:30,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:30,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-14 04:52:30,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:30,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:52:30,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:30,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:52:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:30,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:52:30,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:30,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-14 04:52:30,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:30,534 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:52:30,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:52:30,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1772213874] [2022-07-14 04:52:30,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1772213874] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:52:30,534 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:52:30,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:52:30,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635029665] [2022-07-14 04:52:30,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:52:30,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:52:30,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:52:30,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:52:30,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:52:30,536 INFO L87 Difference]: Start difference. First operand 10550 states and 14874 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-14 04:52:36,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:52:36,140 INFO L93 Difference]: Finished difference Result 10550 states and 14874 transitions. [2022-07-14 04:52:36,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:52:36,141 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (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 108 [2022-07-14 04:52:36,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:52:36,178 INFO L225 Difference]: With dead ends: 10550 [2022-07-14 04:52:36,178 INFO L226 Difference]: Without dead ends: 10548 [2022-07-14 04:52:36,186 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:52:36,188 INFO L413 NwaCegarLoop]: 3081 mSDtfsCounter, 5518 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3687 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5734 SdHoareTripleChecker+Valid, 5037 SdHoareTripleChecker+Invalid, 6969 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3282 IncrementalHoareTripleChecker+Valid, 3687 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:52:36,189 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5734 Valid, 5037 Invalid, 6969 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3282 Valid, 3687 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-07-14 04:52:36,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10548 states. [2022-07-14 04:52:36,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10548 to 10548. [2022-07-14 04:52:36,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10548 states, 6974 states have (on average 1.273157441927158) internal successors, (8879), 7225 states have internal predecessors, (8879), 2842 states have call successors, (2842), 711 states have call predecessors, (2842), 713 states have return successors, (3151), 2744 states have call predecessors, (3151), 2840 states have call successors, (3151) [2022-07-14 04:52:36,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10548 states to 10548 states and 14872 transitions. [2022-07-14 04:52:36,605 INFO L78 Accepts]: Start accepts. Automaton has 10548 states and 14872 transitions. Word has length 108 [2022-07-14 04:52:36,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:52:36,605 INFO L495 AbstractCegarLoop]: Abstraction has 10548 states and 14872 transitions. [2022-07-14 04:52:36,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-14 04:52:36,606 INFO L276 IsEmpty]: Start isEmpty. Operand 10548 states and 14872 transitions. [2022-07-14 04:52:36,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-14 04:52:36,607 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:52:36,607 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:52:36,607 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 04:52:36,607 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_usb_register_check_return_value_probeErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-14 04:52:36,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:52:36,608 INFO L85 PathProgramCache]: Analyzing trace with hash -2105982114, now seen corresponding path program 1 times [2022-07-14 04:52:36,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:52:36,608 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580516194] [2022-07-14 04:52:36,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:52:36,608 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:52:36,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:36,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:52:36,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:36,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:52:36,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:36,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:52:36,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:36,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 04:52:36,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:36,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 04:52:36,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:36,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:52:36,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:36,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:36,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:36,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 04:52:36,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:36,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 04:52:36,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:36,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:52:36,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:36,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:52:36,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:36,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:36,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:36,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:52:36,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:36,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:52:36,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:36,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-14 04:52:36,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:36,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-14 04:52:36,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:36,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-14 04:52:36,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:36,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:52:36,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:36,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-14 04:52:36,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:36,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:52:36,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:36,819 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-07-14 04:52:36,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:52:36,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580516194] [2022-07-14 04:52:36,820 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580516194] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:52:36,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032728227] [2022-07-14 04:52:36,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:52:36,820 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:52:36,820 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:52:36,822 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 04:52:36,823 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-14 04:52:37,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:37,707 INFO L263 TraceCheckSpWp]: Trace formula consists of 2520 conjuncts, 4 conjunts are in the unsatisfiable core [2022-07-14 04:52:37,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:52:37,783 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2022-07-14 04:52:37,783 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 04:52:37,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032728227] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:52:37,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 04:52:37,784 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-07-14 04:52:37,784 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871193435] [2022-07-14 04:52:37,784 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:52:37,785 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-14 04:52:37,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:52:37,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-14 04:52:37,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-14 04:52:37,785 INFO L87 Difference]: Start difference. First operand 10548 states and 14872 transitions. Second operand has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-14 04:52:38,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:52:38,225 INFO L93 Difference]: Finished difference Result 21069 states and 29712 transitions. [2022-07-14 04:52:38,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-14 04:52:38,226 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 122 [2022-07-14 04:52:38,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:52:38,265 INFO L225 Difference]: With dead ends: 21069 [2022-07-14 04:52:38,265 INFO L226 Difference]: Without dead ends: 10542 [2022-07-14 04:52:38,303 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-14 04:52:38,306 INFO L413 NwaCegarLoop]: 3550 mSDtfsCounter, 3530 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3530 SdHoareTripleChecker+Valid, 3550 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-14 04:52:38,306 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3530 Valid, 3550 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-14 04:52:38,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10542 states. [2022-07-14 04:52:38,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10542 to 10542. [2022-07-14 04:52:38,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10542 states, 6969 states have (on average 1.2727794518582294) internal successors, (8870), 7219 states have internal predecessors, (8870), 2842 states have call successors, (2842), 711 states have call predecessors, (2842), 713 states have return successors, (3151), 2744 states have call predecessors, (3151), 2840 states have call successors, (3151) [2022-07-14 04:52:38,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10542 states to 10542 states and 14863 transitions. [2022-07-14 04:52:38,741 INFO L78 Accepts]: Start accepts. Automaton has 10542 states and 14863 transitions. Word has length 122 [2022-07-14 04:52:38,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:52:38,742 INFO L495 AbstractCegarLoop]: Abstraction has 10542 states and 14863 transitions. [2022-07-14 04:52:38,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.333333333333332) internal successors, (58), 3 states have internal predecessors, (58), 2 states have call successors, (21), 2 states have call predecessors, (21), 2 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-14 04:52:38,742 INFO L276 IsEmpty]: Start isEmpty. Operand 10542 states and 14863 transitions. [2022-07-14 04:52:38,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2022-07-14 04:52:38,805 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:52:38,806 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-14 04:52:38,842 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-14 04:52:39,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-07-14 04:52:39,006 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-14 04:52:39,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:52:39,007 INFO L85 PathProgramCache]: Analyzing trace with hash -2455789, now seen corresponding path program 1 times [2022-07-14 04:52:39,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:52:39,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524471818] [2022-07-14 04:52:39,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:52:39,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:52:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:39,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:52:39,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:39,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:52:39,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:39,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:52:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:39,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 04:52:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:39,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 04:52:39,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:39,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:52:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:39,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:39,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:39,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 04:52:39,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:39,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 04:52:39,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:39,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 04:52:39,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:39,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-14 04:52:39,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:39,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-14 04:52:39,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:39,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:52:39,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:39,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:52:39,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:39,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:52:39,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:39,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-14 04:52:39,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:39,249 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:52:39,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:52:39,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524471818] [2022-07-14 04:52:39,249 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524471818] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:52:39,249 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:52:39,249 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:52:39,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419363793] [2022-07-14 04:52:39,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:52:39,251 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:52:39,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:52:39,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:52:39,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:52:39,252 INFO L87 Difference]: Start difference. First operand 10542 states and 14863 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-14 04:52:45,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:52:45,382 INFO L93 Difference]: Finished difference Result 10542 states and 14863 transitions. [2022-07-14 04:52:45,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:52:45,383 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 110 [2022-07-14 04:52:45,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:52:45,416 INFO L225 Difference]: With dead ends: 10542 [2022-07-14 04:52:45,416 INFO L226 Difference]: Without dead ends: 10540 [2022-07-14 04:52:45,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:52:45,424 INFO L413 NwaCegarLoop]: 3075 mSDtfsCounter, 5491 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3683 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5707 SdHoareTripleChecker+Valid, 5031 SdHoareTripleChecker+Invalid, 6965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3282 IncrementalHoareTripleChecker+Valid, 3683 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.6s IncrementalHoareTripleChecker+Time [2022-07-14 04:52:45,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5707 Valid, 5031 Invalid, 6965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3282 Valid, 3683 Invalid, 0 Unknown, 0 Unchecked, 5.6s Time] [2022-07-14 04:52:45,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10540 states. [2022-07-14 04:52:45,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10540 to 10540. [2022-07-14 04:52:45,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10540 states, 6968 states have (on average 1.272675086107922) internal successors, (8868), 7217 states have internal predecessors, (8868), 2842 states have call successors, (2842), 711 states have call predecessors, (2842), 713 states have return successors, (3151), 2744 states have call predecessors, (3151), 2840 states have call successors, (3151) [2022-07-14 04:52:45,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10540 states to 10540 states and 14861 transitions. [2022-07-14 04:52:45,878 INFO L78 Accepts]: Start accepts. Automaton has 10540 states and 14861 transitions. Word has length 110 [2022-07-14 04:52:45,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:52:45,879 INFO L495 AbstractCegarLoop]: Abstraction has 10540 states and 14861 transitions. [2022-07-14 04:52:45,879 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-14 04:52:45,879 INFO L276 IsEmpty]: Start isEmpty. Operand 10540 states and 14861 transitions. [2022-07-14 04:52:45,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2022-07-14 04:52:45,881 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:52:45,881 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-14 04:52:45,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 04:52:45,881 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-14 04:52:45,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:52:45,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1227318538, now seen corresponding path program 1 times [2022-07-14 04:52:45,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:52:45,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263268151] [2022-07-14 04:52:45,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:52:45,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:52:45,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:45,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:52:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:45,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:52:45,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:45,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:52:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:45,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 04:52:45,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:45,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 04:52:45,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:45,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:52:45,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:45,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:46,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:46,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 04:52:46,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:46,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 04:52:46,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:46,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 04:52:46,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:46,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-14 04:52:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:46,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-14 04:52:46,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:46,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:52:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:46,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:52:46,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:46,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:52:46,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:46,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-14 04:52:46,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:46,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-14 04:52:46,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:46,052 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:52:46,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:52:46,053 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263268151] [2022-07-14 04:52:46,053 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263268151] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:52:46,053 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:52:46,053 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:52:46,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1679356240] [2022-07-14 04:52:46,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:52:46,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:52:46,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:52:46,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:52:46,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:52:46,054 INFO L87 Difference]: Start difference. First operand 10540 states and 14861 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-14 04:52:51,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:52:51,113 INFO L93 Difference]: Finished difference Result 10540 states and 14861 transitions. [2022-07-14 04:52:51,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:52:51,115 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 116 [2022-07-14 04:52:51,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:52:51,146 INFO L225 Difference]: With dead ends: 10540 [2022-07-14 04:52:51,146 INFO L226 Difference]: Without dead ends: 10538 [2022-07-14 04:52:51,152 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:52:51,152 INFO L413 NwaCegarLoop]: 3073 mSDtfsCounter, 5487 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3681 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5702 SdHoareTripleChecker+Valid, 5029 SdHoareTripleChecker+Invalid, 6963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3282 IncrementalHoareTripleChecker+Valid, 3681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-07-14 04:52:51,152 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5702 Valid, 5029 Invalid, 6963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3282 Valid, 3681 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-07-14 04:52:51,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10538 states. [2022-07-14 04:52:51,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10538 to 10538. [2022-07-14 04:52:51,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10538 states, 6967 states have (on average 1.2725706903975886) internal successors, (8866), 7215 states have internal predecessors, (8866), 2842 states have call successors, (2842), 711 states have call predecessors, (2842), 713 states have return successors, (3151), 2744 states have call predecessors, (3151), 2840 states have call successors, (3151) [2022-07-14 04:52:51,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10538 states to 10538 states and 14859 transitions. [2022-07-14 04:52:51,680 INFO L78 Accepts]: Start accepts. Automaton has 10538 states and 14859 transitions. Word has length 116 [2022-07-14 04:52:51,680 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:52:51,680 INFO L495 AbstractCegarLoop]: Abstraction has 10538 states and 14859 transitions. [2022-07-14 04:52:51,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-14 04:52:51,680 INFO L276 IsEmpty]: Start isEmpty. Operand 10538 states and 14859 transitions. [2022-07-14 04:52:51,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-14 04:52:51,682 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:52:51,682 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:52:51,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-14 04:52:51,683 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-14 04:52:51,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:52:51,684 INFO L85 PathProgramCache]: Analyzing trace with hash 1970825439, now seen corresponding path program 1 times [2022-07-14 04:52:51,684 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:52:51,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024705121] [2022-07-14 04:52:51,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:52:51,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:52:51,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:52:51,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:52:51,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:52:51,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 04:52:51,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 04:52:51,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:52:51,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:51,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 04:52:51,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 04:52:51,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:51,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-14 04:52:51,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:52,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-14 04:52:52,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:52,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:52,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:52,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:52:52,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:52,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:52:52,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:52,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-14 04:52:52,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:52,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2022-07-14 04:52:52,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:52,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-14 04:52:52,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:52,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-14 04:52:52,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:52,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-14 04:52:52,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:52,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-14 04:52:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:52,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-14 04:52:52,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:52,046 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2022-07-14 04:52:52,047 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:52:52,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024705121] [2022-07-14 04:52:52,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024705121] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:52:52,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [324666781] [2022-07-14 04:52:52,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:52:52,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:52:52,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:52:52,048 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 04:52:52,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-14 04:52:52,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:52,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 2766 conjuncts, 58 conjunts are in the unsatisfiable core [2022-07-14 04:52:52,873 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:52:52,964 INFO L134 CoverageAnalysis]: Checked inductivity of 84 backedges. 59 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2022-07-14 04:52:52,965 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 04:52:52,965 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [324666781] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:52:52,965 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 04:52:52,965 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [17] total 19 [2022-07-14 04:52:52,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55391652] [2022-07-14 04:52:52,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:52:52,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-14 04:52:52,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:52:52,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-14 04:52:52,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=305, Unknown=0, NotChecked=0, Total=342 [2022-07-14 04:52:52,968 INFO L87 Difference]: Start difference. First operand 10538 states and 14859 transitions. Second operand has 14 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 6 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) [2022-07-14 04:52:53,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:52:53,862 INFO L93 Difference]: Finished difference Result 20562 states and 28906 transitions. [2022-07-14 04:52:53,862 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-14 04:52:53,863 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 6 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) Word has length 135 [2022-07-14 04:52:53,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:52:53,902 INFO L225 Difference]: With dead ends: 20562 [2022-07-14 04:52:53,902 INFO L226 Difference]: Without dead ends: 10591 [2022-07-14 04:52:53,940 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=102, Invalid=600, Unknown=0, NotChecked=0, Total=702 [2022-07-14 04:52:53,940 INFO L413 NwaCegarLoop]: 3530 mSDtfsCounter, 45 mSDsluCounter, 42095 mSDsCounter, 0 mSdLazyCounter, 626 mSolverCounterSat, 171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 45625 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 171 IncrementalHoareTripleChecker+Valid, 626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-14 04:52:53,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 45625 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [171 Valid, 626 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-14 04:52:53,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10591 states. [2022-07-14 04:52:54,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10591 to 10562. [2022-07-14 04:52:54,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10562 states, 6983 states have (on average 1.2719461549477302) internal successors, (8882), 7231 states have internal predecessors, (8882), 2850 states have call successors, (2850), 711 states have call predecessors, (2850), 713 states have return successors, (3159), 2752 states have call predecessors, (3159), 2848 states have call successors, (3159) [2022-07-14 04:52:54,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10562 states to 10562 states and 14891 transitions. [2022-07-14 04:52:54,432 INFO L78 Accepts]: Start accepts. Automaton has 10562 states and 14891 transitions. Word has length 135 [2022-07-14 04:52:54,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:52:54,432 INFO L495 AbstractCegarLoop]: Abstraction has 10562 states and 14891 transitions. [2022-07-14 04:52:54,432 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 5.846153846153846) internal successors, (76), 13 states have internal predecessors, (76), 6 states have call successors, (25), 2 states have call predecessors, (25), 4 states have return successors, (21), 6 states have call predecessors, (21), 6 states have call successors, (21) [2022-07-14 04:52:54,432 INFO L276 IsEmpty]: Start isEmpty. Operand 10562 states and 14891 transitions. [2022-07-14 04:52:54,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-07-14 04:52:54,433 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:52:54,434 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-14 04:52:54,455 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-14 04:52:54,655 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-07-14 04:52:54,656 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-14 04:52:54,656 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:52:54,656 INFO L85 PathProgramCache]: Analyzing trace with hash 1099724524, now seen corresponding path program 1 times [2022-07-14 04:52:54,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:52:54,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994938840] [2022-07-14 04:52:54,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:52:54,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:52:54,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:54,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:52:54,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:54,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:52:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:54,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:52:54,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:54,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 04:52:54,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:54,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 04:52:54,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:54,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:52:54,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:54,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:52:54,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:54,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 04:52:54,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:54,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 04:52:54,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:54,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 04:52:54,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:54,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-14 04:52:54,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:54,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-14 04:52:54,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:54,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:52:54,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:54,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:52:54,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:54,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:52:54,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:54,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-14 04:52:54,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:54,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-14 04:52:54,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:54,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-14 04:52:54,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:52:54,917 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:52:54,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:52:54,918 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994938840] [2022-07-14 04:52:54,918 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994938840] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:52:54,918 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:52:54,918 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:52:54,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960932785] [2022-07-14 04:52:54,918 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:52:54,919 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:52:54,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:52:54,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:52:54,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:52:54,919 INFO L87 Difference]: Start difference. First operand 10562 states and 14891 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-14 04:53:00,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:53:00,327 INFO L93 Difference]: Finished difference Result 10562 states and 14891 transitions. [2022-07-14 04:53:00,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:53:00,328 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 122 [2022-07-14 04:53:00,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:53:00,359 INFO L225 Difference]: With dead ends: 10562 [2022-07-14 04:53:00,360 INFO L226 Difference]: Without dead ends: 10560 [2022-07-14 04:53:00,365 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:53:00,366 INFO L413 NwaCegarLoop]: 3071 mSDtfsCounter, 5481 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3679 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5695 SdHoareTripleChecker+Valid, 5027 SdHoareTripleChecker+Invalid, 6961 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3282 IncrementalHoareTripleChecker+Valid, 3679 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-07-14 04:53:00,366 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5695 Valid, 5027 Invalid, 6961 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3282 Valid, 3679 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-07-14 04:53:00,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10560 states. [2022-07-14 04:53:00,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10560 to 10560. [2022-07-14 04:53:00,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10560 states, 6982 states have (on average 1.2718418791177313) internal successors, (8880), 7229 states have internal predecessors, (8880), 2850 states have call successors, (2850), 711 states have call predecessors, (2850), 713 states have return successors, (3159), 2752 states have call predecessors, (3159), 2848 states have call successors, (3159) [2022-07-14 04:53:00,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10560 states to 10560 states and 14889 transitions. [2022-07-14 04:53:00,760 INFO L78 Accepts]: Start accepts. Automaton has 10560 states and 14889 transitions. Word has length 122 [2022-07-14 04:53:00,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:53:00,760 INFO L495 AbstractCegarLoop]: Abstraction has 10560 states and 14889 transitions. [2022-07-14 04:53:00,760 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-14 04:53:00,760 INFO L276 IsEmpty]: Start isEmpty. Operand 10560 states and 14889 transitions. [2022-07-14 04:53:00,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2022-07-14 04:53:00,762 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:53:00,762 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-14 04:53:00,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-14 04:53:00,762 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-14 04:53:00,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:53:00,763 INFO L85 PathProgramCache]: Analyzing trace with hash -894151915, now seen corresponding path program 1 times [2022-07-14 04:53:00,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:53:00,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1946937009] [2022-07-14 04:53:00,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:53:00,763 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:53:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:00,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:53:00,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:00,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:53:00,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:00,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:53:00,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:00,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 04:53:00,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:00,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 04:53:00,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:00,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:53:00,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:00,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:53:00,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:00,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 04:53:00,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:00,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 04:53:00,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:00,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 04:53:00,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:00,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-14 04:53:00,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:00,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-14 04:53:00,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:00,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:53:00,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:00,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:53:00,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:00,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:53:00,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:01,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-14 04:53:01,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:01,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-14 04:53:01,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:01,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-14 04:53:01,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:01,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-14 04:53:01,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:01,016 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:53:01,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:53:01,016 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1946937009] [2022-07-14 04:53:01,016 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1946937009] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:53:01,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:53:01,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:53:01,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337114442] [2022-07-14 04:53:01,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:53:01,018 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:53:01,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:53:01,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:53:01,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:53:01,018 INFO L87 Difference]: Start difference. First operand 10560 states and 14889 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-14 04:53:06,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:53:06,631 INFO L93 Difference]: Finished difference Result 10560 states and 14889 transitions. [2022-07-14 04:53:06,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:53:06,633 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 128 [2022-07-14 04:53:06,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:53:06,735 INFO L225 Difference]: With dead ends: 10560 [2022-07-14 04:53:06,735 INFO L226 Difference]: Without dead ends: 10558 [2022-07-14 04:53:06,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:53:06,740 INFO L413 NwaCegarLoop]: 3069 mSDtfsCounter, 5475 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3677 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5688 SdHoareTripleChecker+Valid, 5025 SdHoareTripleChecker+Invalid, 6959 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3282 IncrementalHoareTripleChecker+Valid, 3677 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:53:06,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5688 Valid, 5025 Invalid, 6959 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3282 Valid, 3677 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-07-14 04:53:06,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10558 states. [2022-07-14 04:53:07,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10558 to 10558. [2022-07-14 04:53:07,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10558 states, 6981 states have (on average 1.271737573413551) internal successors, (8878), 7227 states have internal predecessors, (8878), 2850 states have call successors, (2850), 711 states have call predecessors, (2850), 713 states have return successors, (3159), 2752 states have call predecessors, (3159), 2848 states have call successors, (3159) [2022-07-14 04:53:07,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10558 states to 10558 states and 14887 transitions. [2022-07-14 04:53:07,198 INFO L78 Accepts]: Start accepts. Automaton has 10558 states and 14887 transitions. Word has length 128 [2022-07-14 04:53:07,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:53:07,199 INFO L495 AbstractCegarLoop]: Abstraction has 10558 states and 14887 transitions. [2022-07-14 04:53:07,199 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-14 04:53:07,200 INFO L276 IsEmpty]: Start isEmpty. Operand 10558 states and 14887 transitions. [2022-07-14 04:53:07,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-07-14 04:53:07,207 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:53:07,208 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-14 04:53:07,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-14 04:53:07,209 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-14 04:53:07,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:53:07,209 INFO L85 PathProgramCache]: Analyzing trace with hash 150555854, now seen corresponding path program 1 times [2022-07-14 04:53:07,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:53:07,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899106622] [2022-07-14 04:53:07,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:53:07,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:53:07,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:07,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:53:07,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:07,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:53:07,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:07,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:53:07,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:07,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 04:53:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:07,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 04:53:07,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:07,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:53:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:07,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:53:07,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:07,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 04:53:07,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:07,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 04:53:07,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:07,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 04:53:07,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:07,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-14 04:53:07,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:07,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-14 04:53:07,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:07,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:53:07,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:07,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:53:07,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:07,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:53:07,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:07,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-14 04:53:07,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:07,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-14 04:53:07,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:07,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-14 04:53:07,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:07,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-14 04:53:07,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:07,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-14 04:53:07,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:07,460 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:53:07,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:53:07,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899106622] [2022-07-14 04:53:07,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899106622] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:53:07,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:53:07,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:53:07,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80458937] [2022-07-14 04:53:07,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:53:07,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:53:07,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:53:07,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:53:07,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:53:07,463 INFO L87 Difference]: Start difference. First operand 10558 states and 14887 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-14 04:53:12,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:53:12,884 INFO L93 Difference]: Finished difference Result 10558 states and 14887 transitions. [2022-07-14 04:53:12,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:53:12,886 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 134 [2022-07-14 04:53:12,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:53:12,924 INFO L225 Difference]: With dead ends: 10558 [2022-07-14 04:53:12,924 INFO L226 Difference]: Without dead ends: 10556 [2022-07-14 04:53:12,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:53:12,934 INFO L413 NwaCegarLoop]: 3067 mSDtfsCounter, 5469 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3675 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5681 SdHoareTripleChecker+Valid, 5023 SdHoareTripleChecker+Invalid, 6957 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3282 IncrementalHoareTripleChecker+Valid, 3675 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-07-14 04:53:12,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5681 Valid, 5023 Invalid, 6957 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3282 Valid, 3675 Invalid, 0 Unknown, 0 Unchecked, 4.9s Time] [2022-07-14 04:53:12,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10556 states. [2022-07-14 04:53:13,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10556 to 10556. [2022-07-14 04:53:13,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10556 states, 6980 states have (on average 1.2716332378223496) internal successors, (8876), 7225 states have internal predecessors, (8876), 2850 states have call successors, (2850), 711 states have call predecessors, (2850), 713 states have return successors, (3159), 2752 states have call predecessors, (3159), 2848 states have call successors, (3159) [2022-07-14 04:53:13,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10556 states to 10556 states and 14885 transitions. [2022-07-14 04:53:13,468 INFO L78 Accepts]: Start accepts. Automaton has 10556 states and 14885 transitions. Word has length 134 [2022-07-14 04:53:13,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:53:13,468 INFO L495 AbstractCegarLoop]: Abstraction has 10556 states and 14885 transitions. [2022-07-14 04:53:13,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-14 04:53:13,468 INFO L276 IsEmpty]: Start isEmpty. Operand 10556 states and 14885 transitions. [2022-07-14 04:53:13,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-14 04:53:13,470 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:53:13,471 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:53:13,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-14 04:53:13,471 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-14 04:53:13,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:53:13,471 INFO L85 PathProgramCache]: Analyzing trace with hash -931896786, now seen corresponding path program 1 times [2022-07-14 04:53:13,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:53:13,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462879667] [2022-07-14 04:53:13,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:53:13,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:53:13,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:13,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:53:13,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:13,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:53:13,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:13,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:53:13,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:13,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-07-14 04:53:13,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:13,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:53:13,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:13,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:53:13,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:13,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2022-07-14 04:53:13,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:13,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-07-14 04:53:13,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:13,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:53:13,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:13,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-14 04:53:13,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:13,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-14 04:53:13,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:13,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-07-14 04:53:13,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:13,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-07-14 04:53:13,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:13,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:53:13,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:13,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:53:13,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:13,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:53:13,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:13,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-14 04:53:13,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:13,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2022-07-14 04:53:13,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:13,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-14 04:53:13,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:13,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-14 04:53:13,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:13,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-14 04:53:13,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:13,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 04:53:13,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:13,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-14 04:53:13,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:13,748 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 102 trivial. 0 not checked. [2022-07-14 04:53:13,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:53:13,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462879667] [2022-07-14 04:53:13,748 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462879667] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-14 04:53:13,748 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1666829971] [2022-07-14 04:53:13,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:53:13,748 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:53:13,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:53:13,750 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-14 04:53:13,750 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-14 04:53:14,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:14,459 INFO L263 TraceCheckSpWp]: Trace formula consists of 2868 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-14 04:53:14,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-14 04:53:14,498 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 55 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2022-07-14 04:53:14,499 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-14 04:53:14,499 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1666829971] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:53:14,499 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-14 04:53:14,499 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 12 [2022-07-14 04:53:14,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1291683534] [2022-07-14 04:53:14,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:53:14,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 04:53:14,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:53:14,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 04:53:14,502 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-14 04:53:14,502 INFO L87 Difference]: Start difference. First operand 10556 states and 14885 transitions. Second operand has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 2 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-14 04:53:15,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:53:15,268 INFO L93 Difference]: Finished difference Result 21742 states and 30764 transitions. [2022-07-14 04:53:15,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-14 04:53:15,344 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 2 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) Word has length 151 [2022-07-14 04:53:15,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:53:15,376 INFO L225 Difference]: With dead ends: 21742 [2022-07-14 04:53:15,376 INFO L226 Difference]: Without dead ends: 11376 [2022-07-14 04:53:15,402 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 209 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=219, Unknown=0, NotChecked=0, Total=272 [2022-07-14 04:53:15,402 INFO L413 NwaCegarLoop]: 3928 mSDtfsCounter, 401 mSDsluCounter, 26985 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 122 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 553 SdHoareTripleChecker+Valid, 30913 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 122 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-14 04:53:15,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [553 Valid, 30913 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [122 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-07-14 04:53:15,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11376 states. [2022-07-14 04:53:15,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11376 to 10560. [2022-07-14 04:53:15,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10560 states, 6984 states have (on average 1.2714776632302405) internal successors, (8880), 7229 states have internal predecessors, (8880), 2850 states have call successors, (2850), 711 states have call predecessors, (2850), 713 states have return successors, (3159), 2752 states have call predecessors, (3159), 2848 states have call successors, (3159) [2022-07-14 04:53:15,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10560 states to 10560 states and 14889 transitions. [2022-07-14 04:53:15,917 INFO L78 Accepts]: Start accepts. Automaton has 10560 states and 14889 transitions. Word has length 151 [2022-07-14 04:53:15,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:53:15,918 INFO L495 AbstractCegarLoop]: Abstraction has 10560 states and 14889 transitions. [2022-07-14 04:53:15,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.777777777777779) internal successors, (79), 8 states have internal predecessors, (79), 2 states have call successors, (27), 2 states have call predecessors, (27), 3 states have return successors, (23), 3 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-14 04:53:15,918 INFO L276 IsEmpty]: Start isEmpty. Operand 10560 states and 14889 transitions. [2022-07-14 04:53:15,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-07-14 04:53:15,919 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:53:15,919 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-14 04:53:15,941 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-14 04:53:16,120 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-14 04:53:16,120 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-14 04:53:16,120 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:53:16,120 INFO L85 PathProgramCache]: Analyzing trace with hash 2137124343, now seen corresponding path program 1 times [2022-07-14 04:53:16,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:53:16,120 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994747740] [2022-07-14 04:53:16,121 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:53:16,121 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:53:16,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:16,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:53:16,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:16,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:53:16,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:16,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:53:16,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:16,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 04:53:16,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:16,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 04:53:16,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:16,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:53:16,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:16,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:53:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:16,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 04:53:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:16,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 04:53:16,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:16,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 04:53:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:16,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-14 04:53:16,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:16,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-14 04:53:16,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:16,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:53:16,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:16,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:53:16,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:16,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:53:16,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:16,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-14 04:53:16,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:16,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-14 04:53:16,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:16,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-14 04:53:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:16,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-14 04:53:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:16,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-14 04:53:16,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:16,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 04:53:16,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:16,333 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:53:16,333 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:53:16,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994747740] [2022-07-14 04:53:16,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1994747740] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:53:16,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:53:16,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:53:16,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282176926] [2022-07-14 04:53:16,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:53:16,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:53:16,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:53:16,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:53:16,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:53:16,335 INFO L87 Difference]: Start difference. First operand 10560 states and 14889 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-14 04:53:21,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:53:21,677 INFO L93 Difference]: Finished difference Result 10560 states and 14889 transitions. [2022-07-14 04:53:21,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:53:21,680 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 140 [2022-07-14 04:53:21,680 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:53:21,711 INFO L225 Difference]: With dead ends: 10560 [2022-07-14 04:53:21,711 INFO L226 Difference]: Without dead ends: 10558 [2022-07-14 04:53:21,718 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:53:21,718 INFO L413 NwaCegarLoop]: 3065 mSDtfsCounter, 5463 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3673 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5674 SdHoareTripleChecker+Valid, 5021 SdHoareTripleChecker+Invalid, 6955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3282 IncrementalHoareTripleChecker+Valid, 3673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.8s IncrementalHoareTripleChecker+Time [2022-07-14 04:53:21,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5674 Valid, 5021 Invalid, 6955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3282 Valid, 3673 Invalid, 0 Unknown, 0 Unchecked, 4.8s Time] [2022-07-14 04:53:21,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10558 states. [2022-07-14 04:53:22,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10558 to 10558. [2022-07-14 04:53:22,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10558 states, 6983 states have (on average 1.2713733352427323) internal successors, (8878), 7227 states have internal predecessors, (8878), 2850 states have call successors, (2850), 711 states have call predecessors, (2850), 713 states have return successors, (3159), 2752 states have call predecessors, (3159), 2848 states have call successors, (3159) [2022-07-14 04:53:22,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10558 states to 10558 states and 14887 transitions. [2022-07-14 04:53:22,207 INFO L78 Accepts]: Start accepts. Automaton has 10558 states and 14887 transitions. Word has length 140 [2022-07-14 04:53:22,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:53:22,207 INFO L495 AbstractCegarLoop]: Abstraction has 10558 states and 14887 transitions. [2022-07-14 04:53:22,208 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-14 04:53:22,208 INFO L276 IsEmpty]: Start isEmpty. Operand 10558 states and 14887 transitions. [2022-07-14 04:53:22,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2022-07-14 04:53:22,209 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:53:22,209 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-14 04:53:22,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-14 04:53:22,210 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-14 04:53:22,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:53:22,210 INFO L85 PathProgramCache]: Analyzing trace with hash -938020630, now seen corresponding path program 1 times [2022-07-14 04:53:22,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:53:22,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1599028082] [2022-07-14 04:53:22,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:53:22,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:53:22,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:22,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:53:22,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:22,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:53:22,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:22,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:53:22,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:22,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 04:53:22,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:22,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 04:53:22,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:22,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:53:22,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:22,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:53:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:22,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 04:53:22,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:22,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 04:53:22,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:22,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 04:53:22,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:22,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-14 04:53:22,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:22,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-14 04:53:22,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:22,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:53:22,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:22,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:53:22,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:22,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:53:22,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:22,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-14 04:53:22,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:22,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-14 04:53:22,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:22,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-14 04:53:22,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:22,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-14 04:53:22,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:22,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-14 04:53:22,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:22,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 04:53:22,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:22,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-14 04:53:22,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:22,391 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:53:22,391 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:53:22,391 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1599028082] [2022-07-14 04:53:22,391 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1599028082] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:53:22,392 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:53:22,392 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:53:22,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987647406] [2022-07-14 04:53:22,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:53:22,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:53:22,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:53:22,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:53:22,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:53:22,393 INFO L87 Difference]: Start difference. First operand 10558 states and 14887 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-14 04:53:28,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:53:28,194 INFO L93 Difference]: Finished difference Result 10558 states and 14887 transitions. [2022-07-14 04:53:28,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:53:28,195 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 146 [2022-07-14 04:53:28,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:53:28,230 INFO L225 Difference]: With dead ends: 10558 [2022-07-14 04:53:28,230 INFO L226 Difference]: Without dead ends: 10556 [2022-07-14 04:53:28,236 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:53:28,237 INFO L413 NwaCegarLoop]: 3063 mSDtfsCounter, 5457 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3671 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5667 SdHoareTripleChecker+Valid, 5019 SdHoareTripleChecker+Invalid, 6953 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3282 IncrementalHoareTripleChecker+Valid, 3671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-07-14 04:53:28,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5667 Valid, 5019 Invalid, 6953 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3282 Valid, 3671 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-07-14 04:53:28,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10556 states. [2022-07-14 04:53:28,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10556 to 10556. [2022-07-14 04:53:28,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10556 states, 6982 states have (on average 1.271268977370381) internal successors, (8876), 7225 states have internal predecessors, (8876), 2850 states have call successors, (2850), 711 states have call predecessors, (2850), 713 states have return successors, (3159), 2752 states have call predecessors, (3159), 2848 states have call successors, (3159) [2022-07-14 04:53:28,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10556 states to 10556 states and 14885 transitions. [2022-07-14 04:53:28,742 INFO L78 Accepts]: Start accepts. Automaton has 10556 states and 14885 transitions. Word has length 146 [2022-07-14 04:53:28,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:53:28,742 INFO L495 AbstractCegarLoop]: Abstraction has 10556 states and 14885 transitions. [2022-07-14 04:53:28,742 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-14 04:53:28,743 INFO L276 IsEmpty]: Start isEmpty. Operand 10556 states and 14885 transitions. [2022-07-14 04:53:28,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2022-07-14 04:53:28,744 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:53:28,744 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-14 04:53:28,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-14 04:53:28,745 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-14 04:53:28,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:53:28,745 INFO L85 PathProgramCache]: Analyzing trace with hash 1073850845, now seen corresponding path program 1 times [2022-07-14 04:53:28,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:53:28,745 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821460463] [2022-07-14 04:53:28,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:53:28,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:53:28,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:28,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:53:28,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:28,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:53:28,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:28,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:53:28,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:28,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 04:53:28,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:28,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 04:53:28,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:28,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:53:28,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:28,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:53:28,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:28,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 04:53:28,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:28,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 04:53:28,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:28,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 04:53:28,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:28,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-14 04:53:28,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:28,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-14 04:53:28,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:28,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:53:28,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:28,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:53:28,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:28,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:53:28,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:28,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-14 04:53:28,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:28,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-14 04:53:28,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:28,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-14 04:53:28,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:28,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-14 04:53:28,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:28,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-14 04:53:28,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:28,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 04:53:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:28,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-14 04:53:28,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:28,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-14 04:53:28,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:28,902 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:53:28,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:53:28,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821460463] [2022-07-14 04:53:28,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [821460463] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:53:28,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:53:28,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:53:28,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1512078317] [2022-07-14 04:53:28,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:53:28,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:53:28,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:53:28,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:53:28,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:53:28,904 INFO L87 Difference]: Start difference. First operand 10556 states and 14885 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-14 04:53:34,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:53:34,636 INFO L93 Difference]: Finished difference Result 10556 states and 14885 transitions. [2022-07-14 04:53:34,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:53:34,637 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 152 [2022-07-14 04:53:34,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:53:34,667 INFO L225 Difference]: With dead ends: 10556 [2022-07-14 04:53:34,668 INFO L226 Difference]: Without dead ends: 10554 [2022-07-14 04:53:34,674 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-07-14 04:53:34,675 INFO L413 NwaCegarLoop]: 3061 mSDtfsCounter, 5451 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3669 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5660 SdHoareTripleChecker+Valid, 5017 SdHoareTripleChecker+Invalid, 6951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3282 IncrementalHoareTripleChecker+Valid, 3669 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-07-14 04:53:34,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5660 Valid, 5017 Invalid, 6951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3282 Valid, 3669 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-07-14 04:53:34,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10554 states. [2022-07-14 04:53:35,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10554 to 10554. [2022-07-14 04:53:35,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10554 states, 6981 states have (on average 1.2711645896003438) internal successors, (8874), 7223 states have internal predecessors, (8874), 2850 states have call successors, (2850), 711 states have call predecessors, (2850), 713 states have return successors, (3159), 2752 states have call predecessors, (3159), 2848 states have call successors, (3159) [2022-07-14 04:53:35,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10554 states to 10554 states and 14883 transitions. [2022-07-14 04:53:35,172 INFO L78 Accepts]: Start accepts. Automaton has 10554 states and 14883 transitions. Word has length 152 [2022-07-14 04:53:35,172 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:53:35,172 INFO L495 AbstractCegarLoop]: Abstraction has 10554 states and 14883 transitions. [2022-07-14 04:53:35,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-14 04:53:35,172 INFO L276 IsEmpty]: Start isEmpty. Operand 10554 states and 14883 transitions. [2022-07-14 04:53:35,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-07-14 04:53:35,174 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:53:35,174 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:53:35,174 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-14 04:53:35,175 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-14 04:53:35,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:53:35,175 INFO L85 PathProgramCache]: Analyzing trace with hash -242444843, now seen corresponding path program 1 times [2022-07-14 04:53:35,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:53:35,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486068719] [2022-07-14 04:53:35,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:53:35,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:53:35,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:35,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:53:35,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:35,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:53:35,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:35,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:53:35,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:35,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:53:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:35,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:53:35,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:35,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:53:35,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:35,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:53:35,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:35,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:53:35,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:35,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:53:35,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:35,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:53:35,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:35,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:53:35,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:35,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-14 04:53:35,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:35,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:53:35,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:35,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:53:35,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:35,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:53:35,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:35,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:53:35,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:35,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:53:35,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:35,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:53:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:35,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-14 04:53:35,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:35,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-14 04:53:35,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:35,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:53:35,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:35,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 04:53:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:35,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-14 04:53:35,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:35,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:53:35,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:35,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-14 04:53:35,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:35,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:53:35,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:35,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:53:35,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:35,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-14 04:53:35,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:35,428 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2022-07-14 04:53:35,428 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:53:35,428 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486068719] [2022-07-14 04:53:35,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1486068719] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:53:35,428 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:53:35,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 04:53:35,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1479347479] [2022-07-14 04:53:35,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:53:35,429 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 04:53:35,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:53:35,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 04:53:35,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-14 04:53:35,430 INFO L87 Difference]: Start difference. First operand 10554 states and 14883 transitions. Second operand has 8 states, 8 states have (on average 9.625) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (24), 6 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-14 04:53:47,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:53:47,047 INFO L93 Difference]: Finished difference Result 22631 states and 33041 transitions. [2022-07-14 04:53:47,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 04:53:47,049 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (24), 6 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 176 [2022-07-14 04:53:47,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:53:47,091 INFO L225 Difference]: With dead ends: 22631 [2022-07-14 04:53:47,091 INFO L226 Difference]: Without dead ends: 12102 [2022-07-14 04:53:47,117 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-07-14 04:53:47,118 INFO L413 NwaCegarLoop]: 2958 mSDtfsCounter, 4582 mSDsluCounter, 3797 mSDsCounter, 0 mSdLazyCounter, 9998 mSolverCounterSat, 4159 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4582 SdHoareTripleChecker+Valid, 6755 SdHoareTripleChecker+Invalid, 14157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4159 IncrementalHoareTripleChecker+Valid, 9998 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2022-07-14 04:53:47,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4582 Valid, 6755 Invalid, 14157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4159 Valid, 9998 Invalid, 0 Unknown, 0 Unchecked, 10.6s Time] [2022-07-14 04:53:47,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12102 states. [2022-07-14 04:53:47,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12102 to 10838. [2022-07-14 04:53:47,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10838 states, 7185 states have (on average 1.2707028531663187) internal successors, (9130), 7439 states have internal predecessors, (9130), 2906 states have call successors, (2906), 711 states have call predecessors, (2906), 737 states have return successors, (3545), 2820 states have call predecessors, (3545), 2904 states have call successors, (3545) [2022-07-14 04:53:47,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10838 states to 10838 states and 15581 transitions. [2022-07-14 04:53:47,699 INFO L78 Accepts]: Start accepts. Automaton has 10838 states and 15581 transitions. Word has length 176 [2022-07-14 04:53:47,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:53:47,699 INFO L495 AbstractCegarLoop]: Abstraction has 10838 states and 15581 transitions. [2022-07-14 04:53:47,699 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.625) internal successors, (77), 4 states have internal predecessors, (77), 3 states have call successors, (24), 6 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-14 04:53:47,700 INFO L276 IsEmpty]: Start isEmpty. Operand 10838 states and 15581 transitions. [2022-07-14 04:53:47,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-07-14 04:53:47,701 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:53:47,701 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:53:47,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-14 04:53:47,702 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_linux_arch_io_io_mem_unmapErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-14 04:53:47,702 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:53:47,702 INFO L85 PathProgramCache]: Analyzing trace with hash 573026121, now seen corresponding path program 1 times [2022-07-14 04:53:47,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:53:47,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830925086] [2022-07-14 04:53:47,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:53:47,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:53:47,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:47,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:53:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:47,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:53:47,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:47,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:53:47,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:47,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-07-14 04:53:47,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:47,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:53:47,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:47,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:53:47,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:47,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:53:47,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:47,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:53:47,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:47,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:53:47,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:47,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:53:47,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:47,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:53:47,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:47,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-07-14 04:53:47,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:47,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:53:47,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:47,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:53:47,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:47,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:53:47,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:47,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:53:47,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:47,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:53:47,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:47,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-14 04:53:47,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:47,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2022-07-14 04:53:47,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:47,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2022-07-14 04:53:47,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:47,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:53:47,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:47,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-07-14 04:53:47,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:47,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-14 04:53:47,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:47,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:53:47,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:47,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 146 [2022-07-14 04:53:47,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:47,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:53:47,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:47,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:53:47,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:47,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 163 [2022-07-14 04:53:47,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:53:47,983 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 163 trivial. 0 not checked. [2022-07-14 04:53:47,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:53:47,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830925086] [2022-07-14 04:53:47,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830925086] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:53:47,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:53:47,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 04:53:47,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368299528] [2022-07-14 04:53:47,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:53:47,984 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 04:53:47,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:53:47,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 04:53:47,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-14 04:53:47,985 INFO L87 Difference]: Start difference. First operand 10838 states and 15581 transitions. Second operand has 8 states, 8 states have (on average 9.75) internal successors, (78), 4 states have internal predecessors, (78), 3 states have call successors, (24), 6 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-14 04:53:59,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:53:59,959 INFO L93 Difference]: Finished difference Result 23099 states and 34027 transitions. [2022-07-14 04:53:59,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 04:53:59,960 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 4 states have internal predecessors, (78), 3 states have call successors, (24), 6 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 177 [2022-07-14 04:53:59,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:54:00,001 INFO L225 Difference]: With dead ends: 23099 [2022-07-14 04:54:00,001 INFO L226 Difference]: Without dead ends: 12286 [2022-07-14 04:54:00,031 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=56, Invalid=154, Unknown=0, NotChecked=0, Total=210 [2022-07-14 04:54:00,032 INFO L413 NwaCegarLoop]: 2958 mSDtfsCounter, 4579 mSDsluCounter, 3797 mSDsCounter, 0 mSdLazyCounter, 10013 mSolverCounterSat, 4154 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4579 SdHoareTripleChecker+Valid, 6755 SdHoareTripleChecker+Invalid, 14167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4154 IncrementalHoareTripleChecker+Valid, 10013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.9s IncrementalHoareTripleChecker+Time [2022-07-14 04:54:00,032 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4579 Valid, 6755 Invalid, 14167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4154 Valid, 10013 Invalid, 0 Unknown, 0 Unchecked, 10.9s Time] [2022-07-14 04:54:00,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12286 states. [2022-07-14 04:54:00,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12286 to 11030. [2022-07-14 04:54:00,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11030 states, 7337 states have (on average 1.2716369088183181) internal successors, (9330), 7591 states have internal predecessors, (9330), 2946 states have call successors, (2946), 711 states have call predecessors, (2946), 737 states have return successors, (3589), 2860 states have call predecessors, (3589), 2944 states have call successors, (3589) [2022-07-14 04:54:00,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11030 states to 11030 states and 15865 transitions. [2022-07-14 04:54:00,654 INFO L78 Accepts]: Start accepts. Automaton has 11030 states and 15865 transitions. Word has length 177 [2022-07-14 04:54:00,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:54:00,654 INFO L495 AbstractCegarLoop]: Abstraction has 11030 states and 15865 transitions. [2022-07-14 04:54:00,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 9.75) internal successors, (78), 4 states have internal predecessors, (78), 3 states have call successors, (24), 6 states have call predecessors, (24), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-14 04:54:00,654 INFO L276 IsEmpty]: Start isEmpty. Operand 11030 states and 15865 transitions. [2022-07-14 04:54:00,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-07-14 04:54:00,656 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:54:00,656 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-14 04:54:00,656 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-14 04:54:00,656 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-14 04:54:00,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:54:00,657 INFO L85 PathProgramCache]: Analyzing trace with hash -574680277, now seen corresponding path program 1 times [2022-07-14 04:54:00,657 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:54:00,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172125325] [2022-07-14 04:54:00,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:54:00,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:54:00,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:00,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:54:00,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:00,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:54:00,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:00,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:54:00,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:00,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 04:54:00,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:00,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 04:54:00,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:00,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:54:00,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:00,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:54:00,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:00,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 04:54:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:00,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 04:54:00,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:00,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 04:54:00,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:00,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-14 04:54:00,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:00,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-14 04:54:00,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:00,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:54:00,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:00,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:54:00,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:00,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:54:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:00,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-14 04:54:00,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:00,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-14 04:54:00,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:00,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-14 04:54:00,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:00,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-14 04:54:00,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:00,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-14 04:54:00,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:00,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 04:54:00,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:00,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-14 04:54:00,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:00,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-14 04:54:00,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:00,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-14 04:54:00,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:00,913 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:54:00,913 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:54:00,914 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172125325] [2022-07-14 04:54:00,914 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172125325] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:54:00,914 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:54:00,914 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:54:00,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946831288] [2022-07-14 04:54:00,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:54:00,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:54:00,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:54:00,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:54:00,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:54:00,915 INFO L87 Difference]: Start difference. First operand 11030 states and 15865 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-14 04:54:06,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:54:06,593 INFO L93 Difference]: Finished difference Result 11030 states and 15865 transitions. [2022-07-14 04:54:06,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:54:06,595 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 158 [2022-07-14 04:54:06,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:54:06,637 INFO L225 Difference]: With dead ends: 11030 [2022-07-14 04:54:06,638 INFO L226 Difference]: Without dead ends: 11028 [2022-07-14 04:54:06,648 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:54:06,649 INFO L413 NwaCegarLoop]: 3059 mSDtfsCounter, 5445 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3667 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5653 SdHoareTripleChecker+Valid, 5015 SdHoareTripleChecker+Invalid, 6949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3282 IncrementalHoareTripleChecker+Valid, 3667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-07-14 04:54:06,649 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5653 Valid, 5015 Invalid, 6949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3282 Valid, 3667 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-07-14 04:54:06,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11028 states. [2022-07-14 04:54:07,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11028 to 11028. [2022-07-14 04:54:07,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11028 states, 7336 states have (on average 1.271537622682661) internal successors, (9328), 7589 states have internal predecessors, (9328), 2946 states have call successors, (2946), 711 states have call predecessors, (2946), 737 states have return successors, (3589), 2860 states have call predecessors, (3589), 2944 states have call successors, (3589) [2022-07-14 04:54:07,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11028 states to 11028 states and 15863 transitions. [2022-07-14 04:54:07,311 INFO L78 Accepts]: Start accepts. Automaton has 11028 states and 15863 transitions. Word has length 158 [2022-07-14 04:54:07,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:54:07,312 INFO L495 AbstractCegarLoop]: Abstraction has 11028 states and 15863 transitions. [2022-07-14 04:54:07,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-14 04:54:07,312 INFO L276 IsEmpty]: Start isEmpty. Operand 11028 states and 15863 transitions. [2022-07-14 04:54:07,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-07-14 04:54:07,314 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:54:07,314 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1] [2022-07-14 04:54:07,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-14 04:54:07,314 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-14 04:54:07,315 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:54:07,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1649951739, now seen corresponding path program 1 times [2022-07-14 04:54:07,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:54:07,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1571718929] [2022-07-14 04:54:07,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:54:07,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:54:07,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:07,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:54:07,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:07,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:54:07,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:07,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:54:07,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:07,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 04:54:07,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:07,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 04:54:07,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:07,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:54:07,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:07,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:54:07,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:07,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 04:54:07,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:07,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 04:54:07,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:07,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 04:54:07,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:07,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-14 04:54:07,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:07,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-14 04:54:07,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:07,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:54:07,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:07,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:54:07,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:07,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:54:07,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:07,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-14 04:54:07,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:07,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-14 04:54:07,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:07,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-14 04:54:07,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:07,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-14 04:54:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:07,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-14 04:54:07,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:07,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 04:54:07,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:07,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-14 04:54:07,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:07,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-14 04:54:07,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:07,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-14 04:54:07,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:07,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-14 04:54:07,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:07,483 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:54:07,483 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:54:07,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1571718929] [2022-07-14 04:54:07,483 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1571718929] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:54:07,483 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:54:07,483 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:54:07,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752307217] [2022-07-14 04:54:07,484 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:54:07,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:54:07,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:54:07,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:54:07,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:54:07,485 INFO L87 Difference]: Start difference. First operand 11028 states and 15863 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-14 04:54:13,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:54:13,212 INFO L93 Difference]: Finished difference Result 11028 states and 15863 transitions. [2022-07-14 04:54:13,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:54:13,213 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 164 [2022-07-14 04:54:13,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:54:13,247 INFO L225 Difference]: With dead ends: 11028 [2022-07-14 04:54:13,247 INFO L226 Difference]: Without dead ends: 11026 [2022-07-14 04:54:13,254 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-07-14 04:54:13,254 INFO L413 NwaCegarLoop]: 3057 mSDtfsCounter, 5439 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3665 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5646 SdHoareTripleChecker+Valid, 5013 SdHoareTripleChecker+Invalid, 6947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3282 IncrementalHoareTripleChecker+Valid, 3665 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.0s IncrementalHoareTripleChecker+Time [2022-07-14 04:54:13,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5646 Valid, 5013 Invalid, 6947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3282 Valid, 3665 Invalid, 0 Unknown, 0 Unchecked, 5.0s Time] [2022-07-14 04:54:13,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11026 states. [2022-07-14 04:54:13,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11026 to 11026. [2022-07-14 04:54:13,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11026 states, 7335 states have (on average 1.2714383094751194) internal successors, (9326), 7587 states have internal predecessors, (9326), 2946 states have call successors, (2946), 711 states have call predecessors, (2946), 737 states have return successors, (3589), 2860 states have call predecessors, (3589), 2944 states have call successors, (3589) [2022-07-14 04:54:13,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11026 states to 11026 states and 15861 transitions. [2022-07-14 04:54:13,897 INFO L78 Accepts]: Start accepts. Automaton has 11026 states and 15861 transitions. Word has length 164 [2022-07-14 04:54:13,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:54:13,898 INFO L495 AbstractCegarLoop]: Abstraction has 11026 states and 15861 transitions. [2022-07-14 04:54:13,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-14 04:54:13,898 INFO L276 IsEmpty]: Start isEmpty. Operand 11026 states and 15861 transitions. [2022-07-14 04:54:13,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-07-14 04:54:13,900 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:54:13,900 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:54:13,900 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-14 04:54:13,900 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-14 04:54:13,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:54:13,900 INFO L85 PathProgramCache]: Analyzing trace with hash -1855225943, now seen corresponding path program 1 times [2022-07-14 04:54:13,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:54:13,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718137833] [2022-07-14 04:54:13,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:54:13,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:54:13,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:13,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:54:13,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:13,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:54:13,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:13,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:54:13,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:14,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 04:54:14,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:14,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 04:54:14,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:14,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:54:14,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:14,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:54:14,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:14,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 04:54:14,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:14,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 04:54:14,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:14,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 04:54:14,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:14,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-14 04:54:14,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:14,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-14 04:54:14,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:14,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:54:14,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:14,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:54:14,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:14,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:54:14,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:14,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-14 04:54:14,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:14,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-14 04:54:14,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:14,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-14 04:54:14,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:14,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-14 04:54:14,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:14,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-14 04:54:14,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:14,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 04:54:14,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:14,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-14 04:54:14,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:14,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-14 04:54:14,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:14,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-14 04:54:14,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:14,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-14 04:54:14,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:14,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-14 04:54:14,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:14,082 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:54:14,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:54:14,083 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718137833] [2022-07-14 04:54:14,083 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718137833] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:54:14,083 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:54:14,083 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:54:14,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471273035] [2022-07-14 04:54:14,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:54:14,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:54:14,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:54:14,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:54:14,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:54:14,085 INFO L87 Difference]: Start difference. First operand 11026 states and 15861 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-14 04:54:19,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:54:19,911 INFO L93 Difference]: Finished difference Result 11026 states and 15861 transitions. [2022-07-14 04:54:19,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:54:19,912 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 170 [2022-07-14 04:54:19,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:54:19,943 INFO L225 Difference]: With dead ends: 11026 [2022-07-14 04:54:19,944 INFO L226 Difference]: Without dead ends: 11024 [2022-07-14 04:54:19,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:54:19,950 INFO L413 NwaCegarLoop]: 3055 mSDtfsCounter, 5433 mSDsluCounter, 1956 mSDsCounter, 0 mSdLazyCounter, 3663 mSolverCounterSat, 3282 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5639 SdHoareTripleChecker+Valid, 5011 SdHoareTripleChecker+Invalid, 6945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3282 IncrementalHoareTripleChecker+Valid, 3663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:54:19,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5639 Valid, 5011 Invalid, 6945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3282 Valid, 3663 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2022-07-14 04:54:19,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11024 states. [2022-07-14 04:54:20,531 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11024 to 11024. [2022-07-14 04:54:20,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11024 states, 7334 states have (on average 1.2713389691846195) internal successors, (9324), 7585 states have internal predecessors, (9324), 2946 states have call successors, (2946), 711 states have call predecessors, (2946), 737 states have return successors, (3589), 2860 states have call predecessors, (3589), 2944 states have call successors, (3589) [2022-07-14 04:54:20,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11024 states to 11024 states and 15859 transitions. [2022-07-14 04:54:20,581 INFO L78 Accepts]: Start accepts. Automaton has 11024 states and 15859 transitions. Word has length 170 [2022-07-14 04:54:20,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:54:20,581 INFO L495 AbstractCegarLoop]: Abstraction has 11024 states and 15859 transitions. [2022-07-14 04:54:20,581 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-14 04:54:20,581 INFO L276 IsEmpty]: Start isEmpty. Operand 11024 states and 15859 transitions. [2022-07-14 04:54:20,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-07-14 04:54:20,584 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:54:20,584 INFO L195 NwaCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-14 04:54:20,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-14 04:54:20,584 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 26 more)] === [2022-07-14 04:54:20,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:54:20,584 INFO L85 PathProgramCache]: Analyzing trace with hash -1980326328, now seen corresponding path program 1 times [2022-07-14 04:54:20,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:54:20,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602139631] [2022-07-14 04:54:20,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:54:20,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:54:20,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:20,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:54:20,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:20,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-14 04:54:20,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:20,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-14 04:54:20,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:20,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-07-14 04:54:20,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:20,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-07-14 04:54:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:20,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-14 04:54:20,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:20,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:54:20,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:20,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 04:54:20,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:20,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-14 04:54:20,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:20,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-07-14 04:54:20,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:20,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-14 04:54:20,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:20,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-14 04:54:20,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:20,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-07-14 04:54:20,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:20,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2022-07-14 04:54:20,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:20,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:54:20,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:20,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-07-14 04:54:20,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:20,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2022-07-14 04:54:20,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:20,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2022-07-14 04:54:20,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:20,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-07-14 04:54:20,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:20,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-14 04:54:20,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:20,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-07-14 04:54:20,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:20,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 136 [2022-07-14 04:54:20,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:20,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2022-07-14 04:54:20,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:20,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-14 04:54:20,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:20,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2022-07-14 04:54:20,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:20,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2022-07-14 04:54:20,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:20,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-14 04:54:20,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:54:20,756 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2022-07-14 04:54:20,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:54:20,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602139631] [2022-07-14 04:54:20,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602139631] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:54:20,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:54:20,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:54:20,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063689812] [2022-07-14 04:54:20,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:54:20,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:54:20,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:54:20,757 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:54:20,757 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:54:20,757 INFO L87 Difference]: Start difference. First operand 11024 states and 15859 transitions. Second operand has 6 states, 6 states have (on average 18.333333333333332) internal successors, (110), 4 states have internal predecessors, (110), 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)