./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 eb692b52 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-?-eb692b5 [2022-07-20 04:12:40,239 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-20 04:12:40,242 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-20 04:12:40,286 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-20 04:12:40,286 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-20 04:12:40,288 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-20 04:12:40,289 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-20 04:12:40,291 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-20 04:12:40,293 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-20 04:12:40,297 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-20 04:12:40,298 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-20 04:12:40,300 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-20 04:12:40,300 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-20 04:12:40,302 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-20 04:12:40,303 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-20 04:12:40,306 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-20 04:12:40,307 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-20 04:12:40,308 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-20 04:12:40,309 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-20 04:12:40,314 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-20 04:12:40,316 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-20 04:12:40,317 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-20 04:12:40,318 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-20 04:12:40,319 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-20 04:12:40,320 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-20 04:12:40,331 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-20 04:12:40,332 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-20 04:12:40,332 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-20 04:12:40,333 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-20 04:12:40,334 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-20 04:12:40,335 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-20 04:12:40,336 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-20 04:12:40,337 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-20 04:12:40,338 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-20 04:12:40,338 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-20 04:12:40,339 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-20 04:12:40,339 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-20 04:12:40,340 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-20 04:12:40,340 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-20 04:12:40,341 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-20 04:12:40,341 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-20 04:12:40,343 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-20 04:12:40,344 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-20 04:12:40,372 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-20 04:12:40,372 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-20 04:12:40,372 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-20 04:12:40,373 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-20 04:12:40,373 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-20 04:12:40,374 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-20 04:12:40,374 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-20 04:12:40,374 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-20 04:12:40,375 INFO L138 SettingsManager]: * Use SBE=true [2022-07-20 04:12:40,376 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-20 04:12:40,376 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-20 04:12:40,376 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-20 04:12:40,376 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-20 04:12:40,376 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-20 04:12:40,377 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-20 04:12:40,377 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-20 04:12:40,377 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-20 04:12:40,377 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-20 04:12:40,377 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-20 04:12:40,379 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-20 04:12:40,379 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-20 04:12:40,379 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 04:12:40,379 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-20 04:12:40,380 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-20 04:12:40,380 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-20 04:12:40,380 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-20 04:12:40,380 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-20 04:12:40,380 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-20 04:12:40,381 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-20 04:12:40,381 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-20 04:12:40,381 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-20 04:12:40,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-20 04:12:40,615 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-20 04:12:40,617 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-20 04:12:40,618 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-20 04:12:40,619 INFO L275 PluginConnector]: CDTParser initialized [2022-07-20 04:12:40,620 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-20 04:12:40,698 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8b7c0594/76a3a7817a9c458c994eacc5f08d3117/FLAG7e2cc1be2 [2022-07-20 04:12:41,404 INFO L306 CDTParser]: Found 1 translation units. [2022-07-20 04:12:41,404 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-20 04:12:41,450 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8b7c0594/76a3a7817a9c458c994eacc5f08d3117/FLAG7e2cc1be2 [2022-07-20 04:12:41,487 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e8b7c0594/76a3a7817a9c458c994eacc5f08d3117 [2022-07-20 04:12:41,490 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-20 04:12:41,491 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-20 04:12:41,492 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-20 04:12:41,492 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-20 04:12:41,496 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-20 04:12:41,496 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 04:12:41" (1/1) ... [2022-07-20 04:12:41,497 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@455200e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:12:41, skipping insertion in model container [2022-07-20 04:12:41,497 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.07 04:12:41" (1/1) ... [2022-07-20 04:12:41,503 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-20 04:12:41,615 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-20 04:12:44,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[287816,287829] [2022-07-20 04:12:44,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[287961,287974] [2022-07-20 04:12:44,175 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,176 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,176 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,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[288588,288601] [2022-07-20 04:12:44,183 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,183 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,184 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,184 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,184 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,185 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,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[289634,289647] [2022-07-20 04:12:44,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[289789,289802] [2022-07-20 04:12:44,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[289949,289962] [2022-07-20 04:12:44,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[290100,290113] [2022-07-20 04:12:44,202 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,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[290403,290416] [2022-07-20 04:12:44,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[290552,290565] [2022-07-20 04:12:44,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[290700,290713] [2022-07-20 04:12:44,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[290857,290870] [2022-07-20 04:12:44,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[291006,291019] [2022-07-20 04:12:44,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[291162,291175] [2022-07-20 04:12:44,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[291315,291328] [2022-07-20 04:12:44,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[291461,291474] [2022-07-20 04:12:44,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[291604,291617] [2022-07-20 04:12:44,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[291756,291769] [2022-07-20 04:12:44,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[291902,291915] [2022-07-20 04:12:44,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[292047,292060] [2022-07-20 04:12:44,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[292201,292214] [2022-07-20 04:12:44,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[292352,292365] [2022-07-20 04:12:44,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[292507,292520] [2022-07-20 04:12:44,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[292659,292672] [2022-07-20 04:12:44,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[292814,292827] [2022-07-20 04:12:44,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[292978,292991] [2022-07-20 04:12:44,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[293134,293147] [2022-07-20 04:12:44,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[293298,293311] [2022-07-20 04:12:44,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[293440,293453] [2022-07-20 04:12:44,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[293598,293611] [2022-07-20 04:12:44,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[293765,293778] [2022-07-20 04:12:44,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[293924,293937] [2022-07-20 04:12:44,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[294083,294096] [2022-07-20 04:12:44,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[294232,294245] [2022-07-20 04:12:44,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[294379,294392] [2022-07-20 04:12:44,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[294518,294531] [2022-07-20 04:12:44,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[294681,294694] [2022-07-20 04:12:44,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[294847,294860] [2022-07-20 04:12:44,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[295011,295024] [2022-07-20 04:12:44,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[295176,295189] [2022-07-20 04:12:44,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[295341,295354] [2022-07-20 04:12:44,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[295507,295520] [2022-07-20 04:12:44,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[295672,295685] [2022-07-20 04:12:44,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[295839,295852] [2022-07-20 04:12:44,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[295999,296012] [2022-07-20 04:12:44,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[296161,296174] [2022-07-20 04:12:44,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[296320,296333] [2022-07-20 04:12:44,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[296466,296479] [2022-07-20 04:12:44,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[296609,296622] [2022-07-20 04:12:44,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[296753,296766] [2022-07-20 04:12:44,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[296896,296909] [2022-07-20 04:12:44,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[297040,297053] [2022-07-20 04:12:44,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[297181,297194] [2022-07-20 04:12:44,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[297319,297332] [2022-07-20 04:12:44,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[297477,297490] [2022-07-20 04:12:44,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[297636,297649] [2022-07-20 04:12:44,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[297792,297805] [2022-07-20 04:12:44,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[297941,297954] [2022-07-20 04:12:44,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[298093,298106] [2022-07-20 04:12:44,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[298244,298257] [2022-07-20 04:12:44,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[298393,298406] [2022-07-20 04:12:44,226 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,226 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,226 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,227 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,227 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,227 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,228 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,229 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,229 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,230 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,230 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,230 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,231 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,231 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,231 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,232 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,232 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,233 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,237 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 04:12:44,269 INFO L203 MainTranslator]: Completed pre-run [2022-07-20 04:12:44,527 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,530 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,530 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,531 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,532 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,533 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,533 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,534 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,538 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,539 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,539 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,540 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,540 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,565 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,566 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,566 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,566 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,566 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,567 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,567 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,567 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,567 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,567 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,568 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,568 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,568 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,568 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,569 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,569 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,569 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,569 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,569 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,570 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,570 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,570 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,570 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,570 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,571 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,571 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,571 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,571 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,572 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,572 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,572 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,572 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,572 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,573 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,573 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,573 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,573 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,573 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,574 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,574 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,574 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,574 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,575 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,575 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,578 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,578 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,578 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,579 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,579 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,580 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,583 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,584 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,584 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,584 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,585 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,586 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,586 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,586 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,591 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,597 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,597 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,598 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,598 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,599 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,599 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,600 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,601 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,601 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,602 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,603 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,603 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,604 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,604 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,604 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,604 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation 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-20 04:12:44,610 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-20 04:12:44,764 INFO L208 MainTranslator]: Completed translation [2022-07-20 04:12:44,764 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:12:44 WrapperNode [2022-07-20 04:12:44,764 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-20 04:12:44,765 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-20 04:12:44,765 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-20 04:12:44,766 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-20 04:12:44,772 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:12:44" (1/1) ... [2022-07-20 04:12:44,864 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:12:44" (1/1) ... [2022-07-20 04:12:45,022 INFO L137 Inliner]: procedures = 516, calls = 1379, calls flagged for inlining = 239, calls inlined = 169, statements flattened = 3204 [2022-07-20 04:12:45,023 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-20 04:12:45,024 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-20 04:12:45,025 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-20 04:12:45,025 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-20 04:12:45,034 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:12:44" (1/1) ... [2022-07-20 04:12:45,034 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:12:44" (1/1) ... [2022-07-20 04:12:45,054 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:12:44" (1/1) ... [2022-07-20 04:12:45,055 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:12:44" (1/1) ... [2022-07-20 04:12:45,139 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:12:44" (1/1) ... [2022-07-20 04:12:45,156 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:12:44" (1/1) ... [2022-07-20 04:12:45,174 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:12:44" (1/1) ... [2022-07-20 04:12:45,200 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-20 04:12:45,201 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-20 04:12:45,201 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-20 04:12:45,201 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-20 04:12:45,205 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:12:44" (1/1) ... [2022-07-20 04:12:45,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-20 04:12:45,222 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:12:45,238 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-20 04:12:45,263 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-20 04:12:45,283 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irqrestore_97 [2022-07-20 04:12:45,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irqrestore_97 [2022-07-20 04:12:45,283 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-20 04:12:45,283 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-20 04:12:45,284 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-07-20 04:12:45,284 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-07-20 04:12:45,284 INFO L130 BoogieDeclarations]: Found specification of procedure parport_uss720_disable_irq [2022-07-20 04:12:45,284 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_uss720_disable_irq [2022-07-20 04:12:45,284 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_async [2022-07-20 04:12:45,284 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_async [2022-07-20 04:12:45,284 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-20 04:12:45,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-20 04:12:45,284 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-20 04:12:45,284 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-20 04:12:45,285 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-20 04:12:45,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-20 04:12:45,285 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-20 04:12:45,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-20 04:12:45,285 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-20 04:12:45,285 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-20 04:12:45,285 INFO L130 BoogieDeclarations]: Found specification of procedure parport_uss720_read_status [2022-07-20 04:12:45,285 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_uss720_read_status [2022-07-20 04:12:45,286 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-20 04:12:45,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-20 04:12:45,286 INFO L130 BoogieDeclarations]: Found specification of procedure parport_uss720_read_data [2022-07-20 04:12:45,286 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_uss720_read_data [2022-07-20 04:12:45,286 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-20 04:12:45,286 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-20 04:12:45,286 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-20 04:12:45,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-20 04:12:45,287 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-20 04:12:45,287 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-20 04:12:45,287 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-20 04:12:45,287 INFO L130 BoogieDeclarations]: Found specification of procedure parport_uss720_data_reverse [2022-07-20 04:12:45,287 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_uss720_data_reverse [2022-07-20 04:12:45,287 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-20 04:12:45,288 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-20 04:12:45,288 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-20 04:12:45,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-20 04:12:45,288 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-20 04:12:45,288 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-20 04:12:45,288 INFO L130 BoogieDeclarations]: Found specification of procedure kref_get [2022-07-20 04:12:45,288 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_get [2022-07-20 04:12:45,288 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-20 04:12:45,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-20 04:12:45,289 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-20 04:12:45,289 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-20 04:12:45,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-20 04:12:45,289 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2022-07-20 04:12:45,289 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2022-07-20 04:12:45,289 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-20 04:12:45,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-20 04:12:45,290 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-20 04:12:45,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-20 04:12:45,290 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-20 04:12:45,290 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-20 04:12:45,290 INFO L130 BoogieDeclarations]: Found specification of procedure submit_async_request [2022-07-20 04:12:45,290 INFO L138 BoogieDeclarations]: Found implementation of procedure submit_async_request [2022-07-20 04:12:45,291 INFO L130 BoogieDeclarations]: Found specification of procedure kref_put [2022-07-20 04:12:45,291 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_put [2022-07-20 04:12:45,291 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-20 04:12:45,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-20 04:12:45,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-20 04:12:45,291 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-20 04:12:45,291 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-20 04:12:45,291 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-20 04:12:45,292 INFO L130 BoogieDeclarations]: Found specification of procedure change_mode [2022-07-20 04:12:45,292 INFO L138 BoogieDeclarations]: Found implementation of procedure change_mode [2022-07-20 04:12:45,292 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-20 04:12:45,292 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-20 04:12:45,292 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-20 04:12:45,292 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-20 04:12:45,292 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-20 04:12:45,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-20 04:12:45,293 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_dev_usb_put_dev [2022-07-20 04:12:45,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_dev_usb_put_dev [2022-07-20 04:12:45,293 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-20 04:12:45,293 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-20 04:12:45,293 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-07-20 04:12:45,293 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-07-20 04:12:45,294 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-20 04:12:45,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-20 04:12:45,294 INFO L130 BoogieDeclarations]: Found specification of procedure parport_generic_irq [2022-07-20 04:12:45,294 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_generic_irq [2022-07-20 04:12:45,294 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-20 04:12:45,294 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-20 04:12:45,294 INFO L130 BoogieDeclarations]: Found specification of procedure get_1284_register [2022-07-20 04:12:45,294 INFO L138 BoogieDeclarations]: Found implementation of procedure get_1284_register [2022-07-20 04:12:45,295 INFO L130 BoogieDeclarations]: Found specification of procedure kref_sub [2022-07-20 04:12:45,295 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_sub [2022-07-20 04:12:45,295 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-20 04:12:45,295 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-20 04:12:45,295 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-20 04:12:45,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-20 04:12:45,295 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_asynclock_of_parport_uss720_private [2022-07-20 04:12:45,295 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_asynclock_of_parport_uss720_private [2022-07-20 04:12:45,296 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-20 04:12:45,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-20 04:12:45,296 INFO L130 BoogieDeclarations]: Found specification of procedure set_1284_register [2022-07-20 04:12:45,296 INFO L138 BoogieDeclarations]: Found implementation of procedure set_1284_register [2022-07-20 04:12:45,296 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-20 04:12:45,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-20 04:12:45,296 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-20 04:12:45,296 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-20 04:12:45,297 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-20 04:12:45,297 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-07-20 04:12:45,297 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-07-20 04:12:45,297 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-20 04:12:45,297 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-20 04:12:45,297 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-20 04:12:45,297 INFO L130 BoogieDeclarations]: Found specification of procedure async_complete [2022-07-20 04:12:45,298 INFO L138 BoogieDeclarations]: Found implementation of procedure async_complete [2022-07-20 04:12:45,298 INFO L130 BoogieDeclarations]: Found specification of procedure parport_uss720_read_control [2022-07-20 04:12:45,298 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_uss720_read_control [2022-07-20 04:12:45,298 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-20 04:12:45,298 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-07-20 04:12:45,298 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-07-20 04:12:45,298 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-20 04:12:45,298 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-20 04:12:45,298 INFO L130 BoogieDeclarations]: Found specification of procedure parport_uss720_enable_irq [2022-07-20 04:12:45,299 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_uss720_enable_irq [2022-07-20 04:12:45,299 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-07-20 04:12:45,299 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-07-20 04:12:45,299 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-20 04:12:45,299 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-20 04:12:45,299 INFO L130 BoogieDeclarations]: Found specification of procedure clear_epp_timeout [2022-07-20 04:12:45,299 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_epp_timeout [2022-07-20 04:12:45,300 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-07-20 04:12:45,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-07-20 04:12:45,300 INFO L130 BoogieDeclarations]: Found specification of procedure uss720_disconnect [2022-07-20 04:12:45,300 INFO L138 BoogieDeclarations]: Found implementation of procedure uss720_disconnect [2022-07-20 04:12:45,300 INFO L130 BoogieDeclarations]: Found specification of procedure parport_uss720_data_forward [2022-07-20 04:12:45,300 INFO L138 BoogieDeclarations]: Found implementation of procedure parport_uss720_data_forward [2022-07-20 04:12:45,300 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-20 04:12:45,300 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-20 04:12:45,301 INFO L130 BoogieDeclarations]: Found specification of procedure kill_all_async_requests_priv [2022-07-20 04:12:45,301 INFO L138 BoogieDeclarations]: Found implementation of procedure kill_all_async_requests_priv [2022-07-20 04:12:45,301 INFO L130 BoogieDeclarations]: Found specification of procedure usb_bulk_msg [2022-07-20 04:12:45,301 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_bulk_msg [2022-07-20 04:12:45,301 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-20 04:12:45,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-20 04:12:45,301 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-20 04:12:45,301 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-20 04:12:45,302 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-20 04:12:45,302 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_linux_kernel_locking_spinlock_spin_lock [2022-07-20 04:12:45,302 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-20 04:12:45,302 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-20 04:12:45,302 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-20 04:12:45,302 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-20 04:12:45,302 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-20 04:12:45,302 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-20 04:12:45,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-20 04:12:45,303 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-20 04:12:45,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-20 04:12:45,303 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-20 04:12:45,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-20 04:12:45,303 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-20 04:12:45,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-20 04:12:45,303 INFO L130 BoogieDeclarations]: Found specification of procedure kref_init [2022-07-20 04:12:45,304 INFO L138 BoogieDeclarations]: Found implementation of procedure kref_init [2022-07-20 04:12:45,304 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-20 04:12:45,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-20 04:12:45,304 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-20 04:12:45,304 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-20 04:12:45,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-20 04:12:45,874 INFO L234 CfgBuilder]: Building ICFG [2022-07-20 04:12:45,879 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-20 04:12:46,474 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-20 04:12:47,952 INFO L275 CfgBuilder]: Performing block encoding [2022-07-20 04:12:47,965 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-20 04:12:47,965 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-20 04:12:47,968 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 04:12:47 BoogieIcfgContainer [2022-07-20 04:12:47,968 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-20 04:12:47,970 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-20 04:12:47,970 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-20 04:12:47,973 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-20 04:12:47,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.07 04:12:41" (1/3) ... [2022-07-20 04:12:47,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36634327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 04:12:47, skipping insertion in model container [2022-07-20 04:12:47,974 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.07 04:12:44" (2/3) ... [2022-07-20 04:12:47,974 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@36634327 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.07 04:12:47, skipping insertion in model container [2022-07-20 04:12:47,975 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.07 04:12:47" (3/3) ... [2022-07-20 04:12:47,976 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--usb--misc--uss720.ko.cil.i [2022-07-20 04:12:47,989 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-20 04:12:47,989 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 33 error locations. [2022-07-20 04:12:48,054 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-20 04:12:48,060 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@86aa72e, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@50401152 [2022-07-20 04:12:48,060 INFO L358 AbstractCegarLoop]: Starting to check reachability of 33 error locations. [2022-07-20 04:12:48,067 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-20 04:12:48,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-20 04:12:48,078 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:12:48,078 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-20 04:12:48,079 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-20 04:12:48,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:12:48,083 INFO L85 PathProgramCache]: Analyzing trace with hash 932299145, now seen corresponding path program 1 times [2022-07-20 04:12:48,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:12:48,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857839124] [2022-07-20 04:12:48,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:12:48,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:12:48,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:48,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:12:48,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:48,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:12:48,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:48,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:12:48,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:48,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:12:48,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:48,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:12:48,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:48,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 04:12:48,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:48,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:12:48,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:48,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:48,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:48,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-20 04:12:48,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:48,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-20 04:12:48,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:48,771 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-20 04:12:48,772 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:12:48,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857839124] [2022-07-20 04:12:48,773 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857839124] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:12:48,773 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:12:48,773 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:12:48,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114707135] [2022-07-20 04:12:48,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:12:48,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:12:48,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:12:48,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:12:48,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:12:48,808 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-20 04:12:51,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:12:51,568 INFO L93 Difference]: Finished difference Result 2243 states and 3170 transitions. [2022-07-20 04:12:51,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:12:51,572 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-20 04:12:51,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:12:51,592 INFO L225 Difference]: With dead ends: 2243 [2022-07-20 04:12:51,592 INFO L226 Difference]: Without dead ends: 1137 [2022-07-20 04:12:51,613 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-20 04:12:51,616 INFO L413 NwaCegarLoop]: 1378 mSDtfsCounter, 2307 mSDsluCounter, 1304 mSDsCounter, 0 mSdLazyCounter, 1350 mSolverCounterSat, 928 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s 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.4s IncrementalHoareTripleChecker+Time [2022-07-20 04:12:51,616 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.4s Time] [2022-07-20 04:12:51,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1137 states. [2022-07-20 04:12:51,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1137 to 1137. [2022-07-20 04:12:51,758 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-20 04:12:51,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1137 states to 1137 states and 1471 transitions. [2022-07-20 04:12:51,774 INFO L78 Accepts]: Start accepts. Automaton has 1137 states and 1471 transitions. Word has length 73 [2022-07-20 04:12:51,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:12:51,776 INFO L495 AbstractCegarLoop]: Abstraction has 1137 states and 1471 transitions. [2022-07-20 04:12:51,776 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-20 04:12:51,776 INFO L276 IsEmpty]: Start isEmpty. Operand 1137 states and 1471 transitions. [2022-07-20 04:12:51,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-20 04:12:51,780 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:12:51,780 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-20 04:12:51,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-20 04:12:51,781 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-20 04:12:51,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:12:51,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1910424931, now seen corresponding path program 1 times [2022-07-20 04:12:51,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:12:51,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299487114] [2022-07-20 04:12:51,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:12:51,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:12:51,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:51,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:12:51,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:51,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:12:51,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:51,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:12:51,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:51,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:12:51,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:51,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:12:51,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:51,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 04:12:51,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:52,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:12:52,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:52,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:52,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:52,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-20 04:12:52,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:52,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-20 04:12:52,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:52,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-20 04:12:52,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:52,048 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-20 04:12:52,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:12:52,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299487114] [2022-07-20 04:12:52,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299487114] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:12:52,049 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:12:52,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:12:52,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187706110] [2022-07-20 04:12:52,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:12:52,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:12:52,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:12:52,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:12:52,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:12:52,051 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-20 04:12:54,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:12:54,492 INFO L93 Difference]: Finished difference Result 1137 states and 1471 transitions. [2022-07-20 04:12:54,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:12:54,493 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-20 04:12:54,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:12:54,500 INFO L225 Difference]: With dead ends: 1137 [2022-07-20 04:12:54,501 INFO L226 Difference]: Without dead ends: 1135 [2022-07-20 04:12:54,502 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:12:54,503 INFO L413 NwaCegarLoop]: 1360 mSDtfsCounter, 2275 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 1336 mSolverCounterSat, 920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s 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.3s IncrementalHoareTripleChecker+Time [2022-07-20 04:12:54,503 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.3s Time] [2022-07-20 04:12:54,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1135 states. [2022-07-20 04:12:54,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1135 to 1135. [2022-07-20 04:12:54,575 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-20 04:12:54,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1135 states to 1135 states and 1469 transitions. [2022-07-20 04:12:54,583 INFO L78 Accepts]: Start accepts. Automaton has 1135 states and 1469 transitions. Word has length 79 [2022-07-20 04:12:54,584 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:12:54,584 INFO L495 AbstractCegarLoop]: Abstraction has 1135 states and 1469 transitions. [2022-07-20 04:12:54,584 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-20 04:12:54,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1135 states and 1469 transitions. [2022-07-20 04:12:54,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-20 04:12:54,587 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:12:54,587 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-20 04:12:54,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-20 04:12:54,588 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-20 04:12:54,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:12:54,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1592629622, now seen corresponding path program 1 times [2022-07-20 04:12:54,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:12:54,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1467587114] [2022-07-20 04:12:54,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:12:54,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:12:54,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:54,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:12:54,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:54,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:12:54,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:54,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:12:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:54,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:12:54,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:54,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:12:54,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:54,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 04:12:54,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:54,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:12:54,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:54,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:54,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:54,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-20 04:12:54,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:54,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-20 04:12:54,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:54,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-20 04:12:54,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:54,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-20 04:12:54,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:54,897 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-20 04:12:54,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:12:54,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1467587114] [2022-07-20 04:12:54,898 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1467587114] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:12:54,898 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:12:54,898 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:12:54,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428936136] [2022-07-20 04:12:54,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:12:54,899 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:12:54,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:12:54,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:12:54,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:12:54,900 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-20 04:12:56,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:12:56,948 INFO L93 Difference]: Finished difference Result 1135 states and 1469 transitions. [2022-07-20 04:12:56,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:12:56,951 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-20 04:12:56,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:12:56,958 INFO L225 Difference]: With dead ends: 1135 [2022-07-20 04:12:56,958 INFO L226 Difference]: Without dead ends: 1133 [2022-07-20 04:12:56,959 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-20 04:12:56,960 INFO L413 NwaCegarLoop]: 1358 mSDtfsCounter, 2269 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 1334 mSolverCounterSat, 920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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, 1.9s IncrementalHoareTripleChecker+Time [2022-07-20 04:12:56,960 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2396 Valid, 2646 Invalid, 2254 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [920 Valid, 1334 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-20 04:12:56,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1133 states. [2022-07-20 04:12:56,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1133 to 1133. [2022-07-20 04:12:57,000 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-20 04:12:57,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1133 states to 1133 states and 1467 transitions. [2022-07-20 04:12:57,008 INFO L78 Accepts]: Start accepts. Automaton has 1133 states and 1467 transitions. Word has length 85 [2022-07-20 04:12:57,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:12:57,008 INFO L495 AbstractCegarLoop]: Abstraction has 1133 states and 1467 transitions. [2022-07-20 04:12:57,009 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-20 04:12:57,009 INFO L276 IsEmpty]: Start isEmpty. Operand 1133 states and 1467 transitions. [2022-07-20 04:12:57,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-20 04:12:57,011 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:12:57,011 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-20 04:12:57,011 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-20 04:12:57,011 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-20 04:12:57,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:12:57,012 INFO L85 PathProgramCache]: Analyzing trace with hash 315582992, now seen corresponding path program 1 times [2022-07-20 04:12:57,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:12:57,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128151410] [2022-07-20 04:12:57,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:12:57,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:12:57,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:12:57,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:12:57,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:12:57,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:12:57,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:12:57,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 04:12:57,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:12:57,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:57,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-20 04:12:57,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-20 04:12:57,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-20 04:12:57,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-20 04:12:57,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-20 04:12:57,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:57,283 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-20 04:12:57,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:12:57,283 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128151410] [2022-07-20 04:12:57,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128151410] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:12:57,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:12:57,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:12:57,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16343093] [2022-07-20 04:12:57,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:12:57,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:12:57,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:12:57,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:12:57,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:12:57,286 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-20 04:12:59,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:12:59,429 INFO L93 Difference]: Finished difference Result 1133 states and 1467 transitions. [2022-07-20 04:12:59,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:12:59,430 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-20 04:12:59,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:12:59,437 INFO L225 Difference]: With dead ends: 1133 [2022-07-20 04:12:59,437 INFO L226 Difference]: Without dead ends: 1131 [2022-07-20 04:12:59,438 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-20 04:12:59,439 INFO L413 NwaCegarLoop]: 1356 mSDtfsCounter, 2263 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 1332 mSolverCounterSat, 920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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.0s IncrementalHoareTripleChecker+Time [2022-07-20 04:12:59,439 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.0s Time] [2022-07-20 04:12:59,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1131 states. [2022-07-20 04:12:59,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1131 to 1131. [2022-07-20 04:12:59,477 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-20 04:12:59,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1131 states to 1131 states and 1465 transitions. [2022-07-20 04:12:59,485 INFO L78 Accepts]: Start accepts. Automaton has 1131 states and 1465 transitions. Word has length 91 [2022-07-20 04:12:59,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:12:59,485 INFO L495 AbstractCegarLoop]: Abstraction has 1131 states and 1465 transitions. [2022-07-20 04:12:59,486 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-20 04:12:59,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1131 states and 1465 transitions. [2022-07-20 04:12:59,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-07-20 04:12:59,487 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:12:59,487 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-20 04:12:59,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-20 04:12:59,488 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-20 04:12:59,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:12:59,488 INFO L85 PathProgramCache]: Analyzing trace with hash -1831010472, now seen corresponding path program 1 times [2022-07-20 04:12:59,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:12:59,489 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1670149388] [2022-07-20 04:12:59,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:12:59,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:12:59,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:59,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:12:59,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:59,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:12:59,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:59,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:12:59,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:59,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:12:59,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:59,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:12:59,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:59,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 04:12:59,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:59,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:12:59,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:59,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:12:59,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:59,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-20 04:12:59,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:59,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-20 04:12:59,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:59,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-20 04:12:59,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:59,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-20 04:12:59,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:59,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-20 04:12:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:59,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-20 04:12:59,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:12:59,765 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-20 04:12:59,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:12:59,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1670149388] [2022-07-20 04:12:59,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1670149388] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:12:59,766 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:12:59,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:12:59,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [479531790] [2022-07-20 04:12:59,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:12:59,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:12:59,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:12:59,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:12:59,768 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:12:59,768 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-20 04:13:01,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:01,852 INFO L93 Difference]: Finished difference Result 1131 states and 1465 transitions. [2022-07-20 04:13:01,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:13:01,853 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-20 04:13:01,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:01,860 INFO L225 Difference]: With dead ends: 1131 [2022-07-20 04:13:01,860 INFO L226 Difference]: Without dead ends: 1129 [2022-07-20 04:13:01,861 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-20 04:13:01,862 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-20 04:13:01,863 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-20 04:13:01,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1129 states. [2022-07-20 04:13:01,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1129 to 1129. [2022-07-20 04:13:01,930 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-20 04:13:01,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1129 states to 1129 states and 1463 transitions. [2022-07-20 04:13:01,936 INFO L78 Accepts]: Start accepts. Automaton has 1129 states and 1463 transitions. Word has length 97 [2022-07-20 04:13:01,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:01,938 INFO L495 AbstractCegarLoop]: Abstraction has 1129 states and 1463 transitions. [2022-07-20 04:13:01,938 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-20 04:13:01,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1129 states and 1463 transitions. [2022-07-20 04:13:01,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-07-20 04:13:01,941 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:01,941 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-20 04:13:01,941 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-20 04:13:01,942 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-20 04:13:01,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:01,942 INFO L85 PathProgramCache]: Analyzing trace with hash 898638973, now seen corresponding path program 1 times [2022-07-20 04:13:01,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:01,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308677301] [2022-07-20 04:13:01,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:01,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:02,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:02,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:02,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:02,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:02,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:02,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:02,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:02,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:13:02,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:02,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:13:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:02,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 04:13:02,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:02,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:13:02,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:02,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:02,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:02,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-20 04:13:02,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:02,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-20 04:13:02,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:02,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-20 04:13:02,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:02,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-20 04:13:02,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:02,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-20 04:13:02,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:02,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-20 04:13:02,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:02,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-20 04:13:02,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:02,219 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-20 04:13:02,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:02,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308677301] [2022-07-20 04:13:02,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308677301] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:02,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:02,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:13:02,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110076716] [2022-07-20 04:13:02,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:02,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:13:02,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:02,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:13:02,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:13:02,222 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-20 04:13:04,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:04,147 INFO L93 Difference]: Finished difference Result 1129 states and 1463 transitions. [2022-07-20 04:13:04,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:13:04,147 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-20 04:13:04,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:04,153 INFO L225 Difference]: With dead ends: 1129 [2022-07-20 04:13:04,153 INFO L226 Difference]: Without dead ends: 1127 [2022-07-20 04:13:04,154 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-20 04:13:04,155 INFO L413 NwaCegarLoop]: 1352 mSDtfsCounter, 2251 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 1328 mSolverCounterSat, 920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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-20 04:13:04,155 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-20 04:13:04,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1127 states. [2022-07-20 04:13:04,198 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1127 to 1127. [2022-07-20 04:13:04,200 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-20 04:13:04,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1127 states to 1127 states and 1461 transitions. [2022-07-20 04:13:04,206 INFO L78 Accepts]: Start accepts. Automaton has 1127 states and 1461 transitions. Word has length 103 [2022-07-20 04:13:04,206 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:04,206 INFO L495 AbstractCegarLoop]: Abstraction has 1127 states and 1461 transitions. [2022-07-20 04:13:04,207 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-20 04:13:04,207 INFO L276 IsEmpty]: Start isEmpty. Operand 1127 states and 1461 transitions. [2022-07-20 04:13:04,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-20 04:13:04,208 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:04,208 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-20 04:13:04,209 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-20 04:13:04,209 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-20 04:13:04,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:04,209 INFO L85 PathProgramCache]: Analyzing trace with hash 982356993, now seen corresponding path program 1 times [2022-07-20 04:13:04,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:04,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667745147] [2022-07-20 04:13:04,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:04,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:04,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:04,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:04,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:04,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:04,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:04,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:04,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:04,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:13:04,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:04,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:13:04,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:04,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 04:13:04,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:04,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:13:04,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:04,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:04,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-20 04:13:04,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:04,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-20 04:13:04,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:04,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-20 04:13:04,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:04,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-20 04:13:04,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:04,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-20 04:13:04,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:04,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-20 04:13:04,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:04,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-20 04:13:04,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:04,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-20 04:13:04,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:04,484 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-20 04:13:04,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:04,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667745147] [2022-07-20 04:13:04,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1667745147] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:04,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:04,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:13:04,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533450384] [2022-07-20 04:13:04,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:04,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:13:04,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:04,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:13:04,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:13:04,487 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-20 04:13:06,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:06,391 INFO L93 Difference]: Finished difference Result 1127 states and 1461 transitions. [2022-07-20 04:13:06,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:13:06,392 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-20 04:13:06,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:06,398 INFO L225 Difference]: With dead ends: 1127 [2022-07-20 04:13:06,398 INFO L226 Difference]: Without dead ends: 1125 [2022-07-20 04:13:06,399 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-20 04:13:06,399 INFO L413 NwaCegarLoop]: 1350 mSDtfsCounter, 2245 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 1326 mSolverCounterSat, 920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s 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, 1.8s IncrementalHoareTripleChecker+Time [2022-07-20 04:13:06,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2368 Valid, 2638 Invalid, 2246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [920 Valid, 1326 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-20 04:13:06,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1125 states. [2022-07-20 04:13:06,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1125 to 1125. [2022-07-20 04:13:06,440 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-20 04:13:06,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1125 states to 1125 states and 1459 transitions. [2022-07-20 04:13:06,446 INFO L78 Accepts]: Start accepts. Automaton has 1125 states and 1459 transitions. Word has length 109 [2022-07-20 04:13:06,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:06,447 INFO L495 AbstractCegarLoop]: Abstraction has 1125 states and 1459 transitions. [2022-07-20 04:13:06,447 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-20 04:13:06,447 INFO L276 IsEmpty]: Start isEmpty. Operand 1125 states and 1459 transitions. [2022-07-20 04:13:06,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-20 04:13:06,449 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:06,449 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-20 04:13:06,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-20 04:13:06,450 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-20 04:13:06,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:06,450 INFO L85 PathProgramCache]: Analyzing trace with hash 664691615, now seen corresponding path program 1 times [2022-07-20 04:13:06,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:06,451 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [682823015] [2022-07-20 04:13:06,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:06,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:06,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:06,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:06,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:13:06,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:13:06,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 04:13:06,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:13:06,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:06,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-20 04:13:06,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-20 04:13:06,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-20 04:13:06,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-20 04:13:06,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-20 04:13:06,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-20 04:13:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-20 04:13:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-20 04:13:06,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-20 04:13:06,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:06,732 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-20 04:13:06,733 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:06,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [682823015] [2022-07-20 04:13:06,733 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [682823015] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:06,733 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:06,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:13:06,734 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1745844253] [2022-07-20 04:13:06,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:06,734 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:13:06,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:06,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:13:06,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:13:06,735 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-20 04:13:10,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:10,894 INFO L93 Difference]: Finished difference Result 2162 states and 2871 transitions. [2022-07-20 04:13:10,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 04:13:10,895 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-20 04:13:10,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:10,906 INFO L225 Difference]: With dead ends: 2162 [2022-07-20 04:13:10,906 INFO L226 Difference]: Without dead ends: 2160 [2022-07-20 04:13:10,907 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-20 04:13:10,908 INFO L413 NwaCegarLoop]: 1549 mSDtfsCounter, 3251 mSDsluCounter, 1743 mSDsCounter, 0 mSdLazyCounter, 2941 mSolverCounterSat, 1631 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3328 SdHoareTripleChecker+Valid, 3292 SdHoareTripleChecker+Invalid, 4572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1631 IncrementalHoareTripleChecker+Valid, 2941 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-20 04:13:10,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3328 Valid, 3292 Invalid, 4572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1631 Valid, 2941 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-07-20 04:13:10,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2160 states. [2022-07-20 04:13:10,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2160 to 2026. [2022-07-20 04:13:11,000 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-20 04:13:11,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2026 states to 2026 states and 2735 transitions. [2022-07-20 04:13:11,008 INFO L78 Accepts]: Start accepts. Automaton has 2026 states and 2735 transitions. Word has length 115 [2022-07-20 04:13:11,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:11,009 INFO L495 AbstractCegarLoop]: Abstraction has 2026 states and 2735 transitions. [2022-07-20 04:13:11,009 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-20 04:13:11,009 INFO L276 IsEmpty]: Start isEmpty. Operand 2026 states and 2735 transitions. [2022-07-20 04:13:11,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-20 04:13:11,012 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:11,012 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-20 04:13:11,012 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-20 04:13:11,012 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-20 04:13:11,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:11,013 INFO L85 PathProgramCache]: Analyzing trace with hash 392690514, now seen corresponding path program 1 times [2022-07-20 04:13:11,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:11,013 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257736525] [2022-07-20 04:13:11,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:11,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:11,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:11,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:11,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:11,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:11,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:11,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:11,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:11,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:13:11,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:11,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:13:11,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:11,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 04:13:11,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:11,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:13:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:11,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:11,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:11,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-20 04:13:11,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:11,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-20 04:13:11,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:11,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-20 04:13:11,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:11,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:13:11,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:11,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:11,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:11,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:11,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:11,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:11,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:11,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:13:11,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:11,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-20 04:13:11,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:11,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-20 04:13:11,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:11,380 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-20 04:13:11,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:11,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257736525] [2022-07-20 04:13:11,381 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257736525] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:11,381 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:11,381 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 04:13:11,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562935010] [2022-07-20 04:13:11,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:11,382 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 04:13:11,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:11,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 04:13:11,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-20 04:13:11,384 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-20 04:13:15,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:15,650 INFO L93 Difference]: Finished difference Result 4235 states and 6090 transitions. [2022-07-20 04:13:15,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 04:13:15,650 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-20 04:13:15,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:15,664 INFO L225 Difference]: With dead ends: 4235 [2022-07-20 04:13:15,664 INFO L226 Difference]: Without dead ends: 2266 [2022-07-20 04:13:15,678 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-20 04:13:15,679 INFO L413 NwaCegarLoop]: 1337 mSDtfsCounter, 2929 mSDsluCounter, 2560 mSDsCounter, 0 mSdLazyCounter, 3948 mSolverCounterSat, 1529 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3074 SdHoareTripleChecker+Valid, 3897 SdHoareTripleChecker+Invalid, 5477 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1529 IncrementalHoareTripleChecker+Valid, 3948 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.0s IncrementalHoareTripleChecker+Time [2022-07-20 04:13:15,680 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3074 Valid, 3897 Invalid, 5477 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1529 Valid, 3948 Invalid, 0 Unknown, 0 Unchecked, 4.0s Time] [2022-07-20 04:13:15,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2266 states. [2022-07-20 04:13:15,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2266 to 2029. [2022-07-20 04:13:15,818 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-20 04:13:15,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2029 states to 2029 states and 2738 transitions. [2022-07-20 04:13:15,826 INFO L78 Accepts]: Start accepts. Automaton has 2029 states and 2738 transitions. Word has length 130 [2022-07-20 04:13:15,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:15,827 INFO L495 AbstractCegarLoop]: Abstraction has 2029 states and 2738 transitions. [2022-07-20 04:13:15,827 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-20 04:13:15,827 INFO L276 IsEmpty]: Start isEmpty. Operand 2029 states and 2738 transitions. [2022-07-20 04:13:15,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-20 04:13:15,829 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:15,829 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-20 04:13:15,830 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-20 04:13:15,830 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-20 04:13:15,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:15,830 INFO L85 PathProgramCache]: Analyzing trace with hash 392750096, now seen corresponding path program 1 times [2022-07-20 04:13:15,830 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:15,831 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462482614] [2022-07-20 04:13:15,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:15,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:15,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:15,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:15,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:15,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:15,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:15,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:15,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:15,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:13:15,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:15,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:13:15,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:15,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 04:13:15,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:15,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:13:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:15,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:15,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:15,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-20 04:13:15,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:15,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-20 04:13:15,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:15,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-20 04:13:15,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:16,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:13:16,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:16,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:16,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:16,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:16,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:16,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:16,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:16,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:13:16,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:16,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-20 04:13:16,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:16,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-07-20 04:13:16,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:16,037 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-20 04:13:16,037 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:16,037 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462482614] [2022-07-20 04:13:16,037 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462482614] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:16,037 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:16,037 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 04:13:16,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48680014] [2022-07-20 04:13:16,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:16,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 04:13:16,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:16,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 04:13:16,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 04:13:16,040 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-20 04:13:19,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:19,634 INFO L93 Difference]: Finished difference Result 2266 states and 3168 transitions. [2022-07-20 04:13:19,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 04:13:19,635 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-20 04:13:19,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:19,649 INFO L225 Difference]: With dead ends: 2266 [2022-07-20 04:13:19,649 INFO L226 Difference]: Without dead ends: 2264 [2022-07-20 04:13:19,651 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-20 04:13:19,652 INFO L413 NwaCegarLoop]: 1336 mSDtfsCounter, 1771 mSDsluCounter, 2176 mSDsCounter, 0 mSdLazyCounter, 2848 mSolverCounterSat, 1221 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1771 SdHoareTripleChecker+Valid, 3512 SdHoareTripleChecker+Invalid, 4069 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1221 IncrementalHoareTripleChecker+Valid, 2848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-20 04:13:19,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1771 Valid, 3512 Invalid, 4069 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1221 Valid, 2848 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-07-20 04:13:19,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2264 states. [2022-07-20 04:13:19,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2264 to 2027. [2022-07-20 04:13:19,755 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-20 04:13:19,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2027 states to 2027 states and 2735 transitions. [2022-07-20 04:13:19,765 INFO L78 Accepts]: Start accepts. Automaton has 2027 states and 2735 transitions. Word has length 130 [2022-07-20 04:13:19,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:19,768 INFO L495 AbstractCegarLoop]: Abstraction has 2027 states and 2735 transitions. [2022-07-20 04:13:19,768 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-20 04:13:19,768 INFO L276 IsEmpty]: Start isEmpty. Operand 2027 states and 2735 transitions. [2022-07-20 04:13:19,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-20 04:13:19,770 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:19,770 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-20 04:13:19,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-20 04:13:19,771 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-20 04:13:19,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:19,772 INFO L85 PathProgramCache]: Analyzing trace with hash 200930521, now seen corresponding path program 1 times [2022-07-20 04:13:19,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:19,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1053176993] [2022-07-20 04:13:19,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:19,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:19,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:19,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:19,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:19,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:19,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:19,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:19,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:19,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:13:19,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:19,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:13:19,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:19,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 04:13:19,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:19,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:13:19,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:19,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:19,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:19,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-20 04:13:19,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:19,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-20 04:13:19,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:19,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-20 04:13:19,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:20,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:13:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:20,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:20,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:20,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:20,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:20,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:20,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:13:20,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:20,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-20 04:13:20,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:20,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-20 04:13:20,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:20,134 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-20 04:13:20,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:20,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1053176993] [2022-07-20 04:13:20,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1053176993] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:20,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:20,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 04:13:20,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262058346] [2022-07-20 04:13:20,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:20,135 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 04:13:20,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:20,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 04:13:20,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-20 04:13:20,136 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-20 04:13:26,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:26,022 INFO L93 Difference]: Finished difference Result 4287 states and 6080 transitions. [2022-07-20 04:13:26,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-07-20 04:13:26,023 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-20 04:13:26,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:26,037 INFO L225 Difference]: With dead ends: 4287 [2022-07-20 04:13:26,037 INFO L226 Difference]: Without dead ends: 2349 [2022-07-20 04:13:26,050 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=87, Invalid=255, Unknown=0, NotChecked=0, Total=342 [2022-07-20 04:13:26,051 INFO L413 NwaCegarLoop]: 1311 mSDtfsCounter, 1810 mSDsluCounter, 3021 mSDsCounter, 0 mSdLazyCounter, 4626 mSolverCounterSat, 1352 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1810 SdHoareTripleChecker+Valid, 4332 SdHoareTripleChecker+Invalid, 5978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1352 IncrementalHoareTripleChecker+Valid, 4626 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.5s IncrementalHoareTripleChecker+Time [2022-07-20 04:13:26,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1810 Valid, 4332 Invalid, 5978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1352 Valid, 4626 Invalid, 0 Unknown, 0 Unchecked, 5.5s Time] [2022-07-20 04:13:26,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2349 states. [2022-07-20 04:13:26,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2349 to 2066. [2022-07-20 04:13:26,235 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-20 04:13:26,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2066 states to 2066 states and 2802 transitions. [2022-07-20 04:13:26,244 INFO L78 Accepts]: Start accepts. Automaton has 2066 states and 2802 transitions. Word has length 127 [2022-07-20 04:13:26,244 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:26,244 INFO L495 AbstractCegarLoop]: Abstraction has 2066 states and 2802 transitions. [2022-07-20 04:13:26,245 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-20 04:13:26,245 INFO L276 IsEmpty]: Start isEmpty. Operand 2066 states and 2802 transitions. [2022-07-20 04:13:26,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-20 04:13:26,247 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:26,247 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-20 04:13:26,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-20 04:13:26,248 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-20 04:13:26,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:26,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1181334718, now seen corresponding path program 1 times [2022-07-20 04:13:26,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:26,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225337811] [2022-07-20 04:13:26,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:26,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:26,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:26,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:26,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:26,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:26,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:26,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:26,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:26,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:13:26,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:26,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:13:26,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:26,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 04:13:26,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:26,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:13:26,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:26,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:26,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:26,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-20 04:13:26,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:26,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-20 04:13:26,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:26,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-20 04:13:26,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:26,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-20 04:13:26,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:26,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-20 04:13:26,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:26,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-20 04:13:26,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:26,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-20 04:13:26,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:26,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-20 04:13:26,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:26,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-20 04:13:26,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:26,470 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-20 04:13:26,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:26,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225337811] [2022-07-20 04:13:26,470 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225337811] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:26,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:26,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:13:26,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177651532] [2022-07-20 04:13:26,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:26,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:13:26,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:26,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:13:26,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:13:26,472 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-20 04:13:28,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:28,386 INFO L93 Difference]: Finished difference Result 2066 states and 2802 transitions. [2022-07-20 04:13:28,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:13:28,386 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-20 04:13:28,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:28,394 INFO L225 Difference]: With dead ends: 2066 [2022-07-20 04:13:28,394 INFO L226 Difference]: Without dead ends: 2064 [2022-07-20 04:13:28,395 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-20 04:13:28,396 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.8s IncrementalHoareTripleChecker+Time [2022-07-20 04:13:28,396 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.8s Time] [2022-07-20 04:13:28,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2064 states. [2022-07-20 04:13:28,529 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2064 to 2064. [2022-07-20 04:13:28,532 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-20 04:13:28,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2064 states to 2064 states and 2799 transitions. [2022-07-20 04:13:28,540 INFO L78 Accepts]: Start accepts. Automaton has 2064 states and 2799 transitions. Word has length 117 [2022-07-20 04:13:28,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:28,540 INFO L495 AbstractCegarLoop]: Abstraction has 2064 states and 2799 transitions. [2022-07-20 04:13:28,540 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-20 04:13:28,541 INFO L276 IsEmpty]: Start isEmpty. Operand 2064 states and 2799 transitions. [2022-07-20 04:13:28,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-20 04:13:28,543 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:28,543 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-20 04:13:28,543 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-20 04:13:28,544 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-20 04:13:28,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:28,544 INFO L85 PathProgramCache]: Analyzing trace with hash 1641601009, now seen corresponding path program 1 times [2022-07-20 04:13:28,544 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:28,544 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1133311994] [2022-07-20 04:13:28,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:28,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:28,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:28,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:28,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:28,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:28,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:28,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:28,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:28,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:13:28,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:28,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:13:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:28,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 04:13:28,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:28,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:13:28,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:28,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:28,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:28,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-20 04:13:28,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:28,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-20 04:13:28,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:28,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-20 04:13:28,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:28,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-20 04:13:28,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:28,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-20 04:13:28,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:28,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-20 04:13:28,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:28,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-20 04:13:28,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:28,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-20 04:13:28,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:28,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-20 04:13:28,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:28,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-20 04:13:28,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:28,755 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-20 04:13:28,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:28,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1133311994] [2022-07-20 04:13:28,756 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1133311994] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:28,756 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:28,756 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:13:28,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [973221586] [2022-07-20 04:13:28,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:28,757 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:13:28,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:28,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:13:28,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:13:28,758 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-20 04:13:30,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:30,945 INFO L93 Difference]: Finished difference Result 2064 states and 2799 transitions. [2022-07-20 04:13:30,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:13:30,946 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-20 04:13:30,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:30,956 INFO L225 Difference]: With dead ends: 2064 [2022-07-20 04:13:30,956 INFO L226 Difference]: Without dead ends: 2062 [2022-07-20 04:13:30,958 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-20 04:13:30,959 INFO L413 NwaCegarLoop]: 1343 mSDtfsCounter, 2224 mSDsluCounter, 1288 mSDsCounter, 0 mSdLazyCounter, 1319 mSolverCounterSat, 920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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, 2.0s IncrementalHoareTripleChecker+Time [2022-07-20 04:13:30,959 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2345 Valid, 2631 Invalid, 2239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [920 Valid, 1319 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-20 04:13:30,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2062 states. [2022-07-20 04:13:31,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2062 to 2062. [2022-07-20 04:13:31,077 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-20 04:13:31,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2062 states to 2062 states and 2797 transitions. [2022-07-20 04:13:31,086 INFO L78 Accepts]: Start accepts. Automaton has 2062 states and 2797 transitions. Word has length 123 [2022-07-20 04:13:31,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:31,086 INFO L495 AbstractCegarLoop]: Abstraction has 2062 states and 2797 transitions. [2022-07-20 04:13:31,087 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-20 04:13:31,087 INFO L276 IsEmpty]: Start isEmpty. Operand 2062 states and 2797 transitions. [2022-07-20 04:13:31,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-07-20 04:13:31,089 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:31,090 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-20 04:13:31,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-20 04:13:31,090 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-20 04:13:31,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:31,091 INFO L85 PathProgramCache]: Analyzing trace with hash -572408838, now seen corresponding path program 1 times [2022-07-20 04:13:31,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:31,091 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1973564705] [2022-07-20 04:13:31,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:31,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:31,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:31,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:31,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:31,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:31,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:31,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:31,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:31,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:13:31,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:31,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:13:31,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:31,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 04:13:31,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:31,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:13:31,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:31,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:31,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-20 04:13:31,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:31,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-20 04:13:31,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:31,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-20 04:13:31,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:31,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:13:31,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:31,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:31,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:31,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:31,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:31,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:31,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:13:31,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:31,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-20 04:13:31,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:31,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-20 04:13:31,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:31,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:31,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:31,355 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-20 04:13:31,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:31,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1973564705] [2022-07-20 04:13:31,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1973564705] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:31,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:31,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:13:31,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717233950] [2022-07-20 04:13:31,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:31,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:13:31,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:31,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:13:31,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:13:31,358 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-20 04:13:33,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:33,582 INFO L93 Difference]: Finished difference Result 4291 states and 6228 transitions. [2022-07-20 04:13:33,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:13:33,583 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-20 04:13:33,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:33,596 INFO L225 Difference]: With dead ends: 4291 [2022-07-20 04:13:33,597 INFO L226 Difference]: Without dead ends: 2286 [2022-07-20 04:13:33,609 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-20 04:13:33,609 INFO L413 NwaCegarLoop]: 1329 mSDtfsCounter, 2885 mSDsluCounter, 1126 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 1524 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3028 SdHoareTripleChecker+Valid, 2455 SdHoareTripleChecker+Invalid, 2467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1524 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-20 04:13:33,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3028 Valid, 2455 Invalid, 2467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1524 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-20 04:13:33,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2286 states. [2022-07-20 04:13:33,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2286 to 2056. [2022-07-20 04:13:33,728 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-20 04:13:33,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2056 states to 2056 states and 2788 transitions. [2022-07-20 04:13:33,738 INFO L78 Accepts]: Start accepts. Automaton has 2056 states and 2788 transitions. Word has length 137 [2022-07-20 04:13:33,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:33,739 INFO L495 AbstractCegarLoop]: Abstraction has 2056 states and 2788 transitions. [2022-07-20 04:13:33,739 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-20 04:13:33,740 INFO L276 IsEmpty]: Start isEmpty. Operand 2056 states and 2788 transitions. [2022-07-20 04:13:33,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-07-20 04:13:33,748 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:33,748 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-20 04:13:33,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-20 04:13:33,748 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-20 04:13:33,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:33,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1009057684, now seen corresponding path program 1 times [2022-07-20 04:13:33,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:33,750 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359977794] [2022-07-20 04:13:33,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:33,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:33,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:34,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:34,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:34,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:34,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:34,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:13:34,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:34,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:13:34,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:34,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:34,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:34,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:34,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:34,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:13:34,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:34,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:34,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:34,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:34,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:34,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:34,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:13:34,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:34,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:34,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:34,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:34,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:34,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:34,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:34,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:13:34,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:34,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:34,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:34,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:34,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:34,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:34,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:34,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:13:34,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:34,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:34,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:34,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:34,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:34,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:34,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:34,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:13:34,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:34,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:13:34,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:34,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-20 04:13:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:34,342 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-20 04:13:34,342 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:34,342 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359977794] [2022-07-20 04:13:34,343 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359977794] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:34,343 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:34,343 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-20 04:13:34,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639667057] [2022-07-20 04:13:34,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:34,344 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-20 04:13:34,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:34,344 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-20 04:13:34,344 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-20 04:13:34,344 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-20 04:13:48,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:48,264 INFO L93 Difference]: Finished difference Result 5586 states and 8033 transitions. [2022-07-20 04:13:48,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 04:13:48,267 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-20 04:13:48,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:48,287 INFO L225 Difference]: With dead ends: 5586 [2022-07-20 04:13:48,288 INFO L226 Difference]: Without dead ends: 3676 [2022-07-20 04:13:48,296 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-20 04:13:48,297 INFO L413 NwaCegarLoop]: 1960 mSDtfsCounter, 4687 mSDsluCounter, 7217 mSDsCounter, 0 mSdLazyCounter, 9098 mSolverCounterSat, 2420 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4687 SdHoareTripleChecker+Valid, 9177 SdHoareTripleChecker+Invalid, 11518 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2420 IncrementalHoareTripleChecker+Valid, 9098 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.1s IncrementalHoareTripleChecker+Time [2022-07-20 04:13:48,297 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4687 Valid, 9177 Invalid, 11518 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2420 Valid, 9098 Invalid, 0 Unknown, 0 Unchecked, 13.1s Time] [2022-07-20 04:13:48,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3676 states. [2022-07-20 04:13:48,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3676 to 2069. [2022-07-20 04:13:48,567 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-20 04:13:48,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2069 states to 2069 states and 2804 transitions. [2022-07-20 04:13:48,575 INFO L78 Accepts]: Start accepts. Automaton has 2069 states and 2804 transitions. Word has length 166 [2022-07-20 04:13:48,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:48,576 INFO L495 AbstractCegarLoop]: Abstraction has 2069 states and 2804 transitions. [2022-07-20 04:13:48,576 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-20 04:13:48,576 INFO L276 IsEmpty]: Start isEmpty. Operand 2069 states and 2804 transitions. [2022-07-20 04:13:48,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-20 04:13:48,579 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:48,580 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-20 04:13:48,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-20 04:13:48,580 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-20 04:13:48,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:48,580 INFO L85 PathProgramCache]: Analyzing trace with hash -241167825, now seen corresponding path program 1 times [2022-07-20 04:13:48,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:48,581 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653166413] [2022-07-20 04:13:48,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:48,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:48,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:48,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:48,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:13:48,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:13:48,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:48,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:48,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:48,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:13:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:48,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:48,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:48,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:13:48,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:48,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:48,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:48,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:13:48,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:48,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:48,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:48,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:13:48,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:48,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:48,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:13:48,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:13:48,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-20 04:13:48,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:48,909 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-20 04:13:48,909 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:48,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653166413] [2022-07-20 04:13:48,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653166413] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:48,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:48,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:13:48,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [466582387] [2022-07-20 04:13:48,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:48,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:13:48,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:48,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:13:48,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:13:48,918 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-20 04:13:53,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:13:53,976 INFO L93 Difference]: Finished difference Result 6551 states and 9859 transitions. [2022-07-20 04:13:53,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-20 04:13:53,976 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-20 04:13:53,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:13:54,004 INFO L225 Difference]: With dead ends: 6551 [2022-07-20 04:13:54,004 INFO L226 Difference]: Without dead ends: 4535 [2022-07-20 04:13:54,015 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-20 04:13:54,016 INFO L413 NwaCegarLoop]: 1635 mSDtfsCounter, 4586 mSDsluCounter, 1866 mSDsCounter, 0 mSdLazyCounter, 2737 mSolverCounterSat, 2761 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4668 SdHoareTripleChecker+Valid, 3501 SdHoareTripleChecker+Invalid, 5498 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2761 IncrementalHoareTripleChecker+Valid, 2737 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.5s IncrementalHoareTripleChecker+Time [2022-07-20 04:13:54,016 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4668 Valid, 3501 Invalid, 5498 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2761 Valid, 2737 Invalid, 0 Unknown, 0 Unchecked, 4.5s Time] [2022-07-20 04:13:54,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4535 states. [2022-07-20 04:13:54,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4535 to 4038. [2022-07-20 04:13:54,457 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-20 04:13:54,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4038 states to 4038 states and 5898 transitions. [2022-07-20 04:13:54,476 INFO L78 Accepts]: Start accepts. Automaton has 4038 states and 5898 transitions. Word has length 168 [2022-07-20 04:13:54,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:13:54,477 INFO L495 AbstractCegarLoop]: Abstraction has 4038 states and 5898 transitions. [2022-07-20 04:13:54,477 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-20 04:13:54,477 INFO L276 IsEmpty]: Start isEmpty. Operand 4038 states and 5898 transitions. [2022-07-20 04:13:54,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 169 [2022-07-20 04:13:54,480 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:13:54,480 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-20 04:13:54,480 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-20 04:13:54,480 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-20 04:13:54,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:13:54,481 INFO L85 PathProgramCache]: Analyzing trace with hash 2059654765, now seen corresponding path program 1 times [2022-07-20 04:13:54,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:13:54,481 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225984281] [2022-07-20 04:13:54,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:13:54,481 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:13:54,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:13:54,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:13:54,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:13:54,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:13:54,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:13:54,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:54,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:54,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:54,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:13:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:54,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:54,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:54,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:13:54,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:54,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:54,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:54,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:13:54,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:54,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:54,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:54,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:13:54,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:13:54,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:13:54,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:13:54,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:13:54,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:13:54,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-20 04:13:54,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:13:54,851 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-20 04:13:54,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:13:54,852 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225984281] [2022-07-20 04:13:54,852 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225984281] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:13:54,852 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:13:54,852 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-20 04:13:54,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [400425660] [2022-07-20 04:13:54,853 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:13:54,854 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-20 04:13:54,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:13:54,854 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-20 04:13:54,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-20 04:13:54,854 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-20 04:14:02,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:14:02,908 INFO L93 Difference]: Finished difference Result 8464 states and 12854 transitions. [2022-07-20 04:14:02,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 04:14:02,908 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-20 04:14:02,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:14:02,932 INFO L225 Difference]: With dead ends: 8464 [2022-07-20 04:14:02,932 INFO L226 Difference]: Without dead ends: 4537 [2022-07-20 04:14:02,950 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-20 04:14:02,950 INFO L413 NwaCegarLoop]: 2470 mSDtfsCounter, 2893 mSDsluCounter, 4161 mSDsCounter, 0 mSdLazyCounter, 6689 mSolverCounterSat, 2137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2971 SdHoareTripleChecker+Valid, 6631 SdHoareTripleChecker+Invalid, 8826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2137 IncrementalHoareTripleChecker+Valid, 6689 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-07-20 04:14:02,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2971 Valid, 6631 Invalid, 8826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2137 Valid, 6689 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2022-07-20 04:14:02,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4537 states. [2022-07-20 04:14:03,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4537 to 4034. [2022-07-20 04:14:03,412 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-20 04:14:03,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4034 states to 4034 states and 5889 transitions. [2022-07-20 04:14:03,432 INFO L78 Accepts]: Start accepts. Automaton has 4034 states and 5889 transitions. Word has length 168 [2022-07-20 04:14:03,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:14:03,432 INFO L495 AbstractCegarLoop]: Abstraction has 4034 states and 5889 transitions. [2022-07-20 04:14:03,433 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-20 04:14:03,433 INFO L276 IsEmpty]: Start isEmpty. Operand 4034 states and 5889 transitions. [2022-07-20 04:14:03,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-20 04:14:03,435 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:14:03,436 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-20 04:14:03,436 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-20 04:14:03,436 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-20 04:14:03,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:14:03,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1284125422, now seen corresponding path program 1 times [2022-07-20 04:14:03,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:14:03,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1414053908] [2022-07-20 04:14:03,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:03,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:14:03,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:03,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:14:03,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:03,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:14:03,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:03,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:14:03,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:03,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:14:03,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:03,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:14:03,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:03,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 04:14:03,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:03,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:14:03,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:03,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:03,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:03,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-20 04:14:03,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:03,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-20 04:14:03,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:03,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-20 04:14:03,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:03,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-20 04:14:03,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:03,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-20 04:14:03,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:03,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-20 04:14:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:03,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-20 04:14:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:03,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-20 04:14:03,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:03,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-20 04:14:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:03,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-20 04:14:03,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:03,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-20 04:14:03,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:03,714 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-20 04:14:03,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:14:03,715 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1414053908] [2022-07-20 04:14:03,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1414053908] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:14:03,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:14:03,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:14:03,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77601790] [2022-07-20 04:14:03,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:14:03,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:14:03,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:14:03,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:14:03,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:14:03,717 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-20 04:14:06,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:14:06,042 INFO L93 Difference]: Finished difference Result 4034 states and 5889 transitions. [2022-07-20 04:14:06,042 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:14:06,042 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-20 04:14:06,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:14:06,054 INFO L225 Difference]: With dead ends: 4034 [2022-07-20 04:14:06,054 INFO L226 Difference]: Without dead ends: 4032 [2022-07-20 04:14:06,055 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-20 04:14:06,056 INFO L413 NwaCegarLoop]: 1334 mSDtfsCounter, 2199 mSDsluCounter, 1285 mSDsCounter, 0 mSdLazyCounter, 1311 mSolverCounterSat, 920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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, 1.9s IncrementalHoareTripleChecker+Time [2022-07-20 04:14:06,056 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2319 Valid, 2619 Invalid, 2231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [920 Valid, 1311 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-20 04:14:06,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4032 states. [2022-07-20 04:14:06,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4032 to 4032. [2022-07-20 04:14:06,524 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-20 04:14:06,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4032 states to 4032 states and 5887 transitions. [2022-07-20 04:14:06,545 INFO L78 Accepts]: Start accepts. Automaton has 4032 states and 5887 transitions. Word has length 129 [2022-07-20 04:14:06,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:14:06,545 INFO L495 AbstractCegarLoop]: Abstraction has 4032 states and 5887 transitions. [2022-07-20 04:14:06,546 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-20 04:14:06,546 INFO L276 IsEmpty]: Start isEmpty. Operand 4032 states and 5887 transitions. [2022-07-20 04:14:06,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2022-07-20 04:14:06,548 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:14:06,549 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-20 04:14:06,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-20 04:14:06,549 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-20 04:14:06,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:14:06,550 INFO L85 PathProgramCache]: Analyzing trace with hash -651550320, now seen corresponding path program 1 times [2022-07-20 04:14:06,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:14:06,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847481319] [2022-07-20 04:14:06,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:06,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:14:06,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:14:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:14:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:14:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:14:06,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:14:06,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:06,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:06,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:06,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:14:06,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:06,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:06,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:06,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:14:06,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:06,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:06,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:14:06,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:06,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:06,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:06,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:14:06,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:06,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:06,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:06,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:14:06,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:14:06,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-20 04:14:06,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:06,842 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-20 04:14:06,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:14:06,843 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847481319] [2022-07-20 04:14:06,843 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847481319] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:14:06,843 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:14:06,843 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 04:14:06,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816888278] [2022-07-20 04:14:06,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:14:06,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 04:14:06,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:14:06,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 04:14:06,846 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-20 04:14:06,846 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-20 04:14:14,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:14:14,916 INFO L93 Difference]: Finished difference Result 4533 states and 6617 transitions. [2022-07-20 04:14:14,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 04:14:14,917 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-20 04:14:14,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:14:14,937 INFO L225 Difference]: With dead ends: 4533 [2022-07-20 04:14:14,937 INFO L226 Difference]: Without dead ends: 4531 [2022-07-20 04:14:14,940 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-20 04:14:14,941 INFO L413 NwaCegarLoop]: 2461 mSDtfsCounter, 3881 mSDsluCounter, 4161 mSDsCounter, 0 mSdLazyCounter, 6691 mSolverCounterSat, 2691 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3959 SdHoareTripleChecker+Valid, 6622 SdHoareTripleChecker+Invalid, 9382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2691 IncrementalHoareTripleChecker+Valid, 6691 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.5s IncrementalHoareTripleChecker+Time [2022-07-20 04:14:14,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3959 Valid, 6622 Invalid, 9382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2691 Valid, 6691 Invalid, 0 Unknown, 0 Unchecked, 7.5s Time] [2022-07-20 04:14:14,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4531 states. [2022-07-20 04:14:15,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4531 to 4036. [2022-07-20 04:14:15,392 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-20 04:14:15,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4036 states to 4036 states and 5891 transitions. [2022-07-20 04:14:15,410 INFO L78 Accepts]: Start accepts. Automaton has 4036 states and 5891 transitions. Word has length 170 [2022-07-20 04:14:15,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:14:15,411 INFO L495 AbstractCegarLoop]: Abstraction has 4036 states and 5891 transitions. [2022-07-20 04:14:15,411 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-20 04:14:15,411 INFO L276 IsEmpty]: Start isEmpty. Operand 4036 states and 5891 transitions. [2022-07-20 04:14:15,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 173 [2022-07-20 04:14:15,414 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:14:15,414 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-20 04:14:15,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-20 04:14:15,414 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-20 04:14:15,415 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:14:15,415 INFO L85 PathProgramCache]: Analyzing trace with hash 1121977116, now seen corresponding path program 1 times [2022-07-20 04:14:15,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:14:15,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52195325] [2022-07-20 04:14:15,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:15,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:14:15,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:15,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:14:15,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:15,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:14:15,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:15,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:14:15,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:15,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:14:15,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:15,550 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:14:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:15,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:15,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:15,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:15,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:15,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:15,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:15,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:14:15,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:15,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:15,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:15,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:15,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:15,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:15,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:14:15,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:15,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:15,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:15,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:15,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:15,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:15,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:15,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:14:15,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:15,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:15,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:15,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:15,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:15,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:15,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:14:15,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:15,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:15,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:15,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:15,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:15,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:15,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:15,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:14:15,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:15,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:14:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:15,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-20 04:14:15,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:15,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-20 04:14:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:15,691 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-20 04:14:15,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:14:15,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52195325] [2022-07-20 04:14:15,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52195325] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:14:15,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:14:15,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-20 04:14:15,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [605488025] [2022-07-20 04:14:15,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:14:15,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-20 04:14:15,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:14:15,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-20 04:14:15,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-20 04:14:15,695 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-20 04:14:18,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:14:18,897 INFO L93 Difference]: Finished difference Result 8345 states and 12444 transitions. [2022-07-20 04:14:18,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-20 04:14:18,899 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-20 04:14:18,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:14:18,917 INFO L225 Difference]: With dead ends: 8345 [2022-07-20 04:14:18,918 INFO L226 Difference]: Without dead ends: 4510 [2022-07-20 04:14:18,931 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-20 04:14:18,932 INFO L413 NwaCegarLoop]: 1179 mSDtfsCounter, 3924 mSDsluCounter, 1482 mSDsCounter, 0 mSdLazyCounter, 1452 mSolverCounterSat, 2171 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4119 SdHoareTripleChecker+Valid, 2661 SdHoareTripleChecker+Invalid, 3623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2171 IncrementalHoareTripleChecker+Valid, 1452 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.7s IncrementalHoareTripleChecker+Time [2022-07-20 04:14:18,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4119 Valid, 2661 Invalid, 3623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2171 Valid, 1452 Invalid, 0 Unknown, 0 Unchecked, 2.7s Time] [2022-07-20 04:14:18,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4510 states. [2022-07-20 04:14:19,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4510 to 4050. [2022-07-20 04:14:19,353 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-20 04:14:19,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4050 states to 4050 states and 5995 transitions. [2022-07-20 04:14:19,373 INFO L78 Accepts]: Start accepts. Automaton has 4050 states and 5995 transitions. Word has length 172 [2022-07-20 04:14:19,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:14:19,374 INFO L495 AbstractCegarLoop]: Abstraction has 4050 states and 5995 transitions. [2022-07-20 04:14:19,375 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-20 04:14:19,375 INFO L276 IsEmpty]: Start isEmpty. Operand 4050 states and 5995 transitions. [2022-07-20 04:14:19,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-20 04:14:19,378 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:14:19,378 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-20 04:14:19,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-20 04:14:19,379 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-20 04:14:19,379 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:14:19,379 INFO L85 PathProgramCache]: Analyzing trace with hash 155784661, now seen corresponding path program 1 times [2022-07-20 04:14:19,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:14:19,380 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484517790] [2022-07-20 04:14:19,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:19,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:14:19,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:19,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:14:19,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:19,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:14:19,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:19,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:14:19,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:19,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:14:19,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:19,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:14:19,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:19,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 04:14:19,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:19,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:14:19,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:19,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:19,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:19,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-20 04:14:19,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:19,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-20 04:14:19,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:19,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-20 04:14:19,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:19,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-20 04:14:19,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:19,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-20 04:14:19,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:19,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-20 04:14:19,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:19,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-20 04:14:19,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:19,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-20 04:14:19,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:19,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-20 04:14:19,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:19,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-20 04:14:19,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:19,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-20 04:14:19,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:19,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-20 04:14:19,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:19,670 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-20 04:14:19,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:14:19,671 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484517790] [2022-07-20 04:14:19,671 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [484517790] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:14:19,671 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:14:19,671 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:14:19,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318914547] [2022-07-20 04:14:19,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:14:19,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:14:19,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:14:19,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:14:19,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:14:19,674 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-20 04:14:21,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:14:21,923 INFO L93 Difference]: Finished difference Result 4050 states and 5995 transitions. [2022-07-20 04:14:21,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:14:21,923 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-20 04:14:21,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:14:21,938 INFO L225 Difference]: With dead ends: 4050 [2022-07-20 04:14:21,939 INFO L226 Difference]: Without dead ends: 4048 [2022-07-20 04:14:21,941 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-20 04:14:21,941 INFO L413 NwaCegarLoop]: 1327 mSDtfsCounter, 2188 mSDsluCounter, 1271 mSDsCounter, 0 mSdLazyCounter, 1308 mSolverCounterSat, 920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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, 1.9s IncrementalHoareTripleChecker+Time [2022-07-20 04:14:21,942 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2307 Valid, 2598 Invalid, 2228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [920 Valid, 1308 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-20 04:14:21,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4048 states. [2022-07-20 04:14:22,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4048 to 4048. [2022-07-20 04:14:22,362 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-20 04:14:22,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4048 states to 4048 states and 5993 transitions. [2022-07-20 04:14:22,384 INFO L78 Accepts]: Start accepts. Automaton has 4048 states and 5993 transitions. Word has length 135 [2022-07-20 04:14:22,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:14:22,385 INFO L495 AbstractCegarLoop]: Abstraction has 4048 states and 5993 transitions. [2022-07-20 04:14:22,385 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-20 04:14:22,385 INFO L276 IsEmpty]: Start isEmpty. Operand 4048 states and 5993 transitions. [2022-07-20 04:14:22,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-07-20 04:14:22,389 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:14:22,389 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-20 04:14:22,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-20 04:14:22,390 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-20 04:14:22,390 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:14:22,390 INFO L85 PathProgramCache]: Analyzing trace with hash 359029675, now seen corresponding path program 1 times [2022-07-20 04:14:22,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:14:22,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074966180] [2022-07-20 04:14:22,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:22,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:14:22,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:22,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:14:22,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:22,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:14:22,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:22,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:14:22,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:22,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:14:22,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:22,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:14:22,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:22,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:22,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:22,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:22,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:22,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:22,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:22,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:14:22,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:22,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:22,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:22,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:22,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:22,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:22,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:22,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:14:22,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:22,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:22,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:22,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:22,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:22,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:22,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:22,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:14:22,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:22,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:22,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:22,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:22,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:22,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:22,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:22,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:14:22,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:22,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:22,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:22,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:22,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:22,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:22,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:22,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:14:22,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:22,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:14:22,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:22,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-20 04:14:22,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:22,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-20 04:14:22,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:22,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-20 04:14:22,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:22,734 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-20 04:14:22,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:14:22,734 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074966180] [2022-07-20 04:14:22,734 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074966180] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 04:14:22,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936075530] [2022-07-20 04:14:22,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:22,735 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:14:22,735 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:14:22,739 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-20 04:14:22,772 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-20 04:14:23,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:23,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 2117 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-20 04:14:23,532 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:14:23,630 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-20 04:14:23,631 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 04:14:23,631 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936075530] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:14:23,631 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 04:14:23,631 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2022-07-20 04:14:23,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644850494] [2022-07-20 04:14:23,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:14:23,632 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-20 04:14:23,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:14:23,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-20 04:14:23,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-20 04:14:23,636 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-20 04:14:24,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:14:24,112 INFO L93 Difference]: Finished difference Result 7931 states and 11700 transitions. [2022-07-20 04:14:24,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-20 04:14:24,113 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-20 04:14:24,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:14:24,138 INFO L225 Difference]: With dead ends: 7931 [2022-07-20 04:14:24,138 INFO L226 Difference]: Without dead ends: 4096 [2022-07-20 04:14:24,156 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 240 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-07-20 04:14:24,157 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-20 04:14:24,158 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-20 04:14:24,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4096 states. [2022-07-20 04:14:24,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4096 to 4093. [2022-07-20 04:14:24,552 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-20 04:14:24,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4093 states to 4093 states and 6044 transitions. [2022-07-20 04:14:24,575 INFO L78 Accepts]: Start accepts. Automaton has 4093 states and 6044 transitions. Word has length 178 [2022-07-20 04:14:24,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:14:24,576 INFO L495 AbstractCegarLoop]: Abstraction has 4093 states and 6044 transitions. [2022-07-20 04:14:24,576 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-20 04:14:24,576 INFO L276 IsEmpty]: Start isEmpty. Operand 4093 states and 6044 transitions. [2022-07-20 04:14:24,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-20 04:14:24,581 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:14:24,581 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-20 04:14:24,615 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-20 04:14:24,807 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-20 04:14:24,807 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-20 04:14:24,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:14:24,808 INFO L85 PathProgramCache]: Analyzing trace with hash -116780528, now seen corresponding path program 1 times [2022-07-20 04:14:24,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:14:24,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165151681] [2022-07-20 04:14:24,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:24,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:14:24,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:24,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:14:24,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:24,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:14:24,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:24,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:14:24,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:24,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:14:24,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:24,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:14:24,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:24,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 04:14:24,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:24,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:14:24,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:24,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:24,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:24,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-20 04:14:24,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:24,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-20 04:14:24,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:24,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-20 04:14:24,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:24,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-20 04:14:24,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:24,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-20 04:14:24,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:24,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-20 04:14:24,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:24,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-20 04:14:24,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:24,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-20 04:14:24,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:24,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-20 04:14:25,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:25,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-20 04:14:25,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:25,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-20 04:14:25,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:25,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-20 04:14:25,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:25,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-20 04:14:25,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:25,022 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-20 04:14:25,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:14:25,023 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165151681] [2022-07-20 04:14:25,023 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165151681] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:14:25,023 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:14:25,023 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:14:25,023 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811238604] [2022-07-20 04:14:25,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:14:25,024 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:14:25,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:14:25,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:14:25,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:14:25,025 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-20 04:14:27,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:14:27,608 INFO L93 Difference]: Finished difference Result 4093 states and 6044 transitions. [2022-07-20 04:14:27,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:14:27,608 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-20 04:14:27,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:14:27,625 INFO L225 Difference]: With dead ends: 4093 [2022-07-20 04:14:27,625 INFO L226 Difference]: Without dead ends: 4091 [2022-07-20 04:14:27,628 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-20 04:14:27,629 INFO L413 NwaCegarLoop]: 1320 mSDtfsCounter, 2177 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 1305 mSolverCounterSat, 920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.8s 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-20 04:14:27,629 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-20 04:14:27,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4091 states. [2022-07-20 04:14:28,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4091 to 4091. [2022-07-20 04:14:28,136 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-20 04:14:28,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4091 states to 4091 states and 6042 transitions. [2022-07-20 04:14:28,156 INFO L78 Accepts]: Start accepts. Automaton has 4091 states and 6042 transitions. Word has length 141 [2022-07-20 04:14:28,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:14:28,156 INFO L495 AbstractCegarLoop]: Abstraction has 4091 states and 6042 transitions. [2022-07-20 04:14:28,156 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-20 04:14:28,157 INFO L276 IsEmpty]: Start isEmpty. Operand 4091 states and 6042 transitions. [2022-07-20 04:14:28,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-20 04:14:28,161 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:14:28,162 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-20 04:14:28,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-20 04:14:28,162 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-20 04:14:28,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:14:28,163 INFO L85 PathProgramCache]: Analyzing trace with hash 208514548, now seen corresponding path program 1 times [2022-07-20 04:14:28,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:14:28,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1962875180] [2022-07-20 04:14:28,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:28,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:14:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:28,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:14:28,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:28,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:14:28,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:28,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:14:28,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:28,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:14:28,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:28,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:14:28,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:28,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 04:14:28,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:28,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:14:28,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:28,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:28,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:28,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-20 04:14:28,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:28,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-20 04:14:28,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:28,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-20 04:14:28,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:28,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:14:28,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:28,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:28,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:28,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:28,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:28,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:28,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:28,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:14:28,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:28,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-20 04:14:28,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:28,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-20 04:14:28,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:28,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2022-07-20 04:14:28,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:28,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2022-07-20 04:14:28,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:28,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-20 04:14:28,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:28,463 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-20 04:14:28,464 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:14:28,464 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1962875180] [2022-07-20 04:14:28,464 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1962875180] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:14:28,464 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:14:28,464 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-20 04:14:28,464 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059272151] [2022-07-20 04:14:28,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:14:28,465 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-20 04:14:28,465 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:14:28,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-20 04:14:28,466 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-20 04:14:28,466 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-20 04:14:35,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:14:35,611 INFO L93 Difference]: Finished difference Result 8600 states and 14385 transitions. [2022-07-20 04:14:35,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 04:14:35,612 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-20 04:14:35,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:14:35,636 INFO L225 Difference]: With dead ends: 8600 [2022-07-20 04:14:35,636 INFO L226 Difference]: Without dead ends: 4677 [2022-07-20 04:14:35,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=133, Invalid=373, Unknown=0, NotChecked=0, Total=506 [2022-07-20 04:14:35,662 INFO L413 NwaCegarLoop]: 1296 mSDtfsCounter, 1763 mSDsluCounter, 2947 mSDsCounter, 0 mSdLazyCounter, 4650 mSolverCounterSat, 1359 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1763 SdHoareTripleChecker+Valid, 4243 SdHoareTripleChecker+Invalid, 6009 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1359 IncrementalHoareTripleChecker+Valid, 4650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-07-20 04:14:35,662 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1763 Valid, 4243 Invalid, 6009 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1359 Valid, 4650 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-07-20 04:14:35,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4677 states. [2022-07-20 04:14:36,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4677 to 4097. [2022-07-20 04:14:36,097 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-20 04:14:36,113 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4097 states to 4097 states and 6038 transitions. [2022-07-20 04:14:36,116 INFO L78 Accepts]: Start accepts. Automaton has 4097 states and 6038 transitions. Word has length 157 [2022-07-20 04:14:36,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:14:36,116 INFO L495 AbstractCegarLoop]: Abstraction has 4097 states and 6038 transitions. [2022-07-20 04:14:36,117 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-20 04:14:36,117 INFO L276 IsEmpty]: Start isEmpty. Operand 4097 states and 6038 transitions. [2022-07-20 04:14:36,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-20 04:14:36,121 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:14:36,121 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-20 04:14:36,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-20 04:14:36,122 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-20 04:14:36,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:14:36,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1703019388, now seen corresponding path program 1 times [2022-07-20 04:14:36,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:14:36,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229187163] [2022-07-20 04:14:36,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:36,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:14:36,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:36,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:14:36,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:36,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:14:36,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:36,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:14:36,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:36,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:14:36,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:36,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:14:36,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:36,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 04:14:36,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:36,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:14:36,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:36,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:36,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:36,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-20 04:14:36,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:36,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-20 04:14:36,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:36,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-20 04:14:36,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:36,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-20 04:14:36,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:36,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-20 04:14:36,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:36,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-20 04:14:36,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:36,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-20 04:14:36,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:36,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-20 04:14:36,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:36,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-20 04:14:36,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:36,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-20 04:14:36,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:36,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-20 04:14:36,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:36,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-20 04:14:36,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:36,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-20 04:14:36,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:36,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:14:36,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:36,354 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-20 04:14:36,355 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:14:36,355 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229187163] [2022-07-20 04:14:36,355 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229187163] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:14:36,355 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:14:36,355 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:14:36,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1120342378] [2022-07-20 04:14:36,356 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:14:36,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:14:36,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:14:36,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:14:36,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:14:36,357 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-20 04:14:38,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:14:38,724 INFO L93 Difference]: Finished difference Result 4097 states and 6038 transitions. [2022-07-20 04:14:38,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:14:38,724 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-20 04:14:38,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:14:38,736 INFO L225 Difference]: With dead ends: 4097 [2022-07-20 04:14:38,737 INFO L226 Difference]: Without dead ends: 4095 [2022-07-20 04:14:38,739 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-20 04:14:38,739 INFO L413 NwaCegarLoop]: 1318 mSDtfsCounter, 2171 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 1303 mSolverCounterSat, 920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s 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, 2.0s IncrementalHoareTripleChecker+Time [2022-07-20 04:14:38,744 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2288 Valid, 2575 Invalid, 2223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [920 Valid, 1303 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-20 04:14:38,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4095 states. [2022-07-20 04:14:39,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4095 to 4095. [2022-07-20 04:14:39,138 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-20 04:14:39,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4095 states to 4095 states and 6036 transitions. [2022-07-20 04:14:39,151 INFO L78 Accepts]: Start accepts. Automaton has 4095 states and 6036 transitions. Word has length 147 [2022-07-20 04:14:39,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:14:39,152 INFO L495 AbstractCegarLoop]: Abstraction has 4095 states and 6036 transitions. [2022-07-20 04:14:39,152 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-20 04:14:39,152 INFO L276 IsEmpty]: Start isEmpty. Operand 4095 states and 6036 transitions. [2022-07-20 04:14:39,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-20 04:14:39,156 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:14:39,157 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-20 04:14:39,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-20 04:14:39,157 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-20 04:14:39,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:14:39,158 INFO L85 PathProgramCache]: Analyzing trace with hash -1018861834, now seen corresponding path program 1 times [2022-07-20 04:14:39,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:14:39,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1246652634] [2022-07-20 04:14:39,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:39,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:14:39,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:39,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:14:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:39,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:14:39,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:39,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:14:39,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:39,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:14:39,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:39,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:14:39,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:39,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 04:14:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:39,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:14:39,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:39,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:39,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:39,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-20 04:14:39,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:39,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-20 04:14:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:39,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-20 04:14:39,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:39,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-20 04:14:39,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:39,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-20 04:14:39,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:39,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-20 04:14:39,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:39,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-20 04:14:39,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:39,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-20 04:14:39,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:39,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-20 04:14:39,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:39,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-20 04:14:39,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:39,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-20 04:14:39,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:39,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-20 04:14:39,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:39,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-20 04:14:39,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:39,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:14:39,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:39,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-20 04:14:39,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:39,381 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-20 04:14:39,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:14:39,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1246652634] [2022-07-20 04:14:39,382 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1246652634] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:14:39,382 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:14:39,382 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:14:39,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [167771898] [2022-07-20 04:14:39,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:14:39,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:14:39,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:14:39,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:14:39,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:14:39,384 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-20 04:14:41,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:14:41,723 INFO L93 Difference]: Finished difference Result 4095 states and 6036 transitions. [2022-07-20 04:14:41,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:14:41,726 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-20 04:14:41,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:14:41,738 INFO L225 Difference]: With dead ends: 4095 [2022-07-20 04:14:41,738 INFO L226 Difference]: Without dead ends: 4093 [2022-07-20 04:14:41,739 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-20 04:14:41,740 INFO L413 NwaCegarLoop]: 1316 mSDtfsCounter, 2165 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 1301 mSolverCounterSat, 920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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.9s IncrementalHoareTripleChecker+Time [2022-07-20 04:14:41,740 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.9s Time] [2022-07-20 04:14:41,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4093 states. [2022-07-20 04:14:42,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4093 to 4093. [2022-07-20 04:14:42,126 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-20 04:14:42,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4093 states to 4093 states and 6034 transitions. [2022-07-20 04:14:42,140 INFO L78 Accepts]: Start accepts. Automaton has 4093 states and 6034 transitions. Word has length 153 [2022-07-20 04:14:42,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:14:42,141 INFO L495 AbstractCegarLoop]: Abstraction has 4093 states and 6034 transitions. [2022-07-20 04:14:42,141 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-20 04:14:42,141 INFO L276 IsEmpty]: Start isEmpty. Operand 4093 states and 6034 transitions. [2022-07-20 04:14:42,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 221 [2022-07-20 04:14:42,145 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:14:42,145 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-20 04:14:42,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-20 04:14:42,146 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-20 04:14:42,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:14:42,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1974944495, now seen corresponding path program 1 times [2022-07-20 04:14:42,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:14:42,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914190809] [2022-07-20 04:14:42,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:14:42,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:14:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:42,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:14:42,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:42,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:14:42,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:42,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:14:42,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:42,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:14:42,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:42,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:14:42,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:42,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:42,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:42,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:42,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:42,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:42,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:42,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:14:42,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:42,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:42,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:42,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:42,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:42,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:42,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:42,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:14:42,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:42,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:42,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:42,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:42,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:42,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:42,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:14:42,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:42,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:42,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:42,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:42,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:42,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:42,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:14:42,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:42,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:42,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:42,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:14:42,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:42,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:14:42,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:42,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:14:42,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:42,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:14:42,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:42,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-20 04:14:42,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:42,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-20 04:14:42,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:43,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-20 04:14:43,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:43,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:43,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:43,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:43,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:43,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:43,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:43,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 04:14:43,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:43,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:14:43,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:43,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:14:43,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:43,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:14:43,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:14:43,105 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-20 04:14:43,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:14:43,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914190809] [2022-07-20 04:14:43,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914190809] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:14:43,106 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:14:43,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-20 04:14:43,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975018464] [2022-07-20 04:14:43,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:14:43,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-20 04:14:43,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:14:43,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-20 04:14:43,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-20 04:14:43,109 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-20 04:15:11,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:15:11,096 INFO L93 Difference]: Finished difference Result 8171 states and 12662 transitions. [2022-07-20 04:15:11,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 04:15:11,102 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-20 04:15:11,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:15:11,124 INFO L225 Difference]: With dead ends: 8171 [2022-07-20 04:15:11,124 INFO L226 Difference]: Without dead ends: 6023 [2022-07-20 04:15:11,137 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-20 04:15:11,137 INFO L413 NwaCegarLoop]: 2406 mSDtfsCounter, 3722 mSDsluCounter, 9746 mSDsCounter, 0 mSdLazyCounter, 9322 mSolverCounterSat, 2754 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3722 SdHoareTripleChecker+Valid, 12152 SdHoareTripleChecker+Invalid, 12076 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 2754 IncrementalHoareTripleChecker+Valid, 9322 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 26.5s IncrementalHoareTripleChecker+Time [2022-07-20 04:15:11,138 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3722 Valid, 12152 Invalid, 12076 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [2754 Valid, 9322 Invalid, 0 Unknown, 0 Unchecked, 26.5s Time] [2022-07-20 04:15:11,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6023 states. [2022-07-20 04:15:11,689 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6023 to 4105. [2022-07-20 04:15:11,693 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-20 04:15:11,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4105 states to 4105 states and 6040 transitions. [2022-07-20 04:15:11,708 INFO L78 Accepts]: Start accepts. Automaton has 4105 states and 6040 transitions. Word has length 220 [2022-07-20 04:15:11,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:15:11,708 INFO L495 AbstractCegarLoop]: Abstraction has 4105 states and 6040 transitions. [2022-07-20 04:15:11,709 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-20 04:15:11,709 INFO L276 IsEmpty]: Start isEmpty. Operand 4105 states and 6040 transitions. [2022-07-20 04:15:11,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-07-20 04:15:11,712 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:15:11,713 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-20 04:15:11,713 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-20 04:15:11,713 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-20 04:15:11,713 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:15:11,714 INFO L85 PathProgramCache]: Analyzing trace with hash 546814783, now seen corresponding path program 1 times [2022-07-20 04:15:11,714 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:15:11,714 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957068131] [2022-07-20 04:15:11,714 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:15:11,714 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:15:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:15:11,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:15:11,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:15:11,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:15:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:15:11,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 04:15:11,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:15:11,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:11,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-20 04:15:11,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-20 04:15:11,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-20 04:15:11,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-20 04:15:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-20 04:15:11,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-20 04:15:11,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-20 04:15:11,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-20 04:15:11,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-20 04:15:11,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-20 04:15:11,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-20 04:15:11,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-20 04:15:11,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-20 04:15:11,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:15:11,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-20 04:15:11,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-20 04:15:11,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:11,958 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-20 04:15:11,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:15:11,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957068131] [2022-07-20 04:15:11,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1957068131] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:15:11,958 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:15:11,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:15:11,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [630336380] [2022-07-20 04:15:11,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:15:11,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:15:11,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:15:11,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:15:11,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:15:11,960 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-20 04:15:14,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:15:14,195 INFO L93 Difference]: Finished difference Result 4105 states and 6040 transitions. [2022-07-20 04:15:14,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:15:14,196 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-20 04:15:14,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:15:14,213 INFO L225 Difference]: With dead ends: 4105 [2022-07-20 04:15:14,213 INFO L226 Difference]: Without dead ends: 4103 [2022-07-20 04:15:14,217 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-20 04:15:14,218 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-20 04:15:14,218 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-20 04:15:14,221 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4103 states. [2022-07-20 04:15:14,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4103 to 4103. [2022-07-20 04:15:14,655 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-20 04:15:14,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4103 states to 4103 states and 6038 transitions. [2022-07-20 04:15:14,667 INFO L78 Accepts]: Start accepts. Automaton has 4103 states and 6038 transitions. Word has length 159 [2022-07-20 04:15:14,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:15:14,668 INFO L495 AbstractCegarLoop]: Abstraction has 4103 states and 6038 transitions. [2022-07-20 04:15:14,668 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-20 04:15:14,668 INFO L276 IsEmpty]: Start isEmpty. Operand 4103 states and 6038 transitions. [2022-07-20 04:15:14,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-07-20 04:15:14,671 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:15:14,671 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-20 04:15:14,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-20 04:15:14,671 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-20 04:15:14,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:15:14,672 INFO L85 PathProgramCache]: Analyzing trace with hash 1102846129, now seen corresponding path program 1 times [2022-07-20 04:15:14,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:15:14,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977621521] [2022-07-20 04:15:14,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:15:14,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:15:14,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:14,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:15:14,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:14,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:15:14,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:14,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:15:14,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:14,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:15:14,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:14,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:15:14,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:14,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 04:15:14,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:14,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:15:14,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:14,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:14,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:14,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-20 04:15:14,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:14,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-20 04:15:14,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:14,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-20 04:15:14,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:14,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-20 04:15:14,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:14,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-20 04:15:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:14,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-20 04:15:14,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:14,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-20 04:15:14,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:14,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-20 04:15:14,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:14,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-20 04:15:14,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:14,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-20 04:15:14,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:14,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-20 04:15:14,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:14,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-20 04:15:14,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:14,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-20 04:15:14,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:14,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:15:14,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:14,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-20 04:15:14,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:14,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-20 04:15:14,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:14,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-20 04:15:14,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:14,900 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-20 04:15:14,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:15:14,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977621521] [2022-07-20 04:15:14,900 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977621521] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:15:14,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:15:14,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:15:14,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614116652] [2022-07-20 04:15:14,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:15:14,901 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:15:14,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:15:14,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:15:14,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:15:14,903 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-20 04:15:17,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:15:17,141 INFO L93 Difference]: Finished difference Result 4103 states and 6038 transitions. [2022-07-20 04:15:17,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:15:17,141 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-20 04:15:17,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:15:17,153 INFO L225 Difference]: With dead ends: 4103 [2022-07-20 04:15:17,153 INFO L226 Difference]: Without dead ends: 4101 [2022-07-20 04:15:17,155 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-20 04:15:17,155 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-20 04:15:17,156 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-20 04:15:17,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4101 states. [2022-07-20 04:15:17,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4101 to 4101. [2022-07-20 04:15:17,493 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-20 04:15:17,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4101 states to 4101 states and 6036 transitions. [2022-07-20 04:15:17,505 INFO L78 Accepts]: Start accepts. Automaton has 4101 states and 6036 transitions. Word has length 165 [2022-07-20 04:15:17,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:15:17,506 INFO L495 AbstractCegarLoop]: Abstraction has 4101 states and 6036 transitions. [2022-07-20 04:15:17,506 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-20 04:15:17,506 INFO L276 IsEmpty]: Start isEmpty. Operand 4101 states and 6036 transitions. [2022-07-20 04:15:17,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-07-20 04:15:17,509 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:15:17,509 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-20 04:15:17,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-20 04:15:17,509 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-20 04:15:17,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:15:17,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1899140410, now seen corresponding path program 1 times [2022-07-20 04:15:17,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:15:17,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810279546] [2022-07-20 04:15:17,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:15:17,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:15:17,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:17,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:15:17,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:17,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:15:17,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:17,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:15:17,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:17,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:15:17,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:17,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:15:17,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:17,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 04:15:17,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:17,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:15:17,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:17,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:17,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:17,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-20 04:15:17,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:17,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-20 04:15:17,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:17,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-20 04:15:17,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:17,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-20 04:15:17,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:17,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-20 04:15:17,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:17,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-20 04:15:17,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:17,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-20 04:15:17,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:17,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-20 04:15:17,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:17,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-20 04:15:17,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:17,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-20 04:15:17,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:17,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-20 04:15:17,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:17,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-20 04:15:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:17,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-20 04:15:17,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:17,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:15:17,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:17,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-20 04:15:17,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:17,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-20 04:15:17,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:17,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-20 04:15:17,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:17,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-20 04:15:17,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15: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-20 04:15:17,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:15:17,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810279546] [2022-07-20 04:15:17,737 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810279546] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:15:17,737 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:15:17,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:15:17,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37245173] [2022-07-20 04:15:17,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:15:17,739 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:15:17,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:15:17,739 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:15:17,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:15:17,739 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-20 04:15:20,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:15:20,034 INFO L93 Difference]: Finished difference Result 4101 states and 6036 transitions. [2022-07-20 04:15:20,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:15:20,034 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-20 04:15:20,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:15:20,047 INFO L225 Difference]: With dead ends: 4101 [2022-07-20 04:15:20,048 INFO L226 Difference]: Without dead ends: 4099 [2022-07-20 04:15:20,050 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-20 04:15:20,053 INFO L413 NwaCegarLoop]: 1310 mSDtfsCounter, 2147 mSDsluCounter, 1257 mSDsCounter, 0 mSdLazyCounter, 1295 mSolverCounterSat, 920 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s 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.8s IncrementalHoareTripleChecker+Time [2022-07-20 04:15:20,053 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.8s Time] [2022-07-20 04:15:20,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4099 states. [2022-07-20 04:15:20,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4099 to 4099. [2022-07-20 04:15:20,423 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-20 04:15:20,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4099 states to 4099 states and 6034 transitions. [2022-07-20 04:15:20,437 INFO L78 Accepts]: Start accepts. Automaton has 4099 states and 6034 transitions. Word has length 171 [2022-07-20 04:15:20,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:15:20,437 INFO L495 AbstractCegarLoop]: Abstraction has 4099 states and 6034 transitions. [2022-07-20 04:15:20,437 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-20 04:15:20,437 INFO L276 IsEmpty]: Start isEmpty. Operand 4099 states and 6034 transitions. [2022-07-20 04:15:20,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 178 [2022-07-20 04:15:20,440 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:15:20,441 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-20 04:15:20,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-20 04:15:20,441 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-20 04:15:20,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:15:20,441 INFO L85 PathProgramCache]: Analyzing trace with hash -2143733899, now seen corresponding path program 1 times [2022-07-20 04:15:20,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:15:20,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2141409541] [2022-07-20 04:15:20,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:15:20,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:15:20,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:20,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:15:20,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:20,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:15:20,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:20,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:15:20,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:20,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:15:20,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:20,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:15:20,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:20,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 04:15:20,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:20,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:15:20,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:20,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:20,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:20,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-20 04:15:20,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:20,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-20 04:15:20,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:20,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-20 04:15:20,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:20,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-20 04:15:20,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:20,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-20 04:15:20,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:20,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-20 04:15:20,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:20,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-20 04:15:20,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:20,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-20 04:15:20,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:20,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-20 04:15:20,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:20,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-20 04:15:20,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:20,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-20 04:15:20,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:20,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-20 04:15:20,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:20,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-20 04:15:20,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:20,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:15:20,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:20,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-20 04:15:20,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:20,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-20 04:15:20,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:20,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-20 04:15:20,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:20,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-20 04:15:20,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:20,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-20 04:15:20,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:20,729 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-20 04:15:20,730 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:15:20,730 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2141409541] [2022-07-20 04:15:20,730 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2141409541] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:15:20,730 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:15:20,730 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:15:20,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [446307911] [2022-07-20 04:15:20,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:15:20,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:15:20,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:15:20,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:15:20,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:15:20,732 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-20 04:15:22,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:15:22,826 INFO L93 Difference]: Finished difference Result 4099 states and 6034 transitions. [2022-07-20 04:15:22,826 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:15:22,826 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-20 04:15:22,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:15:22,837 INFO L225 Difference]: With dead ends: 4099 [2022-07-20 04:15:22,837 INFO L226 Difference]: Without dead ends: 4097 [2022-07-20 04:15:22,838 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-20 04:15:22,838 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-20 04:15:22,839 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-20 04:15:22,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4097 states. [2022-07-20 04:15:23,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4097 to 4097. [2022-07-20 04:15:23,234 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-20 04:15:23,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4097 states to 4097 states and 6032 transitions. [2022-07-20 04:15:23,246 INFO L78 Accepts]: Start accepts. Automaton has 4097 states and 6032 transitions. Word has length 177 [2022-07-20 04:15:23,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:15:23,246 INFO L495 AbstractCegarLoop]: Abstraction has 4097 states and 6032 transitions. [2022-07-20 04:15:23,246 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-20 04:15:23,246 INFO L276 IsEmpty]: Start isEmpty. Operand 4097 states and 6032 transitions. [2022-07-20 04:15:23,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2022-07-20 04:15:23,249 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:15:23,249 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-20 04:15:23,249 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-20 04:15:23,250 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-20 04:15:23,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:15:23,250 INFO L85 PathProgramCache]: Analyzing trace with hash 1287467755, now seen corresponding path program 1 times [2022-07-20 04:15:23,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:15:23,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57781275] [2022-07-20 04:15:23,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:15:23,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:15:23,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:23,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:15:23,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:23,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:15:23,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:23,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:15:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:23,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:15:23,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:23,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:15:23,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:23,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:23,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:23,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:15:23,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:23,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:15:23,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:23,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:15:23,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:23,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:23,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:23,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:15:23,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:23,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:15:23,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:23,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:15:23,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:23,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:23,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:23,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:15:23,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:23,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:15:23,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:23,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:15:23,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:23,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:23,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:23,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:15:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:23,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:15:23,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:23,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:15:23,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:23,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:23,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:23,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:15:23,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:23,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:15:23,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:23,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:15:23,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:23,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:15:23,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:23,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-20 04:15:23,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:23,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-20 04:15:23,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:23,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-20 04:15:23,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:23,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:23,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:23,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:23,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:23,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:23,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 04:15:23,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:23,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:15:23,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:23,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:23,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:23,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:15:23,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:23,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-07-20 04:15:23,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:23,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-07-20 04:15:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:23,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-07-20 04:15:23,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:23,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:23,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:23,608 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-20 04:15:23,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:15:23,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57781275] [2022-07-20 04:15:23,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [57781275] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:15:23,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:15:23,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-20 04:15:23,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338869486] [2022-07-20 04:15:23,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:15:23,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-20 04:15:23,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:15:23,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-20 04:15:23,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-20 04:15:23,610 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-20 04:15:28,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:15:28,713 INFO L93 Difference]: Finished difference Result 4685 states and 7115 transitions. [2022-07-20 04:15:28,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-20 04:15:28,714 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-20 04:15:28,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:15:28,731 INFO L225 Difference]: With dead ends: 4685 [2022-07-20 04:15:28,731 INFO L226 Difference]: Without dead ends: 4683 [2022-07-20 04:15:28,733 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-20 04:15:28,734 INFO L413 NwaCegarLoop]: 1265 mSDtfsCounter, 3450 mSDsluCounter, 2447 mSDsCounter, 0 mSdLazyCounter, 3661 mSolverCounterSat, 2294 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s 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.5s IncrementalHoareTripleChecker+Time [2022-07-20 04:15:28,734 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.5s Time] [2022-07-20 04:15:28,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4683 states. [2022-07-20 04:15:29,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4683 to 4123. [2022-07-20 04:15:29,135 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-20 04:15:29,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4123 states to 4123 states and 6047 transitions. [2022-07-20 04:15:29,149 INFO L78 Accepts]: Start accepts. Automaton has 4123 states and 6047 transitions. Word has length 248 [2022-07-20 04:15:29,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:15:29,149 INFO L495 AbstractCegarLoop]: Abstraction has 4123 states and 6047 transitions. [2022-07-20 04:15:29,149 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-20 04:15:29,149 INFO L276 IsEmpty]: Start isEmpty. Operand 4123 states and 6047 transitions. [2022-07-20 04:15:29,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-07-20 04:15:29,153 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:15:29,153 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-20 04:15:29,153 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-20 04:15:29,153 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-20 04:15:29,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:15:29,153 INFO L85 PathProgramCache]: Analyzing trace with hash 92079102, now seen corresponding path program 1 times [2022-07-20 04:15:29,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:15:29,154 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140657981] [2022-07-20 04:15:29,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:15:29,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:15:29,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:29,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:15:29,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:29,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:15:29,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:29,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:15:29,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:29,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:15:29,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:29,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:15:29,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:29,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 04:15:29,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:29,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:15:29,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:29,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:29,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:29,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-20 04:15:29,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:29,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-20 04:15:29,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:29,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-20 04:15:29,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:29,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-20 04:15:29,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:29,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-20 04:15:29,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:29,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-20 04:15:29,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:29,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-20 04:15:29,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:29,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-20 04:15:29,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:29,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-20 04:15:29,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:29,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-20 04:15:29,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:29,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-20 04:15:29,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:29,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-20 04:15:29,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:29,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-20 04:15:29,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:29,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:15:29,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:29,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-20 04:15:29,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:29,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-20 04:15:29,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:29,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-20 04:15:29,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:29,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-20 04:15:29,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:29,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-20 04:15:29,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:29,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-20 04:15:29,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:29,378 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-20 04:15:29,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:15:29,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140657981] [2022-07-20 04:15:29,378 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [140657981] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:15:29,378 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:15:29,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:15:29,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797435452] [2022-07-20 04:15:29,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:15:29,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:15:29,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:15:29,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:15:29,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:15:29,380 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-20 04:15:31,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:15:31,563 INFO L93 Difference]: Finished difference Result 4123 states and 6047 transitions. [2022-07-20 04:15:31,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:15:31,563 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-20 04:15:31,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:15:31,577 INFO L225 Difference]: With dead ends: 4123 [2022-07-20 04:15:31,578 INFO L226 Difference]: Without dead ends: 4121 [2022-07-20 04:15:31,581 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-20 04:15:31,581 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-20 04:15:31,581 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-20 04:15:31,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4121 states. [2022-07-20 04:15:32,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4121 to 4121. [2022-07-20 04:15:32,014 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-20 04:15:32,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4121 states to 4121 states and 6045 transitions. [2022-07-20 04:15:32,029 INFO L78 Accepts]: Start accepts. Automaton has 4121 states and 6045 transitions. Word has length 183 [2022-07-20 04:15:32,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:15:32,029 INFO L495 AbstractCegarLoop]: Abstraction has 4121 states and 6045 transitions. [2022-07-20 04:15:32,029 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-20 04:15:32,029 INFO L276 IsEmpty]: Start isEmpty. Operand 4121 states and 6045 transitions. [2022-07-20 04:15:32,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-07-20 04:15:32,033 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:15:32,033 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-20 04:15:32,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-07-20 04:15:32,033 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-20 04:15:32,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:15:32,034 INFO L85 PathProgramCache]: Analyzing trace with hash 1180014176, now seen corresponding path program 1 times [2022-07-20 04:15:32,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:15:32,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462239429] [2022-07-20 04:15:32,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:15:32,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:15:32,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:32,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:15:32,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:32,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:15:32,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:32,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:15:32,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:32,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:15:32,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:32,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:15:32,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:32,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 04:15:32,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:32,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:15:32,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:32,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:32,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:32,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-20 04:15:32,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:32,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-20 04:15:32,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:32,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-20 04:15:32,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:32,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-20 04:15:32,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:32,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-20 04:15:32,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:32,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-20 04:15:32,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:32,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-20 04:15:32,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:32,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-07-20 04:15:32,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:32,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-07-20 04:15:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:32,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-07-20 04:15:32,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:32,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-20 04:15:32,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:32,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-20 04:15:32,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:32,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-20 04:15:32,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:32,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:15:32,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:32,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-20 04:15:32,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:32,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-20 04:15:32,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:32,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-20 04:15:32,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:32,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-20 04:15:32,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:32,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2022-07-20 04:15:32,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:32,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-20 04:15:32,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:32,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 179 [2022-07-20 04:15:32,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:32,283 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-20 04:15:32,284 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:15:32,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462239429] [2022-07-20 04:15:32,284 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462239429] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:15:32,284 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:15:32,284 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-20 04:15:32,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894515991] [2022-07-20 04:15:32,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:15:32,284 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:15:32,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:15:32,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:15:32,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-20 04:15:32,285 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-20 04:15:37,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:15:37,351 INFO L93 Difference]: Finished difference Result 8070 states and 12824 transitions. [2022-07-20 04:15:37,351 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-20 04:15:37,352 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-20 04:15:37,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:15:37,389 INFO L225 Difference]: With dead ends: 8070 [2022-07-20 04:15:37,390 INFO L226 Difference]: Without dead ends: 7911 [2022-07-20 04:15:37,397 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-20 04:15:37,398 INFO L413 NwaCegarLoop]: 1718 mSDtfsCounter, 2750 mSDsluCounter, 1703 mSDsCounter, 0 mSdLazyCounter, 3104 mSolverCounterSat, 1541 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2815 SdHoareTripleChecker+Valid, 3421 SdHoareTripleChecker+Invalid, 4645 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1541 IncrementalHoareTripleChecker+Valid, 3104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.2s IncrementalHoareTripleChecker+Time [2022-07-20 04:15:37,398 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2815 Valid, 3421 Invalid, 4645 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1541 Valid, 3104 Invalid, 0 Unknown, 0 Unchecked, 4.2s Time] [2022-07-20 04:15:37,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7911 states. [2022-07-20 04:15:38,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7911 to 7887. [2022-07-20 04:15:38,227 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-20 04:15:38,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7887 states to 7887 states and 12617 transitions. [2022-07-20 04:15:38,268 INFO L78 Accepts]: Start accepts. Automaton has 7887 states and 12617 transitions. Word has length 189 [2022-07-20 04:15:38,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:15:38,269 INFO L495 AbstractCegarLoop]: Abstraction has 7887 states and 12617 transitions. [2022-07-20 04:15:38,269 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-20 04:15:38,269 INFO L276 IsEmpty]: Start isEmpty. Operand 7887 states and 12617 transitions. [2022-07-20 04:15:38,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2022-07-20 04:15:38,273 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:15:38,273 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-20 04:15:38,273 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-07-20 04:15:38,273 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-20 04:15:38,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:15:38,273 INFO L85 PathProgramCache]: Analyzing trace with hash 669787798, now seen corresponding path program 1 times [2022-07-20 04:15:38,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:15:38,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [559785168] [2022-07-20 04:15:38,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:15:38,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:15:38,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:38,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:15:38,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:38,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:15:38,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:38,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:15:38,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:38,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:15:38,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:38,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:15:38,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:38,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:38,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:38,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:15:38,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:38,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:15:38,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:38,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:15:38,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:38,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:38,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:38,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:15:38,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:38,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:15:38,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:38,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:15:38,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:38,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:38,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:38,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:15:38,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:38,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:15:38,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:38,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:15:38,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:38,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:38,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:38,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:15:38,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:38,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:15:38,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:38,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:15:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:38,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:38,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:38,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:15:38,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:38,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:15:38,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:38,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:15:38,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:38,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:15:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:38,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-20 04:15:38,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:38,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-20 04:15:38,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:38,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-20 04:15:38,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:38,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:38,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:38,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:38,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:38,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:38,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:38,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 04:15:38,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:38,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:15:38,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:38,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:38,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:38,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:15:38,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:38,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-07-20 04:15:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:38,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-07-20 04:15:38,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:38,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-07-20 04:15:38,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:38,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:38,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:38,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-20 04:15:38,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:38,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-20 04:15:38,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:38,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-20 04:15:38,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:38,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 257 [2022-07-20 04:15:38,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:38,681 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-20 04:15:38,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:15:38,681 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [559785168] [2022-07-20 04:15:38,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [559785168] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:15:38,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:15:38,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-20 04:15:38,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535834568] [2022-07-20 04:15:38,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:15:38,683 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-20 04:15:38,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:15:38,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-20 04:15:38,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-20 04:15:38,684 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-20 04:15:46,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:15:46,198 INFO L93 Difference]: Finished difference Result 10643 states and 21027 transitions. [2022-07-20 04:15:46,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-20 04:15:46,199 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-20 04:15:46,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:15:46,249 INFO L225 Difference]: With dead ends: 10643 [2022-07-20 04:15:46,250 INFO L226 Difference]: Without dead ends: 10641 [2022-07-20 04:15:46,263 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-20 04:15:46,264 INFO L413 NwaCegarLoop]: 1267 mSDtfsCounter, 2942 mSDsluCounter, 3660 mSDsCounter, 0 mSdLazyCounter, 5496 mSolverCounterSat, 2254 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2942 SdHoareTripleChecker+Valid, 4927 SdHoareTripleChecker+Invalid, 7750 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2254 IncrementalHoareTripleChecker+Valid, 5496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.3s IncrementalHoareTripleChecker+Time [2022-07-20 04:15:46,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2942 Valid, 4927 Invalid, 7750 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2254 Valid, 5496 Invalid, 0 Unknown, 0 Unchecked, 6.3s Time] [2022-07-20 04:15:46,274 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10641 states. [2022-07-20 04:15:47,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10641 to 8017. [2022-07-20 04:15:47,289 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-20 04:15:47,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8017 states to 8017 states and 12813 transitions. [2022-07-20 04:15:47,322 INFO L78 Accepts]: Start accepts. Automaton has 8017 states and 12813 transitions. Word has length 269 [2022-07-20 04:15:47,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:15:47,322 INFO L495 AbstractCegarLoop]: Abstraction has 8017 states and 12813 transitions. [2022-07-20 04:15:47,322 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-20 04:15:47,323 INFO L276 IsEmpty]: Start isEmpty. Operand 8017 states and 12813 transitions. [2022-07-20 04:15:47,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 275 [2022-07-20 04:15:47,327 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:15:47,328 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-20 04:15:47,328 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-07-20 04:15:47,328 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-20 04:15:47,329 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:15:47,329 INFO L85 PathProgramCache]: Analyzing trace with hash -2070069253, now seen corresponding path program 1 times [2022-07-20 04:15:47,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:15:47,329 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672417522] [2022-07-20 04:15:47,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:15:47,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:15:47,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:47,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:15:47,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:47,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:15:47,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:47,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:15:47,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:47,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:15:47,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:47,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:15:47,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:47,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-20 04:15:47,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:47,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-20 04:15:47,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:47,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:47,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:47,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-20 04:15:47,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:47,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-20 04:15:47,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:47,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2022-07-20 04:15:47,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:47,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:15:47,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:47,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:47,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:47,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:15:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:47,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:15:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:47,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:15:47,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:47,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-20 04:15:47,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:47,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2022-07-20 04:15:47,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:47,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:47,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:47,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:47,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:47,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:47,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:47,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 04:15:47,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:47,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:15:47,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:47,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:47,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:47,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:15:47,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:47,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-20 04:15:47,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:47,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2022-07-20 04:15:47,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:47,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 173 [2022-07-20 04:15:47,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:47,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-07-20 04:15:47,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:47,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2022-07-20 04:15:47,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:47,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 191 [2022-07-20 04:15:47,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:47,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:47,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:47,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-07-20 04:15:47,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:47,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2022-07-20 04:15:47,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:47,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-07-20 04:15:47,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:47,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:47,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-07-20 04:15:47,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:47,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-20 04:15:47,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:47,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-07-20 04:15:47,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:47,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 265 [2022-07-20 04:15:47,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:47,813 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-20 04:15:47,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:15:47,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672417522] [2022-07-20 04:15:47,814 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1672417522] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:15:47,814 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:15:47,814 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-07-20 04:15:47,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1353154889] [2022-07-20 04:15:47,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:15:47,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-20 04:15:47,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:15:47,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-20 04:15:47,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2022-07-20 04:15:47,817 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-20 04:15:57,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:15:57,038 INFO L93 Difference]: Finished difference Result 16240 states and 29059 transitions. [2022-07-20 04:15:57,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-20 04:15:57,038 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-20 04:15:57,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:15:57,069 INFO L225 Difference]: With dead ends: 16240 [2022-07-20 04:15:57,069 INFO L226 Difference]: Without dead ends: 8395 [2022-07-20 04:15:57,123 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-20 04:15:57,124 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.0s IncrementalHoareTripleChecker+Time [2022-07-20 04:15:57,124 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.0s Time] [2022-07-20 04:15:57,129 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8395 states. [2022-07-20 04:15:57,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8395 to 8117. [2022-07-20 04:15:57,883 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-20 04:15:57,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8117 states to 8117 states and 12986 transitions. [2022-07-20 04:15:57,920 INFO L78 Accepts]: Start accepts. Automaton has 8117 states and 12986 transitions. Word has length 274 [2022-07-20 04:15:57,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:15:57,920 INFO L495 AbstractCegarLoop]: Abstraction has 8117 states and 12986 transitions. [2022-07-20 04:15:57,921 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-20 04:15:57,921 INFO L276 IsEmpty]: Start isEmpty. Operand 8117 states and 12986 transitions. [2022-07-20 04:15:57,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 325 [2022-07-20 04:15:57,971 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:15:57,971 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-20 04:15:57,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-20 04:15:57,971 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-20 04:15:57,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:15:57,972 INFO L85 PathProgramCache]: Analyzing trace with hash 454580242, now seen corresponding path program 1 times [2022-07-20 04:15:57,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:15:57,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165330575] [2022-07-20 04:15:57,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:15:57,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:15:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:15:58,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:15:58,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:15:58,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:15:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:15:58,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:58,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:15:58,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:15:58,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:15:58,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:58,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:15:58,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:15:58,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:15:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:58,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:15:58,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:15:58,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:15:58,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:58,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:15:58,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:15:58,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:15:58,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:58,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:15:58,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:15:58,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:15:58,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:15:58,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-20 04:15:58,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 162 [2022-07-20 04:15:58,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 169 [2022-07-20 04:15:58,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:58,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:58,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:58,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-20 04:15:58,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:15:58,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:58,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-07-20 04:15:58,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 215 [2022-07-20 04:15:58,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 223 [2022-07-20 04:15:58,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-07-20 04:15:58,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:58,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 241 [2022-07-20 04:15:58,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:58,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-20 04:15:58,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-20 04:15:58,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,413 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-20 04:15:58,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-20 04:15:58,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:15:58,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:15:58,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 289 [2022-07-20 04:15:58,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 295 [2022-07-20 04:15:58,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2022-07-20 04:15:58,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:15:58,441 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-20 04:15:58,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:15:58,441 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165330575] [2022-07-20 04:15:58,441 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165330575] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:15:58,441 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-20 04:15:58,441 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-20 04:15:58,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008015649] [2022-07-20 04:15:58,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:15:58,442 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-20 04:15:58,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:15:58,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-20 04:15:58,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-07-20 04:15:58,443 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-20 04:16:06,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:16:06,627 INFO L93 Difference]: Finished difference Result 17994 states and 34497 transitions. [2022-07-20 04:16:06,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-07-20 04:16:06,627 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-20 04:16:06,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:16:06,678 INFO L225 Difference]: With dead ends: 17994 [2022-07-20 04:16:06,678 INFO L226 Difference]: Without dead ends: 10049 [2022-07-20 04:16:06,737 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-20 04:16:06,738 INFO L413 NwaCegarLoop]: 1292 mSDtfsCounter, 2941 mSDsluCounter, 4361 mSDsCounter, 0 mSdLazyCounter, 6860 mSolverCounterSat, 2313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2941 SdHoareTripleChecker+Valid, 5653 SdHoareTripleChecker+Invalid, 9173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2313 IncrementalHoareTripleChecker+Valid, 6860 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-07-20 04:16:06,738 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2941 Valid, 5653 Invalid, 9173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2313 Valid, 6860 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2022-07-20 04:16:06,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10049 states. [2022-07-20 04:16:07,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10049 to 8429. [2022-07-20 04:16:07,700 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-20 04:16:07,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8429 states to 8429 states and 13240 transitions. [2022-07-20 04:16:07,738 INFO L78 Accepts]: Start accepts. Automaton has 8429 states and 13240 transitions. Word has length 324 [2022-07-20 04:16:07,738 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:16:07,738 INFO L495 AbstractCegarLoop]: Abstraction has 8429 states and 13240 transitions. [2022-07-20 04:16:07,739 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-20 04:16:07,739 INFO L276 IsEmpty]: Start isEmpty. Operand 8429 states and 13240 transitions. [2022-07-20 04:16:07,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2022-07-20 04:16:07,743 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:16:07,743 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2022-07-20 04:16:07,744 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-07-20 04:16:07,744 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-20 04:16:07,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:16:07,744 INFO L85 PathProgramCache]: Analyzing trace with hash -1801582095, now seen corresponding path program 1 times [2022-07-20 04:16:07,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:16:07,744 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2044881090] [2022-07-20 04:16:07,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:16:07,745 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:16:08,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:16:08,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:16:08,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:16:08,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:16:08,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:16:08,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:16:08,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:16:08,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:16:08,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:16:08,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:16:08,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:16:08,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:16:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:16:08,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:16:08,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:16:08,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:16:08,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:16:08,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:16:08,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:16:08,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:16:08,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:16:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:16:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:16:08,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:16:08,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:16:08,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:16:08,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-20 04:16:08,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-20 04:16:08,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-20 04:16:08,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-20 04:16:08,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-20 04:16:08,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:16:08,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-20 04:16:08,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-20 04:16:08,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-07-20 04:16:08,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2022-07-20 04:16:08,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-07-20 04:16:08,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-07-20 04:16:08,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2022-07-20 04:16:08,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-20 04:16:08,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:16:08,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-20 04:16:08,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-20 04:16:08,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-20 04:16:08,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-20 04:16:08,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:16:08,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:16:08,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2022-07-20 04:16:08,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2022-07-20 04:16:08,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2022-07-20 04:16:08,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:08,426 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 5 proven. 42 refuted. 0 times theorem prover too weak. 614 trivial. 0 not checked. [2022-07-20 04:16:08,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:16:08,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2044881090] [2022-07-20 04:16:08,426 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2044881090] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 04:16:08,426 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508292400] [2022-07-20 04:16:08,427 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:16:08,427 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:16:08,427 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:16:08,431 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 04:16:08,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-20 04:16:09,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:09,428 INFO L263 TraceCheckSpWp]: Trace formula consists of 3221 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-20 04:16:09,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:16:09,489 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 127 proven. 0 refuted. 0 times theorem prover too weak. 534 trivial. 0 not checked. [2022-07-20 04:16:09,490 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 04:16:09,490 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [508292400] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:16:09,490 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 04:16:09,490 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 14 [2022-07-20 04:16:09,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123249053] [2022-07-20 04:16:09,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:16:09,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-20 04:16:09,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:16:09,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-20 04:16:09,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-07-20 04:16:09,492 INFO L87 Difference]: Start difference. First operand 8429 states and 13240 transitions. Second operand has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 3 states have call successors, (43), 2 states have call predecessors, (43), 3 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) [2022-07-20 04:16:10,836 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:16:10,836 INFO L93 Difference]: Finished difference Result 17736 states and 28322 transitions. [2022-07-20 04:16:10,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-20 04:16:10,836 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 3 states have call successors, (43), 2 states have call predecessors, (43), 3 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) Word has length 327 [2022-07-20 04:16:10,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:16:10,880 INFO L225 Difference]: With dead ends: 17736 [2022-07-20 04:16:10,880 INFO L226 Difference]: Without dead ends: 9354 [2022-07-20 04:16:10,920 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 433 GetRequests, 418 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2022-07-20 04:16:10,920 INFO L413 NwaCegarLoop]: 1470 mSDtfsCounter, 518 mSDsluCounter, 5688 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 7158 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-20 04:16:10,920 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [518 Valid, 7158 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-20 04:16:10,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9354 states. [2022-07-20 04:16:11,830 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9354 to 8397. [2022-07-20 04:16:11,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8397 states, 6031 states have (on average 1.2240092853589786) internal successors, (7382), 6134 states have internal predecessors, (7382), 1665 states have call successors, (1665), 501 states have call predecessors, (1665), 693 states have return successors, (4149), 1811 states have call predecessors, (4149), 1661 states have call successors, (4149) [2022-07-20 04:16:11,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8397 states to 8397 states and 13196 transitions. [2022-07-20 04:16:11,875 INFO L78 Accepts]: Start accepts. Automaton has 8397 states and 13196 transitions. Word has length 327 [2022-07-20 04:16:11,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-20 04:16:11,875 INFO L495 AbstractCegarLoop]: Abstraction has 8397 states and 13196 transitions. [2022-07-20 04:16:11,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.333333333333332) internal successors, (140), 6 states have internal predecessors, (140), 3 states have call successors, (43), 2 states have call predecessors, (43), 3 states have return successors, (38), 3 states have call predecessors, (38), 3 states have call successors, (38) [2022-07-20 04:16:11,875 INFO L276 IsEmpty]: Start isEmpty. Operand 8397 states and 13196 transitions. [2022-07-20 04:16:11,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 328 [2022-07-20 04:16:11,879 INFO L187 NwaCegarLoop]: Found error trace [2022-07-20 04:16:11,880 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 4, 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] [2022-07-20 04:16:11,902 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-07-20 04:16:12,080 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-07-20 04:16:12,080 INFO L420 AbstractCegarLoop]: === Iteration 39 === 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-20 04:16:12,081 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-20 04:16:12,081 INFO L85 PathProgramCache]: Analyzing trace with hash -975769681, now seen corresponding path program 1 times [2022-07-20 04:16:12,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-20 04:16:12,081 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716467580] [2022-07-20 04:16:12,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:16:12,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-20 04:16:12,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-20 04:16:12,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-20 04:16:12,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-20 04:16:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-20 04:16:12,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-20 04:16:12,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:16:12,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:16:12,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:16:12,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-20 04:16:12,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:16:12,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:16:12,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:16:12,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-20 04:16:12,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:16:12,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:16:12,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:16:12,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-20 04:16:12,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:16:12,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:16:12,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:16:12,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-20 04:16:12,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:16:12,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:16:12,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-20 04:16:12,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-20 04:16:12,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-20 04:16:12,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-20 04:16:12,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2022-07-20 04:16:12,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2022-07-20 04:16:12,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-20 04:16:12,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2022-07-20 04:16:12,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:16:12,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 194 [2022-07-20 04:16:12,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 198 [2022-07-20 04:16:12,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 204 [2022-07-20 04:16:12,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 209 [2022-07-20 04:16:12,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 222 [2022-07-20 04:16:12,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 228 [2022-07-20 04:16:12,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2022-07-20 04:16:12,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 243 [2022-07-20 04:16:12,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:16:12,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-07-20 04:16:12,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-07-20 04:16:12,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-20 04:16:12,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-20 04:16:12,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-20 04:16:12,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-20 04:16:12,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 291 [2022-07-20 04:16:12,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 297 [2022-07-20 04:16:12,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2022-07-20 04:16:12,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:12,854 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 8 proven. 67 refuted. 0 times theorem prover too weak. 586 trivial. 0 not checked. [2022-07-20 04:16:12,854 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-20 04:16:12,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716467580] [2022-07-20 04:16:12,854 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716467580] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-20 04:16:12,855 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1807956562] [2022-07-20 04:16:12,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-20 04:16:12,855 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-20 04:16:12,855 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-20 04:16:12,860 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-20 04:16:12,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-20 04:16:13,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-20 04:16:13,756 INFO L263 TraceCheckSpWp]: Trace formula consists of 3219 conjuncts, 22 conjunts are in the unsatisfiable core [2022-07-20 04:16:13,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-20 04:16:14,020 INFO L134 CoverageAnalysis]: Checked inductivity of 661 backedges. 177 proven. 0 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2022-07-20 04:16:14,020 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-20 04:16:14,020 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1807956562] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-20 04:16:14,020 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-20 04:16:14,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [16] total 26 [2022-07-20 04:16:14,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1684975769] [2022-07-20 04:16:14,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-20 04:16:14,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-20 04:16:14,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-20 04:16:14,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-20 04:16:14,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2022-07-20 04:16:14,022 INFO L87 Difference]: Start difference. First operand 8397 states and 13196 transitions. Second operand has 14 states, 13 states have (on average 11.0) internal successors, (143), 13 states have internal predecessors, (143), 6 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (38), 6 states have call predecessors, (38), 6 states have call successors, (38) [2022-07-20 04:16:15,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-20 04:16:15,997 INFO L93 Difference]: Finished difference Result 18208 states and 29406 transitions. [2022-07-20 04:16:15,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-20 04:16:15,997 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 11.0) internal successors, (143), 13 states have internal predecessors, (143), 6 states have call successors, (43), 2 states have call predecessors, (43), 4 states have return successors, (38), 6 states have call predecessors, (38), 6 states have call successors, (38) Word has length 327 [2022-07-20 04:16:15,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-20 04:16:16,048 INFO L225 Difference]: With dead ends: 18208 [2022-07-20 04:16:16,048 INFO L226 Difference]: Without dead ends: 10311 [2022-07-20 04:16:16,082 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 441 GetRequests, 409 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=114, Invalid=1008, Unknown=0, NotChecked=0, Total=1122 [2022-07-20 04:16:16,082 INFO L413 NwaCegarLoop]: 1788 mSDtfsCounter, 1859 mSDsluCounter, 19070 mSDsCounter, 0 mSdLazyCounter, 473 mSolverCounterSat, 569 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1859 SdHoareTripleChecker+Valid, 20858 SdHoareTripleChecker+Invalid, 1042 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 569 IncrementalHoareTripleChecker+Valid, 473 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-07-20 04:16:16,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1859 Valid, 20858 Invalid, 1042 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [569 Valid, 473 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-07-20 04:16:16,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10311 states.