./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.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 87fc46113f1aa6bf5cd254bff58332904e2431653df647e3a9a61cd4104d8890 --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 15:44:11,290 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 15:44:11,292 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 15:44:11,322 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 15:44:11,322 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 15:44:11,323 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 15:44:11,328 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 15:44:11,331 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 15:44:11,333 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 15:44:11,338 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 15:44:11,339 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 15:44:11,340 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 15:44:11,341 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 15:44:11,343 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 15:44:11,350 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 15:44:11,352 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 15:44:11,353 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 15:44:11,356 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 15:44:11,364 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 15:44:11,367 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 15:44:11,369 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 15:44:11,370 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 15:44:11,371 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 15:44:11,372 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 15:44:11,374 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 15:44:11,389 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 15:44:11,389 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 15:44:11,390 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 15:44:11,390 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 15:44:11,391 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 15:44:11,392 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 15:44:11,392 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 15:44:11,394 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 15:44:11,394 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 15:44:11,395 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 15:44:11,396 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 15:44:11,396 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 15:44:11,397 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 15:44:11,397 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 15:44:11,397 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 15:44:11,398 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 15:44:11,400 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 15:44:11,403 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-21 15:44:11,436 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 15:44:11,436 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 15:44:11,437 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 15:44:11,437 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 15:44:11,437 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 15:44:11,438 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 15:44:11,438 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 15:44:11,439 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 15:44:11,439 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 15:44:11,440 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 15:44:11,440 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 15:44:11,440 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 15:44:11,440 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 15:44:11,440 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 15:44:11,440 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 15:44:11,441 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 15:44:11,441 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 15:44:11,441 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 15:44:11,441 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 15:44:11,442 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 15:44:11,442 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 15:44:11,442 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 15:44:11,442 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 15:44:11,442 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 15:44:11,443 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 15:44:11,443 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 15:44:11,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 15:44:11,443 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 15:44:11,443 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 15:44:11,443 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 15:44:11,444 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 -> 87fc46113f1aa6bf5cd254bff58332904e2431653df647e3a9a61cd4104d8890 [2022-07-21 15:44:11,759 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 15:44:11,778 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 15:44:11,780 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 15:44:11,781 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 15:44:11,782 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 15:44:11,785 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--misc--uss720.ko.cil.i [2022-07-21 15:44:11,840 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51544b676/76825403072e4d6988d5939f49fe4bcb/FLAG86f352081 [2022-07-21 15:44:12,646 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 15:44:12,646 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i [2022-07-21 15:44:12,725 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51544b676/76825403072e4d6988d5939f49fe4bcb/FLAG86f352081 [2022-07-21 15:44:12,834 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51544b676/76825403072e4d6988d5939f49fe4bcb [2022-07-21 15:44:12,836 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 15:44:12,838 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 15:44:12,852 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 15:44:12,852 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 15:44:12,856 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 15:44:12,856 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 03:44:12" (1/1) ... [2022-07-21 15:44:12,857 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42bafea3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:44:12, skipping insertion in model container [2022-07-21 15:44:12,857 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 03:44:12" (1/1) ... [2022-07-21 15:44:12,864 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 15:44:13,101 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 15:44:16,161 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[287816,287829] [2022-07-21 15:44:16,168 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[287961,287974] [2022-07-21 15:44:16,169 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[288107,288120] [2022-07-21 15:44:16,170 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[288272,288285] [2022-07-21 15:44:16,170 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[288430,288443] [2022-07-21 15:44:16,171 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[288588,288601] [2022-07-21 15:44:16,172 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[288746,288759] [2022-07-21 15:44:16,172 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[288906,288919] [2022-07-21 15:44:16,172 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[289065,289078] [2022-07-21 15:44:16,173 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[289204,289217] [2022-07-21 15:44:16,174 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[289346,289359] [2022-07-21 15:44:16,174 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[289495,289508] [2022-07-21 15:44:16,181 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[289634,289647] [2022-07-21 15:44:16,182 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[289789,289802] [2022-07-21 15:44:16,182 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[289949,289962] [2022-07-21 15:44:16,188 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[290100,290113] [2022-07-21 15:44:16,189 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[290251,290264] [2022-07-21 15:44:16,191 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[290403,290416] [2022-07-21 15:44:16,192 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[290552,290565] [2022-07-21 15:44:16,193 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[290700,290713] [2022-07-21 15:44:16,193 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[290857,290870] [2022-07-21 15:44:16,194 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[291006,291019] [2022-07-21 15:44:16,194 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[291162,291175] [2022-07-21 15:44:16,195 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[291315,291328] [2022-07-21 15:44:16,195 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[291461,291474] [2022-07-21 15:44:16,196 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[291604,291617] [2022-07-21 15:44:16,196 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[291756,291769] [2022-07-21 15:44:16,197 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[291902,291915] [2022-07-21 15:44:16,197 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[292047,292060] [2022-07-21 15:44:16,198 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[292201,292214] [2022-07-21 15:44:16,199 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[292352,292365] [2022-07-21 15:44:16,200 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[292507,292520] [2022-07-21 15:44:16,200 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[292659,292672] [2022-07-21 15:44:16,201 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[292814,292827] [2022-07-21 15:44:16,203 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[292978,292991] [2022-07-21 15:44:16,203 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[293134,293147] [2022-07-21 15:44:16,204 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[293298,293311] [2022-07-21 15:44:16,204 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[293440,293453] [2022-07-21 15:44:16,204 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[293598,293611] [2022-07-21 15:44:16,205 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[293765,293778] [2022-07-21 15:44:16,205 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[293924,293937] [2022-07-21 15:44:16,205 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[294083,294096] [2022-07-21 15:44:16,206 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[294232,294245] [2022-07-21 15:44:16,206 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[294379,294392] [2022-07-21 15:44:16,206 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[294518,294531] [2022-07-21 15:44:16,207 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[294681,294694] [2022-07-21 15:44:16,207 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[294847,294860] [2022-07-21 15:44:16,208 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[295011,295024] [2022-07-21 15:44:16,209 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[295176,295189] [2022-07-21 15:44:16,209 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[295341,295354] [2022-07-21 15:44:16,210 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[295507,295520] [2022-07-21 15:44:16,210 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[295672,295685] [2022-07-21 15:44:16,210 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[295839,295852] [2022-07-21 15:44:16,211 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[295999,296012] [2022-07-21 15:44:16,211 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[296161,296174] [2022-07-21 15:44:16,212 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[296320,296333] [2022-07-21 15:44:16,212 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[296466,296479] [2022-07-21 15:44:16,212 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[296609,296622] [2022-07-21 15:44:16,213 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[296753,296766] [2022-07-21 15:44:16,213 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[296896,296909] [2022-07-21 15:44:16,213 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[297040,297053] [2022-07-21 15:44:16,214 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[297181,297194] [2022-07-21 15:44:16,215 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[297319,297332] [2022-07-21 15:44:16,215 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[297477,297490] [2022-07-21 15:44:16,216 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[297636,297649] [2022-07-21 15:44:16,216 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[297792,297805] [2022-07-21 15:44:16,216 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[297941,297954] [2022-07-21 15:44:16,217 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[298093,298106] [2022-07-21 15:44:16,217 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[298244,298257] [2022-07-21 15:44:16,217 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[298393,298406] [2022-07-21 15:44:16,218 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[298545,298558] [2022-07-21 15:44:16,218 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[298693,298706] [2022-07-21 15:44:16,218 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[298846,298859] [2022-07-21 15:44:16,219 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[298997,299010] [2022-07-21 15:44:16,219 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[299147,299160] [2022-07-21 15:44:16,219 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[299294,299307] [2022-07-21 15:44:16,220 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[299445,299458] [2022-07-21 15:44:16,221 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[299596,299609] [2022-07-21 15:44:16,221 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[299744,299757] [2022-07-21 15:44:16,222 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[299910,299923] [2022-07-21 15:44:16,222 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[300079,300092] [2022-07-21 15:44:16,222 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[300246,300259] [2022-07-21 15:44:16,223 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[300414,300427] [2022-07-21 15:44:16,223 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[300564,300577] [2022-07-21 15:44:16,224 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[300711,300724] [2022-07-21 15:44:16,224 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[300872,300885] [2022-07-21 15:44:16,224 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[301042,301055] [2022-07-21 15:44:16,225 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[301204,301217] [2022-07-21 15:44:16,228 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 15:44:16,282 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 15:44:16,748 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[287816,287829] [2022-07-21 15:44:16,748 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[287961,287974] [2022-07-21 15:44:16,749 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[288107,288120] [2022-07-21 15:44:16,749 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[288272,288285] [2022-07-21 15:44:16,750 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[288430,288443] [2022-07-21 15:44:16,750 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[288588,288601] [2022-07-21 15:44:16,750 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[288746,288759] [2022-07-21 15:44:16,751 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[288906,288919] [2022-07-21 15:44:16,751 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[289065,289078] [2022-07-21 15:44:16,752 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[289204,289217] [2022-07-21 15:44:16,752 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[289346,289359] [2022-07-21 15:44:16,753 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[289495,289508] [2022-07-21 15:44:16,753 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[289634,289647] [2022-07-21 15:44:16,754 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[289789,289802] [2022-07-21 15:44:16,754 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[289949,289962] [2022-07-21 15:44:16,754 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[290100,290113] [2022-07-21 15:44:16,755 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[290251,290264] [2022-07-21 15:44:16,755 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[290403,290416] [2022-07-21 15:44:16,755 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[290552,290565] [2022-07-21 15:44:16,756 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[290700,290713] [2022-07-21 15:44:16,756 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[290857,290870] [2022-07-21 15:44:16,756 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[291006,291019] [2022-07-21 15:44:16,757 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[291162,291175] [2022-07-21 15:44:16,757 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[291315,291328] [2022-07-21 15:44:16,758 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[291461,291474] [2022-07-21 15:44:16,758 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[291604,291617] [2022-07-21 15:44:16,758 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[291756,291769] [2022-07-21 15:44:16,759 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[291902,291915] [2022-07-21 15:44:16,759 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[292047,292060] [2022-07-21 15:44:16,759 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[292201,292214] [2022-07-21 15:44:16,760 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[292352,292365] [2022-07-21 15:44:16,760 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[292507,292520] [2022-07-21 15:44:16,760 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[292659,292672] [2022-07-21 15:44:16,761 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[292814,292827] [2022-07-21 15:44:16,761 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[292978,292991] [2022-07-21 15:44:16,762 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[293134,293147] [2022-07-21 15:44:16,762 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[293298,293311] [2022-07-21 15:44:16,762 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[293440,293453] [2022-07-21 15:44:16,763 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[293598,293611] [2022-07-21 15:44:16,763 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[293765,293778] [2022-07-21 15:44:16,764 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[293924,293937] [2022-07-21 15:44:16,764 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[294083,294096] [2022-07-21 15:44:16,764 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[294232,294245] [2022-07-21 15:44:16,765 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[294379,294392] [2022-07-21 15:44:16,765 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[294518,294531] [2022-07-21 15:44:16,766 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[294681,294694] [2022-07-21 15:44:16,766 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[294847,294860] [2022-07-21 15:44:16,767 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[295011,295024] [2022-07-21 15:44:16,767 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[295176,295189] [2022-07-21 15:44:16,767 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[295341,295354] [2022-07-21 15:44:16,768 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[295507,295520] [2022-07-21 15:44:16,768 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[295672,295685] [2022-07-21 15:44:16,768 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[295839,295852] [2022-07-21 15:44:16,769 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[295999,296012] [2022-07-21 15:44:16,769 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[296161,296174] [2022-07-21 15:44:16,770 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[296320,296333] [2022-07-21 15:44:16,770 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[296466,296479] [2022-07-21 15:44:16,770 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[296609,296622] [2022-07-21 15:44:16,771 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[296753,296766] [2022-07-21 15:44:16,771 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[296896,296909] [2022-07-21 15:44:16,772 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[297040,297053] [2022-07-21 15:44:16,773 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[297181,297194] [2022-07-21 15:44:16,773 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[297319,297332] [2022-07-21 15:44:16,776 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[297477,297490] [2022-07-21 15:44:16,776 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[297636,297649] [2022-07-21 15:44:16,777 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[297792,297805] [2022-07-21 15:44:16,777 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[297941,297954] [2022-07-21 15:44:16,778 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[298093,298106] [2022-07-21 15:44:16,779 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[298244,298257] [2022-07-21 15:44:16,780 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[298393,298406] [2022-07-21 15:44:16,780 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[298545,298558] [2022-07-21 15:44:16,781 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[298693,298706] [2022-07-21 15:44:16,790 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[298846,298859] [2022-07-21 15:44:16,791 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[298997,299010] [2022-07-21 15:44:16,791 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[299147,299160] [2022-07-21 15:44:16,792 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[299294,299307] [2022-07-21 15:44:16,792 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[299445,299458] [2022-07-21 15:44:16,792 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[299596,299609] [2022-07-21 15:44:16,794 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[299744,299757] [2022-07-21 15:44:16,795 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[299910,299923] [2022-07-21 15:44:16,795 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[300079,300092] [2022-07-21 15:44:16,796 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[300246,300259] [2022-07-21 15:44:16,796 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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--misc--uss720.ko.cil.i[300414,300427] [2022-07-21 15:44:16,797 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[300564,300577] [2022-07-21 15:44:16,797 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[300711,300724] [2022-07-21 15:44:16,797 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[300872,300885] [2022-07-21 15:44:16,798 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[301042,301055] [2022-07-21 15:44:16,798 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i[301204,301217] [2022-07-21 15:44:16,801 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 15:44:16,975 INFO L208 MainTranslator]: Completed translation [2022-07-21 15:44:16,975 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:44:16 WrapperNode [2022-07-21 15:44:16,976 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 15:44:16,977 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 15:44:16,977 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 15:44:16,977 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 15:44:16,983 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:44:16" (1/1) ... [2022-07-21 15:44:17,117 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:44:16" (1/1) ... [2022-07-21 15:44:17,294 INFO L137 Inliner]: procedures = 516, calls = 1379, calls flagged for inlining = 239, calls inlined = 169, statements flattened = 3204 [2022-07-21 15:44:17,295 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 15:44:17,297 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 15:44:17,297 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 15:44:17,297 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 15:44:17,304 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:44:16" (1/1) ... [2022-07-21 15:44:17,304 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:44:16" (1/1) ... [2022-07-21 15:44:17,323 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:44:16" (1/1) ... [2022-07-21 15:44:17,324 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:44:16" (1/1) ... [2022-07-21 15:44:17,495 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:44:16" (1/1) ... [2022-07-21 15:44:17,509 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:44:16" (1/1) ... [2022-07-21 15:44:17,532 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:44:16" (1/1) ... [2022-07-21 15:44:17,560 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 15:44:17,564 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 15:44:17,564 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 15:44:17,564 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 15:44:17,565 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:44:16" (1/1) ... [2022-07-21 15:44:17,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 15:44:17,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:44:17,596 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 15:44:17,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 15:44:17,655 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_97 [2022-07-21 15:44:17,655 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_97 [2022-07-21 15:44:17,657 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-21 15:44:17,658 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-21 15:44:17,658 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-21 15:44:17,658 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-21 15:44:17,659 INFO L130 BoogieDeclarations]: Found specification of procedure parport_uss720_disable_irq [2022-07-21 15:44:17,659 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_uss720_disable_irq [2022-07-21 15:44:17,659 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_async [2022-07-21 15:44:17,659 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_async [2022-07-21 15:44:17,659 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-21 15:44:17,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-21 15:44:17,659 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-21 15:44:17,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-21 15:44:17,660 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-21 15:44:17,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-21 15:44:17,660 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-21 15:44:17,660 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-21 15:44:17,675 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-21 15:44:17,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-21 15:44:17,675 INFO L130 BoogieDeclarations]: Found specification of procedure parport_uss720_read_status [2022-07-21 15:44:17,675 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_uss720_read_status [2022-07-21 15:44:17,675 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-21 15:44:17,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-21 15:44:17,676 INFO L130 BoogieDeclarations]: Found specification of procedure parport_uss720_read_data [2022-07-21 15:44:17,676 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_uss720_read_data [2022-07-21 15:44:17,676 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-21 15:44:17,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-21 15:44:17,676 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-21 15:44:17,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-21 15:44:17,676 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 15:44:17,676 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-21 15:44:17,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-21 15:44:17,676 INFO L130 BoogieDeclarations]: Found specification of procedure parport_uss720_data_reverse [2022-07-21 15:44:17,676 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_uss720_data_reverse [2022-07-21 15:44:17,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-21 15:44:17,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-21 15:44:17,677 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-21 15:44:17,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-21 15:44:17,677 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-21 15:44:17,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-21 15:44:17,677 INFO L130 BoogieDeclarations]: Found specification of procedure kref_get [2022-07-21 15:44:17,677 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_get [2022-07-21 15:44:17,677 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-21 15:44:17,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-21 15:44:17,677 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 15:44:17,677 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-21 15:44:17,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-21 15:44:17,677 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2022-07-21 15:44:17,677 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2022-07-21 15:44:17,677 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-21 15:44:17,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-21 15:44:17,678 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-21 15:44:17,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-21 15:44:17,678 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-21 15:44:17,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-21 15:44:17,678 INFO L130 BoogieDeclarations]: Found specification of procedure submit_async_request [2022-07-21 15:44:17,678 INFO L138 BoogieDeclarations]: Found implementation of procedure submit_async_request [2022-07-21 15:44:17,678 INFO L130 BoogieDeclarations]: Found specification of procedure kref_put [2022-07-21 15:44:17,678 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_put [2022-07-21 15:44:17,678 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-21 15:44:17,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-21 15:44:17,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 15:44:17,679 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 15:44:17,679 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-21 15:44:17,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-21 15:44:17,679 INFO L130 BoogieDeclarations]: Found specification of procedure change_mode [2022-07-21 15:44:17,679 INFO L138 BoogieDeclarations]: Found implementation of procedure change_mode [2022-07-21 15:44:17,679 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 15:44:17,679 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-21 15:44:17,679 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-21 15:44:17,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-21 15:44:17,679 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-21 15:44:17,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-21 15:44:17,680 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_dev_usb_put_dev [2022-07-21 15:44:17,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_dev_usb_put_dev [2022-07-21 15:44:17,680 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-21 15:44:17,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-21 15:44:17,680 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-21 15:44:17,680 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-21 15:44:17,681 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-21 15:44:17,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-21 15:44:17,681 INFO L130 BoogieDeclarations]: Found specification of procedure parport_generic_irq [2022-07-21 15:44:17,681 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_generic_irq [2022-07-21 15:44:17,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 15:44:17,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 15:44:17,681 INFO L130 BoogieDeclarations]: Found specification of procedure get_1284_register [2022-07-21 15:44:17,682 INFO L138 BoogieDeclarations]: Found implementation of procedure get_1284_register [2022-07-21 15:44:17,682 INFO L130 BoogieDeclarations]: Found specification of procedure kref_sub [2022-07-21 15:44:17,682 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_sub [2022-07-21 15:44:17,682 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-21 15:44:17,682 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-21 15:44:17,682 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-21 15:44:17,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-21 15:44:17,683 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_asynclock_of_parport_uss720_private [2022-07-21 15:44:17,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_asynclock_of_parport_uss720_private [2022-07-21 15:44:17,683 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-21 15:44:17,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-21 15:44:17,683 INFO L130 BoogieDeclarations]: Found specification of procedure set_1284_register [2022-07-21 15:44:17,683 INFO L138 BoogieDeclarations]: Found implementation of procedure set_1284_register [2022-07-21 15:44:17,683 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-21 15:44:17,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-21 15:44:17,683 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-21 15:44:17,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-21 15:44:17,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 15:44:17,684 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-07-21 15:44:17,684 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-07-21 15:44:17,684 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-21 15:44:17,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-21 15:44:17,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 15:44:17,684 INFO L130 BoogieDeclarations]: Found specification of procedure async_complete [2022-07-21 15:44:17,684 INFO L138 BoogieDeclarations]: Found implementation of procedure async_complete [2022-07-21 15:44:17,684 INFO L130 BoogieDeclarations]: Found specification of procedure parport_uss720_read_control [2022-07-21 15:44:17,684 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_uss720_read_control [2022-07-21 15:44:17,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 15:44:17,684 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-21 15:44:17,684 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-21 15:44:17,685 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-21 15:44:17,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-21 15:44:17,685 INFO L130 BoogieDeclarations]: Found specification of procedure parport_uss720_enable_irq [2022-07-21 15:44:17,685 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_uss720_enable_irq [2022-07-21 15:44:17,685 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-07-21 15:44:17,685 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-07-21 15:44:17,685 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-21 15:44:17,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-21 15:44:17,685 INFO L130 BoogieDeclarations]: Found specification of procedure clear_epp_timeout [2022-07-21 15:44:17,685 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_epp_timeout [2022-07-21 15:44:17,686 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-21 15:44:17,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-21 15:44:17,686 INFO L130 BoogieDeclarations]: Found specification of procedure uss720_disconnect [2022-07-21 15:44:17,686 INFO L138 BoogieDeclarations]: Found implementation of procedure uss720_disconnect [2022-07-21 15:44:17,686 INFO L130 BoogieDeclarations]: Found specification of procedure parport_uss720_data_forward [2022-07-21 15:44:17,686 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_uss720_data_forward [2022-07-21 15:44:17,686 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-21 15:44:17,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-21 15:44:17,686 INFO L130 BoogieDeclarations]: Found specification of procedure kill_all_async_requests_priv [2022-07-21 15:44:17,686 INFO L138 BoogieDeclarations]: Found implementation of procedure kill_all_async_requests_priv [2022-07-21 15:44:17,686 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2022-07-21 15:44:17,686 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2022-07-21 15:44:17,686 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-21 15:44:17,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-21 15:44:17,686 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-21 15:44:17,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-21 15:44:17,687 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-21 15:44:17,687 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-21 15:44:17,687 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-21 15:44:17,687 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-21 15:44:17,687 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-21 15:44:17,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-21 15:44:17,687 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-21 15:44:17,687 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-21 15:44:17,687 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 15:44:17,688 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-21 15:44:17,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-21 15:44:17,688 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-21 15:44:17,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-21 15:44:17,688 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-21 15:44:17,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-21 15:44:17,688 INFO L130 BoogieDeclarations]: Found specification of procedure kref_init [2022-07-21 15:44:17,689 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_init [2022-07-21 15:44:17,689 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-21 15:44:17,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-21 15:44:17,689 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-21 15:44:17,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-21 15:44:17,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 15:44:18,387 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 15:44:18,390 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 15:44:19,059 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-21 15:44:21,272 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 15:44:21,285 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 15:44:21,285 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-21 15:44:21,288 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:44:21 BoogieIcfgContainer [2022-07-21 15:44:21,289 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 15:44:21,290 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 15:44:21,290 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 15:44:21,293 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 15:44:21,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 03:44:12" (1/3) ... [2022-07-21 15:44:21,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76144efb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 03:44:21, skipping insertion in model container [2022-07-21 15:44:21,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:44:16" (2/3) ... [2022-07-21 15:44:21,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76144efb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 03:44:21, skipping insertion in model container [2022-07-21 15:44:21,295 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:44:21" (3/3) ... [2022-07-21 15:44:21,296 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i [2022-07-21 15:44:21,309 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 15:44:21,309 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 33 error locations. [2022-07-21 15:44:21,371 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 15:44:21,377 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@2b23fa1d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@245107b3 [2022-07-21 15:44:21,377 INFO L358 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2022-07-21 15:44:21,385 INFO L276 IsEmpty]: Start isEmpty. Operand has 1155 states, 797 states have (on average 1.3312421580928482) internal successors, (1061), 846 states have internal predecessors, (1061), 251 states have call successors, (251), 74 states have call predecessors, (251), 73 states have return successors, (247), 241 states have call predecessors, (247), 247 states have call successors, (247) [2022-07-21 15:44:21,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-21 15:44:21,395 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:21,396 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:44:21,397 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-21 15:44:21,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:21,402 INFO L85 PathProgramCache]: Analyzing trace with hash 932299145, now seen corresponding path program 1 times [2022-07-21 15:44:21,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:21,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869733918] [2022-07-21 15:44:21,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:21,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:21,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:21,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:21,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:21,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:22,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:22,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:44:22,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:22,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:44:22,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:22,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:44:22,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:22,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:44:22,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:22,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:44:22,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:22,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:22,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:22,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:44:22,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:22,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:44:22,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:22,132 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:44:22,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:22,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869733918] [2022-07-21 15:44:22,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [869733918] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:22,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:22,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:44:22,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756602317] [2022-07-21 15:44:22,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:22,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:44:22,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:22,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:44:22,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:44:22,167 INFO L87 Difference]: Start difference. First operand has 1155 states, 797 states have (on average 1.3312421580928482) internal successors, (1061), 846 states have internal predecessors, (1061), 251 states have call successors, (251), 74 states have call predecessors, (251), 73 states have return successors, (247), 241 states have call predecessors, (247), 247 states have call successors, (247) Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-21 15:44:25,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:25,101 INFO L93 Difference]: Finished difference Result 2243 states and 3170 transitions. [2022-07-21 15:44:25,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:44:25,104 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 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 73 [2022-07-21 15:44:25,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:25,122 INFO L225 Difference]: With dead ends: 2243 [2022-07-21 15:44:25,123 INFO L226 Difference]: Without dead ends: 1137 [2022-07-21 15:44:25,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:44:25,138 INFO L413 NwaCegarLoop]: 1378 mSDtfsCounter, 2307 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 1350 mSolverCounterSat, 928 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2438 SdHoareTripleChecker+Valid, 2682 SdHoareTripleChecker+Invalid, 2278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 928 IncrementalHoareTripleChecker+Valid, 1350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:25,139 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2438 Valid, 2682 Invalid, 2278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [928 Valid, 1350 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-07-21 15:44:25,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2022-07-21 15:44:25,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 1137. [2022-07-21 15:44:25,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1137 states, 786 states have (on average 1.2455470737913485) internal successors, (979), 831 states have internal predecessors, (979), 247 states have call successors, (247), 73 states have call predecessors, (247), 72 states have return successors, (245), 239 states have call predecessors, (245), 245 states have call successors, (245) [2022-07-21 15:44:25,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 1471 transitions. [2022-07-21 15:44:25,248 INFO L78 Accepts]: Start accepts. Automaton has 1137 states and 1471 transitions. Word has length 73 [2022-07-21 15:44:25,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:25,249 INFO L495 AbstractCegarLoop]: Abstraction has 1137 states and 1471 transitions. [2022-07-21 15:44:25,250 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 4 states have internal predecessors, (39), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-21 15:44:25,250 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1471 transitions. [2022-07-21 15:44:25,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-21 15:44:25,254 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:25,254 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:44:25,254 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 15:44:25,255 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-21 15:44:25,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:25,255 INFO L85 PathProgramCache]: Analyzing trace with hash -1910424931, now seen corresponding path program 1 times [2022-07-21 15:44:25,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:25,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946881048] [2022-07-21 15:44:25,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:25,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:25,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:25,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:25,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:25,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:25,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:44:25,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:25,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:44:25,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:25,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:44:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:25,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:44:25,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:25,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:44:25,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:25,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:25,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:25,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:44:25,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:25,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:44:25,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:25,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:44:25,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:25,832 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:44:25,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:25,832 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946881048] [2022-07-21 15:44:25,832 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946881048] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:25,833 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:25,833 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:44:25,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559927930] [2022-07-21 15:44:25,833 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:25,835 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:44:25,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:25,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:44:25,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:44:25,836 INFO L87 Difference]: Start difference. First operand 1137 states and 1471 transitions. Second operand has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-21 15:44:28,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:28,742 INFO L93 Difference]: Finished difference Result 1137 states and 1471 transitions. [2022-07-21 15:44:28,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:44:28,742 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (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 79 [2022-07-21 15:44:28,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:28,754 INFO L225 Difference]: With dead ends: 1137 [2022-07-21 15:44:28,754 INFO L226 Difference]: Without dead ends: 1135 [2022-07-21 15:44:28,755 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:44:28,756 INFO L413 NwaCegarLoop]: 1360 mSDtfsCounter, 2275 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 1336 mSolverCounterSat, 920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2403 SdHoareTripleChecker+Valid, 2648 SdHoareTripleChecker+Invalid, 2256 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 920 IncrementalHoareTripleChecker+Valid, 1336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:28,757 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2403 Valid, 2648 Invalid, 2256 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [920 Valid, 1336 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-07-21 15:44:28,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2022-07-21 15:44:28,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 1135. [2022-07-21 15:44:28,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1135 states, 785 states have (on average 1.2445859872611464) internal successors, (977), 829 states have internal predecessors, (977), 247 states have call successors, (247), 73 states have call predecessors, (247), 72 states have return successors, (245), 239 states have call predecessors, (245), 245 states have call successors, (245) [2022-07-21 15:44:28,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1469 transitions. [2022-07-21 15:44:28,822 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1469 transitions. Word has length 79 [2022-07-21 15:44:28,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:28,822 INFO L495 AbstractCegarLoop]: Abstraction has 1135 states and 1469 transitions. [2022-07-21 15:44:28,823 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.166666666666667) internal successors, (43), 4 states have internal predecessors, (43), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-21 15:44:28,823 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1469 transitions. [2022-07-21 15:44:28,824 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-21 15:44:28,825 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:28,825 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:44:28,825 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 15:44:28,825 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-21 15:44:28,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:28,826 INFO L85 PathProgramCache]: Analyzing trace with hash 1592629622, now seen corresponding path program 1 times [2022-07-21 15:44:28,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:28,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341926703] [2022-07-21 15:44:28,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:28,827 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:28,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:28,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:28,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:28,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:28,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:29,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:44:29,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:29,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:44:29,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:29,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:44:29,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:29,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:44:29,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:29,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:44:29,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:29,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:29,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:29,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:44:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:29,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:44:29,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:29,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:44:29,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:29,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:44:29,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:29,092 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:44:29,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:29,092 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341926703] [2022-07-21 15:44:29,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341926703] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:29,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:29,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:44:29,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198849101] [2022-07-21 15:44:29,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:29,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:44:29,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:29,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:44:29,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:44:29,095 INFO L87 Difference]: Start difference. First operand 1135 states and 1469 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-21 15:44:31,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:31,377 INFO L93 Difference]: Finished difference Result 1135 states and 1469 transitions. [2022-07-21 15:44:31,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:44:31,378 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (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 85 [2022-07-21 15:44:31,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:31,384 INFO L225 Difference]: With dead ends: 1135 [2022-07-21 15:44:31,384 INFO L226 Difference]: Without dead ends: 1133 [2022-07-21 15:44:31,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:44:31,386 INFO L413 NwaCegarLoop]: 1358 mSDtfsCounter, 2269 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 1334 mSolverCounterSat, 920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2396 SdHoareTripleChecker+Valid, 2646 SdHoareTripleChecker+Invalid, 2254 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 920 IncrementalHoareTripleChecker+Valid, 1334 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:31,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2396 Valid, 2646 Invalid, 2254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [920 Valid, 1334 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-21 15:44:31,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2022-07-21 15:44:31,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1133. [2022-07-21 15:44:31,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1133 states, 784 states have (on average 1.2436224489795917) internal successors, (975), 827 states have internal predecessors, (975), 247 states have call successors, (247), 73 states have call predecessors, (247), 72 states have return successors, (245), 239 states have call predecessors, (245), 245 states have call successors, (245) [2022-07-21 15:44:31,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1467 transitions. [2022-07-21 15:44:31,428 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1467 transitions. Word has length 85 [2022-07-21 15:44:31,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:31,429 INFO L495 AbstractCegarLoop]: Abstraction has 1133 states and 1467 transitions. [2022-07-21 15:44:31,429 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 4 states have internal predecessors, (47), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-21 15:44:31,430 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1467 transitions. [2022-07-21 15:44:31,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-21 15:44:31,431 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:31,431 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:44:31,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 15:44:31,432 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-21 15:44:31,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:31,432 INFO L85 PathProgramCache]: Analyzing trace with hash 315582992, now seen corresponding path program 1 times [2022-07-21 15:44:31,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:31,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412623076] [2022-07-21 15:44:31,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:31,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:31,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:31,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:31,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:31,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:31,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:31,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:44:31,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:31,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:44:31,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:31,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:44:31,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:31,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:44:31,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:31,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:44:31,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:31,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:31,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:44:31,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:31,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:44:31,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:31,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:44:31,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:31,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:44:31,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:31,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 15:44:31,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:31,689 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:44:31,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:31,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412623076] [2022-07-21 15:44:31,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [412623076] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:31,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:31,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:44:31,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645588128] [2022-07-21 15:44:31,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:31,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:44:31,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:31,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:44:31,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:44:31,692 INFO L87 Difference]: Start difference. First operand 1133 states and 1467 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-21 15:44:34,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:34,192 INFO L93 Difference]: Finished difference Result 1133 states and 1467 transitions. [2022-07-21 15:44:34,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:44:34,192 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 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 91 [2022-07-21 15:44:34,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:34,199 INFO L225 Difference]: With dead ends: 1133 [2022-07-21 15:44:34,199 INFO L226 Difference]: Without dead ends: 1131 [2022-07-21 15:44:34,200 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:44:34,201 INFO L413 NwaCegarLoop]: 1356 mSDtfsCounter, 2263 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 1332 mSolverCounterSat, 920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2389 SdHoareTripleChecker+Valid, 2644 SdHoareTripleChecker+Invalid, 2252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 920 IncrementalHoareTripleChecker+Valid, 1332 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:34,201 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2389 Valid, 2644 Invalid, 2252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [920 Valid, 1332 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-21 15:44:34,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2022-07-21 15:44:34,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 1131. [2022-07-21 15:44:34,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1131 states, 783 states have (on average 1.2426564495530013) internal successors, (973), 825 states have internal predecessors, (973), 247 states have call successors, (247), 73 states have call predecessors, (247), 72 states have return successors, (245), 239 states have call predecessors, (245), 245 states have call successors, (245) [2022-07-21 15:44:34,243 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1465 transitions. [2022-07-21 15:44:34,243 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1465 transitions. Word has length 91 [2022-07-21 15:44:34,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:34,244 INFO L495 AbstractCegarLoop]: Abstraction has 1131 states and 1465 transitions. [2022-07-21 15:44:34,244 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 4 states have internal predecessors, (51), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-21 15:44:34,244 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1465 transitions. [2022-07-21 15:44:34,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-21 15:44:34,246 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:34,246 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:44:34,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 15:44:34,246 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-21 15:44:34,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:34,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1831010472, now seen corresponding path program 1 times [2022-07-21 15:44:34,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:34,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036154260] [2022-07-21 15:44:34,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:34,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:34,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:34,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:34,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:44:34,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:44:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:44:34,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:44:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:44:34,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:34,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:44:34,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:44:34,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:44:34,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:44:34,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 15:44:34,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 15:44:34,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,476 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:44:34,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:34,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036154260] [2022-07-21 15:44:34,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036154260] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:34,477 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:34,477 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:44:34,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899078054] [2022-07-21 15:44:34,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:34,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:44:34,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:34,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:44:34,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:44:34,479 INFO L87 Difference]: Start difference. First operand 1131 states and 1465 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-21 15:44:36,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:36,629 INFO L93 Difference]: Finished difference Result 1131 states and 1465 transitions. [2022-07-21 15:44:36,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:44:36,632 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (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 97 [2022-07-21 15:44:36,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:36,639 INFO L225 Difference]: With dead ends: 1131 [2022-07-21 15:44:36,639 INFO L226 Difference]: Without dead ends: 1129 [2022-07-21 15:44:36,640 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:44:36,642 INFO L413 NwaCegarLoop]: 1354 mSDtfsCounter, 2257 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 1330 mSolverCounterSat, 920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2382 SdHoareTripleChecker+Valid, 2642 SdHoareTripleChecker+Invalid, 2250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 920 IncrementalHoareTripleChecker+Valid, 1330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:36,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2382 Valid, 2642 Invalid, 2250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [920 Valid, 1330 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-21 15:44:36,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2022-07-21 15:44:36,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1129. [2022-07-21 15:44:36,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1129 states, 782 states have (on average 1.241687979539642) internal successors, (971), 823 states have internal predecessors, (971), 247 states have call successors, (247), 73 states have call predecessors, (247), 72 states have return successors, (245), 239 states have call predecessors, (245), 245 states have call successors, (245) [2022-07-21 15:44:36,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1463 transitions. [2022-07-21 15:44:36,733 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1463 transitions. Word has length 97 [2022-07-21 15:44:36,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:36,734 INFO L495 AbstractCegarLoop]: Abstraction has 1129 states and 1463 transitions. [2022-07-21 15:44:36,734 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-21 15:44:36,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1463 transitions. [2022-07-21 15:44:36,735 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-21 15:44:36,736 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:36,736 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:44:36,736 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 15:44:36,736 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-21 15:44:36,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:36,737 INFO L85 PathProgramCache]: Analyzing trace with hash 898638973, now seen corresponding path program 1 times [2022-07-21 15:44:36,737 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:36,737 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674104182] [2022-07-21 15:44:36,737 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:36,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:36,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:36,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:36,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:44:36,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:44:36,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:44:36,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:44:36,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:44:36,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:44:36,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:44:36,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:44:36,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:37,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:44:37,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:37,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 15:44:37,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:37,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 15:44:37,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:37,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 15:44:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:37,032 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:44:37,032 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:37,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674104182] [2022-07-21 15:44:37,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674104182] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:37,033 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:37,033 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:44:37,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1277985242] [2022-07-21 15:44:37,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:37,034 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:44:37,034 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:37,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:44:37,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:44:37,035 INFO L87 Difference]: Start difference. First operand 1129 states and 1463 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-21 15:44:39,021 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:39,022 INFO L93 Difference]: Finished difference Result 1129 states and 1463 transitions. [2022-07-21 15:44:39,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:44:39,022 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 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 103 [2022-07-21 15:44:39,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:39,028 INFO L225 Difference]: With dead ends: 1129 [2022-07-21 15:44:39,028 INFO L226 Difference]: Without dead ends: 1127 [2022-07-21 15:44:39,029 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-21 15:44:39,031 INFO L413 NwaCegarLoop]: 1352 mSDtfsCounter, 2251 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 1328 mSolverCounterSat, 920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2375 SdHoareTripleChecker+Valid, 2640 SdHoareTripleChecker+Invalid, 2248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 920 IncrementalHoareTripleChecker+Valid, 1328 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:39,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2375 Valid, 2640 Invalid, 2248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [920 Valid, 1328 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-21 15:44:39,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2022-07-21 15:44:39,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 1127. [2022-07-21 15:44:39,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1127 states, 781 states have (on average 1.2407170294494239) internal successors, (969), 821 states have internal predecessors, (969), 247 states have call successors, (247), 73 states have call predecessors, (247), 72 states have return successors, (245), 239 states have call predecessors, (245), 245 states have call successors, (245) [2022-07-21 15:44:39,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1461 transitions. [2022-07-21 15:44:39,080 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 1461 transitions. Word has length 103 [2022-07-21 15:44:39,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:39,080 INFO L495 AbstractCegarLoop]: Abstraction has 1127 states and 1461 transitions. [2022-07-21 15:44:39,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-21 15:44:39,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1461 transitions. [2022-07-21 15:44:39,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-21 15:44:39,083 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:39,083 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:44:39,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 15:44:39,084 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-21 15:44:39,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:39,084 INFO L85 PathProgramCache]: Analyzing trace with hash 982356993, now seen corresponding path program 1 times [2022-07-21 15:44:39,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:39,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343261126] [2022-07-21 15:44:39,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:39,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:39,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:39,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:39,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:39,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:39,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:39,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:44:39,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:39,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:44:39,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:39,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:44:39,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:39,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:44:39,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:39,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:44:39,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:39,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:39,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:39,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:44:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:39,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:44:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:39,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:44:39,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:39,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:44:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:39,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 15:44:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:39,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 15:44:39,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:39,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 15:44:39,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:39,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 15:44:39,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:39,349 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:44:39,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:39,350 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343261126] [2022-07-21 15:44:39,350 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343261126] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:39,350 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:39,350 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:44:39,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737427325] [2022-07-21 15:44:39,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:39,351 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:44:39,351 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:39,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:44:39,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:44:39,352 INFO L87 Difference]: Start difference. First operand 1127 states and 1461 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-21 15:44:41,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:41,575 INFO L93 Difference]: Finished difference Result 1127 states and 1461 transitions. [2022-07-21 15:44:41,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:44:41,576 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 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 109 [2022-07-21 15:44:41,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:41,581 INFO L225 Difference]: With dead ends: 1127 [2022-07-21 15:44:41,581 INFO L226 Difference]: Without dead ends: 1125 [2022-07-21 15:44:41,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:44:41,582 INFO L413 NwaCegarLoop]: 1350 mSDtfsCounter, 2245 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 1326 mSolverCounterSat, 920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2368 SdHoareTripleChecker+Valid, 2638 SdHoareTripleChecker+Invalid, 2246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 920 IncrementalHoareTripleChecker+Valid, 1326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:41,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2368 Valid, 2638 Invalid, 2246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [920 Valid, 1326 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-21 15:44:41,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2022-07-21 15:44:41,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1125. [2022-07-21 15:44:41,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1125 states, 780 states have (on average 1.2397435897435898) internal successors, (967), 819 states have internal predecessors, (967), 247 states have call successors, (247), 73 states have call predecessors, (247), 72 states have return successors, (245), 239 states have call predecessors, (245), 245 states have call successors, (245) [2022-07-21 15:44:41,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1459 transitions. [2022-07-21 15:44:41,645 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1459 transitions. Word has length 109 [2022-07-21 15:44:41,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:41,645 INFO L495 AbstractCegarLoop]: Abstraction has 1125 states and 1459 transitions. [2022-07-21 15:44:41,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-21 15:44:41,646 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1459 transitions. [2022-07-21 15:44:41,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-21 15:44:41,650 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:41,650 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:44:41,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 15:44:41,650 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-21 15:44:41,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:41,651 INFO L85 PathProgramCache]: Analyzing trace with hash 664691615, now seen corresponding path program 1 times [2022-07-21 15:44:41,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:41,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89873089] [2022-07-21 15:44:41,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:41,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:41,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:41,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:41,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:44:41,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:44:41,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:44:41,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:44:41,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:44:41,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:41,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:44:41,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:44:41,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:44:41,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:44:41,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 15:44:41,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 15:44:41,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 15:44:41,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 15:44:41,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 15:44:41,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:41,902 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:44:41,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:41,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89873089] [2022-07-21 15:44:41,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89873089] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:41,903 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:41,903 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:44:41,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187708316] [2022-07-21 15:44:41,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:41,904 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:44:41,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:41,905 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:44:41,905 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:44:41,905 INFO L87 Difference]: Start difference. First operand 1125 states and 1459 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-21 15:44:47,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:47,629 INFO L93 Difference]: Finished difference Result 2162 states and 2871 transitions. [2022-07-21 15:44:47,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 15:44:47,629 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 115 [2022-07-21 15:44:47,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:47,640 INFO L225 Difference]: With dead ends: 2162 [2022-07-21 15:44:47,640 INFO L226 Difference]: Without dead ends: 2160 [2022-07-21 15:44:47,642 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-21 15:44:47,642 INFO L413 NwaCegarLoop]: 1551 mSDtfsCounter, 3247 mSDsluCounter, 1743 mSDsCounter, 0 mSdLazyCounter, 2949 mSolverCounterSat, 1625 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3324 SdHoareTripleChecker+Valid, 3294 SdHoareTripleChecker+Invalid, 4574 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1625 IncrementalHoareTripleChecker+Valid, 2949 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:47,643 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3324 Valid, 3294 Invalid, 4574 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1625 Valid, 2949 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-07-21 15:44:47,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2160 states. [2022-07-21 15:44:47,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2160 to 2026. [2022-07-21 15:44:47,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2026 states, 1425 states have (on average 1.2435087719298246) internal successors, (1772), 1474 states have internal predecessors, (1772), 443 states have call successors, (443), 133 states have call predecessors, (443), 132 states have return successors, (520), 429 states have call predecessors, (520), 441 states have call successors, (520) [2022-07-21 15:44:47,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2026 states to 2026 states and 2735 transitions. [2022-07-21 15:44:47,810 INFO L78 Accepts]: Start accepts. Automaton has 2026 states and 2735 transitions. Word has length 115 [2022-07-21 15:44:47,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:47,810 INFO L495 AbstractCegarLoop]: Abstraction has 2026 states and 2735 transitions. [2022-07-21 15:44:47,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-21 15:44:47,811 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 2735 transitions. [2022-07-21 15:44:47,813 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-21 15:44:47,813 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:47,814 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:44:47,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 15:44:47,814 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-21 15:44:47,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:47,816 INFO L85 PathProgramCache]: Analyzing trace with hash 392690514, now seen corresponding path program 1 times [2022-07-21 15:44:47,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:47,817 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534121667] [2022-07-21 15:44:47,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:47,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:47,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:47,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:47,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:47,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:47,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:47,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:44:47,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:48,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:44:48,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:48,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:44:48,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:48,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:44:48,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:48,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:44:48,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:48,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:48,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:48,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:44:48,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:48,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:44:48,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:48,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 15:44:48,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:48,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:44:48,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:48,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:48,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:48,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:48,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:48,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:48,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:48,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:44:48,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:48,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 15:44:48,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:48,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-21 15:44:48,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:48,123 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-21 15:44:48,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:48,123 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534121667] [2022-07-21 15:44:48,124 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534121667] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:48,124 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:48,124 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 15:44:48,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606967193] [2022-07-21 15:44:48,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:48,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 15:44:48,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:48,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 15:44:48,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-21 15:44:48,126 INFO L87 Difference]: Start difference. First operand 2026 states and 2735 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-21 15:44:52,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:52,521 INFO L93 Difference]: Finished difference Result 4235 states and 6090 transitions. [2022-07-21 15:44:52,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 15:44:52,522 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) Word has length 130 [2022-07-21 15:44:52,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:52,538 INFO L225 Difference]: With dead ends: 4235 [2022-07-21 15:44:52,538 INFO L226 Difference]: Without dead ends: 2266 [2022-07-21 15:44:52,553 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2022-07-21 15:44:52,555 INFO L413 NwaCegarLoop]: 1338 mSDtfsCounter, 2929 mSDsluCounter, 2560 mSDsCounter, 0 mSdLazyCounter, 3959 mSolverCounterSat, 1526 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3073 SdHoareTripleChecker+Valid, 3898 SdHoareTripleChecker+Invalid, 5485 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1526 IncrementalHoareTripleChecker+Valid, 3959 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:52,556 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3073 Valid, 3898 Invalid, 5485 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1526 Valid, 3959 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-07-21 15:44:52,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2266 states. [2022-07-21 15:44:52,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2266 to 2029. [2022-07-21 15:44:52,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2029 states, 1427 states have (on average 1.2417659425367904) internal successors, (1772), 1477 states have internal predecessors, (1772), 443 states have call successors, (443), 133 states have call predecessors, (443), 133 states have return successors, (523), 429 states have call predecessors, (523), 441 states have call successors, (523) [2022-07-21 15:44:52,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 2029 states and 2738 transitions. [2022-07-21 15:44:52,682 INFO L78 Accepts]: Start accepts. Automaton has 2029 states and 2738 transitions. Word has length 130 [2022-07-21 15:44:52,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:52,682 INFO L495 AbstractCegarLoop]: Abstraction has 2029 states and 2738 transitions. [2022-07-21 15:44:52,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 5 states have internal predecessors, (64), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (18), 3 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-21 15:44:52,683 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 2738 transitions. [2022-07-21 15:44:52,685 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-21 15:44:52,686 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:52,686 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:44:52,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 15:44:52,686 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-21 15:44:52,686 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:52,686 INFO L85 PathProgramCache]: Analyzing trace with hash 392750096, now seen corresponding path program 1 times [2022-07-21 15:44:52,686 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:52,686 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1673336825] [2022-07-21 15:44:52,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:52,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:52,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:52,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:52,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:44:52,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:44:52,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:44:52,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:44:52,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:44:52,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:52,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:44:52,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:44:52,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 15:44:52,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:44:52,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:52,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:52,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:52,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:44:52,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 15:44:52,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-21 15:44:52,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,955 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-21 15:44:52,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:52,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1673336825] [2022-07-21 15:44:52,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1673336825] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:52,956 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:52,956 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 15:44:52,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2144783486] [2022-07-21 15:44:52,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:52,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 15:44:52,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:52,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 15:44:52,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 15:44:52,957 INFO L87 Difference]: Start difference. First operand 2029 states and 2738 transitions. Second operand has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-21 15:44:56,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:56,490 INFO L93 Difference]: Finished difference Result 2266 states and 3168 transitions. [2022-07-21 15:44:56,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 15:44:56,491 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) Word has length 130 [2022-07-21 15:44:56,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:56,513 INFO L225 Difference]: With dead ends: 2266 [2022-07-21 15:44:56,514 INFO L226 Difference]: Without dead ends: 2264 [2022-07-21 15:44:56,514 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-07-21 15:44:56,515 INFO L413 NwaCegarLoop]: 1336 mSDtfsCounter, 1771 mSDsluCounter, 2176 mSDsCounter, 0 mSdLazyCounter, 2844 mSolverCounterSat, 1223 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1771 SdHoareTripleChecker+Valid, 3512 SdHoareTripleChecker+Invalid, 4067 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1223 IncrementalHoareTripleChecker+Valid, 2844 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:56,515 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1771 Valid, 3512 Invalid, 4067 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1223 Valid, 2844 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-07-21 15:44:56,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2264 states. [2022-07-21 15:44:56,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2264 to 2027. [2022-07-21 15:44:56,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2027 states, 1426 states have (on average 1.2405329593267882) internal successors, (1769), 1475 states have internal predecessors, (1769), 443 states have call successors, (443), 133 states have call predecessors, (443), 133 states have return successors, (523), 429 states have call predecessors, (523), 441 states have call successors, (523) [2022-07-21 15:44:56,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 2027 states and 2735 transitions. [2022-07-21 15:44:56,627 INFO L78 Accepts]: Start accepts. Automaton has 2027 states and 2735 transitions. Word has length 130 [2022-07-21 15:44:56,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:56,630 INFO L495 AbstractCegarLoop]: Abstraction has 2027 states and 2735 transitions. [2022-07-21 15:44:56,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.142857142857142) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (18), 1 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-21 15:44:56,630 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 2735 transitions. [2022-07-21 15:44:56,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-21 15:44:56,633 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:56,633 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:44:56,633 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 15:44:56,633 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-21 15:44:56,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:56,634 INFO L85 PathProgramCache]: Analyzing trace with hash 200930521, now seen corresponding path program 1 times [2022-07-21 15:44:56,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:56,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [154466607] [2022-07-21 15:44:56,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:56,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:56,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:56,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:56,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:56,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:56,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:56,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:44:56,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:56,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:44:56,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:56,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:44:56,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:56,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:44:56,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:56,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:44:56,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:56,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:56,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:56,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:44:56,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:56,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:44:56,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:56,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 15:44:56,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:56,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:44:56,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:56,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:56,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:56,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:56,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:56,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:57,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:44:57,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:57,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 15:44:57,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:57,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 15:44:57,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:57,098 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-21 15:44:57,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:57,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [154466607] [2022-07-21 15:44:57,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [154466607] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:57,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:57,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 15:44:57,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [242781770] [2022-07-21 15:44:57,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:57,106 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 15:44:57,106 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:57,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 15:44:57,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-21 15:44:57,108 INFO L87 Difference]: Start difference. First operand 2027 states and 2735 transitions. Second operand has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (20), 5 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-21 15:45:04,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:45:04,078 INFO L93 Difference]: Finished difference Result 4287 states and 6080 transitions. [2022-07-21 15:45:04,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-21 15:45:04,079 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (20), 5 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) Word has length 127 [2022-07-21 15:45:04,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:45:04,092 INFO L225 Difference]: With dead ends: 4287 [2022-07-21 15:45:04,092 INFO L226 Difference]: Without dead ends: 2349 [2022-07-21 15:45:04,101 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2022-07-21 15:45:04,102 INFO L413 NwaCegarLoop]: 1312 mSDtfsCounter, 1810 mSDsluCounter, 3021 mSDsCounter, 0 mSdLazyCounter, 4634 mSolverCounterSat, 1352 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1810 SdHoareTripleChecker+Valid, 4333 SdHoareTripleChecker+Invalid, 5986 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1352 IncrementalHoareTripleChecker+Valid, 4634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.4s IncrementalHoareTripleChecker+Time [2022-07-21 15:45:04,102 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1810 Valid, 4333 Invalid, 5986 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1352 Valid, 4634 Invalid, 0 Unknown, 0 Unchecked, 6.4s Time] [2022-07-21 15:45:04,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2022-07-21 15:45:04,210 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 2066. [2022-07-21 15:45:04,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2066 states, 1453 states have (on average 1.2388162422573985) internal successors, (1800), 1505 states have internal predecessors, (1800), 446 states have call successors, (446), 133 states have call predecessors, (446), 142 states have return successors, (556), 438 states have call predecessors, (556), 444 states have call successors, (556) [2022-07-21 15:45:04,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2066 states to 2066 states and 2802 transitions. [2022-07-21 15:45:04,224 INFO L78 Accepts]: Start accepts. Automaton has 2066 states and 2802 transitions. Word has length 127 [2022-07-21 15:45:04,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:45:04,225 INFO L495 AbstractCegarLoop]: Abstraction has 2066 states and 2802 transitions. [2022-07-21 15:45:04,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.111111111111111) internal successors, (64), 4 states have internal predecessors, (64), 1 states have call successors, (20), 5 states have call predecessors, (20), 2 states have return successors, (18), 2 states have call predecessors, (18), 1 states have call successors, (18) [2022-07-21 15:45:04,225 INFO L276 IsEmpty]: Start isEmpty. Operand 2066 states and 2802 transitions. [2022-07-21 15:45:04,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-21 15:45:04,227 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:45:04,227 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:45:04,227 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 15:45:04,228 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-21 15:45:04,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:45:04,228 INFO L85 PathProgramCache]: Analyzing trace with hash -1181334718, now seen corresponding path program 1 times [2022-07-21 15:45:04,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:45:04,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1186648929] [2022-07-21 15:45:04,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:45:04,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:45:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:04,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:45:04,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:04,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:45:04,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:04,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:45:04,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:04,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:45:04,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:04,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:45:04,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:04,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:45:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:04,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:45:04,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:04,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:04,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:45:04,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:04,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:45:04,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:04,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:45:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:04,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:45:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:04,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 15:45:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:04,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 15:45:04,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:04,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 15:45:04,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:04,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 15:45:04,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:04,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 15:45:04,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:04,462 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:45:04,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:45:04,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1186648929] [2022-07-21 15:45:04,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1186648929] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:45:04,462 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:45:04,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:45:04,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589843784] [2022-07-21 15:45:04,463 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:45:04,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:45:04,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:45:04,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:45:04,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:45:04,470 INFO L87 Difference]: Start difference. First operand 2066 states and 2802 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-21 15:45:06,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:45:06,325 INFO L93 Difference]: Finished difference Result 2066 states and 2802 transitions. [2022-07-21 15:45:06,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:45:06,325 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 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 117 [2022-07-21 15:45:06,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:45:06,335 INFO L225 Difference]: With dead ends: 2066 [2022-07-21 15:45:06,335 INFO L226 Difference]: Without dead ends: 2064 [2022-07-21 15:45:06,336 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:45:06,337 INFO L413 NwaCegarLoop]: 1344 mSDtfsCounter, 2228 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 1322 mSolverCounterSat, 920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2350 SdHoareTripleChecker+Valid, 2632 SdHoareTripleChecker+Invalid, 2242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 920 IncrementalHoareTripleChecker+Valid, 1322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-21 15:45:06,337 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2350 Valid, 2632 Invalid, 2242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [920 Valid, 1322 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-21 15:45:06,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2064 states. [2022-07-21 15:45:06,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2064 to 2064. [2022-07-21 15:45:06,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2064 states, 1452 states have (on average 1.237603305785124) internal successors, (1797), 1503 states have internal predecessors, (1797), 446 states have call successors, (446), 133 states have call predecessors, (446), 142 states have return successors, (556), 438 states have call predecessors, (556), 444 states have call successors, (556) [2022-07-21 15:45:06,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2064 states to 2064 states and 2799 transitions. [2022-07-21 15:45:06,454 INFO L78 Accepts]: Start accepts. Automaton has 2064 states and 2799 transitions. Word has length 117 [2022-07-21 15:45:06,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:45:06,454 INFO L495 AbstractCegarLoop]: Abstraction has 2064 states and 2799 transitions. [2022-07-21 15:45:06,455 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-21 15:45:06,455 INFO L276 IsEmpty]: Start isEmpty. Operand 2064 states and 2799 transitions. [2022-07-21 15:45:06,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-21 15:45:06,457 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:45:06,457 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:45:06,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 15:45:06,458 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-21 15:45:06,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:45:06,458 INFO L85 PathProgramCache]: Analyzing trace with hash 1641601009, now seen corresponding path program 1 times [2022-07-21 15:45:06,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:45:06,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70828868] [2022-07-21 15:45:06,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:45:06,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:45:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:06,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:45:06,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:06,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:45:06,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:06,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:45:06,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:06,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:45:06,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:06,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:45:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:06,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:45:06,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:06,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:45:06,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:06,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:06,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:06,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:45:06,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:06,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:45:06,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:06,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:45:06,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:06,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:45:06,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:06,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 15:45:06,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:06,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 15:45:06,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:06,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 15:45:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:06,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 15:45:06,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:06,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 15:45:06,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:06,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 15:45:06,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:06,689 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:45:06,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:45:06,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [70828868] [2022-07-21 15:45:06,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [70828868] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:45:06,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:45:06,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:45:06,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186528696] [2022-07-21 15:45:06,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:45:06,690 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:45:06,690 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:45:06,691 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:45:06,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:45:06,691 INFO L87 Difference]: Start difference. First operand 2064 states and 2799 transitions. Second operand has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-21 15:45:08,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:45:08,551 INFO L93 Difference]: Finished difference Result 2064 states and 2799 transitions. [2022-07-21 15:45:08,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:45:08,551 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (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 123 [2022-07-21 15:45:08,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:45:08,561 INFO L225 Difference]: With dead ends: 2064 [2022-07-21 15:45:08,561 INFO L226 Difference]: Without dead ends: 2062 [2022-07-21 15:45:08,562 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:45:08,563 INFO L413 NwaCegarLoop]: 1343 mSDtfsCounter, 2224 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 1319 mSolverCounterSat, 920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2345 SdHoareTripleChecker+Valid, 2631 SdHoareTripleChecker+Invalid, 2239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 920 IncrementalHoareTripleChecker+Valid, 1319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-21 15:45:08,563 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2345 Valid, 2631 Invalid, 2239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [920 Valid, 1319 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-21 15:45:08,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2062 states. [2022-07-21 15:45:08,674 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2062 to 2062. [2022-07-21 15:45:08,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2062 states, 1451 states have (on average 1.237077877325982) internal successors, (1795), 1501 states have internal predecessors, (1795), 446 states have call successors, (446), 133 states have call predecessors, (446), 142 states have return successors, (556), 438 states have call predecessors, (556), 444 states have call successors, (556) [2022-07-21 15:45:08,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2062 states to 2062 states and 2797 transitions. [2022-07-21 15:45:08,685 INFO L78 Accepts]: Start accepts. Automaton has 2062 states and 2797 transitions. Word has length 123 [2022-07-21 15:45:08,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:45:08,686 INFO L495 AbstractCegarLoop]: Abstraction has 2062 states and 2797 transitions. [2022-07-21 15:45:08,686 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.166666666666666) internal successors, (73), 4 states have internal predecessors, (73), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-21 15:45:08,686 INFO L276 IsEmpty]: Start isEmpty. Operand 2062 states and 2797 transitions. [2022-07-21 15:45:08,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-21 15:45:08,689 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:45:08,689 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:45:08,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 15:45:08,690 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-21 15:45:08,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:45:08,690 INFO L85 PathProgramCache]: Analyzing trace with hash -572408838, now seen corresponding path program 1 times [2022-07-21 15:45:08,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:45:08,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384809336] [2022-07-21 15:45:08,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:45:08,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:45:08,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:08,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:45:08,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:08,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:45:08,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:08,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:45:08,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:08,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:45:08,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:08,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:45:08,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:08,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:45:08,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:08,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:45:08,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:08,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:08,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:08,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:45:08,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:08,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:45:08,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:08,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 15:45:08,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:08,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:45:08,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:08,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:08,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:08,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:08,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:08,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:08,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:08,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:45:08,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:08,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 15:45:08,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:08,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 15:45:08,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:08,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:08,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:08,992 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2022-07-21 15:45:08,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:45:08,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384809336] [2022-07-21 15:45:08,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384809336] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:45:08,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:45:08,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:45:08,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651762058] [2022-07-21 15:45:08,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:45:08,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:45:08,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:45:08,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:45:08,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:45:08,995 INFO L87 Difference]: Start difference. First operand 2062 states and 2797 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-21 15:45:11,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:45:11,204 INFO L93 Difference]: Finished difference Result 4291 states and 6228 transitions. [2022-07-21 15:45:11,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:45:11,208 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 137 [2022-07-21 15:45:11,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:45:11,222 INFO L225 Difference]: With dead ends: 4291 [2022-07-21 15:45:11,222 INFO L226 Difference]: Without dead ends: 2286 [2022-07-21 15:45:11,234 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 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-21 15:45:11,236 INFO L413 NwaCegarLoop]: 1328 mSDtfsCounter, 2885 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 944 mSolverCounterSat, 1518 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3029 SdHoareTripleChecker+Valid, 2454 SdHoareTripleChecker+Invalid, 2462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1518 IncrementalHoareTripleChecker+Valid, 944 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:45:11,237 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3029 Valid, 2454 Invalid, 2462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1518 Valid, 944 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-21 15:45:11,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2286 states. [2022-07-21 15:45:11,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2286 to 2056. [2022-07-21 15:45:11,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2056 states, 1446 states have (on average 1.2351313969571232) internal successors, (1786), 1495 states have internal predecessors, (1786), 446 states have call successors, (446), 133 states have call predecessors, (446), 142 states have return successors, (556), 438 states have call predecessors, (556), 444 states have call successors, (556) [2022-07-21 15:45:11,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 2788 transitions. [2022-07-21 15:45:11,370 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 2788 transitions. Word has length 137 [2022-07-21 15:45:11,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:45:11,371 INFO L495 AbstractCegarLoop]: Abstraction has 2056 states and 2788 transitions. [2022-07-21 15:45:11,371 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 3 states have internal predecessors, (69), 2 states have call successors, (24), 5 states have call predecessors, (24), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-21 15:45:11,371 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2788 transitions. [2022-07-21 15:45:11,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-07-21 15:45:11,374 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:45:11,374 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:45:11,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 15:45:11,374 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_usb_dev_usb_put_devErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-21 15:45:11,374 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:45:11,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1009057684, now seen corresponding path program 1 times [2022-07-21 15:45:11,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:45:11,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2088054951] [2022-07-21 15:45:11,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:45:11,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:45:11,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:11,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:45:11,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:11,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:45:11,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:11,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:45:11,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:11,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:45:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:11,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 15:45:11,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:11,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:11,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:11,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:11,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:11,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:11,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:11,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 15:45:11,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:11,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:11,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:11,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:11,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:11,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:11,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:45:11,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:11,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:11,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:11,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:11,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:11,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:11,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:11,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:45:11,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:11,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:11,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:11,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:11,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:11,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:11,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:11,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:45:11,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:11,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:11,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:11,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:11,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:11,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:11,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:11,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:45:11,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:11,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 15:45:11,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:11,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-21 15:45:11,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:11,996 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-07-21 15:45:11,997 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:45:11,997 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2088054951] [2022-07-21 15:45:11,997 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2088054951] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:45:11,997 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:45:11,997 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-21 15:45:11,997 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833496570] [2022-07-21 15:45:11,997 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:45:11,998 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 15:45:11,998 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:45:11,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 15:45:11,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-21 15:45:11,999 INFO L87 Difference]: Start difference. First operand 2056 states and 2788 transitions. Second operand has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-21 15:45:26,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:45:26,573 INFO L93 Difference]: Finished difference Result 5586 states and 8033 transitions. [2022-07-21 15:45:26,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 15:45:26,577 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 166 [2022-07-21 15:45:26,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:45:26,598 INFO L225 Difference]: With dead ends: 5586 [2022-07-21 15:45:26,599 INFO L226 Difference]: Without dead ends: 3676 [2022-07-21 15:45:26,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=404, Unknown=0, NotChecked=0, Total=506 [2022-07-21 15:45:26,607 INFO L413 NwaCegarLoop]: 1954 mSDtfsCounter, 4691 mSDsluCounter, 7217 mSDsCounter, 0 mSdLazyCounter, 9033 mSolverCounterSat, 2440 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4691 SdHoareTripleChecker+Valid, 9171 SdHoareTripleChecker+Invalid, 11473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2440 IncrementalHoareTripleChecker+Valid, 9033 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.8s IncrementalHoareTripleChecker+Time [2022-07-21 15:45:26,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4691 Valid, 9171 Invalid, 11473 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2440 Valid, 9033 Invalid, 0 Unknown, 0 Unchecked, 13.8s Time] [2022-07-21 15:45:26,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3676 states. [2022-07-21 15:45:26,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3676 to 2069. [2022-07-21 15:45:26,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2069 states, 1456 states have (on average 1.23489010989011) internal successors, (1798), 1506 states have internal predecessors, (1798), 448 states have call successors, (448), 134 states have call predecessors, (448), 143 states have return successors, (558), 439 states have call predecessors, (558), 446 states have call successors, (558) [2022-07-21 15:45:26,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2069 states to 2069 states and 2804 transitions. [2022-07-21 15:45:26,869 INFO L78 Accepts]: Start accepts. Automaton has 2069 states and 2804 transitions. Word has length 166 [2022-07-21 15:45:26,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:45:26,871 INFO L495 AbstractCegarLoop]: Abstraction has 2069 states and 2804 transitions. [2022-07-21 15:45:26,871 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 4.7272727272727275) internal successors, (52), 8 states have internal predecessors, (52), 3 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-21 15:45:26,871 INFO L276 IsEmpty]: Start isEmpty. Operand 2069 states and 2804 transitions. [2022-07-21 15:45:26,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-21 15:45:26,875 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:45:26,875 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:45:26,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 15:45:26,876 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_usb_dev_usb_put_devErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-21 15:45:26,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:45:26,876 INFO L85 PathProgramCache]: Analyzing trace with hash -241167825, now seen corresponding path program 1 times [2022-07-21 15:45:26,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:45:26,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763954137] [2022-07-21 15:45:26,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:45:26,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:45:26,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:27,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:45:27,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:27,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:45:27,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:27,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:45:27,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:27,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:45:27,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:27,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 15:45:27,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:27,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:27,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:27,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:27,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:27,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:27,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:27,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 15:45:27,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:27,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:27,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:27,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:27,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:27,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:27,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:27,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:45:27,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:27,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:27,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:27,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:27,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:27,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:27,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:27,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:45:27,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:27,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:27,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:27,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:27,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:27,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:27,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:45:27,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:27,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:27,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:27,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:27,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:27,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:27,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:27,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:45:27,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:27,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 15:45:27,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:27,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-21 15:45:27,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:27,193 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-07-21 15:45:27,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:45:27,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763954137] [2022-07-21 15:45:27,195 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763954137] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:45:27,195 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:45:27,195 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:45:27,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816260653] [2022-07-21 15:45:27,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:45:27,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:45:27,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:45:27,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:45:27,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:45:27,198 INFO L87 Difference]: Start difference. First operand 2069 states and 2804 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-21 15:45:32,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:45:32,358 INFO L93 Difference]: Finished difference Result 6551 states and 9859 transitions. [2022-07-21 15:45:32,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 15:45:32,359 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) Word has length 168 [2022-07-21 15:45:32,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:45:32,381 INFO L225 Difference]: With dead ends: 6551 [2022-07-21 15:45:32,381 INFO L226 Difference]: Without dead ends: 4535 [2022-07-21 15:45:32,393 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=122, Unknown=0, NotChecked=0, Total=182 [2022-07-21 15:45:32,394 INFO L413 NwaCegarLoop]: 1635 mSDtfsCounter, 4590 mSDsluCounter, 1866 mSDsCounter, 0 mSdLazyCounter, 2746 mSolverCounterSat, 2765 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4672 SdHoareTripleChecker+Valid, 3501 SdHoareTripleChecker+Invalid, 5511 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2765 IncrementalHoareTripleChecker+Valid, 2746 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-07-21 15:45:32,394 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4672 Valid, 3501 Invalid, 5511 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2765 Valid, 2746 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-07-21 15:45:32,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4535 states. [2022-07-21 15:45:32,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4535 to 4038. [2022-07-21 15:45:32,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4038 states, 2864 states have (on average 1.2416201117318435) internal successors, (3556), 2945 states have internal predecessors, (3556), 866 states have call successors, (866), 239 states have call predecessors, (866), 286 states have return successors, (1476), 873 states have call predecessors, (1476), 864 states have call successors, (1476) [2022-07-21 15:45:32,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4038 states to 4038 states and 5898 transitions. [2022-07-21 15:45:32,797 INFO L78 Accepts]: Start accepts. Automaton has 4038 states and 5898 transitions. Word has length 168 [2022-07-21 15:45:32,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:45:32,798 INFO L495 AbstractCegarLoop]: Abstraction has 4038 states and 5898 transitions. [2022-07-21 15:45:32,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 3 states have internal predecessors, (54), 3 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (15), 3 states have call predecessors, (15), 3 states have call successors, (15) [2022-07-21 15:45:32,798 INFO L276 IsEmpty]: Start isEmpty. Operand 4038 states and 5898 transitions. [2022-07-21 15:45:32,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-21 15:45:32,801 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:45:32,801 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:45:32,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-21 15:45:32,802 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_usb_dev_usb_put_devErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-21 15:45:32,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:45:32,802 INFO L85 PathProgramCache]: Analyzing trace with hash 2059654765, now seen corresponding path program 1 times [2022-07-21 15:45:32,802 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:45:32,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2053622621] [2022-07-21 15:45:32,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:45:32,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:45:32,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:32,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:45:32,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:32,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:45:32,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:32,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:45:32,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:32,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:45:32,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:32,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 15:45:32,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:32,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:32,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:32,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:32,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:32,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:32,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:32,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 15:45:32,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:32,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:32,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:32,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:32,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:33,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:33,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:33,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:45:33,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:33,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:33,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:33,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:33,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:33,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:33,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:33,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:45:33,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:33,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:33,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:33,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:33,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:33,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:33,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:33,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:45:33,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:33,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:33,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:33,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:33,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:33,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:33,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:33,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:45:33,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:33,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 15:45:33,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:33,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-21 15:45:33,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:33,092 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-07-21 15:45:33,093 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:45:33,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2053622621] [2022-07-21 15:45:33,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2053622621] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:45:33,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:45:33,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 15:45:33,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351150992] [2022-07-21 15:45:33,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:45:33,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 15:45:33,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:45:33,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 15:45:33,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 15:45:33,095 INFO L87 Difference]: Start difference. First operand 4038 states and 5898 transitions. Second operand has 8 states, 8 states have (on average 6.75) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-21 15:45:40,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:45:40,929 INFO L93 Difference]: Finished difference Result 8464 states and 12854 transitions. [2022-07-21 15:45:40,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 15:45:40,929 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 168 [2022-07-21 15:45:40,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:45:40,945 INFO L225 Difference]: With dead ends: 8464 [2022-07-21 15:45:40,945 INFO L226 Difference]: Without dead ends: 4537 [2022-07-21 15:45:40,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-07-21 15:45:40,961 INFO L413 NwaCegarLoop]: 2471 mSDtfsCounter, 2896 mSDsluCounter, 4161 mSDsCounter, 0 mSdLazyCounter, 6698 mSolverCounterSat, 2136 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2974 SdHoareTripleChecker+Valid, 6632 SdHoareTripleChecker+Invalid, 8834 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2136 IncrementalHoareTripleChecker+Valid, 6698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-07-21 15:45:40,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2974 Valid, 6632 Invalid, 8834 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2136 Valid, 6698 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2022-07-21 15:45:40,965 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4537 states. [2022-07-21 15:45:41,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4537 to 4034. [2022-07-21 15:45:41,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4034 states, 2858 states have (on average 1.2400279916025192) internal successors, (3544), 2941 states have internal predecessors, (3544), 866 states have call successors, (866), 239 states have call predecessors, (866), 288 states have return successors, (1479), 873 states have call predecessors, (1479), 864 states have call successors, (1479) [2022-07-21 15:45:41,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4034 states to 4034 states and 5889 transitions. [2022-07-21 15:45:41,361 INFO L78 Accepts]: Start accepts. Automaton has 4034 states and 5889 transitions. Word has length 168 [2022-07-21 15:45:41,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:45:41,362 INFO L495 AbstractCegarLoop]: Abstraction has 4034 states and 5889 transitions. [2022-07-21 15:45:41,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.75) internal successors, (54), 5 states have internal predecessors, (54), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-21 15:45:41,362 INFO L276 IsEmpty]: Start isEmpty. Operand 4034 states and 5889 transitions. [2022-07-21 15:45:41,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-21 15:45:41,365 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:45:41,365 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:45:41,365 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-21 15:45:41,366 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-21 15:45:41,366 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:45:41,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1284125422, now seen corresponding path program 1 times [2022-07-21 15:45:41,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:45:41,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910179013] [2022-07-21 15:45:41,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:45:41,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:45:41,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:41,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:45:41,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:41,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:45:41,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:41,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:45:41,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:41,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:45:41,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:41,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:45:41,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:41,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:45:41,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:41,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:45:41,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:41,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:41,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:41,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:45:41,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:41,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:45:41,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:41,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:45:41,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:41,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:45:41,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:41,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 15:45:41,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:41,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 15:45:41,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:41,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 15:45:41,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:41,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 15:45:41,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:41,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 15:45:41,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:41,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 15:45:41,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:41,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 15:45:41,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:41,611 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:45:41,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:45:41,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910179013] [2022-07-21 15:45:41,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910179013] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:45:41,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:45:41,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:45:41,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [439840157] [2022-07-21 15:45:41,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:45:41,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:45:41,613 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:45:41,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:45:41,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:45:41,613 INFO L87 Difference]: Start difference. First operand 4034 states and 5889 transitions. Second operand has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-21 15:45:44,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:45:44,116 INFO L93 Difference]: Finished difference Result 4034 states and 5889 transitions. [2022-07-21 15:45:44,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:45:44,117 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 4 states have internal predecessors, (77), 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 129 [2022-07-21 15:45:44,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:45:44,133 INFO L225 Difference]: With dead ends: 4034 [2022-07-21 15:45:44,133 INFO L226 Difference]: Without dead ends: 4032 [2022-07-21 15:45:44,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:45:44,138 INFO L413 NwaCegarLoop]: 1334 mSDtfsCounter, 2199 mSDsluCounter, 1285 mSDsCounter, 0 mSdLazyCounter, 1311 mSolverCounterSat, 920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2319 SdHoareTripleChecker+Valid, 2619 SdHoareTripleChecker+Invalid, 2231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 920 IncrementalHoareTripleChecker+Valid, 1311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2022-07-21 15:45:44,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2319 Valid, 2619 Invalid, 2231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [920 Valid, 1311 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2022-07-21 15:45:44,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4032 states. [2022-07-21 15:45:44,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4032 to 4032. [2022-07-21 15:45:44,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4032 states, 2857 states have (on average 1.239761988099405) internal successors, (3542), 2939 states have internal predecessors, (3542), 866 states have call successors, (866), 239 states have call predecessors, (866), 288 states have return successors, (1479), 873 states have call predecessors, (1479), 864 states have call successors, (1479) [2022-07-21 15:45:44,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4032 states to 4032 states and 5887 transitions. [2022-07-21 15:45:44,598 INFO L78 Accepts]: Start accepts. Automaton has 4032 states and 5887 transitions. Word has length 129 [2022-07-21 15:45:44,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:45:44,599 INFO L495 AbstractCegarLoop]: Abstraction has 4032 states and 5887 transitions. [2022-07-21 15:45:44,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.833333333333334) internal successors, (77), 4 states have internal predecessors, (77), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-21 15:45:44,599 INFO L276 IsEmpty]: Start isEmpty. Operand 4032 states and 5887 transitions. [2022-07-21 15:45:44,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-07-21 15:45:44,602 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:45:44,603 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:45:44,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-21 15:45:44,603 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_usb_dev_usb_put_devErr1ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-21 15:45:44,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:45:44,604 INFO L85 PathProgramCache]: Analyzing trace with hash -651550320, now seen corresponding path program 1 times [2022-07-21 15:45:44,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:45:44,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101294010] [2022-07-21 15:45:44,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:45:44,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:45:44,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:44,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:45:44,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:44,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:45:44,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:44,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:45:44,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:44,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:45:44,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:44,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 15:45:44,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:44,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:44,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:44,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:44,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:44,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:44,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:44,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 15:45:44,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:44,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:44,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:44,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:44,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:44,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:44,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:44,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:45:44,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:44,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:44,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:44,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:44,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:44,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:44,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:44,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:45:44,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:44,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:44,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:44,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:44,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:44,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:44,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:44,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:45:44,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:44,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:44,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:44,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:44,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:44,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:44,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:44,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:45:44,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:44,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 15:45:44,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:44,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-21 15:45:44,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:44,880 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-07-21 15:45:44,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:45:44,881 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101294010] [2022-07-21 15:45:44,881 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101294010] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:45:44,881 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:45:44,881 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 15:45:44,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099979211] [2022-07-21 15:45:44,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:45:44,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 15:45:44,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:45:44,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 15:45:44,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-21 15:45:44,883 INFO L87 Difference]: Start difference. First operand 4032 states and 5887 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-21 15:45:53,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:45:53,514 INFO L93 Difference]: Finished difference Result 4533 states and 6617 transitions. [2022-07-21 15:45:53,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 15:45:53,515 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 170 [2022-07-21 15:45:53,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:45:53,536 INFO L225 Difference]: With dead ends: 4533 [2022-07-21 15:45:53,537 INFO L226 Difference]: Without dead ends: 4531 [2022-07-21 15:45:53,540 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=244, Unknown=0, NotChecked=0, Total=342 [2022-07-21 15:45:53,541 INFO L413 NwaCegarLoop]: 2464 mSDtfsCounter, 3881 mSDsluCounter, 4161 mSDsCounter, 0 mSdLazyCounter, 6718 mSolverCounterSat, 2685 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3959 SdHoareTripleChecker+Valid, 6625 SdHoareTripleChecker+Invalid, 9403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2685 IncrementalHoareTripleChecker+Valid, 6718 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:45:53,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3959 Valid, 6625 Invalid, 9403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2685 Valid, 6718 Invalid, 0 Unknown, 0 Unchecked, 8.0s Time] [2022-07-21 15:45:53,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4531 states. [2022-07-21 15:45:53,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4531 to 4036. [2022-07-21 15:45:53,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4036 states, 2861 states have (on average 1.2394267738552953) internal successors, (3546), 2943 states have internal predecessors, (3546), 866 states have call successors, (866), 239 states have call predecessors, (866), 288 states have return successors, (1479), 873 states have call predecessors, (1479), 864 states have call successors, (1479) [2022-07-21 15:45:53,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4036 states to 4036 states and 5891 transitions. [2022-07-21 15:45:53,962 INFO L78 Accepts]: Start accepts. Automaton has 4036 states and 5891 transitions. Word has length 170 [2022-07-21 15:45:53,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:45:53,963 INFO L495 AbstractCegarLoop]: Abstraction has 4036 states and 5891 transitions. [2022-07-21 15:45:53,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 6 states have internal predecessors, (56), 2 states have call successors, (16), 5 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-21 15:45:53,963 INFO L276 IsEmpty]: Start isEmpty. Operand 4036 states and 5891 transitions. [2022-07-21 15:45:53,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-07-21 15:45:53,967 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:45:53,967 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:45:53,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-21 15:45:53,967 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-21 15:45:53,968 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:45:53,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1121977116, now seen corresponding path program 1 times [2022-07-21 15:45:53,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:45:53,968 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767872221] [2022-07-21 15:45:53,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:45:53,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:45:54,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:54,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:45:54,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:54,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:45:54,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:54,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:45:54,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:54,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:45:54,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:54,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 15:45:54,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:54,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:54,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:54,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:54,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:54,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:54,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:54,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 15:45:54,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:54,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:54,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:54,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:54,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:54,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:54,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:54,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:45:54,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:54,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:54,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:54,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:54,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:54,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:54,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:54,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:45:54,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:54,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:54,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:54,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:54,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:54,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:54,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:54,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:45:54,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:54,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:54,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:54,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:54,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:54,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:54,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:45:54,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:54,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 15:45:54,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:54,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-21 15:45:54,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:54,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-21 15:45:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:54,305 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-07-21 15:45:54,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:45:54,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767872221] [2022-07-21 15:45:54,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767872221] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:45:54,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:45:54,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 15:45:54,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367484122] [2022-07-21 15:45:54,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:45:54,308 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 15:45:54,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:45:54,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 15:45:54,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 15:45:54,309 INFO L87 Difference]: Start difference. First operand 4036 states and 5891 transitions. Second operand has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-21 15:45:57,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:45:57,373 INFO L93 Difference]: Finished difference Result 8345 states and 12444 transitions. [2022-07-21 15:45:57,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 15:45:57,375 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 172 [2022-07-21 15:45:57,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:45:57,397 INFO L225 Difference]: With dead ends: 8345 [2022-07-21 15:45:57,398 INFO L226 Difference]: Without dead ends: 4510 [2022-07-21 15:45:57,414 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-07-21 15:45:57,415 INFO L413 NwaCegarLoop]: 1182 mSDtfsCounter, 3912 mSDsluCounter, 1482 mSDsCounter, 0 mSdLazyCounter, 1456 mSolverCounterSat, 2163 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4107 SdHoareTripleChecker+Valid, 2664 SdHoareTripleChecker+Invalid, 3619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2163 IncrementalHoareTripleChecker+Valid, 1456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2022-07-21 15:45:57,415 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4107 Valid, 2664 Invalid, 3619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2163 Valid, 1456 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-07-21 15:45:57,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4510 states. [2022-07-21 15:45:57,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4510 to 4050. [2022-07-21 15:45:57,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4050 states, 2894 states have (on average 1.2398064961990325) internal successors, (3588), 2958 states have internal predecessors, (3588), 839 states have call successors, (839), 239 states have call predecessors, (839), 297 states have return successors, (1568), 874 states have call predecessors, (1568), 837 states have call successors, (1568) [2022-07-21 15:45:57,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4050 states to 4050 states and 5995 transitions. [2022-07-21 15:45:57,867 INFO L78 Accepts]: Start accepts. Automaton has 4050 states and 5995 transitions. Word has length 172 [2022-07-21 15:45:57,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:45:57,867 INFO L495 AbstractCegarLoop]: Abstraction has 4050 states and 5995 transitions. [2022-07-21 15:45:57,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.142857142857142) internal successors, (57), 3 states have internal predecessors, (57), 2 states have call successors, (16), 5 states have call predecessors, (16), 2 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-21 15:45:57,868 INFO L276 IsEmpty]: Start isEmpty. Operand 4050 states and 5995 transitions. [2022-07-21 15:45:57,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-21 15:45:57,872 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:45:57,872 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:45:57,872 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-21 15:45:57,873 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-21 15:45:57,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:45:57,873 INFO L85 PathProgramCache]: Analyzing trace with hash 155784661, now seen corresponding path program 1 times [2022-07-21 15:45:57,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:45:57,873 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563880258] [2022-07-21 15:45:57,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:45:57,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:45:57,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:57,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:45:57,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:57,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:45:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:58,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:45:58,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:58,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:45:58,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:58,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:45:58,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:58,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:45:58,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:58,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:45:58,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:58,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:58,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:58,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:45:58,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:58,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:45:58,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:58,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:45:58,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:58,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:45:58,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:58,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 15:45:58,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:58,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 15:45:58,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:58,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 15:45:58,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:58,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 15:45:58,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:58,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 15:45:58,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:58,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 15:45:58,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:58,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 15:45:58,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:58,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 15:45:58,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:58,107 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:45:58,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:45:58,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563880258] [2022-07-21 15:45:58,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563880258] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:45:58,108 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:45:58,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:45:58,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354050098] [2022-07-21 15:45:58,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:45:58,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:45:58,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:45:58,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:45:58,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:45:58,111 INFO L87 Difference]: Start difference. First operand 4050 states and 5995 transitions. Second operand has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-21 15:46:00,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:46:00,495 INFO L93 Difference]: Finished difference Result 4050 states and 5995 transitions. [2022-07-21 15:46:00,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:46:00,497 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 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 135 [2022-07-21 15:46:00,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:46:00,512 INFO L225 Difference]: With dead ends: 4050 [2022-07-21 15:46:00,512 INFO L226 Difference]: Without dead ends: 4048 [2022-07-21 15:46:00,515 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:46:00,515 INFO L413 NwaCegarLoop]: 1327 mSDtfsCounter, 2188 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 1308 mSolverCounterSat, 920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2307 SdHoareTripleChecker+Valid, 2598 SdHoareTripleChecker+Invalid, 2228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 920 IncrementalHoareTripleChecker+Valid, 1308 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:46:00,516 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2307 Valid, 2598 Invalid, 2228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [920 Valid, 1308 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-21 15:46:00,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4048 states. [2022-07-21 15:46:00,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4048 to 4048. [2022-07-21 15:46:00,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4048 states, 2893 states have (on average 1.2395437262357414) internal successors, (3586), 2956 states have internal predecessors, (3586), 839 states have call successors, (839), 239 states have call predecessors, (839), 297 states have return successors, (1568), 874 states have call predecessors, (1568), 837 states have call successors, (1568) [2022-07-21 15:46:00,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4048 states to 4048 states and 5993 transitions. [2022-07-21 15:46:00,961 INFO L78 Accepts]: Start accepts. Automaton has 4048 states and 5993 transitions. Word has length 135 [2022-07-21 15:46:00,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:46:00,961 INFO L495 AbstractCegarLoop]: Abstraction has 4048 states and 5993 transitions. [2022-07-21 15:46:00,961 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.5) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-21 15:46:00,962 INFO L276 IsEmpty]: Start isEmpty. Operand 4048 states and 5993 transitions. [2022-07-21 15:46:00,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-07-21 15:46:00,966 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:46:00,966 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:46:00,966 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-21 15:46:00,966 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-21 15:46:00,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:46:00,967 INFO L85 PathProgramCache]: Analyzing trace with hash 359029675, now seen corresponding path program 1 times [2022-07-21 15:46:00,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:46:00,967 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563887923] [2022-07-21 15:46:00,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:46:00,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:46:01,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:01,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:46:01,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:01,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:46:01,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:01,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:46:01,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:01,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:46:01,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:01,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 15:46:01,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:01,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:01,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:01,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:46:01,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:01,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:46:01,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:01,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 15:46:01,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:01,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:01,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:01,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:46:01,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:01,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:46:01,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:01,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:46:01,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:01,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:01,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:01,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:46:01,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:01,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:46:01,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:01,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:46:01,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:01,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:01,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:01,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:46:01,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:01,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:46:01,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:01,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:46:01,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:01,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:01,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:01,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:46:01,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:01,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:46:01,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:01,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:46:01,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:01,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 15:46:01,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:01,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-21 15:46:01,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:01,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-21 15:46:01,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:01,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-21 15:46:01,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:01,308 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 378 trivial. 0 not checked. [2022-07-21 15:46:01,309 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:46:01,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563887923] [2022-07-21 15:46:01,309 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563887923] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:46:01,309 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [328132910] [2022-07-21 15:46:01,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:46:01,310 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:46:01,310 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:46:01,315 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-21 15:46:01,342 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-21 15:46:02,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:02,094 INFO L263 TraceCheckSpWp]: Trace formula consists of 2117 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 15:46:02,109 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 15:46:02,172 INFO L134 CoverageAnalysis]: Checked inductivity of 380 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-07-21 15:46:02,172 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 15:46:02,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [328132910] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:46:02,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 15:46:02,173 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-07-21 15:46:02,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377092951] [2022-07-21 15:46:02,173 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:46:02,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 15:46:02,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:46:02,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 15:46:02,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-21 15:46:02,174 INFO L87 Difference]: Start difference. First operand 4048 states and 5993 transitions. Second operand has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-21 15:46:02,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:46:02,513 INFO L93 Difference]: Finished difference Result 7931 states and 11700 transitions. [2022-07-21 15:46:02,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 15:46:02,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 178 [2022-07-21 15:46:02,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:46:02,534 INFO L225 Difference]: With dead ends: 7931 [2022-07-21 15:46:02,534 INFO L226 Difference]: Without dead ends: 4096 [2022-07-21 15:46:02,552 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 231 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-21 15:46:02,554 INFO L413 NwaCegarLoop]: 1498 mSDtfsCounter, 1397 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1397 SdHoareTripleChecker+Valid, 1568 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:46:02,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1397 Valid, 1568 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 15:46:02,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4096 states. [2022-07-21 15:46:03,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4096 to 4093. [2022-07-21 15:46:03,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4093 states, 2918 states have (on average 1.2361206305688828) internal successors, (3607), 2984 states have internal predecessors, (3607), 854 states have call successors, (854), 245 states have call predecessors, (854), 303 states have return successors, (1583), 887 states have call predecessors, (1583), 852 states have call successors, (1583) [2022-07-21 15:46:03,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4093 states to 4093 states and 6044 transitions. [2022-07-21 15:46:03,085 INFO L78 Accepts]: Start accepts. Automaton has 4093 states and 6044 transitions. Word has length 178 [2022-07-21 15:46:03,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:46:03,086 INFO L495 AbstractCegarLoop]: Abstraction has 4093 states and 6044 transitions. [2022-07-21 15:46:03,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 20.333333333333332) internal successors, (61), 3 states have internal predecessors, (61), 2 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-21 15:46:03,086 INFO L276 IsEmpty]: Start isEmpty. Operand 4093 states and 6044 transitions. [2022-07-21 15:46:03,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-21 15:46:03,090 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:46:03,091 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:46:03,123 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-21 15:46:03,307 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,SelfDestructingSolverStorable21 [2022-07-21 15:46:03,308 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-21 15:46:03,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:46:03,308 INFO L85 PathProgramCache]: Analyzing trace with hash -116780528, now seen corresponding path program 1 times [2022-07-21 15:46:03,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:46:03,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446072428] [2022-07-21 15:46:03,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:46:03,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:46:03,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:03,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:46:03,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:03,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:46:03,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:03,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:46:03,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:03,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:46:03,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:03,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:46:03,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:03,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:46:03,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:03,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:46:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:03,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:03,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:46:03,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:03,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:46:03,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:03,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:46:03,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:03,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:46:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:03,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 15:46:03,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:03,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 15:46:03,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:03,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 15:46:03,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:03,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 15:46:03,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:03,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 15:46:03,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:03,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 15:46:03,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:03,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 15:46:03,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:03,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 15:46:03,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:03,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-21 15:46:03,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:03,626 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:46:03,626 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:46:03,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446072428] [2022-07-21 15:46:03,627 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446072428] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:46:03,627 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:46:03,627 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:46:03,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1695198811] [2022-07-21 15:46:03,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:46:03,628 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:46:03,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:46:03,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:46:03,628 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:46:03,628 INFO L87 Difference]: Start difference. First operand 4093 states and 6044 transitions. Second operand has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-21 15:46:06,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:46:06,283 INFO L93 Difference]: Finished difference Result 4093 states and 6044 transitions. [2022-07-21 15:46:06,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:46:06,283 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (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 141 [2022-07-21 15:46:06,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:46:06,300 INFO L225 Difference]: With dead ends: 4093 [2022-07-21 15:46:06,301 INFO L226 Difference]: Without dead ends: 4091 [2022-07-21 15:46:06,304 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:46:06,308 INFO L413 NwaCegarLoop]: 1320 mSDtfsCounter, 2177 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 1305 mSolverCounterSat, 920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2295 SdHoareTripleChecker+Valid, 2577 SdHoareTripleChecker+Invalid, 2225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 920 IncrementalHoareTripleChecker+Valid, 1305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-21 15:46:06,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2295 Valid, 2577 Invalid, 2225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [920 Valid, 1305 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-21 15:46:06,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4091 states. [2022-07-21 15:46:06,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4091 to 4091. [2022-07-21 15:46:06,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4091 states, 2917 states have (on average 1.2358587589989716) internal successors, (3605), 2982 states have internal predecessors, (3605), 854 states have call successors, (854), 245 states have call predecessors, (854), 303 states have return successors, (1583), 887 states have call predecessors, (1583), 852 states have call successors, (1583) [2022-07-21 15:46:06,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4091 states to 4091 states and 6042 transitions. [2022-07-21 15:46:06,746 INFO L78 Accepts]: Start accepts. Automaton has 4091 states and 6042 transitions. Word has length 141 [2022-07-21 15:46:06,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:46:06,746 INFO L495 AbstractCegarLoop]: Abstraction has 4091 states and 6042 transitions. [2022-07-21 15:46:06,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.166666666666666) internal successors, (85), 4 states have internal predecessors, (85), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-21 15:46:06,746 INFO L276 IsEmpty]: Start isEmpty. Operand 4091 states and 6042 transitions. [2022-07-21 15:46:06,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-21 15:46:06,751 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:46:06,751 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:46:06,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-21 15:46:06,751 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting destroy_asyncErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-21 15:46:06,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:46:06,752 INFO L85 PathProgramCache]: Analyzing trace with hash 208514548, now seen corresponding path program 1 times [2022-07-21 15:46:06,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:46:06,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068952436] [2022-07-21 15:46:06,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:46:06,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:46:06,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:06,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:46:06,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:06,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:46:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:06,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:46:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:06,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:46:06,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:06,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:46:06,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:06,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:46:06,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:06,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:46:06,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:06,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:06,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:06,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:46:07,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:07,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:46:07,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:07,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 15:46:07,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:07,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:46:07,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:07,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:07,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:07,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:46:07,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:07,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:46:07,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:07,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:46:07,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:07,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 15:46:07,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:07,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 15:46:07,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:07,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-21 15:46:07,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:07,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-21 15:46:07,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:07,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-21 15:46:07,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:07,140 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2022-07-21 15:46:07,140 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:46:07,140 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068952436] [2022-07-21 15:46:07,141 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2068952436] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:46:07,141 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:46:07,141 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 15:46:07,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709676352] [2022-07-21 15:46:07,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:46:07,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 15:46:07,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:46:07,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 15:46:07,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-21 15:46:07,143 INFO L87 Difference]: Start difference. First operand 4091 states and 6042 transitions. Second operand has 9 states, 9 states have (on average 9.0) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (26), 6 states have call predecessors, (26), 2 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-21 15:46:13,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:46:13,940 INFO L93 Difference]: Finished difference Result 8600 states and 14385 transitions. [2022-07-21 15:46:13,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-21 15:46:13,942 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (26), 6 states have call predecessors, (26), 2 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) Word has length 157 [2022-07-21 15:46:13,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:46:13,964 INFO L225 Difference]: With dead ends: 8600 [2022-07-21 15:46:13,965 INFO L226 Difference]: Without dead ends: 4677 [2022-07-21 15:46:13,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2022-07-21 15:46:13,990 INFO L413 NwaCegarLoop]: 1295 mSDtfsCounter, 1765 mSDsluCounter, 2947 mSDsCounter, 0 mSdLazyCounter, 4623 mSolverCounterSat, 1367 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1765 SdHoareTripleChecker+Valid, 4242 SdHoareTripleChecker+Invalid, 5990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1367 IncrementalHoareTripleChecker+Valid, 4623 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:46:13,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1765 Valid, 4242 Invalid, 5990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1367 Valid, 4623 Invalid, 0 Unknown, 0 Unchecked, 6.0s Time] [2022-07-21 15:46:13,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4677 states. [2022-07-21 15:46:14,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4677 to 4097. [2022-07-21 15:46:14,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4097 states, 2925 states have (on average 1.2338461538461538) internal successors, (3609), 2984 states have internal predecessors, (3609), 852 states have call successors, (852), 245 states have call predecessors, (852), 303 states have return successors, (1577), 891 states have call predecessors, (1577), 850 states have call successors, (1577) [2022-07-21 15:46:14,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4097 states to 4097 states and 6038 transitions. [2022-07-21 15:46:14,499 INFO L78 Accepts]: Start accepts. Automaton has 4097 states and 6038 transitions. Word has length 157 [2022-07-21 15:46:14,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:46:14,500 INFO L495 AbstractCegarLoop]: Abstraction has 4097 states and 6038 transitions. [2022-07-21 15:46:14,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 9.0) internal successors, (81), 4 states have internal predecessors, (81), 2 states have call successors, (26), 6 states have call predecessors, (26), 2 states have return successors, (21), 3 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-21 15:46:14,500 INFO L276 IsEmpty]: Start isEmpty. Operand 4097 states and 6038 transitions. [2022-07-21 15:46:14,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-21 15:46:14,504 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:46:14,504 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:46:14,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-21 15:46:14,505 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-21 15:46:14,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:46:14,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1703019388, now seen corresponding path program 1 times [2022-07-21 15:46:14,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:46:14,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099731306] [2022-07-21 15:46:14,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:46:14,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:46:14,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:46:14,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:46:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:46:14,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:46:14,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:46:14,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:46:14,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:46:14,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:14,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:46:14,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:46:14,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:46:14,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:46:14,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 15:46:14,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 15:46:14,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 15:46:14,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 15:46:14,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 15:46:14,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 15:46:14,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 15:46:14,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 15:46:14,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-21 15:46:14,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:46:14,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:14,775 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:46:14,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:46:14,775 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099731306] [2022-07-21 15:46:14,775 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099731306] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:46:14,775 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:46:14,776 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:46:14,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635511023] [2022-07-21 15:46:14,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:46:14,776 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:46:14,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:46:14,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:46:14,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:46:14,777 INFO L87 Difference]: Start difference. First operand 4097 states and 6038 transitions. Second operand has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-21 15:46:17,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:46:17,008 INFO L93 Difference]: Finished difference Result 4097 states and 6038 transitions. [2022-07-21 15:46:17,008 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:46:17,009 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 4 states have internal predecessors, (89), 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 147 [2022-07-21 15:46:17,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:46:17,022 INFO L225 Difference]: With dead ends: 4097 [2022-07-21 15:46:17,022 INFO L226 Difference]: Without dead ends: 4095 [2022-07-21 15:46:17,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:46:17,025 INFO L413 NwaCegarLoop]: 1318 mSDtfsCounter, 2171 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2288 SdHoareTripleChecker+Valid, 2575 SdHoareTripleChecker+Invalid, 2223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 920 IncrementalHoareTripleChecker+Valid, 1303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-21 15:46:17,025 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2288 Valid, 2575 Invalid, 2223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [920 Valid, 1303 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-21 15:46:17,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4095 states. [2022-07-21 15:46:17,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4095 to 4095. [2022-07-21 15:46:17,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4095 states, 2924 states have (on average 1.2335841313269493) internal successors, (3607), 2982 states have internal predecessors, (3607), 852 states have call successors, (852), 245 states have call predecessors, (852), 303 states have return successors, (1577), 891 states have call predecessors, (1577), 850 states have call successors, (1577) [2022-07-21 15:46:17,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4095 states to 4095 states and 6036 transitions. [2022-07-21 15:46:17,492 INFO L78 Accepts]: Start accepts. Automaton has 4095 states and 6036 transitions. Word has length 147 [2022-07-21 15:46:17,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:46:17,492 INFO L495 AbstractCegarLoop]: Abstraction has 4095 states and 6036 transitions. [2022-07-21 15:46:17,493 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.833333333333334) internal successors, (89), 4 states have internal predecessors, (89), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-21 15:46:17,493 INFO L276 IsEmpty]: Start isEmpty. Operand 4095 states and 6036 transitions. [2022-07-21 15:46:17,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-21 15:46:17,496 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:46:17,497 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:46:17,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-21 15:46:17,497 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-21 15:46:17,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:46:17,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1018861834, now seen corresponding path program 1 times [2022-07-21 15:46:17,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:46:17,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572317229] [2022-07-21 15:46:17,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:46:17,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:46:17,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:46:17,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:46:17,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:46:17,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:46:17,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:46:17,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:46:17,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:46:17,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:17,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:46:17,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:46:17,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:46:17,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:46:17,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 15:46:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 15:46:17,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 15:46:17,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 15:46:17,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 15:46:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 15:46:17,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 15:46:17,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 15:46:17,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-21 15:46:17,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:46:17,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-21 15:46:17,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,736 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:46:17,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:46:17,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572317229] [2022-07-21 15:46:17,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572317229] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:46:17,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:46:17,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:46:17,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996910844] [2022-07-21 15:46:17,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:46:17,737 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:46:17,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:46:17,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:46:17,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:46:17,739 INFO L87 Difference]: Start difference. First operand 4095 states and 6036 transitions. Second operand has 6 states, 6 states have (on average 15.5) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-21 15:46:19,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:46:19,919 INFO L93 Difference]: Finished difference Result 4095 states and 6036 transitions. [2022-07-21 15:46:19,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:46:19,920 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 4 states have internal predecessors, (93), 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 153 [2022-07-21 15:46:19,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:46:19,932 INFO L225 Difference]: With dead ends: 4095 [2022-07-21 15:46:19,932 INFO L226 Difference]: Without dead ends: 4093 [2022-07-21 15:46:19,934 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:46:19,935 INFO L413 NwaCegarLoop]: 1316 mSDtfsCounter, 2165 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 1301 mSolverCounterSat, 920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2281 SdHoareTripleChecker+Valid, 2573 SdHoareTripleChecker+Invalid, 2221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 920 IncrementalHoareTripleChecker+Valid, 1301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-21 15:46:19,935 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2281 Valid, 2573 Invalid, 2221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [920 Valid, 1301 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-21 15:46:19,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4093 states. [2022-07-21 15:46:20,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4093 to 4093. [2022-07-21 15:46:20,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4093 states, 2923 states have (on average 1.233321929524461) internal successors, (3605), 2980 states have internal predecessors, (3605), 852 states have call successors, (852), 245 states have call predecessors, (852), 303 states have return successors, (1577), 891 states have call predecessors, (1577), 850 states have call successors, (1577) [2022-07-21 15:46:20,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4093 states to 4093 states and 6034 transitions. [2022-07-21 15:46:20,351 INFO L78 Accepts]: Start accepts. Automaton has 4093 states and 6034 transitions. Word has length 153 [2022-07-21 15:46:20,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:46:20,351 INFO L495 AbstractCegarLoop]: Abstraction has 4093 states and 6034 transitions. [2022-07-21 15:46:20,352 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.5) internal successors, (93), 4 states have internal predecessors, (93), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-21 15:46:20,352 INFO L276 IsEmpty]: Start isEmpty. Operand 4093 states and 6034 transitions. [2022-07-21 15:46:20,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2022-07-21 15:46:20,355 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:46:20,356 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:46:20,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-21 15:46:20,356 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_linux_usb_dev_usb_put_devErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-21 15:46:20,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:46:20,357 INFO L85 PathProgramCache]: Analyzing trace with hash 1974944495, now seen corresponding path program 1 times [2022-07-21 15:46:20,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:46:20,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [9533379] [2022-07-21 15:46:20,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:46:20,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:46:20,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:46:20,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:46:20,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:46:20,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:46:20,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 15:46:20,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:20,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:46:20,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:46:20,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 15:46:20,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:20,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:46:20,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:46:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:46:20,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:20,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:46:20,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:46:20,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:46:20,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:46:20,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:46:20,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:46:20,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:20,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:46:20,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:46:20,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:20,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:46:20,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:21,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 15:46:21,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:21,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-21 15:46:21,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:21,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-21 15:46:21,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:21,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-21 15:46:21,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:21,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:21,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:21,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:21,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:21,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:21,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:21,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 15:46:21,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:21,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:46:21,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:21,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:21,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:21,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:46:21,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:21,143 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2022-07-21 15:46:21,143 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:46:21,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [9533379] [2022-07-21 15:46:21,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [9533379] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:46:21,144 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:46:21,144 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-21 15:46:21,144 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652358956] [2022-07-21 15:46:21,144 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:46:21,145 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 15:46:21,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:46:21,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 15:46:21,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-21 15:46:21,146 INFO L87 Difference]: Start difference. First operand 4093 states and 6034 transitions. Second operand has 13 states, 12 states have (on average 7.0) internal successors, (84), 8 states have internal predecessors, (84), 3 states have call successors, (25), 6 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-21 15:46:46,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:46:46,125 INFO L93 Difference]: Finished difference Result 8171 states and 12662 transitions. [2022-07-21 15:46:46,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 15:46:46,131 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 7.0) internal successors, (84), 8 states have internal predecessors, (84), 3 states have call successors, (25), 6 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 220 [2022-07-21 15:46:46,131 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:46:46,155 INFO L225 Difference]: With dead ends: 8171 [2022-07-21 15:46:46,155 INFO L226 Difference]: Without dead ends: 6023 [2022-07-21 15:46:46,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=121, Invalid=479, Unknown=0, NotChecked=0, Total=600 [2022-07-21 15:46:46,165 INFO L413 NwaCegarLoop]: 2404 mSDtfsCounter, 3722 mSDsluCounter, 9746 mSDsCounter, 0 mSdLazyCounter, 9312 mSolverCounterSat, 2757 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3722 SdHoareTripleChecker+Valid, 12150 SdHoareTripleChecker+Invalid, 12069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2757 IncrementalHoareTripleChecker+Valid, 9312 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.5s IncrementalHoareTripleChecker+Time [2022-07-21 15:46:46,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3722 Valid, 12150 Invalid, 12069 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2757 Valid, 9312 Invalid, 0 Unknown, 0 Unchecked, 23.5s Time] [2022-07-21 15:46:46,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6023 states. [2022-07-21 15:46:46,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6023 to 4105. [2022-07-21 15:46:46,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4105 states, 2934 states have (on average 1.2338104976141786) internal successors, (3620), 2987 states have internal predecessors, (3620), 848 states have call successors, (848), 246 states have call predecessors, (848), 308 states have return successors, (1572), 895 states have call predecessors, (1572), 846 states have call successors, (1572) [2022-07-21 15:46:46,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4105 states to 4105 states and 6040 transitions. [2022-07-21 15:46:46,698 INFO L78 Accepts]: Start accepts. Automaton has 4105 states and 6040 transitions. Word has length 220 [2022-07-21 15:46:46,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:46:46,698 INFO L495 AbstractCegarLoop]: Abstraction has 4105 states and 6040 transitions. [2022-07-21 15:46:46,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 7.0) internal successors, (84), 8 states have internal predecessors, (84), 3 states have call successors, (25), 6 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-21 15:46:46,698 INFO L276 IsEmpty]: Start isEmpty. Operand 4105 states and 6040 transitions. [2022-07-21 15:46:46,701 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-07-21 15:46:46,701 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:46:46,701 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:46:46,701 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-21 15:46:46,701 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-21 15:46:46,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:46:46,701 INFO L85 PathProgramCache]: Analyzing trace with hash 546814783, now seen corresponding path program 1 times [2022-07-21 15:46:46,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:46:46,702 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104334430] [2022-07-21 15:46:46,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:46:46,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:46:46,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:46,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:46:46,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:46,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:46:46,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:46,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:46:46,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:46,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:46:46,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:46,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:46:46,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:46,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:46:46,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:46,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:46:46,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:46,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:46,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:46,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:46:46,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:46,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:46:46,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:46,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:46:46,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:46,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:46:46,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:46,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 15:46:46,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:46,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 15:46:46,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:46,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 15:46:46,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:46,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 15:46:46,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:46,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 15:46:46,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:46,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 15:46:46,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:46,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 15:46:46,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:46,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 15:46:46,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:46,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-21 15:46:46,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:46,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:46:46,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:46,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-21 15:46:46,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:46,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-21 15:46:46,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:46,940 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:46:46,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:46:46,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104334430] [2022-07-21 15:46:46,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104334430] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:46:46,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:46:46,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:46:46,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651563265] [2022-07-21 15:46:46,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:46:46,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:46:46,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:46:46,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:46:46,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:46:46,942 INFO L87 Difference]: Start difference. First operand 4105 states and 6040 transitions. Second operand has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-21 15:46:49,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:46:49,147 INFO L93 Difference]: Finished difference Result 4105 states and 6040 transitions. [2022-07-21 15:46:49,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:46:49,147 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 4 states have internal predecessors, (97), 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 159 [2022-07-21 15:46:49,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:46:49,161 INFO L225 Difference]: With dead ends: 4105 [2022-07-21 15:46:49,161 INFO L226 Difference]: Without dead ends: 4103 [2022-07-21 15:46:49,163 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-21 15:46:49,164 INFO L413 NwaCegarLoop]: 1314 mSDtfsCounter, 2159 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 1299 mSolverCounterSat, 920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2274 SdHoareTripleChecker+Valid, 2571 SdHoareTripleChecker+Invalid, 2219 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 920 IncrementalHoareTripleChecker+Valid, 1299 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-21 15:46:49,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2274 Valid, 2571 Invalid, 2219 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [920 Valid, 1299 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-21 15:46:49,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4103 states. [2022-07-21 15:46:49,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4103 to 4103. [2022-07-21 15:46:49,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4103 states, 2933 states have (on average 1.2335492669621548) internal successors, (3618), 2985 states have internal predecessors, (3618), 848 states have call successors, (848), 246 states have call predecessors, (848), 308 states have return successors, (1572), 895 states have call predecessors, (1572), 846 states have call successors, (1572) [2022-07-21 15:46:49,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4103 states to 4103 states and 6038 transitions. [2022-07-21 15:46:49,659 INFO L78 Accepts]: Start accepts. Automaton has 4103 states and 6038 transitions. Word has length 159 [2022-07-21 15:46:49,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:46:49,660 INFO L495 AbstractCegarLoop]: Abstraction has 4103 states and 6038 transitions. [2022-07-21 15:46:49,660 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.166666666666668) internal successors, (97), 4 states have internal predecessors, (97), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-21 15:46:49,660 INFO L276 IsEmpty]: Start isEmpty. Operand 4103 states and 6038 transitions. [2022-07-21 15:46:49,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-07-21 15:46:49,663 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:46:49,663 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:46:49,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-21 15:46:49,663 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-21 15:46:49,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:46:49,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1102846129, now seen corresponding path program 1 times [2022-07-21 15:46:49,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:46:49,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1153275503] [2022-07-21 15:46:49,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:46:49,664 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:46:49,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:49,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:46:49,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:49,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:46:49,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:49,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:46:49,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:49,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:46:49,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:49,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:46:49,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:49,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:46:49,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:49,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:46:49,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:49,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:49,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:49,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:46:49,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:49,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:46:49,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:49,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:46:49,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:49,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:46:49,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:49,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 15:46:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:49,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 15:46:49,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:49,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 15:46:49,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:49,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 15:46:49,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:49,843 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 15:46:49,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:49,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 15:46:49,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:49,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 15:46:49,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:49,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 15:46:49,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:49,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-21 15:46:49,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:49,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:46:49,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:49,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-21 15:46:49,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:49,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-21 15:46:49,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:49,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-21 15:46:49,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:49,892 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:46:49,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:46:49,892 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1153275503] [2022-07-21 15:46:49,892 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1153275503] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:46:49,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:46:49,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:46:49,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243269148] [2022-07-21 15:46:49,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:46:49,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:46:49,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:46:49,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:46:49,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:46:49,895 INFO L87 Difference]: Start difference. First operand 4103 states and 6038 transitions. Second operand has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-21 15:46:52,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:46:52,094 INFO L93 Difference]: Finished difference Result 4103 states and 6038 transitions. [2022-07-21 15:46:52,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:46:52,094 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 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 165 [2022-07-21 15:46:52,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:46:52,108 INFO L225 Difference]: With dead ends: 4103 [2022-07-21 15:46:52,109 INFO L226 Difference]: Without dead ends: 4101 [2022-07-21 15:46:52,111 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:46:52,112 INFO L413 NwaCegarLoop]: 1312 mSDtfsCounter, 2153 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 1297 mSolverCounterSat, 920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2267 SdHoareTripleChecker+Valid, 2569 SdHoareTripleChecker+Invalid, 2217 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 920 IncrementalHoareTripleChecker+Valid, 1297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-21 15:46:52,112 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2267 Valid, 2569 Invalid, 2217 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [920 Valid, 1297 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-21 15:46:52,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4101 states. [2022-07-21 15:46:52,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4101 to 4101. [2022-07-21 15:46:52,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4101 states, 2932 states have (on average 1.233287858117326) internal successors, (3616), 2983 states have internal predecessors, (3616), 848 states have call successors, (848), 246 states have call predecessors, (848), 308 states have return successors, (1572), 895 states have call predecessors, (1572), 846 states have call successors, (1572) [2022-07-21 15:46:52,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4101 states to 4101 states and 6036 transitions. [2022-07-21 15:46:52,598 INFO L78 Accepts]: Start accepts. Automaton has 4101 states and 6036 transitions. Word has length 165 [2022-07-21 15:46:52,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:46:52,598 INFO L495 AbstractCegarLoop]: Abstraction has 4101 states and 6036 transitions. [2022-07-21 15:46:52,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.833333333333332) internal successors, (101), 4 states have internal predecessors, (101), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-21 15:46:52,599 INFO L276 IsEmpty]: Start isEmpty. Operand 4101 states and 6036 transitions. [2022-07-21 15:46:52,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-07-21 15:46:52,603 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:46:52,603 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:46:52,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-21 15:46:52,603 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-21 15:46:52,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:46:52,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1899140410, now seen corresponding path program 1 times [2022-07-21 15:46:52,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:46:52,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1320616360] [2022-07-21 15:46:52,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:46:52,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:46:52,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:52,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:46:52,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:52,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:46:52,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:52,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:46:52,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:52,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:46:52,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:52,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:46:52,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:52,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:46:52,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:52,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:46:52,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:52,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:52,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:52,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:46:52,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:52,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:46:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:52,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:46:52,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:52,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:46:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:52,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 15:46:52,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:52,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 15:46:52,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:52,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 15:46:52,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:52,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 15:46:52,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:52,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 15:46:52,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:52,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 15:46:52,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:52,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 15:46:52,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:52,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 15:46:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:52,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-21 15:46:52,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:52,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:46:52,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:52,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-21 15:46:52,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:52,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-21 15:46:52,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:52,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-21 15:46:52,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:52,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-21 15:46:52,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:52,840 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:46:52,841 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:46:52,841 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1320616360] [2022-07-21 15:46:52,841 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1320616360] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:46:52,841 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:46:52,841 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:46:52,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102290817] [2022-07-21 15:46:52,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:46:52,842 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:46:52,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:46:52,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:46:52,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:46:52,843 INFO L87 Difference]: Start difference. First operand 4101 states and 6036 transitions. Second operand has 6 states, 6 states have (on average 17.5) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-21 15:46:55,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:46:55,006 INFO L93 Difference]: Finished difference Result 4101 states and 6036 transitions. [2022-07-21 15:46:55,007 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:46:55,007 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 4 states have internal predecessors, (105), 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 171 [2022-07-21 15:46:55,007 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:46:55,019 INFO L225 Difference]: With dead ends: 4101 [2022-07-21 15:46:55,019 INFO L226 Difference]: Without dead ends: 4099 [2022-07-21 15:46:55,021 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-21 15:46:55,022 INFO L413 NwaCegarLoop]: 1310 mSDtfsCounter, 2147 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2260 SdHoareTripleChecker+Valid, 2567 SdHoareTripleChecker+Invalid, 2215 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 920 IncrementalHoareTripleChecker+Valid, 1295 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-21 15:46:55,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2260 Valid, 2567 Invalid, 2215 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [920 Valid, 1295 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-21 15:46:55,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4099 states. [2022-07-21 15:46:55,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4099 to 4099. [2022-07-21 15:46:55,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4099 states, 2931 states have (on average 1.2330262708973048) internal successors, (3614), 2981 states have internal predecessors, (3614), 848 states have call successors, (848), 246 states have call predecessors, (848), 308 states have return successors, (1572), 895 states have call predecessors, (1572), 846 states have call successors, (1572) [2022-07-21 15:46:55,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4099 states to 4099 states and 6034 transitions. [2022-07-21 15:46:55,393 INFO L78 Accepts]: Start accepts. Automaton has 4099 states and 6034 transitions. Word has length 171 [2022-07-21 15:46:55,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:46:55,393 INFO L495 AbstractCegarLoop]: Abstraction has 4099 states and 6034 transitions. [2022-07-21 15:46:55,393 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.5) internal successors, (105), 4 states have internal predecessors, (105), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-21 15:46:55,393 INFO L276 IsEmpty]: Start isEmpty. Operand 4099 states and 6034 transitions. [2022-07-21 15:46:55,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-07-21 15:46:55,396 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:46:55,397 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:46:55,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-21 15:46:55,397 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-21 15:46:55,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:46:55,397 INFO L85 PathProgramCache]: Analyzing trace with hash -2143733899, now seen corresponding path program 1 times [2022-07-21 15:46:55,397 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:46:55,398 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786588321] [2022-07-21 15:46:55,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:46:55,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:46:55,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:46:55,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:46:55,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:46:55,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:46:55,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:46:55,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:46:55,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:46:55,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:55,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:46:55,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:46:55,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:46:55,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:46:55,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 15:46:55,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 15:46:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 15:46:55,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 15:46:55,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 15:46:55,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 15:46:55,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 15:46:55,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 15:46:55,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-21 15:46:55,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:46:55,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-21 15:46:55,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-21 15:46:55,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-21 15:46:55,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-21 15:46:55,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-21 15:46:55,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,615 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:46:55,615 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:46:55,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786588321] [2022-07-21 15:46:55,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786588321] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:46:55,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:46:55,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:46:55,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666317826] [2022-07-21 15:46:55,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:46:55,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:46:55,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:46:55,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:46:55,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:46:55,617 INFO L87 Difference]: Start difference. First operand 4099 states and 6034 transitions. Second operand has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-21 15:46:57,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:46:57,686 INFO L93 Difference]: Finished difference Result 4099 states and 6034 transitions. [2022-07-21 15:46:57,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:46:57,687 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 177 [2022-07-21 15:46:57,687 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:46:57,698 INFO L225 Difference]: With dead ends: 4099 [2022-07-21 15:46:57,698 INFO L226 Difference]: Without dead ends: 4097 [2022-07-21 15:46:57,700 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-21 15:46:57,700 INFO L413 NwaCegarLoop]: 1308 mSDtfsCounter, 2141 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 1293 mSolverCounterSat, 920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2253 SdHoareTripleChecker+Valid, 2565 SdHoareTripleChecker+Invalid, 2213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 920 IncrementalHoareTripleChecker+Valid, 1293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-21 15:46:57,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2253 Valid, 2565 Invalid, 2213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [920 Valid, 1293 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-21 15:46:57,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4097 states. [2022-07-21 15:46:58,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4097 to 4097. [2022-07-21 15:46:58,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4097 states, 2930 states have (on average 1.232764505119454) internal successors, (3612), 2979 states have internal predecessors, (3612), 848 states have call successors, (848), 246 states have call predecessors, (848), 308 states have return successors, (1572), 895 states have call predecessors, (1572), 846 states have call successors, (1572) [2022-07-21 15:46:58,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4097 states to 4097 states and 6032 transitions. [2022-07-21 15:46:58,071 INFO L78 Accepts]: Start accepts. Automaton has 4097 states and 6032 transitions. Word has length 177 [2022-07-21 15:46:58,072 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:46:58,072 INFO L495 AbstractCegarLoop]: Abstraction has 4097 states and 6032 transitions. [2022-07-21 15:46:58,072 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.166666666666668) internal successors, (109), 4 states have internal predecessors, (109), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-21 15:46:58,072 INFO L276 IsEmpty]: Start isEmpty. Operand 4097 states and 6032 transitions. [2022-07-21 15:46:58,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2022-07-21 15:46:58,077 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:46:58,077 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2022-07-21 15:46:58,077 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-21 15:46:58,077 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-21 15:46:58,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:46:58,078 INFO L85 PathProgramCache]: Analyzing trace with hash 1287467755, now seen corresponding path program 1 times [2022-07-21 15:46:58,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:46:58,078 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1208111476] [2022-07-21 15:46:58,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:46:58,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:46:58,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:58,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:46:58,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:58,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:46:58,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:58,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:46:58,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:58,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:46:58,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:58,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 15:46:58,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:58,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:58,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:58,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:46:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:58,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:46:58,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:58,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 15:46:58,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:58,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:58,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:58,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:46:58,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:58,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:46:58,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:58,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:46:58,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:58,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:58,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:58,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:46:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:58,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:46:58,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:58,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:46:58,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:58,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:58,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:58,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:46:58,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:58,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:46:58,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:58,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:46:58,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:58,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:58,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:58,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:46:58,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:58,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:46:58,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:58,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:46:58,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:58,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 15:46:58,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:58,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-21 15:46:58,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:58,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-21 15:46:58,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:58,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-21 15:46:58,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:58,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:58,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:58,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:58,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:58,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:58,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:58,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 15:46:58,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:58,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:46:58,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:58,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:58,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:58,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:46:58,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:58,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-07-21 15:46:58,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:58,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-07-21 15:46:58,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:58,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-07-21 15:46:58,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:58,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:58,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:58,545 INFO L134 CoverageAnalysis]: Checked inductivity of 395 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 395 trivial. 0 not checked. [2022-07-21 15:46:58,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:46:58,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1208111476] [2022-07-21 15:46:58,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1208111476] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:46:58,546 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:46:58,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 15:46:58,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [53151815] [2022-07-21 15:46:58,546 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:46:58,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 15:46:58,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:46:58,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 15:46:58,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:46:58,548 INFO L87 Difference]: Start difference. First operand 4097 states and 6032 transitions. Second operand has 10 states, 10 states have (on average 10.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (31), 8 states have call predecessors, (31), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-21 15:47:03,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:47:03,750 INFO L93 Difference]: Finished difference Result 4685 states and 7115 transitions. [2022-07-21 15:47:03,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 15:47:03,751 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (31), 8 states have call predecessors, (31), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 248 [2022-07-21 15:47:03,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:47:03,768 INFO L225 Difference]: With dead ends: 4685 [2022-07-21 15:47:03,768 INFO L226 Difference]: Without dead ends: 4683 [2022-07-21 15:47:03,770 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 84 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2022-07-21 15:47:03,771 INFO L413 NwaCegarLoop]: 1265 mSDtfsCounter, 3450 mSDsluCounter, 2447 mSDsCounter, 0 mSdLazyCounter, 3661 mSolverCounterSat, 2294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3525 SdHoareTripleChecker+Valid, 3712 SdHoareTripleChecker+Invalid, 5955 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2294 IncrementalHoareTripleChecker+Valid, 3661 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.6s IncrementalHoareTripleChecker+Time [2022-07-21 15:47:03,771 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3525 Valid, 3712 Invalid, 5955 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2294 Valid, 3661 Invalid, 0 Unknown, 0 Unchecked, 4.6s Time] [2022-07-21 15:47:03,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4683 states. [2022-07-21 15:47:04,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4683 to 4123. [2022-07-21 15:47:04,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4123 states, 2949 states have (on average 1.229908443540183) internal successors, (3627), 2997 states have internal predecessors, (3627), 848 states have call successors, (848), 254 states have call predecessors, (848), 316 states have return successors, (1572), 895 states have call predecessors, (1572), 846 states have call successors, (1572) [2022-07-21 15:47:04,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4123 states to 4123 states and 6047 transitions. [2022-07-21 15:47:04,187 INFO L78 Accepts]: Start accepts. Automaton has 4123 states and 6047 transitions. Word has length 248 [2022-07-21 15:47:04,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:47:04,187 INFO L495 AbstractCegarLoop]: Abstraction has 4123 states and 6047 transitions. [2022-07-21 15:47:04,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 10.0) internal successors, (100), 4 states have internal predecessors, (100), 2 states have call successors, (31), 8 states have call predecessors, (31), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-21 15:47:04,188 INFO L276 IsEmpty]: Start isEmpty. Operand 4123 states and 6047 transitions. [2022-07-21 15:47:04,190 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-07-21 15:47:04,191 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:47:04,191 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:47:04,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-21 15:47:04,191 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-21 15:47:04,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:47:04,191 INFO L85 PathProgramCache]: Analyzing trace with hash 92079102, now seen corresponding path program 1 times [2022-07-21 15:47:04,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:47:04,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181596584] [2022-07-21 15:47:04,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:47:04,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:47:04,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:04,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:47:04,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:04,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:47:04,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:04,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:47:04,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:04,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:47:04,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:04,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:47:04,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:04,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:47:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:04,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:47:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:04,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:04,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:47:04,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:04,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:47:04,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:04,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:47:04,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:04,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:47:04,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:04,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 15:47:04,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:04,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 15:47:04,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:04,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 15:47:04,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:04,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 15:47:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:04,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 15:47:04,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:04,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 15:47:04,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:04,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 15:47:04,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:04,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 15:47:04,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:04,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-21 15:47:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:04,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:47:04,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:04,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-21 15:47:04,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:04,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-21 15:47:04,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:04,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-21 15:47:04,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:04,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-21 15:47:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:04,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-21 15:47:04,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:04,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-21 15:47:04,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:04,412 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:47:04,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:47:04,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181596584] [2022-07-21 15:47:04,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181596584] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:47:04,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:47:04,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:47:04,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1973070550] [2022-07-21 15:47:04,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:47:04,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:47:04,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:47:04,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:47:04,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:47:04,415 INFO L87 Difference]: Start difference. First operand 4123 states and 6047 transitions. Second operand has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-21 15:47:06,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:47:06,600 INFO L93 Difference]: Finished difference Result 4123 states and 6047 transitions. [2022-07-21 15:47:06,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:47:06,600 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 183 [2022-07-21 15:47:06,600 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:47:06,610 INFO L225 Difference]: With dead ends: 4123 [2022-07-21 15:47:06,610 INFO L226 Difference]: Without dead ends: 4121 [2022-07-21 15:47:06,612 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:47:06,612 INFO L413 NwaCegarLoop]: 1304 mSDtfsCounter, 2129 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 1289 mSolverCounterSat, 920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2240 SdHoareTripleChecker+Valid, 2561 SdHoareTripleChecker+Invalid, 2209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 920 IncrementalHoareTripleChecker+Valid, 1289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-21 15:47:06,612 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2240 Valid, 2561 Invalid, 2209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [920 Valid, 1289 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-21 15:47:06,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4121 states. [2022-07-21 15:47:06,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4121 to 4121. [2022-07-21 15:47:06,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4121 states, 2948 states have (on average 1.2296472184531886) internal successors, (3625), 2995 states have internal predecessors, (3625), 848 states have call successors, (848), 254 states have call predecessors, (848), 316 states have return successors, (1572), 895 states have call predecessors, (1572), 846 states have call successors, (1572) [2022-07-21 15:47:06,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4121 states to 4121 states and 6045 transitions. [2022-07-21 15:47:06,977 INFO L78 Accepts]: Start accepts. Automaton has 4121 states and 6045 transitions. Word has length 183 [2022-07-21 15:47:06,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:47:06,978 INFO L495 AbstractCegarLoop]: Abstraction has 4121 states and 6045 transitions. [2022-07-21 15:47:06,978 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.833333333333332) internal successors, (113), 4 states have internal predecessors, (113), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-21 15:47:06,978 INFO L276 IsEmpty]: Start isEmpty. Operand 4121 states and 6045 transitions. [2022-07-21 15:47:06,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-07-21 15:47:06,981 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:47:06,981 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:47:06,981 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-21 15:47:06,981 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ldv_linux_usb_urb_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-21 15:47:06,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:47:06,981 INFO L85 PathProgramCache]: Analyzing trace with hash 1180014176, now seen corresponding path program 1 times [2022-07-21 15:47:06,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:47:06,982 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557983982] [2022-07-21 15:47:06,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:47:06,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:47:07,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:07,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:47:07,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:07,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:47:07,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:07,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:47:07,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:07,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:47:07,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:07,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:47:07,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:07,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:47:07,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:07,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:47:07,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:07,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:07,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:07,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:47:07,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:07,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:47:07,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:07,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-21 15:47:07,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:07,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-21 15:47:07,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:07,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-21 15:47:07,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:07,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-21 15:47:07,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:07,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 15:47:07,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:07,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-21 15:47:07,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:07,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-21 15:47:07,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:07,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-21 15:47:07,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:07,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-21 15:47:07,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:07,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-21 15:47:07,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:07,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-21 15:47:07,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:07,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:47:07,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:07,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-21 15:47:07,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:07,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-21 15:47:07,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:07,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-21 15:47:07,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:07,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-21 15:47:07,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:07,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-21 15:47:07,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:07,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-21 15:47:07,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:07,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-21 15:47:07,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:07,185 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:47:07,185 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:47:07,185 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557983982] [2022-07-21 15:47:07,185 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557983982] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:47:07,185 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:47:07,186 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:47:07,186 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259070543] [2022-07-21 15:47:07,186 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:47:07,186 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:47:07,186 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:47:07,187 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:47:07,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:47:07,187 INFO L87 Difference]: Start difference. First operand 4121 states and 6045 transitions. Second operand has 6 states, 6 states have (on average 19.5) internal successors, (117), 4 states have internal predecessors, (117), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-21 15:47:11,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:47:11,799 INFO L93 Difference]: Finished difference Result 8070 states and 12824 transitions. [2022-07-21 15:47:11,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 15:47:11,800 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 4 states have internal predecessors, (117), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 189 [2022-07-21 15:47:11,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:47:11,833 INFO L225 Difference]: With dead ends: 8070 [2022-07-21 15:47:11,833 INFO L226 Difference]: Without dead ends: 7911 [2022-07-21 15:47:11,843 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-21 15:47:11,843 INFO L413 NwaCegarLoop]: 1716 mSDtfsCounter, 2750 mSDsluCounter, 1700 mSDsCounter, 0 mSdLazyCounter, 3099 mSolverCounterSat, 1543 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2815 SdHoareTripleChecker+Valid, 3416 SdHoareTripleChecker+Invalid, 4642 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1543 IncrementalHoareTripleChecker+Valid, 3099 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.8s IncrementalHoareTripleChecker+Time [2022-07-21 15:47:11,844 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2815 Valid, 3416 Invalid, 4642 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1543 Valid, 3099 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-07-21 15:47:11,850 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7911 states. [2022-07-21 15:47:12,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7911 to 7887. [2022-07-21 15:47:12,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7887 states, 5671 states have (on average 1.2334685240698289) internal successors, (6995), 5744 states have internal predecessors, (6995), 1603 states have call successors, (1603), 480 states have call predecessors, (1603), 604 states have return successors, (4019), 1706 states have call predecessors, (4019), 1599 states have call successors, (4019) [2022-07-21 15:47:12,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7887 states to 7887 states and 12617 transitions. [2022-07-21 15:47:12,647 INFO L78 Accepts]: Start accepts. Automaton has 7887 states and 12617 transitions. Word has length 189 [2022-07-21 15:47:12,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:47:12,647 INFO L495 AbstractCegarLoop]: Abstraction has 7887 states and 12617 transitions. [2022-07-21 15:47:12,647 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.5) internal successors, (117), 4 states have internal predecessors, (117), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-21 15:47:12,647 INFO L276 IsEmpty]: Start isEmpty. Operand 7887 states and 12617 transitions. [2022-07-21 15:47:12,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2022-07-21 15:47:12,650 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:47:12,650 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 13, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2022-07-21 15:47:12,650 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-21 15:47:12,651 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-21 15:47:12,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:47:12,651 INFO L85 PathProgramCache]: Analyzing trace with hash 669787798, now seen corresponding path program 1 times [2022-07-21 15:47:12,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:47:12,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312883828] [2022-07-21 15:47:12,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:47:12,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:47:12,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:12,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:47:12,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:12,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:47:12,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:12,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:47:12,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:12,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:47:12,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:12,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 15:47:12,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:12,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:12,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:12,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:47:12,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:12,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:47:12,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:12,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 15:47:12,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:12,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:12,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:12,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:47:12,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:12,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:47:12,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:12,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:47:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:12,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:12,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:47:12,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:12,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:47:12,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:12,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:47:12,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:12,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:12,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:12,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:47:12,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:12,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:47:12,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:12,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:47:12,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:12,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:12,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:12,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:47:12,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:12,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:47:12,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:12,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:47:12,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:12,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 15:47:12,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:12,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-21 15:47:12,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:12,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-21 15:47:12,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:12,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-21 15:47:12,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:13,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:13,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:13,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:13,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:13,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:13,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:13,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 15:47:13,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:13,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:47:13,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:13,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:13,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:13,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:47:13,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:13,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-07-21 15:47:13,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:13,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-07-21 15:47:13,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:13,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-07-21 15:47:13,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:13,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:13,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:13,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-21 15:47:13,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:13,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 15:47:13,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:13,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-21 15:47:13,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:13,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-21 15:47:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:13,092 INFO L134 CoverageAnalysis]: Checked inductivity of 443 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 443 trivial. 0 not checked. [2022-07-21 15:47:13,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:47:13,093 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312883828] [2022-07-21 15:47:13,093 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312883828] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:47:13,093 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:47:13,093 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 15:47:13,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523628109] [2022-07-21 15:47:13,093 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:47:13,094 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 15:47:13,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:47:13,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 15:47:13,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-21 15:47:13,095 INFO L87 Difference]: Start difference. First operand 7887 states and 12617 transitions. Second operand has 11 states, 10 states have (on average 11.0) internal successors, (110), 4 states have internal predecessors, (110), 3 states have call successors, (35), 9 states have call predecessors, (35), 2 states have return successors, (32), 2 states have call predecessors, (32), 3 states have call successors, (32) [2022-07-21 15:47:19,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:47:19,960 INFO L93 Difference]: Finished difference Result 10643 states and 21027 transitions. [2022-07-21 15:47:19,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-21 15:47:19,961 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 11.0) internal successors, (110), 4 states have internal predecessors, (110), 3 states have call successors, (35), 9 states have call predecessors, (35), 2 states have return successors, (32), 2 states have call predecessors, (32), 3 states have call successors, (32) Word has length 269 [2022-07-21 15:47:19,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:47:20,007 INFO L225 Difference]: With dead ends: 10643 [2022-07-21 15:47:20,007 INFO L226 Difference]: Without dead ends: 10641 [2022-07-21 15:47:20,019 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 90 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 146 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=217, Invalid=539, Unknown=0, NotChecked=0, Total=756 [2022-07-21 15:47:20,020 INFO L413 NwaCegarLoop]: 1267 mSDtfsCounter, 2942 mSDsluCounter, 3660 mSDsCounter, 0 mSdLazyCounter, 5481 mSolverCounterSat, 2252 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2942 SdHoareTripleChecker+Valid, 4927 SdHoareTripleChecker+Invalid, 7733 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2252 IncrementalHoareTripleChecker+Valid, 5481 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-07-21 15:47:20,020 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2942 Valid, 4927 Invalid, 7733 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2252 Valid, 5481 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-07-21 15:47:20,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10641 states. [2022-07-21 15:47:20,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10641 to 8017. [2022-07-21 15:47:20,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8017 states, 5766 states have (on average 1.2313562261533124) internal successors, (7100), 5848 states have internal predecessors, (7100), 1611 states have call successors, (1611), 480 states have call predecessors, (1611), 632 states have return successors, (4102), 1732 states have call predecessors, (4102), 1607 states have call successors, (4102) [2022-07-21 15:47:20,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8017 states to 8017 states and 12813 transitions. [2022-07-21 15:47:20,952 INFO L78 Accepts]: Start accepts. Automaton has 8017 states and 12813 transitions. Word has length 269 [2022-07-21 15:47:20,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:47:20,952 INFO L495 AbstractCegarLoop]: Abstraction has 8017 states and 12813 transitions. [2022-07-21 15:47:20,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 11.0) internal successors, (110), 4 states have internal predecessors, (110), 3 states have call successors, (35), 9 states have call predecessors, (35), 2 states have return successors, (32), 2 states have call predecessors, (32), 3 states have call successors, (32) [2022-07-21 15:47:20,953 INFO L276 IsEmpty]: Start isEmpty. Operand 8017 states and 12813 transitions. [2022-07-21 15:47:20,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2022-07-21 15:47:20,958 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:47:20,958 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 5, 5, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:47:20,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-21 15:47:20,958 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting destroy_asyncErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-21 15:47:20,958 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:47:20,959 INFO L85 PathProgramCache]: Analyzing trace with hash -2070069253, now seen corresponding path program 1 times [2022-07-21 15:47:20,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:47:20,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806543129] [2022-07-21 15:47:20,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:47:20,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:47:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:47:21,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:47:21,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:47:21,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:47:21,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:47:21,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-21 15:47:21,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-21 15:47:21,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-21 15:47:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-21 15:47:21,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-21 15:47:21,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:47:21,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:21,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:47:21,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:47:21,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:47:21,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-21 15:47:21,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-21 15:47:21,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:21,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:21,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:21,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 15:47:21,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:47:21,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:21,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:47:21,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-21 15:47:21,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-21 15:47:21,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-21 15:47:21,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-21 15:47:21,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-21 15:47:21,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-21 15:47:21,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:21,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-07-21 15:47:21,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2022-07-21 15:47:21,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-07-21 15:47:21,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:21,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-07-21 15:47:21,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-21 15:47:21,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-07-21 15:47:21,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2022-07-21 15:47:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,455 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 217 trivial. 0 not checked. [2022-07-21 15:47:21,455 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:47:21,455 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806543129] [2022-07-21 15:47:21,455 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806543129] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:47:21,456 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:47:21,456 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-21 15:47:21,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1001928384] [2022-07-21 15:47:21,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:47:21,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-21 15:47:21,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:47:21,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-21 15:47:21,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2022-07-21 15:47:21,459 INFO L87 Difference]: Start difference. First operand 8017 states and 12813 transitions. Second operand has 15 states, 15 states have (on average 8.933333333333334) internal successors, (134), 8 states have internal predecessors, (134), 3 states have call successors, (45), 7 states have call predecessors, (45), 3 states have return successors, (39), 5 states have call predecessors, (39), 3 states have call successors, (39) [2022-07-21 15:47:30,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:47:30,789 INFO L93 Difference]: Finished difference Result 16240 states and 29059 transitions. [2022-07-21 15:47:30,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-21 15:47:30,790 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 8.933333333333334) internal successors, (134), 8 states have internal predecessors, (134), 3 states have call successors, (45), 7 states have call predecessors, (45), 3 states have return successors, (39), 5 states have call predecessors, (39), 3 states have call successors, (39) Word has length 274 [2022-07-21 15:47:30,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:47:30,824 INFO L225 Difference]: With dead ends: 16240 [2022-07-21 15:47:30,824 INFO L226 Difference]: Without dead ends: 8395 [2022-07-21 15:47:30,886 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 81 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=188, Invalid=624, Unknown=0, NotChecked=0, Total=812 [2022-07-21 15:47:30,886 INFO L413 NwaCegarLoop]: 1257 mSDtfsCounter, 1838 mSDsluCounter, 5858 mSDsCounter, 0 mSdLazyCounter, 9370 mSolverCounterSat, 1468 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1838 SdHoareTripleChecker+Valid, 7115 SdHoareTripleChecker+Invalid, 10838 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1468 IncrementalHoareTripleChecker+Valid, 9370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-07-21 15:47:30,886 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1838 Valid, 7115 Invalid, 10838 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1468 Valid, 9370 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2022-07-21 15:47:30,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8395 states. [2022-07-21 15:47:31,598 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8395 to 8117. [2022-07-21 15:47:31,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8117 states, 5828 states have (on average 1.2278654770075497) internal successors, (7156), 5926 states have internal predecessors, (7156), 1615 states have call successors, (1615), 480 states have call predecessors, (1615), 666 states have return successors, (4215), 1754 states have call predecessors, (4215), 1611 states have call successors, (4215) [2022-07-21 15:47:31,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8117 states to 8117 states and 12986 transitions. [2022-07-21 15:47:31,641 INFO L78 Accepts]: Start accepts. Automaton has 8117 states and 12986 transitions. Word has length 274 [2022-07-21 15:47:31,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:47:31,641 INFO L495 AbstractCegarLoop]: Abstraction has 8117 states and 12986 transitions. [2022-07-21 15:47:31,641 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 8.933333333333334) internal successors, (134), 8 states have internal predecessors, (134), 3 states have call successors, (45), 7 states have call predecessors, (45), 3 states have return successors, (39), 5 states have call predecessors, (39), 3 states have call successors, (39) [2022-07-21 15:47:31,641 INFO L276 IsEmpty]: Start isEmpty. Operand 8117 states and 12986 transitions. [2022-07-21 15:47:31,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2022-07-21 15:47:31,646 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:47:31,646 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:47:31,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-21 15:47:31,647 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting destroy_asyncErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-21 15:47:31,647 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:47:31,647 INFO L85 PathProgramCache]: Analyzing trace with hash 454580242, now seen corresponding path program 1 times [2022-07-21 15:47:31,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:47:31,647 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065482479] [2022-07-21 15:47:31,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:47:31,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:47:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:31,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:47:31,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:31,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:47:31,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:31,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:47:31,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:31,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:47:31,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:31,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 15:47:31,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:31,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:31,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:31,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:47:31,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:31,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:47:31,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:31,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 15:47:31,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:31,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:31,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:31,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:47:31,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:31,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:47:31,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:31,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:47:31,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:31,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:31,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:31,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:47:31,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:31,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:47:31,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:31,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:47:31,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:31,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:31,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:31,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:47:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:31,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:47:31,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:31,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:47:32,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:32,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:32,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:32,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:47:32,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:32,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:47:32,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:32,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:47:32,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:32,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 15:47:32,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:32,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-21 15:47:32,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:32,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-21 15:47:32,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:32,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-21 15:47:32,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:32,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:32,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:32,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:32,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:32,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:32,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:32,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 15:47:32,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:32,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:47:32,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:32,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:32,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:47:32,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:32,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-07-21 15:47:32,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:32,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-07-21 15:47:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:32,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-07-21 15:47:32,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:32,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:32,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:32,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-07-21 15:47:32,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:32,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:32,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:32,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 15:47:32,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:32,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-21 15:47:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:32,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:47:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:32,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 15:47:32,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:32,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:32,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:32,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:47:32,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:32,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2022-07-21 15:47:32,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:32,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2022-07-21 15:47:32,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:32,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2022-07-21 15:47:32,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:32,165 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 522 trivial. 0 not checked. [2022-07-21 15:47:32,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:47:32,165 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065482479] [2022-07-21 15:47:32,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065482479] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:47:32,166 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:47:32,166 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-21 15:47:32,166 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2088834752] [2022-07-21 15:47:32,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:47:32,167 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 15:47:32,167 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:47:32,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 15:47:32,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-21 15:47:32,169 INFO L87 Difference]: Start difference. First operand 8117 states and 12986 transitions. Second operand has 13 states, 12 states have (on average 11.75) internal successors, (141), 5 states have internal predecessors, (141), 5 states have call successors, (43), 11 states have call predecessors, (43), 1 states have return successors, (39), 3 states have call predecessors, (39), 4 states have call successors, (39) [2022-07-21 15:47:40,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:47:40,056 INFO L93 Difference]: Finished difference Result 17994 states and 34497 transitions. [2022-07-21 15:47:40,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-21 15:47:40,057 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 11.75) internal successors, (141), 5 states have internal predecessors, (141), 5 states have call successors, (43), 11 states have call predecessors, (43), 1 states have return successors, (39), 3 states have call predecessors, (39), 4 states have call successors, (39) Word has length 324 [2022-07-21 15:47:40,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:47:40,111 INFO L225 Difference]: With dead ends: 17994 [2022-07-21 15:47:40,111 INFO L226 Difference]: Without dead ends: 10049 [2022-07-21 15:47:40,165 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 103 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=245, Invalid=747, Unknown=0, NotChecked=0, Total=992 [2022-07-21 15:47:40,166 INFO L413 NwaCegarLoop]: 1292 mSDtfsCounter, 2941 mSDsluCounter, 4361 mSDsCounter, 0 mSdLazyCounter, 6833 mSolverCounterSat, 2313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2941 SdHoareTripleChecker+Valid, 5653 SdHoareTripleChecker+Invalid, 9146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2313 IncrementalHoareTripleChecker+Valid, 6833 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2022-07-21 15:47:40,166 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2941 Valid, 5653 Invalid, 9146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2313 Valid, 6833 Invalid, 0 Unknown, 0 Unchecked, 6.6s Time] [2022-07-21 15:47:40,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10049 states. [2022-07-21 15:47:41,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10049 to 8429. [2022-07-21 15:47:41,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8429 states, 6048 states have (on average 1.2238756613756614) internal successors, (7402), 6154 states have internal predecessors, (7402), 1677 states have call successors, (1677), 504 states have call predecessors, (1677), 696 states have return successors, (4161), 1822 states have call predecessors, (4161), 1673 states have call successors, (4161) [2022-07-21 15:47:41,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8429 states to 8429 states and 13240 transitions. [2022-07-21 15:47:41,169 INFO L78 Accepts]: Start accepts. Automaton has 8429 states and 13240 transitions. Word has length 324 [2022-07-21 15:47:41,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:47:41,170 INFO L495 AbstractCegarLoop]: Abstraction has 8429 states and 13240 transitions. [2022-07-21 15:47:41,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 11.75) internal successors, (141), 5 states have internal predecessors, (141), 5 states have call successors, (43), 11 states have call predecessors, (43), 1 states have return successors, (39), 3 states have call predecessors, (39), 4 states have call successors, (39) [2022-07-21 15:47:41,170 INFO L276 IsEmpty]: Start isEmpty. Operand 8429 states and 13240 transitions. [2022-07-21 15:47:41,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 326 [2022-07-21 15:47:41,174 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:47:41,175 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:47:41,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-07-21 15:47:41,175 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ldv_linux_usb_dev_usb_put_devErr0ASSERT_VIOLATIONERROR_FUNCTION === [get_1284_registerErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 31 more)] === [2022-07-21 15:47:41,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:47:41,175 INFO L85 PathProgramCache]: Analyzing trace with hash 573498732, now seen corresponding path program 1 times [2022-07-21 15:47:41,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:47:41,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104449741] [2022-07-21 15:47:41,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:47:41,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:47:41,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:47:41,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:47:41,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:47:41,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:47:41,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 15:47:41,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:41,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:47:41,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:47:41,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 15:47:41,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:41,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:47:41,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:47:41,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:47:41,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:41,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:47:41,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:47:41,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:47:41,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:41,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:47:41,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:47:41,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:47:41,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:41,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:47:41,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:47:41,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:47:41,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 15:47:41,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-21 15:47:41,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-21 15:47:41,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-21 15:47:41,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:41,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:41,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:41,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 15:47:41,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:47:41,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:41,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-21 15:47:41,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-07-21 15:47:41,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-07-21 15:47:41,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-07-21 15:47:41,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:41,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-07-21 15:47:41,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:41,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-21 15:47:41,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-21 15:47:41,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-21 15:47:41,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 15:47:41,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:41,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:47:41,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2022-07-21 15:47:41,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2022-07-21 15:47:41,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 313 [2022-07-21 15:47:41,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:41,769 INFO L134 CoverageAnalysis]: Checked inductivity of 522 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 522 trivial. 0 not checked. [2022-07-21 15:47:41,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:47:41,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104449741] [2022-07-21 15:47:41,770 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104449741] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:47:41,770 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:47:41,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-07-21 15:47:41,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702486184] [2022-07-21 15:47:41,770 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:47:41,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-07-21 15:47:41,772 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:47:41,772 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-07-21 15:47:41,772 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2022-07-21 15:47:41,773 INFO L87 Difference]: Start difference. First operand 8429 states and 13240 transitions. Second operand has 16 states, 16 states have (on average 8.875) internal successors, (142), 8 states have internal predecessors, (142), 4 states have call successors, (43), 8 states have call predecessors, (43), 3 states have return successors, (39), 5 states have call predecessors, (39), 4 states have call successors, (39)