./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--legousbtower.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.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 5574142529d95f295134c1dccd4c5dbe0383ae5c309e7dc50fd933e5702659ed --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 15:44:05,379 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 15:44:05,382 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 15:44:05,423 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 15:44:05,424 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 15:44:05,425 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 15:44:05,429 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 15:44:05,432 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 15:44:05,433 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 15:44:05,438 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 15:44:05,439 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 15:44:05,441 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 15:44:05,442 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 15:44:05,443 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 15:44:05,444 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 15:44:05,450 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 15:44:05,451 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 15:44:05,452 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 15:44:05,454 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 15:44:05,459 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 15:44:05,460 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 15:44:05,461 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 15:44:05,463 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 15:44:05,464 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 15:44:05,465 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 15:44:05,471 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 15:44:05,472 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 15:44:05,472 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 15:44:05,473 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 15:44:05,473 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 15:44:05,474 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 15:44:05,474 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 15:44:05,476 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 15:44:05,476 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 15:44:05,478 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 15:44:05,479 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 15:44:05,479 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 15:44:05,479 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 15:44:05,480 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 15:44:05,480 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 15:44:05,480 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 15:44:05,482 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 15:44:05,490 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-21 15:44:05,521 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 15:44:05,522 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 15:44:05,522 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 15:44:05,522 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 15:44:05,523 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 15:44:05,523 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 15:44:05,524 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 15:44:05,525 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 15:44:05,525 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 15:44:05,526 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 15:44:05,526 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 15:44:05,531 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 15:44:05,531 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 15:44:05,532 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 15:44:05,532 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 15:44:05,532 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 15:44:05,532 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 15:44:05,533 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 15:44:05,533 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 15:44:05,533 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 15:44:05,533 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 15:44:05,534 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 15:44:05,534 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 15:44:05,534 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 15:44:05,534 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 15:44:05,535 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 15:44:05,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 15:44:05,535 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 15:44:05,535 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 15:44:05,536 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 15:44:05,536 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 -> 5574142529d95f295134c1dccd4c5dbe0383ae5c309e7dc50fd933e5702659ed [2022-07-21 15:44:05,890 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 15:44:05,916 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 15:44:05,918 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 15:44:05,919 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 15:44:05,922 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 15:44:05,923 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--legousbtower.ko.cil.i [2022-07-21 15:44:05,984 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97245786d/eb3e9a141d6e4b4490352e2b4bb4d314/FLAG7dfd92069 [2022-07-21 15:44:06,709 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 15:44:06,710 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--legousbtower.ko.cil.i [2022-07-21 15:44:06,759 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97245786d/eb3e9a141d6e4b4490352e2b4bb4d314/FLAG7dfd92069 [2022-07-21 15:44:07,005 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/97245786d/eb3e9a141d6e4b4490352e2b4bb4d314 [2022-07-21 15:44:07,007 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 15:44:07,008 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 15:44:07,011 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 15:44:07,011 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 15:44:07,014 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 15:44:07,015 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 03:44:07" (1/1) ... [2022-07-21 15:44:07,016 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51a51564 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:44:07, skipping insertion in model container [2022-07-21 15:44:07,016 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 03:44:07" (1/1) ... [2022-07-21 15:44:07,022 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 15:44:07,148 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 15:44:08,993 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273031,273044] [2022-07-21 15:44:08,996 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273176,273189] [2022-07-21 15:44:08,997 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273322,273335] [2022-07-21 15:44:08,997 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273487,273500] [2022-07-21 15:44:08,998 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273645,273658] [2022-07-21 15:44:08,998 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273803,273816] [2022-07-21 15:44:08,999 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273961,273974] [2022-07-21 15:44:08,999 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274121,274134] [2022-07-21 15:44:09,000 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274280,274293] [2022-07-21 15:44:09,002 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274419,274432] [2022-07-21 15:44:09,002 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274561,274574] [2022-07-21 15:44:09,010 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274710,274723] [2022-07-21 15:44:09,011 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274849,274862] [2022-07-21 15:44:09,011 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275004,275017] [2022-07-21 15:44:09,012 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275164,275177] [2022-07-21 15:44:09,013 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275315,275328] [2022-07-21 15:44:09,014 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275466,275479] [2022-07-21 15:44:09,021 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275618,275631] [2022-07-21 15:44:09,021 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275767,275780] [2022-07-21 15:44:09,022 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275915,275928] [2022-07-21 15:44:09,023 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276072,276085] [2022-07-21 15:44:09,023 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276221,276234] [2022-07-21 15:44:09,024 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276377,276390] [2022-07-21 15:44:09,024 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276530,276543] [2022-07-21 15:44:09,028 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276676,276689] [2022-07-21 15:44:09,029 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276819,276832] [2022-07-21 15:44:09,029 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276971,276984] [2022-07-21 15:44:09,030 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277117,277130] [2022-07-21 15:44:09,030 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277262,277275] [2022-07-21 15:44:09,030 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277416,277429] [2022-07-21 15:44:09,031 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277567,277580] [2022-07-21 15:44:09,032 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277722,277735] [2022-07-21 15:44:09,033 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277874,277887] [2022-07-21 15:44:09,034 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278029,278042] [2022-07-21 15:44:09,034 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278193,278206] [2022-07-21 15:44:09,036 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278349,278362] [2022-07-21 15:44:09,036 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278513,278526] [2022-07-21 15:44:09,037 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278655,278668] [2022-07-21 15:44:09,037 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278813,278826] [2022-07-21 15:44:09,037 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278980,278993] [2022-07-21 15:44:09,038 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279139,279152] [2022-07-21 15:44:09,038 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279298,279311] [2022-07-21 15:44:09,038 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279447,279460] [2022-07-21 15:44:09,039 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279594,279607] [2022-07-21 15:44:09,039 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279733,279746] [2022-07-21 15:44:09,039 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279896,279909] [2022-07-21 15:44:09,040 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280062,280075] [2022-07-21 15:44:09,041 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280226,280239] [2022-07-21 15:44:09,042 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280391,280404] [2022-07-21 15:44:09,042 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280556,280569] [2022-07-21 15:44:09,043 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280722,280735] [2022-07-21 15:44:09,043 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280887,280900] [2022-07-21 15:44:09,043 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281054,281067] [2022-07-21 15:44:09,044 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281214,281227] [2022-07-21 15:44:09,044 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281376,281389] [2022-07-21 15:44:09,044 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281535,281548] [2022-07-21 15:44:09,045 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281681,281694] [2022-07-21 15:44:09,045 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281824,281837] [2022-07-21 15:44:09,046 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281968,281981] [2022-07-21 15:44:09,046 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282111,282124] [2022-07-21 15:44:09,046 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282255,282268] [2022-07-21 15:44:09,047 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282396,282409] [2022-07-21 15:44:09,048 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282534,282547] [2022-07-21 15:44:09,048 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282692,282705] [2022-07-21 15:44:09,049 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282851,282864] [2022-07-21 15:44:09,049 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283007,283020] [2022-07-21 15:44:09,050 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283156,283169] [2022-07-21 15:44:09,050 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283308,283321] [2022-07-21 15:44:09,050 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283459,283472] [2022-07-21 15:44:09,051 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283608,283621] [2022-07-21 15:44:09,051 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283760,283773] [2022-07-21 15:44:09,051 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283908,283921] [2022-07-21 15:44:09,052 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284061,284074] [2022-07-21 15:44:09,052 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284212,284225] [2022-07-21 15:44:09,052 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284362,284375] [2022-07-21 15:44:09,053 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284509,284522] [2022-07-21 15:44:09,053 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284660,284673] [2022-07-21 15:44:09,054 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284811,284824] [2022-07-21 15:44:09,054 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284959,284972] [2022-07-21 15:44:09,055 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285125,285138] [2022-07-21 15:44:09,055 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285294,285307] [2022-07-21 15:44:09,056 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285461,285474] [2022-07-21 15:44:09,056 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285629,285642] [2022-07-21 15:44:09,056 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285779,285792] [2022-07-21 15:44:09,057 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285926,285939] [2022-07-21 15:44:09,057 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286087,286100] [2022-07-21 15:44:09,057 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286257,286270] [2022-07-21 15:44:09,058 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286419,286432] [2022-07-21 15:44:09,066 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 15:44:09,089 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 15:44:09,389 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273031,273044] [2022-07-21 15:44:09,390 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273176,273189] [2022-07-21 15:44:09,390 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273322,273335] [2022-07-21 15:44:09,391 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273487,273500] [2022-07-21 15:44:09,392 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273645,273658] [2022-07-21 15:44:09,393 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273803,273816] [2022-07-21 15:44:09,393 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273961,273974] [2022-07-21 15:44:09,394 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274121,274134] [2022-07-21 15:44:09,397 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274280,274293] [2022-07-21 15:44:09,398 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274419,274432] [2022-07-21 15:44:09,398 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274561,274574] [2022-07-21 15:44:09,398 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274710,274723] [2022-07-21 15:44:09,399 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274849,274862] [2022-07-21 15:44:09,399 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275004,275017] [2022-07-21 15:44:09,399 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275164,275177] [2022-07-21 15:44:09,400 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275315,275328] [2022-07-21 15:44:09,400 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275466,275479] [2022-07-21 15:44:09,400 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275618,275631] [2022-07-21 15:44:09,401 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275767,275780] [2022-07-21 15:44:09,401 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275915,275928] [2022-07-21 15:44:09,402 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276072,276085] [2022-07-21 15:44:09,403 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276221,276234] [2022-07-21 15:44:09,404 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276377,276390] [2022-07-21 15:44:09,404 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276530,276543] [2022-07-21 15:44:09,404 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276676,276689] [2022-07-21 15:44:09,405 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276819,276832] [2022-07-21 15:44:09,405 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276971,276984] [2022-07-21 15:44:09,405 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277117,277130] [2022-07-21 15:44:09,406 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277262,277275] [2022-07-21 15:44:09,406 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277416,277429] [2022-07-21 15:44:09,406 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277567,277580] [2022-07-21 15:44:09,406 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277722,277735] [2022-07-21 15:44:09,407 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277874,277887] [2022-07-21 15:44:09,407 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278029,278042] [2022-07-21 15:44:09,408 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278193,278206] [2022-07-21 15:44:09,408 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278349,278362] [2022-07-21 15:44:09,408 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278513,278526] [2022-07-21 15:44:09,409 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278655,278668] [2022-07-21 15:44:09,410 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278813,278826] [2022-07-21 15:44:09,410 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278980,278993] [2022-07-21 15:44:09,411 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279139,279152] [2022-07-21 15:44:09,411 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279298,279311] [2022-07-21 15:44:09,411 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279447,279460] [2022-07-21 15:44:09,412 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279594,279607] [2022-07-21 15:44:09,412 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279733,279746] [2022-07-21 15:44:09,413 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279896,279909] [2022-07-21 15:44:09,413 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280062,280075] [2022-07-21 15:44:09,413 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280226,280239] [2022-07-21 15:44:09,414 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280391,280404] [2022-07-21 15:44:09,414 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280556,280569] [2022-07-21 15:44:09,414 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280722,280735] [2022-07-21 15:44:09,415 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280887,280900] [2022-07-21 15:44:09,415 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281054,281067] [2022-07-21 15:44:09,415 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281214,281227] [2022-07-21 15:44:09,416 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281376,281389] [2022-07-21 15:44:09,416 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281535,281548] [2022-07-21 15:44:09,417 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281681,281694] [2022-07-21 15:44:09,417 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281824,281837] [2022-07-21 15:44:09,417 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281968,281981] [2022-07-21 15:44:09,417 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282111,282124] [2022-07-21 15:44:09,418 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282255,282268] [2022-07-21 15:44:09,419 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282396,282409] [2022-07-21 15:44:09,420 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282534,282547] [2022-07-21 15:44:09,422 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282692,282705] [2022-07-21 15:44:09,423 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282851,282864] [2022-07-21 15:44:09,423 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283007,283020] [2022-07-21 15:44:09,424 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283156,283169] [2022-07-21 15:44:09,424 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283308,283321] [2022-07-21 15:44:09,425 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283459,283472] [2022-07-21 15:44:09,425 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283608,283621] [2022-07-21 15:44:09,425 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283760,283773] [2022-07-21 15:44:09,429 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283908,283921] [2022-07-21 15:44:09,457 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284061,284074] [2022-07-21 15:44:09,458 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284212,284225] [2022-07-21 15:44:09,458 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284362,284375] [2022-07-21 15:44:09,459 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284509,284522] [2022-07-21 15:44:09,462 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284660,284673] [2022-07-21 15:44:09,463 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284811,284824] [2022-07-21 15:44:09,464 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284959,284972] [2022-07-21 15:44:09,465 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285125,285138] [2022-07-21 15:44:09,465 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285294,285307] [2022-07-21 15:44:09,466 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285461,285474] [2022-07-21 15:44:09,466 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285629,285642] [2022-07-21 15:44:09,467 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285779,285792] [2022-07-21 15:44:09,467 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285926,285939] [2022-07-21 15:44:09,467 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286087,286100] [2022-07-21 15:44:09,468 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286257,286270] [2022-07-21 15:44:09,468 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286419,286432] [2022-07-21 15:44:09,471 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 15:44:09,688 INFO L208 MainTranslator]: Completed translation [2022-07-21 15:44:09,689 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:44:09 WrapperNode [2022-07-21 15:44:09,689 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 15:44:09,690 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 15:44:09,690 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 15:44:09,690 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 15:44:09,697 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:44:09" (1/1) ... [2022-07-21 15:44:09,782 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:44:09" (1/1) ... [2022-07-21 15:44:09,913 INFO L137 Inliner]: procedures = 526, calls = 1327, calls flagged for inlining = 223, calls inlined = 134, statements flattened = 2394 [2022-07-21 15:44:09,913 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 15:44:09,914 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 15:44:09,914 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 15:44:09,914 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 15:44:09,923 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:44:09" (1/1) ... [2022-07-21 15:44:09,923 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:44:09" (1/1) ... [2022-07-21 15:44:09,962 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:44:09" (1/1) ... [2022-07-21 15:44:09,962 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:44:09" (1/1) ... [2022-07-21 15:44:10,046 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:44:09" (1/1) ... [2022-07-21 15:44:10,053 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:44:09" (1/1) ... [2022-07-21 15:44:10,093 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:44:09" (1/1) ... [2022-07-21 15:44:10,114 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 15:44:10,115 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 15:44:10,115 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 15:44:10,116 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 15:44:10,116 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:44:09" (1/1) ... [2022-07-21 15:44:10,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 15:44:10,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:44:10,148 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 15:44:10,177 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 15:44:10,202 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-21 15:44:10,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-21 15:44:10,202 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-21 15:44:10,202 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-21 15:44:10,203 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-21 15:44:10,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-21 15:44:10,203 INFO L130 BoogieDeclarations]: Found specification of procedure __might_sleep [2022-07-21 15:44:10,203 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_sleep [2022-07-21 15:44:10,203 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-21 15:44:10,203 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-21 15:44:10,203 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-21 15:44:10,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-21 15:44:10,204 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-21 15:44:10,204 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-21 15:44:10,205 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_read_buffer_lock_of_lego_usb_tower [2022-07-21 15:44:10,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_read_buffer_lock_of_lego_usb_tower [2022-07-21 15:44:10,205 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-21 15:44:10,205 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-21 15:44:10,207 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-21 15:44:10,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-21 15:44:10,207 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-21 15:44:10,207 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-21 15:44:10,207 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 15:44:10,207 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-07-21 15:44:10,207 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-07-21 15:44:10,208 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-21 15:44:10,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-21 15:44:10,208 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2022-07-21 15:44:10,208 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2022-07-21 15:44:10,208 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-21 15:44:10,208 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-21 15:44:10,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-21 15:44:10,208 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-21 15:44:10,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-21 15:44:10,209 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irq_112 [2022-07-21 15:44:10,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irq_112 [2022-07-21 15:44:10,209 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-21 15:44:10,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-21 15:44:10,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 15:44:10,209 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-21 15:44:10,209 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-21 15:44:10,210 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2022-07-21 15:44:10,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2022-07-21 15:44:10,210 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-21 15:44:10,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-21 15:44:10,210 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-21 15:44:10,210 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-21 15:44:10,210 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-21 15:44:10,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-21 15:44:10,211 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait_event [2022-07-21 15:44:10,211 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait_event [2022-07-21 15:44:10,211 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-21 15:44:10,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-21 15:44:10,211 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_open_disc_mutex [2022-07-21 15:44:10,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_open_disc_mutex [2022-07-21 15:44:10,211 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_lock_of_lego_usb_tower [2022-07-21 15:44:10,211 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_lock_of_lego_usb_tower [2022-07-21 15:44:10,212 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-21 15:44:10,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-21 15:44:10,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 15:44:10,212 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 15:44:10,212 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-21 15:44:10,212 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-21 15:44:10,212 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 15:44:10,213 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2022-07-21 15:44:10,213 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2022-07-21 15:44:10,213 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-21 15:44:10,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-21 15:44:10,213 INFO L130 BoogieDeclarations]: Found specification of procedure usb_control_msg [2022-07-21 15:44:10,213 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_control_msg [2022-07-21 15:44:10,213 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-21 15:44:10,213 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-21 15:44:10,218 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-21 15:44:10,218 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-21 15:44:10,218 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2022-07-21 15:44:10,218 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2022-07-21 15:44:10,218 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_open_disc_mutex [2022-07-21 15:44:10,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_open_disc_mutex [2022-07-21 15:44:10,219 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_timeout [2022-07-21 15:44:10,219 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_timeout [2022-07-21 15:44:10,219 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2022-07-21 15:44:10,220 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2022-07-21 15:44:10,221 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 15:44:10,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 15:44:10,221 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2022-07-21 15:44:10,221 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2022-07-21 15:44:10,221 INFO L130 BoogieDeclarations]: Found specification of procedure tower_disconnect [2022-07-21 15:44:10,221 INFO L138 BoogieDeclarations]: Found implementation of procedure tower_disconnect [2022-07-21 15:44:10,221 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-21 15:44:10,221 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-21 15:44:10,222 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-21 15:44:10,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-21 15:44:10,222 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_maxp [2022-07-21 15:44:10,222 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_maxp [2022-07-21 15:44:10,222 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-21 15:44:10,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-21 15:44:10,222 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_free_urb [2022-07-21 15:44:10,222 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_free_urb [2022-07-21 15:44:10,223 INFO L130 BoogieDeclarations]: Found specification of procedure poll_wait [2022-07-21 15:44:10,223 INFO L138 BoogieDeclarations]: Found implementation of procedure poll_wait [2022-07-21 15:44:10,223 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-21 15:44:10,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-21 15:44:10,223 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_lock_of_lego_usb_tower [2022-07-21 15:44:10,223 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_lock_of_lego_usb_tower [2022-07-21 15:44:10,223 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 15:44:10,223 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2022-07-21 15:44:10,224 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2022-07-21 15:44:10,224 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-21 15:44:10,224 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-21 15:44:10,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 15:44:10,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 15:44:10,224 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2022-07-21 15:44:10,224 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2022-07-21 15:44:10,224 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-21 15:44:10,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-21 15:44:10,225 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-07-21 15:44:10,225 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-07-21 15:44:10,225 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-21 15:44:10,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-21 15:44:10,225 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_lock_of_lego_usb_tower [2022-07-21 15:44:10,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_lock_of_lego_usb_tower [2022-07-21 15:44:10,226 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-21 15:44:10,226 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-21 15:44:10,227 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_alloc_urb [2022-07-21 15:44:10,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_alloc_urb [2022-07-21 15:44:10,227 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-21 15:44:10,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-21 15:44:10,227 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-21 15:44:10,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-21 15:44:10,227 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-21 15:44:10,227 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-21 15:44:10,228 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-21 15:44:10,228 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-21 15:44:10,228 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-21 15:44:10,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-21 15:44:10,228 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_int_urb [2022-07-21 15:44:10,228 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_int_urb [2022-07-21 15:44:10,228 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_read_buffer_lock_of_lego_usb_tower [2022-07-21 15:44:10,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_read_buffer_lock_of_lego_usb_tower [2022-07-21 15:44:10,228 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-21 15:44:10,229 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-21 15:44:10,229 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-21 15:44:10,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-21 15:44:10,229 INFO L130 BoogieDeclarations]: Found specification of procedure tower_delete [2022-07-21 15:44:10,229 INFO L138 BoogieDeclarations]: Found implementation of procedure tower_delete [2022-07-21 15:44:10,229 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 15:44:10,229 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-21 15:44:10,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-21 15:44:10,230 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-21 15:44:10,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-21 15:44:10,230 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-21 15:44:10,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-21 15:44:10,230 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2022-07-21 15:44:10,230 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2022-07-21 15:44:10,230 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-21 15:44:10,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-21 15:44:10,231 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-21 15:44:10,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-21 15:44:10,231 INFO L130 BoogieDeclarations]: Found specification of procedure tower_check_for_read_packet [2022-07-21 15:44:10,231 INFO L138 BoogieDeclarations]: Found implementation of procedure tower_check_for_read_packet [2022-07-21 15:44:10,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 15:44:10,231 INFO L130 BoogieDeclarations]: Found specification of procedure tower_abort_transfers [2022-07-21 15:44:10,231 INFO L138 BoogieDeclarations]: Found implementation of procedure tower_abort_transfers [2022-07-21 15:44:10,231 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_irq_111 [2022-07-21 15:44:10,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_irq_111 [2022-07-21 15:44:10,760 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 15:44:10,762 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 15:44:10,907 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-21 15:44:13,283 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 15:44:13,294 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 15:44:13,294 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 15:44:13,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:44:13 BoogieIcfgContainer [2022-07-21 15:44:13,297 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 15:44:13,299 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 15:44:13,299 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 15:44:13,301 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 15:44:13,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 03:44:07" (1/3) ... [2022-07-21 15:44:13,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a79f36f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 03:44:13, skipping insertion in model container [2022-07-21 15:44:13,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:44:09" (2/3) ... [2022-07-21 15:44:13,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a79f36f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 03:44:13, skipping insertion in model container [2022-07-21 15:44:13,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:44:13" (3/3) ... [2022-07-21 15:44:13,303 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i [2022-07-21 15:44:13,315 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 15:44:13,316 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-07-21 15:44:13,378 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 15:44:13,384 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@76a854b2, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@231eec19 [2022-07-21 15:44:13,385 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2022-07-21 15:44:13,393 INFO L276 IsEmpty]: Start isEmpty. Operand has 996 states, 650 states have (on average 1.2907692307692307) internal successors, (839), 695 states have internal predecessors, (839), 240 states have call successors, (240), 76 states have call predecessors, (240), 75 states have return successors, (235), 232 states have call predecessors, (235), 235 states have call successors, (235) [2022-07-21 15:44:13,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-07-21 15:44:13,407 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:13,407 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:44:13,408 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:44:13,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:13,412 INFO L85 PathProgramCache]: Analyzing trace with hash 402770365, now seen corresponding path program 1 times [2022-07-21 15:44:13,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:13,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256978447] [2022-07-21 15:44:13,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:13,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:13,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:13,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:13,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:13,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:13,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:44:13,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:13,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:44:13,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:14,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:44:14,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:14,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:44:14,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:14,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:44:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:14,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:14,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:14,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:44:14,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:14,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:44:14,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:14,063 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:44:14,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:14,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256978447] [2022-07-21 15:44:14,065 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256978447] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:14,065 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:14,065 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:44:14,066 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85405006] [2022-07-21 15:44:14,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:14,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:44:14,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:14,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:44:14,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:44:14,103 INFO L87 Difference]: Start difference. First operand has 996 states, 650 states have (on average 1.2907692307692307) internal successors, (839), 695 states have internal predecessors, (839), 240 states have call successors, (240), 76 states have call predecessors, (240), 75 states have return successors, (235), 232 states have call predecessors, (235), 235 states have call successors, (235) Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-21 15:44:16,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:16,256 INFO L93 Difference]: Finished difference Result 1943 states and 2658 transitions. [2022-07-21 15:44:16,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:44:16,259 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 71 [2022-07-21 15:44:16,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:16,287 INFO L225 Difference]: With dead ends: 1943 [2022-07-21 15:44:16,287 INFO L226 Difference]: Without dead ends: 978 [2022-07-21 15:44:16,299 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:44:16,302 INFO L413 NwaCegarLoop]: 1223 mSDtfsCounter, 1666 mSDsluCounter, 1529 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 670 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1844 SdHoareTripleChecker+Valid, 2752 SdHoareTripleChecker+Invalid, 1734 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 670 IncrementalHoareTripleChecker+Valid, 1064 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:16,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1844 Valid, 2752 Invalid, 1734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [670 Valid, 1064 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-21 15:44:16,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 978 states. [2022-07-21 15:44:16,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 978 to 978. [2022-07-21 15:44:16,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 978 states, 640 states have (on average 1.2296875) internal successors, (787), 680 states have internal predecessors, (787), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2022-07-21 15:44:16,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 978 states to 978 states and 1255 transitions. [2022-07-21 15:44:16,439 INFO L78 Accepts]: Start accepts. Automaton has 978 states and 1255 transitions. Word has length 71 [2022-07-21 15:44:16,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:16,440 INFO L495 AbstractCegarLoop]: Abstraction has 978 states and 1255 transitions. [2022-07-21 15:44:16,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-21 15:44:16,441 INFO L276 IsEmpty]: Start isEmpty. Operand 978 states and 1255 transitions. [2022-07-21 15:44:16,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-07-21 15:44:16,444 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:16,445 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:44:16,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 15:44:16,445 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:44:16,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:16,446 INFO L85 PathProgramCache]: Analyzing trace with hash 365047418, now seen corresponding path program 1 times [2022-07-21 15:44:16,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:16,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1718783439] [2022-07-21 15:44:16,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:16,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:16,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:16,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:16,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:16,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:16,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:16,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:44:16,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:16,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:44:16,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:16,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:44:16,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:16,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:44:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:16,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:44:16,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:16,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:16,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:16,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:44:16,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:16,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:44:16,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:16,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:44:16,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:16,698 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:44:16,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:16,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1718783439] [2022-07-21 15:44:16,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1718783439] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:16,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:16,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:44:16,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914827094] [2022-07-21 15:44:16,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:16,700 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:44:16,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:16,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:44:16,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:44:16,702 INFO L87 Difference]: Start difference. First operand 978 states and 1255 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-21 15:44:18,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:18,703 INFO L93 Difference]: Finished difference Result 978 states and 1255 transitions. [2022-07-21 15:44:18,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:44:18,704 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 77 [2022-07-21 15:44:18,705 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:18,710 INFO L225 Difference]: With dead ends: 978 [2022-07-21 15:44:18,711 INFO L226 Difference]: Without dead ends: 976 [2022-07-21 15:44:18,712 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-21 15:44:18,712 INFO L413 NwaCegarLoop]: 1203 mSDtfsCounter, 1632 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1807 SdHoareTripleChecker+Valid, 2712 SdHoareTripleChecker+Invalid, 1710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1050 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:18,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1807 Valid, 2712 Invalid, 1710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1050 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-21 15:44:18,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 976 states. [2022-07-21 15:44:18,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 976 to 976. [2022-07-21 15:44:18,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 976 states, 639 states have (on average 1.2284820031298904) internal successors, (785), 678 states have internal predecessors, (785), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2022-07-21 15:44:18,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 976 states to 976 states and 1253 transitions. [2022-07-21 15:44:18,766 INFO L78 Accepts]: Start accepts. Automaton has 976 states and 1253 transitions. Word has length 77 [2022-07-21 15:44:18,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:18,767 INFO L495 AbstractCegarLoop]: Abstraction has 976 states and 1253 transitions. [2022-07-21 15:44:18,767 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-21 15:44:18,767 INFO L276 IsEmpty]: Start isEmpty. Operand 976 states and 1253 transitions. [2022-07-21 15:44:18,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-07-21 15:44:18,770 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:18,770 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:44:18,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 15:44:18,770 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:44:18,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:18,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1918003236, now seen corresponding path program 1 times [2022-07-21 15:44:18,771 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:18,772 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745995551] [2022-07-21 15:44:18,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:18,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:18,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:18,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:18,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:18,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:18,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:18,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:44:18,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:18,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:44:18,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:18,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:44:18,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:18,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:44:18,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:44:19,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:19,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:44:19,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:44:19,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:44:19,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 15:44:19,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:19,055 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:44:19,056 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:19,056 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745995551] [2022-07-21 15:44:19,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745995551] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:19,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:19,057 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:44:19,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487751487] [2022-07-21 15:44:19,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:19,057 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:44:19,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:19,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:44:19,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:44:19,059 INFO L87 Difference]: Start difference. First operand 976 states and 1253 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-21 15:44:21,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:21,049 INFO L93 Difference]: Finished difference Result 976 states and 1253 transitions. [2022-07-21 15:44:21,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:44:21,050 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 83 [2022-07-21 15:44:21,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:21,060 INFO L225 Difference]: With dead ends: 976 [2022-07-21 15:44:21,060 INFO L226 Difference]: Without dead ends: 974 [2022-07-21 15:44:21,061 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:44:21,062 INFO L413 NwaCegarLoop]: 1201 mSDtfsCounter, 1626 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1800 SdHoareTripleChecker+Valid, 2710 SdHoareTripleChecker+Invalid, 1708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1048 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:21,062 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1800 Valid, 2710 Invalid, 1708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-21 15:44:21,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 974 states. [2022-07-21 15:44:21,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 974 to 974. [2022-07-21 15:44:21,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 974 states, 638 states have (on average 1.2272727272727273) internal successors, (783), 676 states have internal predecessors, (783), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2022-07-21 15:44:21,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 974 states to 974 states and 1251 transitions. [2022-07-21 15:44:21,113 INFO L78 Accepts]: Start accepts. Automaton has 974 states and 1251 transitions. Word has length 83 [2022-07-21 15:44:21,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:21,114 INFO L495 AbstractCegarLoop]: Abstraction has 974 states and 1251 transitions. [2022-07-21 15:44:21,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-21 15:44:21,114 INFO L276 IsEmpty]: Start isEmpty. Operand 974 states and 1251 transitions. [2022-07-21 15:44:21,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-07-21 15:44:21,116 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:21,116 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:44:21,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 15:44:21,117 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:44:21,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:21,117 INFO L85 PathProgramCache]: Analyzing trace with hash -568396319, now seen corresponding path program 1 times [2022-07-21 15:44:21,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:21,118 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799636881] [2022-07-21 15:44:21,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:21,118 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:21,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:21,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:21,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:21,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:21,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:44:21,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:21,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:44:21,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:21,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:44:21,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:21,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:44:21,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:21,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:44:21,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:21,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:21,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:21,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:44:21,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:21,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:44:21,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:21,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:44:21,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:21,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 15:44:21,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:21,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 15:44:21,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:21,361 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:44:21,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:21,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799636881] [2022-07-21 15:44:21,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799636881] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:21,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:21,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:44:21,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1933295016] [2022-07-21 15:44:21,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:21,364 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:44:21,364 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:21,365 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:44:21,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:44:21,365 INFO L87 Difference]: Start difference. First operand 974 states and 1251 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-21 15:44:23,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:23,286 INFO L93 Difference]: Finished difference Result 974 states and 1251 transitions. [2022-07-21 15:44:23,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:44:23,286 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 89 [2022-07-21 15:44:23,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:23,292 INFO L225 Difference]: With dead ends: 974 [2022-07-21 15:44:23,292 INFO L226 Difference]: Without dead ends: 972 [2022-07-21 15:44:23,293 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:44:23,293 INFO L413 NwaCegarLoop]: 1199 mSDtfsCounter, 1620 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1793 SdHoareTripleChecker+Valid, 2708 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1046 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:23,294 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1793 Valid, 2708 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1046 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-21 15:44:23,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 972 states. [2022-07-21 15:44:23,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 972 to 972. [2022-07-21 15:44:23,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 972 states, 637 states have (on average 1.2260596546310831) internal successors, (781), 674 states have internal predecessors, (781), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2022-07-21 15:44:23,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 972 states to 972 states and 1249 transitions. [2022-07-21 15:44:23,331 INFO L78 Accepts]: Start accepts. Automaton has 972 states and 1249 transitions. Word has length 89 [2022-07-21 15:44:23,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:23,332 INFO L495 AbstractCegarLoop]: Abstraction has 972 states and 1249 transitions. [2022-07-21 15:44:23,332 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-21 15:44:23,332 INFO L276 IsEmpty]: Start isEmpty. Operand 972 states and 1249 transitions. [2022-07-21 15:44:23,333 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-07-21 15:44:23,333 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:23,334 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:44:23,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 15:44:23,334 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:44:23,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:23,335 INFO L85 PathProgramCache]: Analyzing trace with hash -1507800096, now seen corresponding path program 1 times [2022-07-21 15:44:23,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:23,335 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106485115] [2022-07-21 15:44:23,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:23,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:23,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:23,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:23,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:23,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:23,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:23,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:44:23,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:23,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:44:23,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:23,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:44:23,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:23,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:44:23,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:23,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:44:23,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:23,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:23,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:23,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:44:23,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:23,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:44:23,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:23,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:44:23,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:23,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 15:44:23,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:23,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 15:44:23,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:23,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 15:44:23,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:23,581 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:44:23,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:23,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106485115] [2022-07-21 15:44:23,585 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106485115] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:23,585 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:23,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:44:23,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [730639912] [2022-07-21 15:44:23,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:23,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:44:23,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:23,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:44:23,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:44:23,587 INFO L87 Difference]: Start difference. First operand 972 states and 1249 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-21 15:44:25,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:25,406 INFO L93 Difference]: Finished difference Result 972 states and 1249 transitions. [2022-07-21 15:44:25,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:44:25,406 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 95 [2022-07-21 15:44:25,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:25,412 INFO L225 Difference]: With dead ends: 972 [2022-07-21 15:44:25,412 INFO L226 Difference]: Without dead ends: 970 [2022-07-21 15:44:25,413 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:44:25,413 INFO L413 NwaCegarLoop]: 1197 mSDtfsCounter, 1614 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1786 SdHoareTripleChecker+Valid, 2706 SdHoareTripleChecker+Invalid, 1704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1044 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:25,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1786 Valid, 2706 Invalid, 1704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-21 15:44:25,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2022-07-21 15:44:25,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 970. [2022-07-21 15:44:25,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 636 states have (on average 1.2248427672955975) internal successors, (779), 672 states have internal predecessors, (779), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2022-07-21 15:44:25,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1247 transitions. [2022-07-21 15:44:25,455 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1247 transitions. Word has length 95 [2022-07-21 15:44:25,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:25,456 INFO L495 AbstractCegarLoop]: Abstraction has 970 states and 1247 transitions. [2022-07-21 15:44:25,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-21 15:44:25,456 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1247 transitions. [2022-07-21 15:44:25,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-07-21 15:44:25,457 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:25,457 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:44:25,458 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 15:44:25,458 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:44:25,458 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:25,458 INFO L85 PathProgramCache]: Analyzing trace with hash -1684610100, now seen corresponding path program 1 times [2022-07-21 15:44:25,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:25,459 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719574125] [2022-07-21 15:44:25,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:25,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:25,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:25,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:25,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:25,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:25,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:25,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:44:25,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:25,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:44:25,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:25,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:44:25,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:25,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:44:25,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:25,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:44:25,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:25,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:25,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:25,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:44:25,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:25,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:44:25,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:25,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:44:25,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:25,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 15:44:25,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:25,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 15:44:25,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:25,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 15:44:25,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:25,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 15:44:25,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:25,713 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:44:25,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:25,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719574125] [2022-07-21 15:44:25,714 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719574125] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:25,714 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:25,714 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:44:25,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559348638] [2022-07-21 15:44:25,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:25,715 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:44:25,715 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:25,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:44:25,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:44:25,716 INFO L87 Difference]: Start difference. First operand 970 states and 1247 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-21 15:44:27,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:27,410 INFO L93 Difference]: Finished difference Result 970 states and 1247 transitions. [2022-07-21 15:44:27,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:44:27,410 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 101 [2022-07-21 15:44:27,411 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:27,415 INFO L225 Difference]: With dead ends: 970 [2022-07-21 15:44:27,416 INFO L226 Difference]: Without dead ends: 968 [2022-07-21 15:44:27,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:44:27,422 INFO L413 NwaCegarLoop]: 1195 mSDtfsCounter, 1608 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1779 SdHoareTripleChecker+Valid, 2704 SdHoareTripleChecker+Invalid, 1702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1042 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:27,422 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1779 Valid, 2704 Invalid, 1702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1042 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-21 15:44:27,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2022-07-21 15:44:27,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 968. [2022-07-21 15:44:27,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 635 states have (on average 1.2236220472440944) internal successors, (777), 670 states have internal predecessors, (777), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2022-07-21 15:44:27,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1245 transitions. [2022-07-21 15:44:27,465 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1245 transitions. Word has length 101 [2022-07-21 15:44:27,465 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:27,465 INFO L495 AbstractCegarLoop]: Abstraction has 968 states and 1245 transitions. [2022-07-21 15:44:27,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-21 15:44:27,466 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1245 transitions. [2022-07-21 15:44:27,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-07-21 15:44:27,468 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:27,468 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:44:27,468 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 15:44:27,469 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:44:27,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:27,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1492862734, now seen corresponding path program 1 times [2022-07-21 15:44:27,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:27,470 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879355198] [2022-07-21 15:44:27,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:27,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:27,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:27,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:27,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:27,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:27,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:44:27,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:27,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:44:27,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:27,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:44:27,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:27,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:44:27,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:27,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:44:27,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:27,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:27,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:27,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:44:27,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:27,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:44:27,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:27,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:44:27,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:27,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 15:44:27,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:27,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 15:44:27,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:27,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 15:44:27,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:27,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 15:44:27,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:27,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 15:44:27,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:27,710 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:44:27,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:27,711 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879355198] [2022-07-21 15:44:27,711 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879355198] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:27,711 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:27,711 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:44:27,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16799739] [2022-07-21 15:44:27,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:27,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:44:27,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:27,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:44:27,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:44:27,713 INFO L87 Difference]: Start difference. First operand 968 states and 1245 transitions. Second operand has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-21 15:44:29,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:29,544 INFO L93 Difference]: Finished difference Result 968 states and 1245 transitions. [2022-07-21 15:44:29,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:44:29,544 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 107 [2022-07-21 15:44:29,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:29,550 INFO L225 Difference]: With dead ends: 968 [2022-07-21 15:44:29,550 INFO L226 Difference]: Without dead ends: 966 [2022-07-21 15:44:29,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:44:29,551 INFO L413 NwaCegarLoop]: 1193 mSDtfsCounter, 1602 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1772 SdHoareTripleChecker+Valid, 2702 SdHoareTripleChecker+Invalid, 1700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1040 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:29,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1772 Valid, 2702 Invalid, 1700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-21 15:44:29,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2022-07-21 15:44:29,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 966. [2022-07-21 15:44:29,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 634 states have (on average 1.222397476340694) internal successors, (775), 668 states have internal predecessors, (775), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2022-07-21 15:44:29,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1243 transitions. [2022-07-21 15:44:29,589 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1243 transitions. Word has length 107 [2022-07-21 15:44:29,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:29,590 INFO L495 AbstractCegarLoop]: Abstraction has 966 states and 1243 transitions. [2022-07-21 15:44:29,590 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.166666666666666) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-21 15:44:29,590 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1243 transitions. [2022-07-21 15:44:29,591 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-07-21 15:44:29,591 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:29,591 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:44:29,592 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 15:44:29,592 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:44:29,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:29,592 INFO L85 PathProgramCache]: Analyzing trace with hash -684027951, now seen corresponding path program 1 times [2022-07-21 15:44:29,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:29,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770693770] [2022-07-21 15:44:29,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:29,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:29,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:29,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:29,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:29,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:29,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:29,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:44:29,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:29,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:44:29,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:29,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:44:29,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:29,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:44:29,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:29,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:44:29,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:29,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:29,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:29,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:44:29,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:29,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:44:29,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:29,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:44:29,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:29,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 15:44:29,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:29,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 15:44:29,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:29,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 15:44:29,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:29,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 15:44:29,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:29,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 15:44:29,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:29,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 15:44:29,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:29,806 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:44:29,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:29,807 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770693770] [2022-07-21 15:44:29,807 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770693770] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:29,807 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:29,807 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:44:29,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694002811] [2022-07-21 15:44:29,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:29,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:44:29,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:29,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:44:29,809 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:44:29,809 INFO L87 Difference]: Start difference. First operand 966 states and 1243 transitions. Second operand has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-21 15:44:31,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:31,668 INFO L93 Difference]: Finished difference Result 966 states and 1243 transitions. [2022-07-21 15:44:31,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:44:31,669 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 113 [2022-07-21 15:44:31,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:31,674 INFO L225 Difference]: With dead ends: 966 [2022-07-21 15:44:31,674 INFO L226 Difference]: Without dead ends: 964 [2022-07-21 15:44:31,675 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:44:31,676 INFO L413 NwaCegarLoop]: 1191 mSDtfsCounter, 1600 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1769 SdHoareTripleChecker+Valid, 2700 SdHoareTripleChecker+Invalid, 1694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:31,676 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1769 Valid, 2700 Invalid, 1694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-21 15:44:31,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2022-07-21 15:44:31,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 964. [2022-07-21 15:44:31,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 633 states have (on average 1.221169036334913) internal successors, (773), 666 states have internal predecessors, (773), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2022-07-21 15:44:31,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1241 transitions. [2022-07-21 15:44:31,715 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1241 transitions. Word has length 113 [2022-07-21 15:44:31,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:31,715 INFO L495 AbstractCegarLoop]: Abstraction has 964 states and 1241 transitions. [2022-07-21 15:44:31,716 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.833333333333334) internal successors, (65), 4 states have internal predecessors, (65), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-21 15:44:31,716 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1241 transitions. [2022-07-21 15:44:31,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-07-21 15:44:31,717 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:31,717 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:44:31,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 15:44:31,718 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:44:31,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:31,718 INFO L85 PathProgramCache]: Analyzing trace with hash -220729804, now seen corresponding path program 1 times [2022-07-21 15:44:31,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:31,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955418006] [2022-07-21 15:44:31,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:31,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:31,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:31,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:31,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:31,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:31,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:44:31,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:31,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:44:31,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:31,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:44:31,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:31,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:44:31,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:31,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:44:31,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:31,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:31,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:31,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:44:31,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:31,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:44:31,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:31,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:44:31,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:31,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 15:44:31,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:31,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 15:44:31,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:31,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 15:44:31,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:31,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 15:44:31,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:31,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 15:44:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:31,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 15:44:31,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:31,935 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:44:31,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:31,935 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955418006] [2022-07-21 15:44:31,935 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955418006] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:31,935 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:31,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:44:31,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25393292] [2022-07-21 15:44:31,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:31,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:44:31,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:31,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:44:31,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:44:31,938 INFO L87 Difference]: Start difference. First operand 964 states and 1241 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-21 15:44:33,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:33,948 INFO L93 Difference]: Finished difference Result 964 states and 1241 transitions. [2022-07-21 15:44:33,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:44:33,949 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 115 [2022-07-21 15:44:33,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:33,953 INFO L225 Difference]: With dead ends: 964 [2022-07-21 15:44:33,953 INFO L226 Difference]: Without dead ends: 962 [2022-07-21 15:44:33,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:44:33,955 INFO L413 NwaCegarLoop]: 1189 mSDtfsCounter, 1588 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1757 SdHoareTripleChecker+Valid, 2698 SdHoareTripleChecker+Invalid, 1696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1036 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:33,955 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1757 Valid, 2698 Invalid, 1696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-21 15:44:33,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2022-07-21 15:44:33,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2022-07-21 15:44:33,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 632 states have (on average 1.2199367088607596) internal successors, (771), 664 states have internal predecessors, (771), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2022-07-21 15:44:33,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1239 transitions. [2022-07-21 15:44:33,994 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1239 transitions. Word has length 115 [2022-07-21 15:44:33,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:33,995 INFO L495 AbstractCegarLoop]: Abstraction has 962 states and 1239 transitions. [2022-07-21 15:44:33,995 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-21 15:44:33,995 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1239 transitions. [2022-07-21 15:44:33,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-07-21 15:44:33,997 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:33,997 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:44:33,997 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 15:44:33,997 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:44:33,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:33,998 INFO L85 PathProgramCache]: Analyzing trace with hash 1827149257, now seen corresponding path program 1 times [2022-07-21 15:44:33,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:33,998 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84317361] [2022-07-21 15:44:33,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:33,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:34,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:34,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:34,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:44:34,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:44:34,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:44:34,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:44:34,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:44:34,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:34,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:44:34,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:44:34,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:44:34,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 15:44:34,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 15:44:34,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 15:44:34,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 15:44:34,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 15:44:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 15:44:34,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 15:44:34,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:34,188 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:44:34,189 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:34,189 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84317361] [2022-07-21 15:44:34,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84317361] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:34,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:34,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:44:34,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345006483] [2022-07-21 15:44:34,190 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:34,190 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:44:34,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:34,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:44:34,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:44:34,191 INFO L87 Difference]: Start difference. First operand 962 states and 1239 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-21 15:44:35,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:35,813 INFO L93 Difference]: Finished difference Result 962 states and 1239 transitions. [2022-07-21 15:44:35,813 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:44:35,813 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 121 [2022-07-21 15:44:35,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:35,818 INFO L225 Difference]: With dead ends: 962 [2022-07-21 15:44:35,818 INFO L226 Difference]: Without dead ends: 960 [2022-07-21 15:44:35,818 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:44:35,819 INFO L413 NwaCegarLoop]: 1187 mSDtfsCounter, 1584 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1752 SdHoareTripleChecker+Valid, 2696 SdHoareTripleChecker+Invalid, 1694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1034 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:35,819 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1752 Valid, 2696 Invalid, 1694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-21 15:44:35,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2022-07-21 15:44:35,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 960. [2022-07-21 15:44:35,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 631 states have (on average 1.2187004754358162) internal successors, (769), 662 states have internal predecessors, (769), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2022-07-21 15:44:35,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1237 transitions. [2022-07-21 15:44:35,860 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1237 transitions. Word has length 121 [2022-07-21 15:44:35,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:35,860 INFO L495 AbstractCegarLoop]: Abstraction has 960 states and 1237 transitions. [2022-07-21 15:44:35,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-21 15:44:35,861 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1237 transitions. [2022-07-21 15:44:35,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-07-21 15:44:35,862 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:35,863 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:44:35,863 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 15:44:35,863 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:44:35,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:35,863 INFO L85 PathProgramCache]: Analyzing trace with hash 1600714118, now seen corresponding path program 1 times [2022-07-21 15:44:35,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:35,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190342704] [2022-07-21 15:44:35,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:35,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:35,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:36,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:36,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:44:36,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:44:36,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 15:44:36,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:36,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:36,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:36,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 15:44:36,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:36,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:36,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:36,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:44:36,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:36,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:36,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:36,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:44:36,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:36,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:36,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:36,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:44:36,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:36,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:36,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:36,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:44:36,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 15:44:36,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-21 15:44:36,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:36,219 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-07-21 15:44:36,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:36,220 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190342704] [2022-07-21 15:44:36,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190342704] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:36,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:36,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 15:44:36,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895984144] [2022-07-21 15:44:36,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:36,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 15:44:36,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:36,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 15:44:36,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-21 15:44:36,222 INFO L87 Difference]: Start difference. First operand 960 states and 1237 transitions. Second operand has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-21 15:44:39,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:39,442 INFO L93 Difference]: Finished difference Result 1894 states and 2447 transitions. [2022-07-21 15:44:39,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 15:44:39,443 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) Word has length 164 [2022-07-21 15:44:39,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:39,448 INFO L225 Difference]: With dead ends: 1894 [2022-07-21 15:44:39,448 INFO L226 Difference]: Without dead ends: 973 [2022-07-21 15:44:39,451 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2022-07-21 15:44:39,452 INFO L413 NwaCegarLoop]: 1182 mSDtfsCounter, 1902 mSDsluCounter, 3012 mSDsCounter, 0 mSdLazyCounter, 2676 mSolverCounterSat, 954 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2083 SdHoareTripleChecker+Valid, 4194 SdHoareTripleChecker+Invalid, 3630 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 954 IncrementalHoareTripleChecker+Valid, 2676 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:39,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2083 Valid, 4194 Invalid, 3630 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [954 Valid, 2676 Invalid, 0 Unknown, 0 Unchecked, 3.0s Time] [2022-07-21 15:44:39,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 973 states. [2022-07-21 15:44:39,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 973 to 960. [2022-07-21 15:44:39,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 631 states have (on average 1.2171156893819335) internal successors, (768), 662 states have internal predecessors, (768), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2022-07-21 15:44:39,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1236 transitions. [2022-07-21 15:44:39,499 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1236 transitions. Word has length 164 [2022-07-21 15:44:39,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:39,500 INFO L495 AbstractCegarLoop]: Abstraction has 960 states and 1236 transitions. [2022-07-21 15:44:39,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.333333333333333) internal successors, (48), 5 states have internal predecessors, (48), 2 states have call successors, (18), 5 states have call predecessors, (18), 2 states have return successors, (15), 3 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-21 15:44:39,500 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1236 transitions. [2022-07-21 15:44:39,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2022-07-21 15:44:39,502 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:39,502 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:44:39,502 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 15:44:39,502 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_alloc_irq_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:44:39,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:39,503 INFO L85 PathProgramCache]: Analyzing trace with hash 1600773700, now seen corresponding path program 1 times [2022-07-21 15:44:39,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:39,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622963870] [2022-07-21 15:44:39,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:39,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:39,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:39,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:39,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:39,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:39,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:39,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:44:39,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:39,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:44:39,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:39,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 15:44:39,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:39,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:39,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:39,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:39,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:39,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:39,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:39,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 15:44:39,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:39,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:39,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:39,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:39,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:39,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:39,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:39,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:44:39,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:39,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:39,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:39,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:39,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:39,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:39,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:39,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:44:39,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:39,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:39,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:39,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:39,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:39,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:39,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:44:39,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:39,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:39,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:39,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:39,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:39,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:39,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:39,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:44:39,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:39,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 15:44:39,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:39,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-21 15:44:39,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:39,779 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-07-21 15:44:39,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:39,780 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622963870] [2022-07-21 15:44:39,780 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622963870] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:39,780 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:39,780 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-07-21 15:44:39,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876805446] [2022-07-21 15:44:39,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:39,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-07-21 15:44:39,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:39,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-07-21 15:44:39,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-07-21 15:44:39,782 INFO L87 Difference]: Start difference. First operand 960 states and 1236 transitions. Second operand has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-21 15:44:42,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:42,103 INFO L93 Difference]: Finished difference Result 973 states and 1257 transitions. [2022-07-21 15:44:42,103 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-21 15:44:42,104 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) Word has length 164 [2022-07-21 15:44:42,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:42,108 INFO L225 Difference]: With dead ends: 973 [2022-07-21 15:44:42,108 INFO L226 Difference]: Without dead ends: 971 [2022-07-21 15:44:42,109 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-07-21 15:44:42,109 INFO L413 NwaCegarLoop]: 1182 mSDtfsCounter, 967 mSDsluCounter, 2570 mSDsCounter, 0 mSdLazyCounter, 1882 mSolverCounterSat, 848 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 967 SdHoareTripleChecker+Valid, 3752 SdHoareTripleChecker+Invalid, 2730 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 848 IncrementalHoareTripleChecker+Valid, 1882 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:42,110 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [967 Valid, 3752 Invalid, 2730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [848 Valid, 1882 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-21 15:44:42,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 971 states. [2022-07-21 15:44:42,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 971 to 958. [2022-07-21 15:44:42,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 630 states have (on average 1.2158730158730158) internal successors, (766), 660 states have internal predecessors, (766), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2022-07-21 15:44:42,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1234 transitions. [2022-07-21 15:44:42,158 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1234 transitions. Word has length 164 [2022-07-21 15:44:42,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:42,158 INFO L495 AbstractCegarLoop]: Abstraction has 958 states and 1234 transitions. [2022-07-21 15:44:42,158 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 6.857142857142857) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (15), 1 states have call predecessors, (15), 1 states have call successors, (15) [2022-07-21 15:44:42,159 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1234 transitions. [2022-07-21 15:44:42,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-07-21 15:44:42,160 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:42,160 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:44:42,160 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 15:44:42,161 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:44:42,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:42,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1450869965, now seen corresponding path program 1 times [2022-07-21 15:44:42,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:42,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608563518] [2022-07-21 15:44:42,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:42,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:42,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:42,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:42,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:42,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:42,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:42,294 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:44:42,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:42,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:44:42,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:42,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:44:42,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:42,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:44:42,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:42,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:44:42,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:42,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:42,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:42,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:44:42,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:42,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:44:42,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:42,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:44:42,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:42,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 15:44:42,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:42,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 15:44:42,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:42,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 15:44:42,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:42,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 15:44:42,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:42,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 15:44:42,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:42,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 15:44:42,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:42,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 15:44:42,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:42,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 15:44:42,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:42,389 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:44:42,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:42,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608563518] [2022-07-21 15:44:42,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608563518] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:42,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:42,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:44:42,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1769644700] [2022-07-21 15:44:42,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:42,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:44:42,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:42,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:44:42,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:44:42,392 INFO L87 Difference]: Start difference. First operand 958 states and 1234 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-21 15:44:44,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:44,089 INFO L93 Difference]: Finished difference Result 958 states and 1234 transitions. [2022-07-21 15:44:44,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:44:44,090 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 127 [2022-07-21 15:44:44,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:44,093 INFO L225 Difference]: With dead ends: 958 [2022-07-21 15:44:44,093 INFO L226 Difference]: Without dead ends: 956 [2022-07-21 15:44:44,094 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:44:44,096 INFO L413 NwaCegarLoop]: 1182 mSDtfsCounter, 1569 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1736 SdHoareTripleChecker+Valid, 2691 SdHoareTripleChecker+Invalid, 1689 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1029 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:44,096 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1736 Valid, 2691 Invalid, 1689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1029 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-21 15:44:44,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2022-07-21 15:44:44,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 956. [2022-07-21 15:44:44,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 629 states have (on average 1.2146263910969792) internal successors, (764), 658 states have internal predecessors, (764), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2022-07-21 15:44:44,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1232 transitions. [2022-07-21 15:44:44,142 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1232 transitions. Word has length 127 [2022-07-21 15:44:44,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:44,143 INFO L495 AbstractCegarLoop]: Abstraction has 956 states and 1232 transitions. [2022-07-21 15:44:44,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-21 15:44:44,143 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1232 transitions. [2022-07-21 15:44:44,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-07-21 15:44:44,145 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:44,145 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:44:44,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 15:44:44,146 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:44:44,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:44,146 INFO L85 PathProgramCache]: Analyzing trace with hash -414528546, now seen corresponding path program 1 times [2022-07-21 15:44:44,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:44,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [22341014] [2022-07-21 15:44:44,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:44,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:44,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:44,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:44,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:44,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:44,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:44:44,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:44,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:44:44,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:44,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 15:44:44,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:44,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:44,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:44,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:44,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:44,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:44,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:44,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 15:44:44,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:44,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:44,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:44,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:44,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:44,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:44,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:44,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:44:44,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:44,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:44,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:44,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:44,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:44,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:44,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:44,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:44:44,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:44,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:44,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:44,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:44,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:44,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:44,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:44:44,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:44,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:44,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:44,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:44,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:44,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:44,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:44,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:44:44,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:44,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 15:44:44,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:44,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-21 15:44:44,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:44,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:44,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:44,445 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-07-21 15:44:44,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:44,445 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [22341014] [2022-07-21 15:44:44,445 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [22341014] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:44,445 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:44,446 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:44:44,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1352860220] [2022-07-21 15:44:44,446 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:44,446 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:44:44,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:44,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:44:44,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:44:44,448 INFO L87 Difference]: Start difference. First operand 956 states and 1232 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-21 15:44:46,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:46,186 INFO L93 Difference]: Finished difference Result 1882 states and 2433 transitions. [2022-07-21 15:44:46,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:44:46,187 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 171 [2022-07-21 15:44:46,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:46,191 INFO L225 Difference]: With dead ends: 1882 [2022-07-21 15:44:46,191 INFO L226 Difference]: Without dead ends: 965 [2022-07-21 15:44:46,193 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:44:46,194 INFO L413 NwaCegarLoop]: 1174 mSDtfsCounter, 1863 mSDsluCounter, 1310 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 949 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2045 SdHoareTripleChecker+Valid, 2484 SdHoareTripleChecker+Invalid, 1619 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 949 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:46,194 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2045 Valid, 2484 Invalid, 1619 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [949 Valid, 670 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-21 15:44:46,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2022-07-21 15:44:46,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 952. [2022-07-21 15:44:46,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 626 states have (on average 1.2124600638977636) internal successors, (759), 654 states have internal predecessors, (759), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2022-07-21 15:44:46,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1227 transitions. [2022-07-21 15:44:46,240 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1227 transitions. Word has length 171 [2022-07-21 15:44:46,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:46,241 INFO L495 AbstractCegarLoop]: Abstraction has 952 states and 1227 transitions. [2022-07-21 15:44:46,241 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 3 states have internal predecessors, (53), 2 states have call successors, (19), 5 states have call predecessors, (19), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-21 15:44:46,242 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1227 transitions. [2022-07-21 15:44:46,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2022-07-21 15:44:46,243 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:46,243 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:44:46,244 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 15:44:46,244 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:44:46,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:46,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1405332358, now seen corresponding path program 1 times [2022-07-21 15:44:46,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:46,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120633731] [2022-07-21 15:44:46,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:46,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:46,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:46,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:46,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:46,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:46,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:46,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:44:46,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:46,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:44:46,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:46,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:44:46,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:46,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:44:46,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:46,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:44:46,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:46,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:46,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:46,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:44:46,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:46,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:44:46,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:46,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:44:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:46,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 15:44:46,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:46,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 15:44:46,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:46,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 15:44:46,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:46,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 15:44:46,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:46,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 15:44:46,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:46,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 15:44:46,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:46,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 15:44:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:46,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 15:44:46,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:46,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 15:44:46,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:46,471 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:44:46,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:46,472 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120633731] [2022-07-21 15:44:46,472 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120633731] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:46,472 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:46,472 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:44:46,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756586560] [2022-07-21 15:44:46,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:46,474 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:44:46,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:46,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:44:46,474 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:44:46,475 INFO L87 Difference]: Start difference. First operand 952 states and 1227 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-21 15:44:48,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:48,345 INFO L93 Difference]: Finished difference Result 952 states and 1227 transitions. [2022-07-21 15:44:48,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:44:48,345 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 133 [2022-07-21 15:44:48,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:48,350 INFO L225 Difference]: With dead ends: 952 [2022-07-21 15:44:48,350 INFO L226 Difference]: Without dead ends: 950 [2022-07-21 15:44:48,350 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:44:48,351 INFO L413 NwaCegarLoop]: 1175 mSDtfsCounter, 1548 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1714 SdHoareTripleChecker+Valid, 2684 SdHoareTripleChecker+Invalid, 1682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1022 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:48,351 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1714 Valid, 2684 Invalid, 1682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1022 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-21 15:44:48,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 950 states. [2022-07-21 15:44:48,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 950 to 950. [2022-07-21 15:44:48,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 625 states have (on average 1.2112) internal successors, (757), 652 states have internal predecessors, (757), 235 states have call successors, (235), 75 states have call predecessors, (235), 74 states have return successors, (233), 230 states have call predecessors, (233), 233 states have call successors, (233) [2022-07-21 15:44:48,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1225 transitions. [2022-07-21 15:44:48,399 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1225 transitions. Word has length 133 [2022-07-21 15:44:48,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:48,400 INFO L495 AbstractCegarLoop]: Abstraction has 950 states and 1225 transitions. [2022-07-21 15:44:48,400 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-21 15:44:48,401 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1225 transitions. [2022-07-21 15:44:48,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-07-21 15:44:48,402 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:48,403 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 10, 7, 7, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:44:48,403 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 15:44:48,403 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:44:48,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:48,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1009250017, now seen corresponding path program 1 times [2022-07-21 15:44:48,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:48,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081425928] [2022-07-21 15:44:48,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:48,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:48,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:48,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:48,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:48,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:48,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:44:48,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:48,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:44:48,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:48,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:44:48,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:48,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:44:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:48,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:44:48,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:48,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:48,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:48,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:44:48,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:48,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:44:48,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:48,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:44:48,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:48,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:44:48,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:48,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:48,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:48,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:48,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:48,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:48,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:48,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 15:44:48,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:48,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:48,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:48,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:48,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:48,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:48,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:48,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-21 15:44:48,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:48,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:48,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:48,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:48,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:48,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:48,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:48,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 15:44:48,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:48,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 15:44:48,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:48,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-21 15:44:48,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:48,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:48,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:48,686 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2022-07-21 15:44:48,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:48,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081425928] [2022-07-21 15:44:48,687 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2081425928] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:48,687 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:48,687 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 15:44:48,687 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [58666449] [2022-07-21 15:44:48,687 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:48,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 15:44:48,688 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:48,688 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 15:44:48,688 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-21 15:44:48,689 INFO L87 Difference]: Start difference. First operand 950 states and 1225 transitions. Second operand has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2022-07-21 15:44:52,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:52,115 INFO L93 Difference]: Finished difference Result 1924 states and 2519 transitions. [2022-07-21 15:44:52,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 15:44:52,115 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) Word has length 167 [2022-07-21 15:44:52,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:52,121 INFO L225 Difference]: With dead ends: 1924 [2022-07-21 15:44:52,121 INFO L226 Difference]: Without dead ends: 1248 [2022-07-21 15:44:52,123 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2022-07-21 15:44:52,124 INFO L413 NwaCegarLoop]: 1300 mSDtfsCounter, 1438 mSDsluCounter, 3972 mSDsCounter, 0 mSdLazyCounter, 3548 mSolverCounterSat, 1233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1438 SdHoareTripleChecker+Valid, 5272 SdHoareTripleChecker+Invalid, 4781 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1233 IncrementalHoareTripleChecker+Valid, 3548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:52,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1438 Valid, 5272 Invalid, 4781 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1233 Valid, 3548 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-07-21 15:44:52,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1248 states. [2022-07-21 15:44:52,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1248 to 955. [2022-07-21 15:44:52,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 955 states, 629 states have (on average 1.2098569157392687) internal successors, (761), 656 states have internal predecessors, (761), 235 states have call successors, (235), 75 states have call predecessors, (235), 75 states have return successors, (236), 231 states have call predecessors, (236), 233 states have call successors, (236) [2022-07-21 15:44:52,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 955 states to 955 states and 1232 transitions. [2022-07-21 15:44:52,186 INFO L78 Accepts]: Start accepts. Automaton has 955 states and 1232 transitions. Word has length 167 [2022-07-21 15:44:52,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:52,187 INFO L495 AbstractCegarLoop]: Abstraction has 955 states and 1232 transitions. [2022-07-21 15:44:52,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.666666666666667) internal successors, (60), 5 states have internal predecessors, (60), 2 states have call successors, (23), 5 states have call predecessors, (23), 2 states have return successors, (21), 2 states have call predecessors, (21), 1 states have call successors, (21) [2022-07-21 15:44:52,187 INFO L276 IsEmpty]: Start isEmpty. Operand 955 states and 1232 transitions. [2022-07-21 15:44:52,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-07-21 15:44:52,189 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:52,189 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:44:52,189 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-21 15:44:52,189 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:44:52,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:52,190 INFO L85 PathProgramCache]: Analyzing trace with hash 1781282389, now seen corresponding path program 1 times [2022-07-21 15:44:52,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:52,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579464078] [2022-07-21 15:44:52,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:52,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:52,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:52,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:52,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:44:52,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:44:52,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:44:52,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:44:52,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:44:52,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:52,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:44:52,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:44:52,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:44:52,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 15:44:52,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 15:44:52,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,340 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 15:44:52,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 15:44:52,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 15:44:52,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 15:44:52,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 15:44:52,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 15:44:52,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 15:44:52,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-21 15:44:52,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:52,369 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:44:52,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:52,369 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1579464078] [2022-07-21 15:44:52,369 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1579464078] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:52,369 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:52,370 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:44:52,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [975906785] [2022-07-21 15:44:52,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:52,370 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:44:52,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:52,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:44:52,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:44:52,371 INFO L87 Difference]: Start difference. First operand 955 states and 1232 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-21 15:44:54,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:54,198 INFO L93 Difference]: Finished difference Result 955 states and 1232 transitions. [2022-07-21 15:44:54,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:44:54,199 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 139 [2022-07-21 15:44:54,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:54,204 INFO L225 Difference]: With dead ends: 955 [2022-07-21 15:44:54,204 INFO L226 Difference]: Without dead ends: 953 [2022-07-21 15:44:54,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:44:54,205 INFO L413 NwaCegarLoop]: 1173 mSDtfsCounter, 1542 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1707 SdHoareTripleChecker+Valid, 2682 SdHoareTripleChecker+Invalid, 1680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1020 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:54,206 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1707 Valid, 2682 Invalid, 1680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-21 15:44:54,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2022-07-21 15:44:54,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 953. [2022-07-21 15:44:54,255 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 953 states, 628 states have (on average 1.2085987261146496) internal successors, (759), 654 states have internal predecessors, (759), 235 states have call successors, (235), 75 states have call predecessors, (235), 75 states have return successors, (236), 231 states have call predecessors, (236), 233 states have call successors, (236) [2022-07-21 15:44:54,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 953 states to 953 states and 1230 transitions. [2022-07-21 15:44:54,259 INFO L78 Accepts]: Start accepts. Automaton has 953 states and 1230 transitions. Word has length 139 [2022-07-21 15:44:54,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:54,259 INFO L495 AbstractCegarLoop]: Abstraction has 953 states and 1230 transitions. [2022-07-21 15:44:54,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-21 15:44:54,259 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1230 transitions. [2022-07-21 15:44:54,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-07-21 15:44:54,261 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:54,261 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:44:54,261 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-21 15:44:54,262 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:44:54,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:54,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1618445868, now seen corresponding path program 1 times [2022-07-21 15:44:54,262 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:54,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564172946] [2022-07-21 15:44:54,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:54,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:54,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:54,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:54,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:54,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:54,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:54,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:44:54,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:54,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:44:54,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:54,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:44:54,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:54,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:44:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:54,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:44:54,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:54,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:54,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:54,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:44:54,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:54,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:44:54,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:54,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:44:54,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:54,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 15:44:54,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:54,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 15:44:54,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:54,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 15:44:54,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:54,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 15:44:54,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:54,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 15:44:54,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:54,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 15:44:54,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:54,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 15:44:54,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:54,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 15:44:54,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:54,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 15:44:54,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:54,461 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-21 15:44:54,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:54,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 15:44:54,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:54,474 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:44:54,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:54,475 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564172946] [2022-07-21 15:44:54,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [564172946] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:54,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:54,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:44:54,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666146827] [2022-07-21 15:44:54,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:54,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:44:54,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:54,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:44:54,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:44:54,477 INFO L87 Difference]: Start difference. First operand 953 states and 1230 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-21 15:44:56,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:56,179 INFO L93 Difference]: Finished difference Result 953 states and 1230 transitions. [2022-07-21 15:44:56,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:44:56,180 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 145 [2022-07-21 15:44:56,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:56,184 INFO L225 Difference]: With dead ends: 953 [2022-07-21 15:44:56,184 INFO L226 Difference]: Without dead ends: 951 [2022-07-21 15:44:56,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:44:56,185 INFO L413 NwaCegarLoop]: 1171 mSDtfsCounter, 1536 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1700 SdHoareTripleChecker+Valid, 2680 SdHoareTripleChecker+Invalid, 1678 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1018 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:56,185 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1700 Valid, 2680 Invalid, 1678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-21 15:44:56,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2022-07-21 15:44:56,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 951. [2022-07-21 15:44:56,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 627 states have (on average 1.2073365231259967) internal successors, (757), 652 states have internal predecessors, (757), 235 states have call successors, (235), 75 states have call predecessors, (235), 75 states have return successors, (236), 231 states have call predecessors, (236), 233 states have call successors, (236) [2022-07-21 15:44:56,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1228 transitions. [2022-07-21 15:44:56,239 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1228 transitions. Word has length 145 [2022-07-21 15:44:56,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:56,240 INFO L495 AbstractCegarLoop]: Abstraction has 951 states and 1228 transitions. [2022-07-21 15:44:56,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-21 15:44:56,240 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1228 transitions. [2022-07-21 15:44:56,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2022-07-21 15:44:56,242 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:56,242 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 7, 7, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:44:56,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-21 15:44:56,243 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:44:56,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:56,243 INFO L85 PathProgramCache]: Analyzing trace with hash 92670537, now seen corresponding path program 1 times [2022-07-21 15:44:56,243 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:56,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1323184939] [2022-07-21 15:44:56,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:56,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:56,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:56,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:56,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:56,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:56,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:56,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:44:56,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:56,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:44:56,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:56,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:44:56,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:56,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:44:56,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:56,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:44:56,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:56,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:56,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:56,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:44:56,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:56,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:44:56,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:56,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:44:56,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:56,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:44:56,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:56,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:56,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:56,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:56,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:56,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:56,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:56,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 15:44:56,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:56,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:56,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:56,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:56,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:56,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:56,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:56,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-21 15:44:56,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:56,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:56,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:56,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:44:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:56,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:44:56,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:56,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 15:44:56,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:56,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 15:44:56,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:56,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-21 15:44:56,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:56,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:56,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:56,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 15:44:56,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:56,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 15:44:56,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:56,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:44:56,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:56,573 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2022-07-21 15:44:56,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:56,573 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1323184939] [2022-07-21 15:44:56,574 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1323184939] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:56,574 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:56,574 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 15:44:56,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213959607] [2022-07-21 15:44:56,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:56,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 15:44:56,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:56,576 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 15:44:56,576 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 15:44:56,577 INFO L87 Difference]: Start difference. First operand 951 states and 1228 transitions. Second operand has 8 states, 8 states have (on average 7.75) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (26), 6 states have call predecessors, (26), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-21 15:44:59,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:44:59,072 INFO L93 Difference]: Finished difference Result 1064 states and 1347 transitions. [2022-07-21 15:44:59,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-21 15:44:59,072 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (26), 6 states have call predecessors, (26), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 183 [2022-07-21 15:44:59,073 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:44:59,077 INFO L225 Difference]: With dead ends: 1064 [2022-07-21 15:44:59,077 INFO L226 Difference]: Without dead ends: 1062 [2022-07-21 15:44:59,078 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=102, Invalid=204, Unknown=0, NotChecked=0, Total=306 [2022-07-21 15:44:59,078 INFO L413 NwaCegarLoop]: 1201 mSDtfsCounter, 1886 mSDsluCounter, 2633 mSDsCounter, 0 mSdLazyCounter, 2102 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2038 SdHoareTripleChecker+Valid, 3834 SdHoareTripleChecker+Invalid, 3118 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1016 IncrementalHoareTripleChecker+Valid, 2102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.3s IncrementalHoareTripleChecker+Time [2022-07-21 15:44:59,079 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2038 Valid, 3834 Invalid, 3118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 2102 Invalid, 0 Unknown, 0 Unchecked, 2.3s Time] [2022-07-21 15:44:59,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1062 states. [2022-07-21 15:44:59,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1062 to 1045. [2022-07-21 15:44:59,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1045 states, 690 states have (on average 1.2028985507246377) internal successors, (830), 715 states have internal predecessors, (830), 247 states have call successors, (247), 94 states have call predecessors, (247), 94 states have return successors, (248), 243 states have call predecessors, (248), 245 states have call successors, (248) [2022-07-21 15:44:59,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1045 states to 1045 states and 1325 transitions. [2022-07-21 15:44:59,143 INFO L78 Accepts]: Start accepts. Automaton has 1045 states and 1325 transitions. Word has length 183 [2022-07-21 15:44:59,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:44:59,143 INFO L495 AbstractCegarLoop]: Abstraction has 1045 states and 1325 transitions. [2022-07-21 15:44:59,144 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.75) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (26), 6 states have call predecessors, (26), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-21 15:44:59,144 INFO L276 IsEmpty]: Start isEmpty. Operand 1045 states and 1325 transitions. [2022-07-21 15:44:59,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-07-21 15:44:59,146 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:44:59,146 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:44:59,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-21 15:44:59,146 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:44:59,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:44:59,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1175064005, now seen corresponding path program 1 times [2022-07-21 15:44:59,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:44:59,147 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873459761] [2022-07-21 15:44:59,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:44:59,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:44:59,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:59,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:44:59,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:59,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:44:59,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:59,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:44:59,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:59,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:44:59,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:59,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:44:59,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:59,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:44:59,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:59,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:44:59,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:59,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:44:59,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:59,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:44:59,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:59,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:44:59,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:59,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:44:59,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:59,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 15:44:59,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:59,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 15:44:59,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:59,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 15:44:59,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:59,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 15:44:59,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:59,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 15:44:59,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:59,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 15:44:59,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:59,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 15:44:59,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:59,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 15:44:59,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:59,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 15:44:59,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:59,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-21 15:44:59,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:59,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 15:44:59,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:59,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 15:44:59,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:44:59,395 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:44:59,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:44:59,395 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873459761] [2022-07-21 15:44:59,395 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873459761] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:44:59,396 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:44:59,396 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:44:59,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859288394] [2022-07-21 15:44:59,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:44:59,396 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:44:59,397 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:44:59,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:44:59,397 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:44:59,397 INFO L87 Difference]: Start difference. First operand 1045 states and 1325 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-21 15:45:01,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:45:01,145 INFO L93 Difference]: Finished difference Result 1045 states and 1325 transitions. [2022-07-21 15:45:01,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:45:01,146 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 151 [2022-07-21 15:45:01,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:45:01,149 INFO L225 Difference]: With dead ends: 1045 [2022-07-21 15:45:01,149 INFO L226 Difference]: Without dead ends: 1043 [2022-07-21 15:45:01,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:45:01,150 INFO L413 NwaCegarLoop]: 1169 mSDtfsCounter, 1530 mSDsluCounter, 1509 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1693 SdHoareTripleChecker+Valid, 2678 SdHoareTripleChecker+Invalid, 1676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1016 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-21 15:45:01,151 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1693 Valid, 2678 Invalid, 1676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-21 15:45:01,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1043 states. [2022-07-21 15:45:01,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1043 to 1043. [2022-07-21 15:45:01,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1043 states, 689 states have (on average 1.2017416545718433) internal successors, (828), 713 states have internal predecessors, (828), 247 states have call successors, (247), 94 states have call predecessors, (247), 94 states have return successors, (248), 243 states have call predecessors, (248), 245 states have call successors, (248) [2022-07-21 15:45:01,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1043 states to 1043 states and 1323 transitions. [2022-07-21 15:45:01,216 INFO L78 Accepts]: Start accepts. Automaton has 1043 states and 1323 transitions. Word has length 151 [2022-07-21 15:45:01,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:45:01,217 INFO L495 AbstractCegarLoop]: Abstraction has 1043 states and 1323 transitions. [2022-07-21 15:45:01,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-21 15:45:01,217 INFO L276 IsEmpty]: Start isEmpty. Operand 1043 states and 1323 transitions. [2022-07-21 15:45:01,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2022-07-21 15:45:01,219 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:45:01,220 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:45:01,220 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-21 15:45:01,220 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:45:01,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:45:01,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1315502652, now seen corresponding path program 1 times [2022-07-21 15:45:01,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:45:01,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265674222] [2022-07-21 15:45:01,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:45:01,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:45:01,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:01,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:45:01,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:01,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:45:01,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:01,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:45:01,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:01,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:45:01,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:01,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 15:45:01,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:01,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:01,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:01,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:01,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:01,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:01,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:01,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 15:45:01,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:01,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:01,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:01,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:01,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:01,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:01,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:45:01,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:01,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:01,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:01,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:01,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:01,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:01,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:01,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:45:01,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:01,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:01,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:01,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:01,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:01,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:01,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:01,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:45:01,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:01,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:01,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:01,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:01,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:01,466 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:01,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:01,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:45:01,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:01,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 15:45:01,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:01,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-21 15:45:01,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:01,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:01,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:01,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:01,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:01,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:01,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:01,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 15:45:01,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:01,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:45:01,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:01,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:01,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:01,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 15:45:01,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:01,515 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2022-07-21 15:45:01,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:45:01,515 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265674222] [2022-07-21 15:45:01,515 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265674222] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:45:01,515 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:45:01,515 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:45:01,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421385159] [2022-07-21 15:45:01,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:45:01,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:45:01,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:45:01,518 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:45:01,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:45:01,518 INFO L87 Difference]: Start difference. First operand 1043 states and 1323 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (22), 4 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-21 15:45:03,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:45:03,383 INFO L93 Difference]: Finished difference Result 1961 states and 2469 transitions. [2022-07-21 15:45:03,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-07-21 15:45:03,384 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (22), 4 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 199 [2022-07-21 15:45:03,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:45:03,388 INFO L225 Difference]: With dead ends: 1961 [2022-07-21 15:45:03,388 INFO L226 Difference]: Without dead ends: 1050 [2022-07-21 15:45:03,390 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-07-21 15:45:03,390 INFO L413 NwaCegarLoop]: 976 mSDtfsCounter, 1842 mSDsluCounter, 1294 mSDsCounter, 0 mSdLazyCounter, 862 mSolverCounterSat, 954 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2027 SdHoareTripleChecker+Valid, 2270 SdHoareTripleChecker+Invalid, 1816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 954 IncrementalHoareTripleChecker+Valid, 862 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-21 15:45:03,391 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2027 Valid, 2270 Invalid, 1816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [954 Valid, 862 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-21 15:45:03,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1050 states. [2022-07-21 15:45:03,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1050 to 1039. [2022-07-21 15:45:03,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1039 states, 686 states have (on average 1.1997084548104957) internal successors, (823), 709 states have internal predecessors, (823), 247 states have call successors, (247), 94 states have call predecessors, (247), 94 states have return successors, (248), 243 states have call predecessors, (248), 245 states have call successors, (248) [2022-07-21 15:45:03,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1039 states to 1039 states and 1318 transitions. [2022-07-21 15:45:03,458 INFO L78 Accepts]: Start accepts. Automaton has 1039 states and 1318 transitions. Word has length 199 [2022-07-21 15:45:03,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:45:03,459 INFO L495 AbstractCegarLoop]: Abstraction has 1039 states and 1318 transitions. [2022-07-21 15:45:03,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 3 states have internal predecessors, (70), 2 states have call successors, (22), 4 states have call predecessors, (22), 2 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-21 15:45:03,459 INFO L276 IsEmpty]: Start isEmpty. Operand 1039 states and 1318 transitions. [2022-07-21 15:45:03,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2022-07-21 15:45:03,461 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:45:03,461 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:45:03,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-21 15:45:03,462 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:45:03,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:45:03,462 INFO L85 PathProgramCache]: Analyzing trace with hash -1700966798, now seen corresponding path program 1 times [2022-07-21 15:45:03,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:45:03,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1379281308] [2022-07-21 15:45:03,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:45:03,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:45:03,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:45:03,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:45:03,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:45:03,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:45:03,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:45:03,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:45:03,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:45:03,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:03,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:45:03,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:45:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:45:03,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 15:45:03,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 15:45:03,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 15:45:03,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 15:45:03,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 15:45:03,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 15:45:03,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 15:45:03,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 15:45:03,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 15:45:03,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-21 15:45:03,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 15:45:03,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 15:45:03,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-21 15:45:03,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:03,691 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:45:03,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:45:03,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1379281308] [2022-07-21 15:45:03,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1379281308] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:45:03,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:45:03,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:45:03,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87691837] [2022-07-21 15:45:03,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:45:03,693 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:45:03,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:45:03,693 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:45:03,694 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:45:03,694 INFO L87 Difference]: Start difference. First operand 1039 states and 1318 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-21 15:45:05,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:45:05,377 INFO L93 Difference]: Finished difference Result 1039 states and 1318 transitions. [2022-07-21 15:45:05,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:45:05,378 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 157 [2022-07-21 15:45:05,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:45:05,382 INFO L225 Difference]: With dead ends: 1039 [2022-07-21 15:45:05,383 INFO L226 Difference]: Without dead ends: 1037 [2022-07-21 15:45:05,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:45:05,384 INFO L413 NwaCegarLoop]: 1162 mSDtfsCounter, 1519 mSDsluCounter, 1495 mSDsCounter, 0 mSdLazyCounter, 1013 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1681 SdHoareTripleChecker+Valid, 2657 SdHoareTripleChecker+Invalid, 1673 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1013 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-21 15:45:05,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1681 Valid, 2657 Invalid, 1673 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1013 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-21 15:45:05,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1037 states. [2022-07-21 15:45:05,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1037 to 1037. [2022-07-21 15:45:05,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 685 states have (on average 1.1985401459854015) internal successors, (821), 707 states have internal predecessors, (821), 247 states have call successors, (247), 94 states have call predecessors, (247), 94 states have return successors, (248), 243 states have call predecessors, (248), 245 states have call successors, (248) [2022-07-21 15:45:05,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1316 transitions. [2022-07-21 15:45:05,479 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1316 transitions. Word has length 157 [2022-07-21 15:45:05,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:45:05,480 INFO L495 AbstractCegarLoop]: Abstraction has 1037 states and 1316 transitions. [2022-07-21 15:45:05,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-21 15:45:05,480 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1316 transitions. [2022-07-21 15:45:05,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 206 [2022-07-21 15:45:05,483 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:45:05,483 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] [2022-07-21 15:45:05,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-21 15:45:05,483 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:45:05,484 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:45:05,484 INFO L85 PathProgramCache]: Analyzing trace with hash 1186351891, now seen corresponding path program 1 times [2022-07-21 15:45:05,484 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:45:05,484 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000501148] [2022-07-21 15:45:05,484 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:45:05,484 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:45:05,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:05,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:45:05,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:05,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:45:05,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:05,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:45:05,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:05,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:45:05,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:05,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 15:45:05,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:05,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:05,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:05,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:05,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:05,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:05,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:05,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 15:45:05,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:05,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:05,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:05,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:05,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:05,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:05,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:05,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:45:05,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:05,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:05,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:05,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:05,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:05,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:05,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:05,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:45:05,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:05,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:05,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:05,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:05,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:05,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:05,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:05,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:45:05,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:05,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:05,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:05,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:05,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:05,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:05,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:05,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:45:05,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:05,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 15:45:05,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:05,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-21 15:45:05,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:05,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:05,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:05,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:05,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:05,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:05,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:05,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 15:45:05,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:05,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:45:05,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:05,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:05,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:05,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 15:45:05,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:05,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-21 15:45:05,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:05,778 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 384 trivial. 0 not checked. [2022-07-21 15:45:05,779 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:45:05,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000501148] [2022-07-21 15:45:05,779 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000501148] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:45:05,779 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442666596] [2022-07-21 15:45:05,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:45:05,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:45:05,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:45:05,787 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 15:45:05,817 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-21 15:45:06,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:06,482 INFO L263 TraceCheckSpWp]: Trace formula consists of 2061 conjuncts, 2 conjunts are in the unsatisfiable core [2022-07-21 15:45:06,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 15:45:06,589 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2022-07-21 15:45:06,590 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 15:45:06,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442666596] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:45:06,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 15:45:06,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [9] total 10 [2022-07-21 15:45:06,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [705201792] [2022-07-21 15:45:06,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:45:06,591 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-07-21 15:45:06,591 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:45:06,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-07-21 15:45:06,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:45:06,592 INFO L87 Difference]: Start difference. First operand 1037 states and 1316 transitions. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-21 15:45:06,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:45:06,685 INFO L93 Difference]: Finished difference Result 1991 states and 2504 transitions. [2022-07-21 15:45:06,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-07-21 15:45:06,686 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 205 [2022-07-21 15:45:06,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:45:06,692 INFO L225 Difference]: With dead ends: 1991 [2022-07-21 15:45:06,692 INFO L226 Difference]: Without dead ends: 1089 [2022-07-21 15:45:06,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 279 GetRequests, 271 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:45:06,696 INFO L413 NwaCegarLoop]: 1271 mSDtfsCounter, 1146 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1146 SdHoareTripleChecker+Valid, 1338 SdHoareTripleChecker+Invalid, 3 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:45:06,696 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1146 Valid, 1338 Invalid, 3 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-21 15:45:06,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2022-07-21 15:45:06,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1086. [2022-07-21 15:45:06,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1086 states, 714 states have (on average 1.19187675070028) internal successors, (851), 739 states have internal predecessors, (851), 262 states have call successors, (262), 100 states have call predecessors, (262), 100 states have return successors, (263), 256 states have call predecessors, (263), 260 states have call successors, (263) [2022-07-21 15:45:06,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1086 states to 1086 states and 1376 transitions. [2022-07-21 15:45:06,836 INFO L78 Accepts]: Start accepts. Automaton has 1086 states and 1376 transitions. Word has length 205 [2022-07-21 15:45:06,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:45:06,837 INFO L495 AbstractCegarLoop]: Abstraction has 1086 states and 1376 transitions. [2022-07-21 15:45:06,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 2 states have call successors, (23), 2 states have call predecessors, (23), 2 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-21 15:45:06,837 INFO L276 IsEmpty]: Start isEmpty. Operand 1086 states and 1376 transitions. [2022-07-21 15:45:06,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-07-21 15:45:06,839 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:45:06,840 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:45:06,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-21 15:45:07,055 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,SelfDestructingSolverStorable22 [2022-07-21 15:45:07,056 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:45:07,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:45:07,056 INFO L85 PathProgramCache]: Analyzing trace with hash -70680510, now seen corresponding path program 1 times [2022-07-21 15:45:07,056 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:45:07,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315012213] [2022-07-21 15:45:07,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:45:07,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:45:07,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:07,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:45:07,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:07,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:45:07,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:07,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:45:07,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:07,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:45:07,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:07,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:45:07,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:07,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:45:07,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:07,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:45:07,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:07,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:07,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:07,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:45:07,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:07,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:45:07,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:07,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:45:07,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:07,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 15:45:07,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:07,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 15:45:07,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:07,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 15:45:07,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:07,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 15:45:07,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:07,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 15:45:07,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:07,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 15:45:07,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:07,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 15:45:07,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:07,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 15:45:07,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:07,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 15:45:07,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:07,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-21 15:45:07,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:07,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 15:45:07,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:07,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 15:45:07,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:07,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-21 15:45:07,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:07,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-21 15:45:07,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:07,299 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:45:07,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:45:07,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315012213] [2022-07-21 15:45:07,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315012213] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:45:07,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:45:07,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:45:07,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011735895] [2022-07-21 15:45:07,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:45:07,302 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:45:07,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:45:07,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:45:07,303 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:45:07,303 INFO L87 Difference]: Start difference. First operand 1086 states and 1376 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-21 15:45:09,348 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:45:09,348 INFO L93 Difference]: Finished difference Result 1086 states and 1376 transitions. [2022-07-21 15:45:09,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:45:09,349 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 163 [2022-07-21 15:45:09,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:45:09,354 INFO L225 Difference]: With dead ends: 1086 [2022-07-21 15:45:09,354 INFO L226 Difference]: Without dead ends: 1084 [2022-07-21 15:45:09,355 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:45:09,355 INFO L413 NwaCegarLoop]: 1155 mSDtfsCounter, 1508 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 1010 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1669 SdHoareTripleChecker+Valid, 2636 SdHoareTripleChecker+Invalid, 1670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1010 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.9s IncrementalHoareTripleChecker+Time [2022-07-21 15:45:09,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1669 Valid, 2636 Invalid, 1670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1010 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2022-07-21 15:45:09,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1084 states. [2022-07-21 15:45:09,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1084 to 1084. [2022-07-21 15:45:09,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1084 states, 713 states have (on average 1.1907433380084151) internal successors, (849), 737 states have internal predecessors, (849), 262 states have call successors, (262), 100 states have call predecessors, (262), 100 states have return successors, (263), 256 states have call predecessors, (263), 260 states have call successors, (263) [2022-07-21 15:45:09,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1084 states to 1084 states and 1374 transitions. [2022-07-21 15:45:09,461 INFO L78 Accepts]: Start accepts. Automaton has 1084 states and 1374 transitions. Word has length 163 [2022-07-21 15:45:09,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:45:09,462 INFO L495 AbstractCegarLoop]: Abstraction has 1084 states and 1374 transitions. [2022-07-21 15:45:09,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-21 15:45:09,462 INFO L276 IsEmpty]: Start isEmpty. Operand 1084 states and 1374 transitions. [2022-07-21 15:45:09,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-07-21 15:45:09,465 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:45:09,465 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 7, 7, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:45:09,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-21 15:45:09,465 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:45:09,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:45:09,466 INFO L85 PathProgramCache]: Analyzing trace with hash -1595030586, now seen corresponding path program 1 times [2022-07-21 15:45:09,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:45:09,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658155229] [2022-07-21 15:45:09,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:45:09,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:45:09,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:45:09,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:45:09,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:45:09,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:45:09,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:45:09,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:45:09,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:45:09,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:09,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:45:09,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:45:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:45:09,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:45:09,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:09,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:09,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:09,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 15:45:09,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:09,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:09,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:09,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-21 15:45:09,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:09,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:09,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:09,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 15:45:09,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 15:45:09,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-21 15:45:09,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:09,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 15:45:09,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 15:45:09,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:45:09,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-21 15:45:09,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:09,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-21 15:45:09,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:09,787 INFO L134 CoverageAnalysis]: Checked inductivity of 371 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2022-07-21 15:45:09,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:45:09,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658155229] [2022-07-21 15:45:09,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658155229] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:45:09,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:45:09,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 15:45:09,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409883349] [2022-07-21 15:45:09,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:45:09,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 15:45:09,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:45:09,789 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 15:45:09,789 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-21 15:45:09,790 INFO L87 Difference]: Start difference. First operand 1084 states and 1374 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (29), 7 states have call predecessors, (29), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-21 15:45:13,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:45:13,839 INFO L93 Difference]: Finished difference Result 1774 states and 2223 transitions. [2022-07-21 15:45:13,839 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-21 15:45:13,839 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (29), 7 states have call predecessors, (29), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 201 [2022-07-21 15:45:13,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:45:13,845 INFO L225 Difference]: With dead ends: 1774 [2022-07-21 15:45:13,845 INFO L226 Difference]: Without dead ends: 1772 [2022-07-21 15:45:13,846 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=147, Invalid=315, Unknown=0, NotChecked=0, Total=462 [2022-07-21 15:45:13,846 INFO L413 NwaCegarLoop]: 1538 mSDtfsCounter, 2907 mSDsluCounter, 4542 mSDsCounter, 0 mSdLazyCounter, 3285 mSolverCounterSat, 1637 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3066 SdHoareTripleChecker+Valid, 6080 SdHoareTripleChecker+Invalid, 4922 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1637 IncrementalHoareTripleChecker+Valid, 3285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-21 15:45:13,846 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3066 Valid, 6080 Invalid, 4922 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1637 Valid, 3285 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-07-21 15:45:13,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1772 states. [2022-07-21 15:45:13,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1772 to 1718. [2022-07-21 15:45:13,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1718 states, 1148 states have (on average 1.1942508710801394) internal successors, (1371), 1186 states have internal predecessors, (1371), 391 states have call successors, (391), 170 states have call predecessors, (391), 170 states have return successors, (397), 373 states have call predecessors, (397), 389 states have call successors, (397) [2022-07-21 15:45:13,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1718 states to 1718 states and 2159 transitions. [2022-07-21 15:45:13,966 INFO L78 Accepts]: Start accepts. Automaton has 1718 states and 2159 transitions. Word has length 201 [2022-07-21 15:45:13,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:45:13,966 INFO L495 AbstractCegarLoop]: Abstraction has 1718 states and 2159 transitions. [2022-07-21 15:45:13,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (29), 7 states have call predecessors, (29), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-21 15:45:13,967 INFO L276 IsEmpty]: Start isEmpty. Operand 1718 states and 2159 transitions. [2022-07-21 15:45:13,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2022-07-21 15:45:13,974 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:45:13,974 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 7, 7, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:45:13,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-21 15:45:13,975 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:45:13,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:45:13,975 INFO L85 PathProgramCache]: Analyzing trace with hash -1886422503, now seen corresponding path program 1 times [2022-07-21 15:45:13,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:45:13,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825639872] [2022-07-21 15:45:13,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:45:13,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:45:14,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:14,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:45:14,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:14,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:45:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:14,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:45:14,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:14,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:45:14,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:14,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:45:14,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:14,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:45:14,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:14,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:45:14,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:14,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:14,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:14,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:45:14,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:14,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:45:14,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:14,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:45:14,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:14,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:45:14,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:14,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:14,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:14,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:14,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:14,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:14,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:14,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 15:45:14,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:14,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:14,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:14,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:14,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:14,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:14,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:14,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-21 15:45:14,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:14,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:14,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:14,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:14,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:14,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:14,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:14,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 15:45:14,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:14,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 15:45:14,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:14,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-21 15:45:14,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:14,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:14,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:14,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 15:45:14,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:14,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 15:45:14,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:14,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:45:14,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:14,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-21 15:45:14,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:14,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:14,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:14,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-21 15:45:14,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:14,357 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2022-07-21 15:45:14,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:45:14,358 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825639872] [2022-07-21 15:45:14,358 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825639872] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:45:14,358 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:45:14,358 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-21 15:45:14,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555220928] [2022-07-21 15:45:14,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:45:14,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 15:45:14,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:45:14,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 15:45:14,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-07-21 15:45:14,360 INFO L87 Difference]: Start difference. First operand 1718 states and 2159 transitions. Second operand has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (29), 7 states have call predecessors, (29), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-21 15:45:17,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:45:17,912 INFO L93 Difference]: Finished difference Result 1745 states and 2188 transitions. [2022-07-21 15:45:17,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 15:45:17,913 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (29), 7 states have call predecessors, (29), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 201 [2022-07-21 15:45:17,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:45:17,938 INFO L225 Difference]: With dead ends: 1745 [2022-07-21 15:45:17,938 INFO L226 Difference]: Without dead ends: 1743 [2022-07-21 15:45:17,939 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 67 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=261, Unknown=0, NotChecked=0, Total=380 [2022-07-21 15:45:17,940 INFO L413 NwaCegarLoop]: 1193 mSDtfsCounter, 1454 mSDsluCounter, 3510 mSDsCounter, 0 mSdLazyCounter, 2785 mSolverCounterSat, 1218 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1466 SdHoareTripleChecker+Valid, 4703 SdHoareTripleChecker+Invalid, 4003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1218 IncrementalHoareTripleChecker+Valid, 2785 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-21 15:45:17,940 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1466 Valid, 4703 Invalid, 4003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1218 Valid, 2785 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-07-21 15:45:17,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1743 states. [2022-07-21 15:45:18,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1743 to 1709. [2022-07-21 15:45:18,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1709 states, 1143 states have (on average 1.1933508311461067) internal successors, (1364), 1180 states have internal predecessors, (1364), 387 states have call successors, (387), 169 states have call predecessors, (387), 170 states have return successors, (393), 371 states have call predecessors, (393), 385 states have call successors, (393) [2022-07-21 15:45:18,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1709 states to 1709 states and 2144 transitions. [2022-07-21 15:45:18,055 INFO L78 Accepts]: Start accepts. Automaton has 1709 states and 2144 transitions. Word has length 201 [2022-07-21 15:45:18,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:45:18,056 INFO L495 AbstractCegarLoop]: Abstraction has 1709 states and 2144 transitions. [2022-07-21 15:45:18,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 8.222222222222221) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (29), 7 states have call predecessors, (29), 2 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-21 15:45:18,056 INFO L276 IsEmpty]: Start isEmpty. Operand 1709 states and 2144 transitions. [2022-07-21 15:45:18,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-07-21 15:45:18,058 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:45:18,058 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:45:18,058 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-21 15:45:18,059 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:45:18,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:45:18,059 INFO L85 PathProgramCache]: Analyzing trace with hash 1886226660, now seen corresponding path program 1 times [2022-07-21 15:45:18,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:45:18,059 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765953719] [2022-07-21 15:45:18,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:45:18,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:45:18,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:18,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:45:18,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:18,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:45:18,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:18,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:45:18,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:18,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:45:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:18,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:45:18,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:18,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:45:18,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:18,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:45:18,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:18,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:18,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:18,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:45:18,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:18,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:45:18,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:18,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:45:18,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:18,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 15:45:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:18,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 15:45:18,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:18,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 15:45:18,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:18,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 15:45:18,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:18,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 15:45:18,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:18,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 15:45:18,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:18,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 15:45:18,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:18,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 15:45:18,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:18,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 15:45:18,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:18,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-21 15:45:18,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:18,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 15:45:18,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:18,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 15:45:18,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:18,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-21 15:45:18,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:18,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-21 15:45:18,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:18,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-21 15:45:18,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:18,264 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:45:18,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:45:18,265 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765953719] [2022-07-21 15:45:18,265 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [765953719] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:45:18,265 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:45:18,265 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:45:18,265 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351645009] [2022-07-21 15:45:18,266 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:45:18,266 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:45:18,266 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:45:18,266 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:45:18,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:45:18,267 INFO L87 Difference]: Start difference. First operand 1709 states and 2144 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-21 15:45:20,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:45:20,141 INFO L93 Difference]: Finished difference Result 1709 states and 2144 transitions. [2022-07-21 15:45:20,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:45:20,141 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 169 [2022-07-21 15:45:20,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:45:20,161 INFO L225 Difference]: With dead ends: 1709 [2022-07-21 15:45:20,161 INFO L226 Difference]: Without dead ends: 1707 [2022-07-21 15:45:20,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:45:20,163 INFO L413 NwaCegarLoop]: 1153 mSDtfsCounter, 1502 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 1008 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1662 SdHoareTripleChecker+Valid, 2634 SdHoareTripleChecker+Invalid, 1668 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1008 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-21 15:45:20,164 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1662 Valid, 2634 Invalid, 1668 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1008 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2022-07-21 15:45:20,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1707 states. [2022-07-21 15:45:20,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1707 to 1707. [2022-07-21 15:45:20,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1707 states, 1142 states have (on average 1.191768826619965) internal successors, (1361), 1178 states have internal predecessors, (1361), 387 states have call successors, (387), 169 states have call predecessors, (387), 170 states have return successors, (393), 371 states have call predecessors, (393), 385 states have call successors, (393) [2022-07-21 15:45:20,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1707 states to 1707 states and 2141 transitions. [2022-07-21 15:45:20,300 INFO L78 Accepts]: Start accepts. Automaton has 1707 states and 2141 transitions. Word has length 169 [2022-07-21 15:45:20,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:45:20,300 INFO L495 AbstractCegarLoop]: Abstraction has 1707 states and 2141 transitions. [2022-07-21 15:45:20,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-21 15:45:20,301 INFO L276 IsEmpty]: Start isEmpty. Operand 1707 states and 2141 transitions. [2022-07-21 15:45:20,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-07-21 15:45:20,303 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:45:20,303 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:45:20,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-21 15:45:20,304 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:45:20,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:45:20,304 INFO L85 PathProgramCache]: Analyzing trace with hash 1463589286, now seen corresponding path program 1 times [2022-07-21 15:45:20,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:45:20,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1182128791] [2022-07-21 15:45:20,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:45:20,305 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:45:20,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:20,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:45:20,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:20,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:45:20,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:20,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:45:20,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:20,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:45:20,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:20,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:45:20,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:20,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:45:20,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:20,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:45:20,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:20,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:20,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:20,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:45:20,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:20,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:45:20,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:20,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:45:20,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:20,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 15:45:20,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:20,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 15:45:20,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:20,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 15:45:20,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:20,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 15:45:20,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:20,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 15:45:20,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:20,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 15:45:20,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:20,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 15:45:20,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:20,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 15:45:20,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:20,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 15:45:20,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:20,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-21 15:45:20,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:20,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 15:45:20,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:20,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 15:45:20,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:20,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-21 15:45:20,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:20,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-21 15:45:20,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:20,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-21 15:45:20,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:20,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-21 15:45:20,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:20,520 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:45:20,520 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:45:20,520 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1182128791] [2022-07-21 15:45:20,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1182128791] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:45:20,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:45:20,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:45:20,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706510196] [2022-07-21 15:45:20,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:45:20,521 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:45:20,521 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:45:20,522 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:45:20,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:45:20,523 INFO L87 Difference]: Start difference. First operand 1707 states and 2141 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-21 15:45:22,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:45:22,151 INFO L93 Difference]: Finished difference Result 1707 states and 2141 transitions. [2022-07-21 15:45:22,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:45:22,151 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) Word has length 175 [2022-07-21 15:45:22,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:45:22,156 INFO L225 Difference]: With dead ends: 1707 [2022-07-21 15:45:22,156 INFO L226 Difference]: Without dead ends: 1705 [2022-07-21 15:45:22,157 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:45:22,157 INFO L413 NwaCegarLoop]: 1151 mSDtfsCounter, 1496 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1655 SdHoareTripleChecker+Valid, 2632 SdHoareTripleChecker+Invalid, 1666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2022-07-21 15:45:22,158 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1655 Valid, 2632 Invalid, 1666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1006 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2022-07-21 15:45:22,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1705 states. [2022-07-21 15:45:22,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1705 to 1705. [2022-07-21 15:45:22,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1705 states, 1141 states have (on average 1.1901840490797546) internal successors, (1358), 1176 states have internal predecessors, (1358), 387 states have call successors, (387), 169 states have call predecessors, (387), 170 states have return successors, (393), 371 states have call predecessors, (393), 385 states have call successors, (393) [2022-07-21 15:45:22,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1705 states to 1705 states and 2138 transitions. [2022-07-21 15:45:22,248 INFO L78 Accepts]: Start accepts. Automaton has 1705 states and 2138 transitions. Word has length 175 [2022-07-21 15:45:22,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:45:22,249 INFO L495 AbstractCegarLoop]: Abstraction has 1705 states and 2138 transitions. [2022-07-21 15:45:22,249 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (28), 4 states have call predecessors, (28), 1 states have return successors, (27), 2 states have call predecessors, (27), 2 states have call successors, (27) [2022-07-21 15:45:22,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1705 states and 2138 transitions. [2022-07-21 15:45:22,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 222 [2022-07-21 15:45:22,252 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:45:22,252 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, 1] [2022-07-21 15:45:22,252 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-21 15:45:22,252 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:45:22,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:45:22,253 INFO L85 PathProgramCache]: Analyzing trace with hash 676945121, now seen corresponding path program 1 times [2022-07-21 15:45:22,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:45:22,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669871285] [2022-07-21 15:45:22,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:45:22,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:45:22,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:22,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:45:22,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:22,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:45:22,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:22,415 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:45:22,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:22,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:45:22,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:22,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 15:45:22,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:22,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:22,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:22,436 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:22,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:22,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:22,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:22,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 15:45:22,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:22,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:22,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:22,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:22,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:22,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:22,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:22,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:45:22,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:22,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:22,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:22,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:22,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:22,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:22,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:22,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:45:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:22,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:22,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:22,476 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:22,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:22,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:22,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:22,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:45:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:22,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:22,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:22,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:22,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:22,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:22,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:22,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:45:22,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:22,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 15:45:22,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:22,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-21 15:45:22,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:22,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:22,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:22,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:22,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:22,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:22,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:22,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 15:45:22,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:22,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:45:22,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:22,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:22,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:22,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 15:45:22,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:22,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-21 15:45:22,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:22,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-07-21 15:45:22,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:22,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-07-21 15:45:22,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:22,655 INFO L134 CoverageAnalysis]: Checked inductivity of 386 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 386 trivial. 0 not checked. [2022-07-21 15:45:22,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:45:22,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669871285] [2022-07-21 15:45:22,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669871285] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:45:22,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:45:22,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-07-21 15:45:22,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214773585] [2022-07-21 15:45:22,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:45:22,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-21 15:45:22,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:45:22,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-21 15:45:22,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-07-21 15:45:22,658 INFO L87 Difference]: Start difference. First operand 1705 states and 2138 transitions. Second operand has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (25), 5 states have call predecessors, (25), 3 states have call successors, (25) [2022-07-21 15:45:28,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:45:28,779 INFO L93 Difference]: Finished difference Result 4095 states and 5356 transitions. [2022-07-21 15:45:28,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 15:45:28,780 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (25), 5 states have call predecessors, (25), 3 states have call successors, (25) Word has length 221 [2022-07-21 15:45:28,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:45:28,788 INFO L225 Difference]: With dead ends: 4095 [2022-07-21 15:45:28,789 INFO L226 Difference]: Without dead ends: 2484 [2022-07-21 15:45:28,794 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=390, Unknown=0, NotChecked=0, Total=506 [2022-07-21 15:45:28,794 INFO L413 NwaCegarLoop]: 1715 mSDtfsCounter, 1528 mSDsluCounter, 8778 mSDsCounter, 0 mSdLazyCounter, 6060 mSolverCounterSat, 1253 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1683 SdHoareTripleChecker+Valid, 10493 SdHoareTripleChecker+Invalid, 7313 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1253 IncrementalHoareTripleChecker+Valid, 6060 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.7s IncrementalHoareTripleChecker+Time [2022-07-21 15:45:28,795 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1683 Valid, 10493 Invalid, 7313 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1253 Valid, 6060 Invalid, 0 Unknown, 0 Unchecked, 5.7s Time] [2022-07-21 15:45:28,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2484 states. [2022-07-21 15:45:28,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2484 to 1712. [2022-07-21 15:45:28,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1712 states, 1146 states have (on average 1.1893542757417104) internal successors, (1363), 1180 states have internal predecessors, (1363), 388 states have call successors, (388), 169 states have call predecessors, (388), 171 states have return successors, (398), 374 states have call predecessors, (398), 386 states have call successors, (398) [2022-07-21 15:45:28,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1712 states to 1712 states and 2149 transitions. [2022-07-21 15:45:28,935 INFO L78 Accepts]: Start accepts. Automaton has 1712 states and 2149 transitions. Word has length 221 [2022-07-21 15:45:28,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:45:28,936 INFO L495 AbstractCegarLoop]: Abstraction has 1712 states and 2149 transitions. [2022-07-21 15:45:28,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 6.833333333333333) internal successors, (82), 6 states have internal predecessors, (82), 3 states have call successors, (27), 6 states have call predecessors, (27), 3 states have return successors, (25), 5 states have call predecessors, (25), 3 states have call successors, (25) [2022-07-21 15:45:28,936 INFO L276 IsEmpty]: Start isEmpty. Operand 1712 states and 2149 transitions. [2022-07-21 15:45:28,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2022-07-21 15:45:28,939 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:45:28,939 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:45:28,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-21 15:45:28,939 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:45:28,940 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:45:28,940 INFO L85 PathProgramCache]: Analyzing trace with hash 475611983, now seen corresponding path program 1 times [2022-07-21 15:45:28,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:45:28,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452626583] [2022-07-21 15:45:28,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:45:28,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:45:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:29,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:45:29,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:29,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:45:29,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:29,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:45:29,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:29,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:45:29,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:29,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:45:29,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:29,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:45:29,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:29,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:45:29,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:29,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:29,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:29,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:45:29,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:29,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:45:29,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:29,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:45:29,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:29,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 15:45:29,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:29,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 15:45:29,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:29,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 15:45:29,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:29,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 15:45:29,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:29,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 15:45:29,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:29,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 15:45:29,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:29,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 15:45:29,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:29,126 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 15:45:29,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:29,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 15:45:29,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:29,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-21 15:45:29,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:29,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 15:45:29,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:29,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 15:45:29,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:29,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-21 15:45:29,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:29,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-21 15:45:29,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:29,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-21 15:45:29,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:29,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-21 15:45:29,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:29,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-21 15:45:29,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:29,169 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:45:29,169 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:45:29,170 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452626583] [2022-07-21 15:45:29,170 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452626583] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:45:29,170 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:45:29,170 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:45:29,170 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [368315207] [2022-07-21 15:45:29,170 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:45:29,171 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:45:29,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:45:29,171 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:45:29,171 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:45:29,172 INFO L87 Difference]: Start difference. First operand 1712 states and 2149 transitions. Second operand has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-21 15:45:31,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:45:31,149 INFO L93 Difference]: Finished difference Result 1712 states and 2149 transitions. [2022-07-21 15:45:31,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:45:31,150 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 181 [2022-07-21 15:45:31,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:45:31,154 INFO L225 Difference]: With dead ends: 1712 [2022-07-21 15:45:31,155 INFO L226 Difference]: Without dead ends: 1710 [2022-07-21 15:45:31,155 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:45:31,156 INFO L413 NwaCegarLoop]: 1149 mSDtfsCounter, 1490 mSDsluCounter, 1481 mSDsCounter, 0 mSdLazyCounter, 1004 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1648 SdHoareTripleChecker+Valid, 2630 SdHoareTripleChecker+Invalid, 1664 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 660 IncrementalHoareTripleChecker+Valid, 1004 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2022-07-21 15:45:31,156 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1648 Valid, 2630 Invalid, 1664 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1004 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2022-07-21 15:45:31,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1710 states. [2022-07-21 15:45:31,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1710 to 1710. [2022-07-21 15:45:31,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1710 states, 1145 states have (on average 1.1877729257641922) internal successors, (1360), 1178 states have internal predecessors, (1360), 388 states have call successors, (388), 169 states have call predecessors, (388), 171 states have return successors, (398), 374 states have call predecessors, (398), 386 states have call successors, (398) [2022-07-21 15:45:31,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1710 states to 1710 states and 2146 transitions. [2022-07-21 15:45:31,301 INFO L78 Accepts]: Start accepts. Automaton has 1710 states and 2146 transitions. Word has length 181 [2022-07-21 15:45:31,301 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:45:31,301 INFO L495 AbstractCegarLoop]: Abstraction has 1710 states and 2146 transitions. [2022-07-21 15:45:31,302 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 18.5) internal successors, (111), 4 states have internal predecessors, (111), 2 states have call successors, (29), 4 states have call predecessors, (29), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-21 15:45:31,302 INFO L276 IsEmpty]: Start isEmpty. Operand 1710 states and 2146 transitions. [2022-07-21 15:45:31,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2022-07-21 15:45:31,305 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:45:31,305 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:45:31,306 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-07-21 15:45:31,306 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:45:31,306 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:45:31,306 INFO L85 PathProgramCache]: Analyzing trace with hash -1135182215, now seen corresponding path program 1 times [2022-07-21 15:45:31,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:45:31,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [961483896] [2022-07-21 15:45:31,307 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:45:31,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:45:31,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:31,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:45:31,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:31,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:45:31,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:31,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:45:31,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:31,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:45:31,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:31,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 15:45:31,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:31,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:31,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:31,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:31,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:31,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:31,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:31,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 15:45:31,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:31,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:31,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:31,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:31,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:31,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:31,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:31,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:45:31,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:31,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:31,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:31,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:31,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:31,781 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:31,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:31,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:45:31,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:31,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:31,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:31,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:31,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:31,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:31,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:45:31,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:31,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:31,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:31,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:31,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:31,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:31,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:31,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:45:31,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:31,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 15:45:31,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:31,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-21 15:45:31,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:31,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:31,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:31,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:31,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:31,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:31,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:31,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 15:45:31,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:31,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:45:31,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:31,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:31,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:31,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 15:45:31,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:31,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 15:45:31,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:31,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:45:31,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:31,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 15:45:31,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:31,959 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-21 15:45:31,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:31,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-07-21 15:45:31,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:32,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2022-07-21 15:45:32,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:32,068 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 501 trivial. 0 not checked. [2022-07-21 15:45:32,069 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:45:32,069 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [961483896] [2022-07-21 15:45:32,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [961483896] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:45:32,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:45:32,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-07-21 15:45:32,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008314871] [2022-07-21 15:45:32,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:45:32,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-21 15:45:32,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:45:32,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-21 15:45:32,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=272, Unknown=0, NotChecked=0, Total=306 [2022-07-21 15:45:32,071 INFO L87 Difference]: Start difference. First operand 1710 states and 2146 transitions. Second operand has 18 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 11 states have internal predecessors, (84), 6 states have call successors, (30), 7 states have call predecessors, (30), 4 states have return successors, (28), 7 states have call predecessors, (28), 5 states have call successors, (28) [2022-07-21 15:45:43,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:45:43,434 INFO L93 Difference]: Finished difference Result 4705 states and 6320 transitions. [2022-07-21 15:45:43,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-07-21 15:45:43,435 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 11 states have internal predecessors, (84), 6 states have call successors, (30), 7 states have call predecessors, (30), 4 states have return successors, (28), 7 states have call predecessors, (28), 5 states have call successors, (28) Word has length 237 [2022-07-21 15:45:43,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:45:43,446 INFO L225 Difference]: With dead ends: 4705 [2022-07-21 15:45:43,446 INFO L226 Difference]: Without dead ends: 3183 [2022-07-21 15:45:43,453 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=273, Invalid=1449, Unknown=0, NotChecked=0, Total=1722 [2022-07-21 15:45:43,454 INFO L413 NwaCegarLoop]: 2324 mSDtfsCounter, 2068 mSDsluCounter, 20452 mSDsCounter, 0 mSdLazyCounter, 12375 mSolverCounterSat, 1506 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2399 SdHoareTripleChecker+Valid, 22776 SdHoareTripleChecker+Invalid, 13881 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1506 IncrementalHoareTripleChecker+Valid, 12375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2022-07-21 15:45:43,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2399 Valid, 22776 Invalid, 13881 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1506 Valid, 12375 Invalid, 0 Unknown, 0 Unchecked, 10.4s Time] [2022-07-21 15:45:43,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3183 states. [2022-07-21 15:45:43,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3183 to 1728. [2022-07-21 15:45:43,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1728 states, 1154 states have (on average 1.1863084922010398) internal successors, (1369), 1188 states have internal predecessors, (1369), 395 states have call successors, (395), 170 states have call predecessors, (395), 173 states have return successors, (406), 381 states have call predecessors, (406), 393 states have call successors, (406) [2022-07-21 15:45:43,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1728 states to 1728 states and 2170 transitions. [2022-07-21 15:45:43,735 INFO L78 Accepts]: Start accepts. Automaton has 1728 states and 2170 transitions. Word has length 237 [2022-07-21 15:45:43,735 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:45:43,736 INFO L495 AbstractCegarLoop]: Abstraction has 1728 states and 2170 transitions. [2022-07-21 15:45:43,736 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.9411764705882355) internal successors, (84), 11 states have internal predecessors, (84), 6 states have call successors, (30), 7 states have call predecessors, (30), 4 states have return successors, (28), 7 states have call predecessors, (28), 5 states have call successors, (28) [2022-07-21 15:45:43,736 INFO L276 IsEmpty]: Start isEmpty. Operand 1728 states and 2170 transitions. [2022-07-21 15:45:43,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2022-07-21 15:45:43,740 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:45:43,741 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:45:43,741 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-07-21 15:45:43,741 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ldv_linux_usb_urb_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:45:43,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:45:43,743 INFO L85 PathProgramCache]: Analyzing trace with hash -906292355, now seen corresponding path program 1 times [2022-07-21 15:45:43,743 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:45:43,743 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1298825985] [2022-07-21 15:45:43,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:45:43,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:45:43,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:43,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:45:43,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:43,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:45:43,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:43,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:45:43,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:43,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:45:43,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:43,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:45:43,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:43,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:45:43,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:43,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:45:43,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:43,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:43,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:43,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:45:43,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:43,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:45:43,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:43,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-07-21 15:45:43,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:43,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-07-21 15:45:43,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:43,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-07-21 15:45:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:43,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-07-21 15:45:43,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:43,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-07-21 15:45:43,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:43,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-07-21 15:45:43,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:43,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 15:45:43,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:43,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-07-21 15:45:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:43,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2022-07-21 15:45:43,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:43,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2022-07-21 15:45:43,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:43,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2022-07-21 15:45:43,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:43,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 15:45:43,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:43,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 15:45:43,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:43,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-07-21 15:45:43,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:43,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2022-07-21 15:45:43,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:43,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-07-21 15:45:43,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:43,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2022-07-21 15:45:43,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:43,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2022-07-21 15:45:43,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:43,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-21 15:45:43,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:43,969 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2022-07-21 15:45:43,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:45:43,970 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1298825985] [2022-07-21 15:45:43,970 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1298825985] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:45:43,970 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:45:43,970 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:45:43,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548031783] [2022-07-21 15:45:43,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:45:43,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:45:43,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:45:43,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:45:43,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:45:43,972 INFO L87 Difference]: Start difference. First operand 1728 states and 2170 transitions. Second operand has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-21 15:45:47,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:45:47,326 INFO L93 Difference]: Finished difference Result 3332 states and 4181 transitions. [2022-07-21 15:45:47,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 15:45:47,327 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) Word has length 187 [2022-07-21 15:45:47,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:45:47,337 INFO L225 Difference]: With dead ends: 3332 [2022-07-21 15:45:47,338 INFO L226 Difference]: Without dead ends: 3049 [2022-07-21 15:45:47,341 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-21 15:45:47,341 INFO L413 NwaCegarLoop]: 1400 mSDtfsCounter, 2009 mSDsluCounter, 2130 mSDsCounter, 0 mSdLazyCounter, 2216 mSolverCounterSat, 1143 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2161 SdHoareTripleChecker+Valid, 3530 SdHoareTripleChecker+Invalid, 3359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1143 IncrementalHoareTripleChecker+Valid, 2216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-07-21 15:45:47,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2161 Valid, 3530 Invalid, 3359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1143 Valid, 2216 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-21 15:45:47,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3049 states. [2022-07-21 15:45:47,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3049 to 3030. [2022-07-21 15:45:47,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3030 states, 2035 states have (on average 1.200982800982801) internal successors, (2444), 2090 states have internal predecessors, (2444), 689 states have call successors, (689), 294 states have call predecessors, (689), 300 states have return successors, (721), 665 states have call predecessors, (721), 687 states have call successors, (721) [2022-07-21 15:45:47,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3030 states to 3030 states and 3854 transitions. [2022-07-21 15:45:47,661 INFO L78 Accepts]: Start accepts. Automaton has 3030 states and 3854 transitions. Word has length 187 [2022-07-21 15:45:47,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:45:47,662 INFO L495 AbstractCegarLoop]: Abstraction has 3030 states and 3854 transitions. [2022-07-21 15:45:47,662 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 19.166666666666668) internal successors, (115), 4 states have internal predecessors, (115), 2 states have call successors, (30), 4 states have call predecessors, (30), 1 states have return successors, (29), 2 states have call predecessors, (29), 2 states have call successors, (29) [2022-07-21 15:45:47,662 INFO L276 IsEmpty]: Start isEmpty. Operand 3030 states and 3854 transitions. [2022-07-21 15:45:47,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-07-21 15:45:47,665 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:45:47,665 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:45:47,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-07-21 15:45:47,666 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:45:47,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:45:47,666 INFO L85 PathProgramCache]: Analyzing trace with hash 331266662, now seen corresponding path program 1 times [2022-07-21 15:45:47,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:45:47,666 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606303739] [2022-07-21 15:45:47,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:45:47,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:45:47,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:47,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:45:47,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:47,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:45:47,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:47,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:45:47,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:47,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:45:47,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:48,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 15:45:48,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:48,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:48,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:48,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:48,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:48,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:48,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:48,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 15:45:48,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:48,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:48,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:48,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:48,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:48,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:48,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:48,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:45:48,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:48,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:48,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:48,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:48,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:48,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:48,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:48,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:45:48,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:48,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:48,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:48,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:48,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:48,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:48,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:48,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:45:48,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:48,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:48,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:48,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:48,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:48,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:48,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:48,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:45:48,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:48,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 15:45:48,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:48,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-21 15:45:48,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:48,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:48,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:48,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:48,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:48,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:48,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:48,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 15:45:48,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:48,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:45:48,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:48,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:48,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:48,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 15:45:48,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:48,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 15:45:48,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:48,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:45:48,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:48,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 15:45:48,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:48,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-21 15:45:48,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:48,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-07-21 15:45:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:48,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2022-07-21 15:45:48,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:48,193 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 3 proven. 36 refuted. 0 times theorem prover too weak. 462 trivial. 0 not checked. [2022-07-21 15:45:48,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:45:48,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606303739] [2022-07-21 15:45:48,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606303739] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:45:48,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018484578] [2022-07-21 15:45:48,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:45:48,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:45:48,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:45:48,200 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-21 15:45:48,235 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-21 15:45:48,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:49,009 INFO L263 TraceCheckSpWp]: Trace formula consists of 2422 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-21 15:45:49,017 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 15:45:49,085 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 105 proven. 0 refuted. 0 times theorem prover too weak. 396 trivial. 0 not checked. [2022-07-21 15:45:49,086 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 15:45:49,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018484578] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:45:49,086 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 15:45:49,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 11 [2022-07-21 15:45:49,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [602763918] [2022-07-21 15:45:49,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:45:49,087 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:45:49,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:45:49,088 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:45:49,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-21 15:45:49,088 INFO L87 Difference]: Start difference. First operand 3030 states and 3854 transitions. Second operand has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 3 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2022-07-21 15:45:49,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:45:49,885 INFO L93 Difference]: Finished difference Result 7175 states and 9438 transitions. [2022-07-21 15:45:49,886 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:45:49,886 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 3 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) Word has length 241 [2022-07-21 15:45:49,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:45:49,900 INFO L225 Difference]: With dead ends: 7175 [2022-07-21 15:45:49,900 INFO L226 Difference]: Without dead ends: 4190 [2022-07-21 15:45:49,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 327 GetRequests, 315 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2022-07-21 15:45:49,910 INFO L413 NwaCegarLoop]: 1289 mSDtfsCounter, 610 mSDsluCounter, 4882 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 234 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 610 SdHoareTripleChecker+Valid, 6171 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 234 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 15:45:49,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [610 Valid, 6171 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [234 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 15:45:49,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4190 states. [2022-07-21 15:45:50,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4190 to 2998. [2022-07-21 15:45:50,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2998 states, 2018 states have (on average 1.2011892963330029) internal successors, (2424), 2070 states have internal predecessors, (2424), 677 states have call successors, (677), 291 states have call predecessors, (677), 297 states have return successors, (709), 654 states have call predecessors, (709), 675 states have call successors, (709) [2022-07-21 15:45:50,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2998 states to 2998 states and 3810 transitions. [2022-07-21 15:45:50,300 INFO L78 Accepts]: Start accepts. Automaton has 2998 states and 3810 transitions. Word has length 241 [2022-07-21 15:45:50,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:45:50,301 INFO L495 AbstractCegarLoop]: Abstraction has 2998 states and 3810 transitions. [2022-07-21 15:45:50,301 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.0) internal successors, (96), 6 states have internal predecessors, (96), 3 states have call successors, (30), 2 states have call predecessors, (30), 3 states have return successors, (28), 3 states have call predecessors, (28), 3 states have call successors, (28) [2022-07-21 15:45:50,301 INFO L276 IsEmpty]: Start isEmpty. Operand 2998 states and 3810 transitions. [2022-07-21 15:45:50,303 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-07-21 15:45:50,303 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:45:50,303 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:45:50,339 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-21 15:45:50,519 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,SelfDestructingSolverStorable32 [2022-07-21 15:45:50,520 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:45:50,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:45:50,520 INFO L85 PathProgramCache]: Analyzing trace with hash 1222341284, now seen corresponding path program 1 times [2022-07-21 15:45:50,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:45:50,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139531919] [2022-07-21 15:45:50,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:45:50,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:45:50,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:50,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:45:50,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:50,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:45:50,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:50,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:45:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:50,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:45:50,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:50,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 15:45:50,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:50,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:50,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:50,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:50,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:50,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:50,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:50,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 15:45:50,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:50,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:50,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:50,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:50,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:50,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:50,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:50,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:45:50,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:50,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:50,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:50,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:50,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:51,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:51,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:51,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:45:51,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:51,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:51,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:51,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:51,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:51,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:51,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:51,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:45:51,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:51,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:51,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:51,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:51,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:51,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:51,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:51,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:45:51,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:51,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 15:45:51,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:51,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-21 15:45:51,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:51,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:51,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:51,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:51,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:51,079 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:51,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:51,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 15:45:51,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:51,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:45:51,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:51,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:51,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:51,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 15:45:51,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:51,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 15:45:51,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:51,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:45:51,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:51,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 15:45:51,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:51,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-21 15:45:51,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:51,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-07-21 15:45:51,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:51,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2022-07-21 15:45:51,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:51,127 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 6 proven. 61 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2022-07-21 15:45:51,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:45:51,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139531919] [2022-07-21 15:45:51,128 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139531919] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:45:51,128 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2103749998] [2022-07-21 15:45:51,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:45:51,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:45:51,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:45:51,130 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-21 15:45:51,131 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-21 15:45:52,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:52,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 2420 conjuncts, 44 conjunts are in the unsatisfiable core [2022-07-21 15:45:52,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 15:45:52,098 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-21 15:45:52,311 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 501 trivial. 0 not checked. [2022-07-21 15:45:52,311 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 15:45:52,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2103749998] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:45:52,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 15:45:52,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [13] total 20 [2022-07-21 15:45:52,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878841463] [2022-07-21 15:45:52,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:45:52,312 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 15:45:52,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:45:52,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 15:45:52,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=338, Unknown=0, NotChecked=0, Total=380 [2022-07-21 15:45:52,314 INFO L87 Difference]: Start difference. First operand 2998 states and 3810 transitions. Second operand has 9 states, 8 states have (on average 11.0) internal successors, (88), 7 states have internal predecessors, (88), 4 states have call successors, (30), 4 states have call predecessors, (30), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-21 15:45:58,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:45:58,628 INFO L93 Difference]: Finished difference Result 6788 states and 8878 transitions. [2022-07-21 15:45:58,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-21 15:45:58,628 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 11.0) internal successors, (88), 7 states have internal predecessors, (88), 4 states have call successors, (30), 4 states have call predecessors, (30), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 241 [2022-07-21 15:45:58,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:45:58,645 INFO L225 Difference]: With dead ends: 6788 [2022-07-21 15:45:58,645 INFO L226 Difference]: Without dead ends: 4009 [2022-07-21 15:45:58,653 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 309 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=62, Invalid=490, Unknown=0, NotChecked=0, Total=552 [2022-07-21 15:45:58,654 INFO L413 NwaCegarLoop]: 1422 mSDtfsCounter, 520 mSDsluCounter, 3369 mSDsCounter, 0 mSdLazyCounter, 5354 mSolverCounterSat, 307 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 675 SdHoareTripleChecker+Valid, 4791 SdHoareTripleChecker+Invalid, 5661 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 307 IncrementalHoareTripleChecker+Valid, 5354 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-07-21 15:45:58,654 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [675 Valid, 4791 Invalid, 5661 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [307 Valid, 5354 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-07-21 15:45:58,658 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4009 states. [2022-07-21 15:45:59,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4009 to 3080. [2022-07-21 15:45:59,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3080 states, 2062 states have (on average 1.1998060135790494) internal successors, (2474), 2120 states have internal predecessors, (2474), 707 states have call successors, (707), 293 states have call predecessors, (707), 305 states have return successors, (760), 684 states have call predecessors, (760), 705 states have call successors, (760) [2022-07-21 15:45:59,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3080 states to 3080 states and 3941 transitions. [2022-07-21 15:45:59,093 INFO L78 Accepts]: Start accepts. Automaton has 3080 states and 3941 transitions. Word has length 241 [2022-07-21 15:45:59,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:45:59,094 INFO L495 AbstractCegarLoop]: Abstraction has 3080 states and 3941 transitions. [2022-07-21 15:45:59,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 11.0) internal successors, (88), 7 states have internal predecessors, (88), 4 states have call successors, (30), 4 states have call predecessors, (30), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-07-21 15:45:59,094 INFO L276 IsEmpty]: Start isEmpty. Operand 3080 states and 3941 transitions. [2022-07-21 15:45:59,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 242 [2022-07-21 15:45:59,097 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:45:59,098 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:45:59,126 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-21 15:45:59,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:45:59,312 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:45:59,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:45:59,313 INFO L85 PathProgramCache]: Analyzing trace with hash 829314274, now seen corresponding path program 1 times [2022-07-21 15:45:59,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:45:59,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65073700] [2022-07-21 15:45:59,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:45:59,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:45:59,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:59,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:45:59,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:59,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:45:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:59,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:45:59,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:59,639 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:45:59,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:59,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 15:45:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:59,703 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:59,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:59,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:59,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:59,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:59,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:59,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 15:45:59,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:59,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:59,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:59,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:59,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:59,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:59,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:59,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-07-21 15:45:59,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:59,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:59,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:59,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:59,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:59,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:59,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-21 15:45:59,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:59,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:59,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:59,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:59,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:59,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:59,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2022-07-21 15:45:59,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:59,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:59,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:59,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:45:59,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:59,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:45:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:59,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-21 15:45:59,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:59,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2022-07-21 15:45:59,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:59,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-21 15:45:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:59,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:59,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:59,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:59,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:59,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:59,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 15:45:59,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:59,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:45:59,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:59,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:45:59,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:59,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 15:45:59,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:59,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 15:45:59,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:59,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:45:59,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:59,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 15:45:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:59,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 212 [2022-07-21 15:45:59,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:59,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-07-21 15:45:59,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:59,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 226 [2022-07-21 15:45:59,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:45:59,884 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 6 proven. 61 refuted. 0 times theorem prover too weak. 434 trivial. 0 not checked. [2022-07-21 15:45:59,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:45:59,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65073700] [2022-07-21 15:45:59,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65073700] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:45:59,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407152538] [2022-07-21 15:45:59,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:45:59,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:45:59,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:45:59,887 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 15:45:59,915 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-21 15:46:01,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:01,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 2415 conjuncts, 50 conjunts are in the unsatisfiable core [2022-07-21 15:46:01,099 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 15:46:01,360 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 289 proven. 3 refuted. 0 times theorem prover too weak. 209 trivial. 0 not checked. [2022-07-21 15:46:01,360 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 15:46:01,796 INFO L134 CoverageAnalysis]: Checked inductivity of 501 backedges. 18 proven. 45 refuted. 0 times theorem prover too weak. 438 trivial. 0 not checked. [2022-07-21 15:46:01,797 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407152538] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-21 15:46:01,797 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-07-21 15:46:01,797 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 8] total 20 [2022-07-21 15:46:01,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582997533] [2022-07-21 15:46:01,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-07-21 15:46:01,798 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-07-21 15:46:01,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:46:01,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-07-21 15:46:01,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=336, Unknown=0, NotChecked=0, Total=380 [2022-07-21 15:46:01,799 INFO L87 Difference]: Start difference. First operand 3080 states and 3941 transitions. Second operand has 20 states, 19 states have (on average 8.631578947368421) internal successors, (164), 13 states have internal predecessors, (164), 5 states have call successors, (67), 6 states have call predecessors, (67), 5 states have return successors, (59), 7 states have call predecessors, (59), 5 states have call successors, (59) [2022-07-21 15:46:10,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:46:10,164 INFO L93 Difference]: Finished difference Result 7420 states and 9836 transitions. [2022-07-21 15:46:10,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-21 15:46:10,165 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 8.631578947368421) internal successors, (164), 13 states have internal predecessors, (164), 5 states have call successors, (67), 6 states have call predecessors, (67), 5 states have return successors, (59), 7 states have call predecessors, (59), 5 states have call successors, (59) Word has length 241 [2022-07-21 15:46:10,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:46:10,179 INFO L225 Difference]: With dead ends: 7420 [2022-07-21 15:46:10,179 INFO L226 Difference]: Without dead ends: 4382 [2022-07-21 15:46:10,189 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 583 GetRequests, 550 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=154, Invalid=902, Unknown=0, NotChecked=0, Total=1056 [2022-07-21 15:46:10,190 INFO L413 NwaCegarLoop]: 1636 mSDtfsCounter, 2422 mSDsluCounter, 11144 mSDsCounter, 0 mSdLazyCounter, 7655 mSolverCounterSat, 1761 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2424 SdHoareTripleChecker+Valid, 12780 SdHoareTripleChecker+Invalid, 9416 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1761 IncrementalHoareTripleChecker+Valid, 7655 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.4s IncrementalHoareTripleChecker+Time [2022-07-21 15:46:10,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2424 Valid, 12780 Invalid, 9416 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1761 Valid, 7655 Invalid, 0 Unknown, 0 Unchecked, 7.4s Time] [2022-07-21 15:46:10,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4382 states. [2022-07-21 15:46:10,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4382 to 3082. [2022-07-21 15:46:10,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3082 states, 2063 states have (on average 1.198739699466796) internal successors, (2473), 2119 states have internal predecessors, (2473), 707 states have call successors, (707), 293 states have call predecessors, (707), 306 states have return successors, (761), 684 states have call predecessors, (761), 705 states have call successors, (761) [2022-07-21 15:46:10,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3082 states to 3082 states and 3941 transitions. [2022-07-21 15:46:10,772 INFO L78 Accepts]: Start accepts. Automaton has 3082 states and 3941 transitions. Word has length 241 [2022-07-21 15:46:10,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:46:10,773 INFO L495 AbstractCegarLoop]: Abstraction has 3082 states and 3941 transitions. [2022-07-21 15:46:10,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 8.631578947368421) internal successors, (164), 13 states have internal predecessors, (164), 5 states have call successors, (67), 6 states have call predecessors, (67), 5 states have return successors, (59), 7 states have call predecessors, (59), 5 states have call successors, (59) [2022-07-21 15:46:10,773 INFO L276 IsEmpty]: Start isEmpty. Operand 3082 states and 3941 transitions. [2022-07-21 15:46:10,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2022-07-21 15:46:10,775 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:46:10,775 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-21 15:46:10,810 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-21 15:46:10,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:46:10,992 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:46:10,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:46:10,992 INFO L85 PathProgramCache]: Analyzing trace with hash 358694688, now seen corresponding path program 1 times [2022-07-21 15:46:10,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:46:10,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666533840] [2022-07-21 15:46:10,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:46:10,992 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:46:11,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:11,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:46:11,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:11,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:46:11,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:11,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:46:11,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:11,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:46:11,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:11,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:46:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:11,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:46:11,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:11,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:46:11,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:11,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:11,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:11,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:46:11,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:11,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:46:11,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:11,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:46:11,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:11,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:46:11,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:11,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:11,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:11,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:46:11,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:11,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:46:11,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:11,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 15:46:11,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:11,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:11,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:11,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:46:11,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:11,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:46:11,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:11,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-21 15:46:11,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:11,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:11,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:11,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:46:11,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:11,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:46:11,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:11,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 15:46:11,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:11,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 15:46:11,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:11,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-21 15:46:11,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:11,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:11,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:11,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-21 15:46:11,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:11,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:11,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:11,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-21 15:46:11,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:11,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-21 15:46:11,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:11,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-21 15:46:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:11,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-21 15:46:11,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:11,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:11,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:11,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-21 15:46:11,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:11,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:11,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:11,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:46:11,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:11,304 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2022-07-21 15:46:11,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:46:11,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666533840] [2022-07-21 15:46:11,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666533840] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:46:11,305 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:46:11,305 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-21 15:46:11,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750307006] [2022-07-21 15:46:11,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:46:11,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-21 15:46:11,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:46:11,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-21 15:46:11,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:46:11,307 INFO L87 Difference]: Start difference. First operand 3082 states and 3941 transitions. Second operand has 10 states, 10 states have (on average 8.8) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (32), 8 states have call predecessors, (32), 2 states have return successors, (30), 2 states have call predecessors, (30), 1 states have call successors, (30) [2022-07-21 15:46:16,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:46:16,365 INFO L93 Difference]: Finished difference Result 3202 states and 4083 transitions. [2022-07-21 15:46:16,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-21 15:46:16,366 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (32), 8 states have call predecessors, (32), 2 states have return successors, (30), 2 states have call predecessors, (30), 1 states have call successors, (30) Word has length 233 [2022-07-21 15:46:16,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:46:16,377 INFO L225 Difference]: With dead ends: 3202 [2022-07-21 15:46:16,378 INFO L226 Difference]: Without dead ends: 3200 [2022-07-21 15:46:16,379 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 77 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 109 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=181, Invalid=419, Unknown=0, NotChecked=0, Total=600 [2022-07-21 15:46:16,380 INFO L413 NwaCegarLoop]: 1536 mSDtfsCounter, 2257 mSDsluCounter, 4802 mSDsCounter, 0 mSdLazyCounter, 4234 mSolverCounterSat, 1863 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2353 SdHoareTripleChecker+Valid, 6338 SdHoareTripleChecker+Invalid, 6097 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1863 IncrementalHoareTripleChecker+Valid, 4234 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-07-21 15:46:16,380 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2353 Valid, 6338 Invalid, 6097 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1863 Valid, 4234 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-07-21 15:46:16,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3200 states. [2022-07-21 15:46:16,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3200 to 3172. [2022-07-21 15:46:16,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3172 states, 2127 states have (on average 1.1974612129760225) internal successors, (2547), 2183 states have internal predecessors, (2547), 723 states have call successors, (723), 303 states have call predecessors, (723), 316 states have return successors, (777), 700 states have call predecessors, (777), 721 states have call successors, (777) [2022-07-21 15:46:16,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3172 states to 3172 states and 4047 transitions. [2022-07-21 15:46:16,898 INFO L78 Accepts]: Start accepts. Automaton has 3172 states and 4047 transitions. Word has length 233 [2022-07-21 15:46:16,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:46:16,898 INFO L495 AbstractCegarLoop]: Abstraction has 3172 states and 4047 transitions. [2022-07-21 15:46:16,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 8.8) internal successors, (88), 4 states have internal predecessors, (88), 2 states have call successors, (32), 8 states have call predecessors, (32), 2 states have return successors, (30), 2 states have call predecessors, (30), 1 states have call successors, (30) [2022-07-21 15:46:16,899 INFO L276 IsEmpty]: Start isEmpty. Operand 3172 states and 4047 transitions. [2022-07-21 15:46:16,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2022-07-21 15:46:16,900 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:46:16,901 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-21 15:46:16,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-07-21 15:46:16,901 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:46:16,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:46:16,901 INFO L85 PathProgramCache]: Analyzing trace with hash -146863937, now seen corresponding path program 1 times [2022-07-21 15:46:16,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:46:16,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919974645] [2022-07-21 15:46:16,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:46:16,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:46:16,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:46:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:46:17,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:46:17,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:46:17,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:46:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:46:17,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:46:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:17,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:46:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:46:17,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:46:17,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:46:17,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:17,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:46:17,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:46:17,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 15:46:17,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:46:17,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:46:17,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-21 15:46:17,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:17,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:46:17,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:46:17,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 15:46:17,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 15:46:17,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-21 15:46:17,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:17,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-21 15:46:17,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:17,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-21 15:46:17,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-21 15:46:17,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-21 15:46:17,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,134 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-21 15:46:17,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:17,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-21 15:46:17,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:17,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:46:17,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:17,170 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2022-07-21 15:46:17,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:46:17,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919974645] [2022-07-21 15:46:17,171 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1919974645] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:46:17,171 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:46:17,171 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 15:46:17,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145911679] [2022-07-21 15:46:17,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:46:17,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 15:46:17,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:46:17,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 15:46:17,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-21 15:46:17,174 INFO L87 Difference]: Start difference. First operand 3172 states and 4047 transitions. Second operand has 11 states, 11 states have (on average 8.0) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (32), 7 states have call predecessors, (32), 2 states have return successors, (30), 2 states have call predecessors, (30), 1 states have call successors, (30) [2022-07-21 15:46:23,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:46:23,121 INFO L93 Difference]: Finished difference Result 8811 states and 11996 transitions. [2022-07-21 15:46:23,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-21 15:46:23,121 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.0) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (32), 7 states have call predecessors, (32), 2 states have return successors, (30), 2 states have call predecessors, (30), 1 states have call successors, (30) Word has length 233 [2022-07-21 15:46:23,121 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:46:23,142 INFO L225 Difference]: With dead ends: 8811 [2022-07-21 15:46:23,143 INFO L226 Difference]: Without dead ends: 6324 [2022-07-21 15:46:23,150 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2022-07-21 15:46:23,150 INFO L413 NwaCegarLoop]: 1962 mSDtfsCounter, 2323 mSDsluCounter, 8306 mSDsCounter, 0 mSdLazyCounter, 5714 mSolverCounterSat, 1607 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2511 SdHoareTripleChecker+Valid, 10268 SdHoareTripleChecker+Invalid, 7321 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1607 IncrementalHoareTripleChecker+Valid, 5714 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2022-07-21 15:46:23,150 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2511 Valid, 10268 Invalid, 7321 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1607 Valid, 5714 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2022-07-21 15:46:23,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6324 states. [2022-07-21 15:46:23,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6324 to 3080. [2022-07-21 15:46:23,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3080 states, 2067 states have (on average 1.1925495887760038) internal successors, (2465), 2119 states have internal predecessors, (2465), 703 states have call successors, (703), 287 states have call predecessors, (703), 304 states have return successors, (761), 688 states have call predecessors, (761), 701 states have call successors, (761) [2022-07-21 15:46:23,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3080 states to 3080 states and 3929 transitions. [2022-07-21 15:46:23,700 INFO L78 Accepts]: Start accepts. Automaton has 3080 states and 3929 transitions. Word has length 233 [2022-07-21 15:46:23,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:46:23,701 INFO L495 AbstractCegarLoop]: Abstraction has 3080 states and 3929 transitions. [2022-07-21 15:46:23,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.0) internal successors, (88), 5 states have internal predecessors, (88), 2 states have call successors, (32), 7 states have call predecessors, (32), 2 states have return successors, (30), 2 states have call predecessors, (30), 1 states have call successors, (30) [2022-07-21 15:46:23,701 INFO L276 IsEmpty]: Start isEmpty. Operand 3080 states and 3929 transitions. [2022-07-21 15:46:23,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 250 [2022-07-21 15:46:23,704 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:46:23,704 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 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] [2022-07-21 15:46:23,704 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-07-21 15:46:23,704 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:46:23,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:46:23,705 INFO L85 PathProgramCache]: Analyzing trace with hash 967697026, now seen corresponding path program 1 times [2022-07-21 15:46:23,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:46:23,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608833968] [2022-07-21 15:46:23,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:46:23,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:46:23,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:24,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:46:24,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:24,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:46:24,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:24,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:46:24,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:24,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:46:24,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:24,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 15:46:24,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:24,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:24,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:24,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:46:24,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:24,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:46:24,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:24,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 15:46:24,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:24,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 15:46:24,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:24,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:24,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:46:24,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:24,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:46:24,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:24,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:46:24,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:24,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 15:46:24,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:24,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:24,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:24,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:46:24,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:24,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:46:24,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:24,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 15:46:24,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:24,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:24,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:24,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:46:24,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:24,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:46:24,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:24,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 15:46:24,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:24,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:24,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:24,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:46:24,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:24,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:46:24,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:24,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-21 15:46:24,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:24,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-21 15:46:24,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:24,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-21 15:46:24,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:24,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:24,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:24,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:24,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:24,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:24,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:24,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 15:46:24,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:24,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:46:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:24,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:24,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:24,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 15:46:24,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:24,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 15:46:24,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:24,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:46:24,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:24,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 15:46:24,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:24,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-07-21 15:46:24,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:24,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-21 15:46:24,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:24,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2022-07-21 15:46:24,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:24,438 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2022-07-21 15:46:24,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:46:24,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608833968] [2022-07-21 15:46:24,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608833968] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:46:24,439 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:46:24,439 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-07-21 15:46:24,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633070724] [2022-07-21 15:46:24,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:46:24,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-21 15:46:24,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:46:24,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-21 15:46:24,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=378, Unknown=0, NotChecked=0, Total=420 [2022-07-21 15:46:24,442 INFO L87 Difference]: Start difference. First operand 3080 states and 3929 transitions. Second operand has 21 states, 20 states have (on average 4.5) internal successors, (90), 12 states have internal predecessors, (90), 7 states have call successors, (32), 8 states have call predecessors, (32), 4 states have return successors, (30), 7 states have call predecessors, (30), 5 states have call successors, (30) [2022-07-21 15:46:38,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:46:38,771 INFO L93 Difference]: Finished difference Result 6787 states and 9146 transitions. [2022-07-21 15:46:38,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-21 15:46:38,772 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.5) internal successors, (90), 12 states have internal predecessors, (90), 7 states have call successors, (32), 8 states have call predecessors, (32), 4 states have return successors, (30), 7 states have call predecessors, (30), 5 states have call successors, (30) Word has length 249 [2022-07-21 15:46:38,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:46:38,788 INFO L225 Difference]: With dead ends: 6787 [2022-07-21 15:46:38,789 INFO L226 Difference]: Without dead ends: 5240 [2022-07-21 15:46:38,795 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 83 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 274 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=301, Invalid=1505, Unknown=0, NotChecked=0, Total=1806 [2022-07-21 15:46:38,796 INFO L413 NwaCegarLoop]: 1942 mSDtfsCounter, 2055 mSDsluCounter, 19875 mSDsCounter, 0 mSdLazyCounter, 14754 mSolverCounterSat, 1572 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2336 SdHoareTripleChecker+Valid, 21817 SdHoareTripleChecker+Invalid, 16326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1572 IncrementalHoareTripleChecker+Valid, 14754 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2022-07-21 15:46:38,796 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2336 Valid, 21817 Invalid, 16326 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1572 Valid, 14754 Invalid, 0 Unknown, 0 Unchecked, 12.9s Time] [2022-07-21 15:46:38,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5240 states. [2022-07-21 15:46:39,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5240 to 3111. [2022-07-21 15:46:39,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3111 states, 2083 states have (on average 1.1910705712914067) internal successors, (2481), 2136 states have internal predecessors, (2481), 715 states have call successors, (715), 289 states have call predecessors, (715), 307 states have return successors, (778), 700 states have call predecessors, (778), 713 states have call successors, (778) [2022-07-21 15:46:39,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3111 states to 3111 states and 3974 transitions. [2022-07-21 15:46:39,295 INFO L78 Accepts]: Start accepts. Automaton has 3111 states and 3974 transitions. Word has length 249 [2022-07-21 15:46:39,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:46:39,295 INFO L495 AbstractCegarLoop]: Abstraction has 3111 states and 3974 transitions. [2022-07-21 15:46:39,295 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.5) internal successors, (90), 12 states have internal predecessors, (90), 7 states have call successors, (32), 8 states have call predecessors, (32), 4 states have return successors, (30), 7 states have call predecessors, (30), 5 states have call successors, (30) [2022-07-21 15:46:39,295 INFO L276 IsEmpty]: Start isEmpty. Operand 3111 states and 3974 transitions. [2022-07-21 15:46:39,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2022-07-21 15:46:39,298 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:46:39,298 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 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] [2022-07-21 15:46:39,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-07-21 15:46:39,298 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:46:39,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:46:39,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1137035580, now seen corresponding path program 1 times [2022-07-21 15:46:39,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:46:39,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [186638617] [2022-07-21 15:46:39,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:46:39,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:46:39,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:39,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:46:39,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:39,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:46:39,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:39,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:46:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:39,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:46:39,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:39,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 15:46:39,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:39,571 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:39,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:39,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:46:39,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:39,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:46:39,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:39,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 15:46:39,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:39,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 15:46:39,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:39,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:39,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:39,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:46:39,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:39,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:46:39,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:39,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:46:39,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:39,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 15:46:39,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:39,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:39,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:39,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:46:39,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:39,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:46:39,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:39,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 15:46:39,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:39,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:39,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:39,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:46:39,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:39,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:46:39,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:39,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 15:46:39,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:39,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:39,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:39,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:46:39,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:39,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:46:39,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:39,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-21 15:46:39,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:39,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-21 15:46:39,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:39,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-21 15:46:39,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:39,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:39,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:39,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:39,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:39,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:39,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:39,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 15:46:39,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:39,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:46:39,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:39,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:39,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:39,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 15:46:39,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:39,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 15:46:39,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:39,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:46:39,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:39,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 15:46:39,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:39,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-07-21 15:46:39,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:39,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-21 15:46:39,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:39,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2022-07-21 15:46:39,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:39,973 INFO L134 CoverageAnalysis]: Checked inductivity of 504 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2022-07-21 15:46:39,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:46:39,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [186638617] [2022-07-21 15:46:39,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [186638617] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:46:39,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:46:39,974 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-07-21 15:46:39,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434891816] [2022-07-21 15:46:39,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:46:39,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-07-21 15:46:39,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:46:39,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-07-21 15:46:39,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=377, Unknown=0, NotChecked=0, Total=420 [2022-07-21 15:46:39,975 INFO L87 Difference]: Start difference. First operand 3111 states and 3974 transitions. Second operand has 21 states, 20 states have (on average 4.55) internal successors, (91), 13 states have internal predecessors, (91), 7 states have call successors, (32), 8 states have call predecessors, (32), 4 states have return successors, (30), 7 states have call predecessors, (30), 5 states have call successors, (30) [2022-07-21 15:46:54,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:46:54,418 INFO L93 Difference]: Finished difference Result 8045 states and 10756 transitions. [2022-07-21 15:46:54,418 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-07-21 15:46:54,418 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 4.55) internal successors, (91), 13 states have internal predecessors, (91), 7 states have call successors, (32), 8 states have call predecessors, (32), 4 states have return successors, (30), 7 states have call predecessors, (30), 5 states have call successors, (30) Word has length 250 [2022-07-21 15:46:54,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:46:54,429 INFO L225 Difference]: With dead ends: 8045 [2022-07-21 15:46:54,429 INFO L226 Difference]: Without dead ends: 5246 [2022-07-21 15:46:54,434 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 82 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 304 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=274, Invalid=1532, Unknown=0, NotChecked=0, Total=1806 [2022-07-21 15:46:54,435 INFO L413 NwaCegarLoop]: 1883 mSDtfsCounter, 2131 mSDsluCounter, 16558 mSDsCounter, 0 mSdLazyCounter, 14719 mSolverCounterSat, 1805 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2413 SdHoareTripleChecker+Valid, 18441 SdHoareTripleChecker+Invalid, 16524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1805 IncrementalHoareTripleChecker+Valid, 14719 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.9s IncrementalHoareTripleChecker+Time [2022-07-21 15:46:54,435 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2413 Valid, 18441 Invalid, 16524 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1805 Valid, 14719 Invalid, 0 Unknown, 0 Unchecked, 12.9s Time] [2022-07-21 15:46:54,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5246 states. [2022-07-21 15:46:54,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5246 to 3073. [2022-07-21 15:46:54,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3073 states, 2063 states have (on average 1.1919534658264663) internal successors, (2459), 2114 states have internal predecessors, (2459), 701 states have call successors, (701), 289 states have call predecessors, (701), 303 states have return successors, (747), 684 states have call predecessors, (747), 699 states have call successors, (747) [2022-07-21 15:46:54,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3073 states to 3073 states and 3907 transitions. [2022-07-21 15:46:54,898 INFO L78 Accepts]: Start accepts. Automaton has 3073 states and 3907 transitions. Word has length 250 [2022-07-21 15:46:54,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:46:54,898 INFO L495 AbstractCegarLoop]: Abstraction has 3073 states and 3907 transitions. [2022-07-21 15:46:54,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 4.55) internal successors, (91), 13 states have internal predecessors, (91), 7 states have call successors, (32), 8 states have call predecessors, (32), 4 states have return successors, (30), 7 states have call predecessors, (30), 5 states have call successors, (30) [2022-07-21 15:46:54,899 INFO L276 IsEmpty]: Start isEmpty. Operand 3073 states and 3907 transitions. [2022-07-21 15:46:54,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 233 [2022-07-21 15:46:54,901 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:46:54,901 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 8, 8, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-21 15:46:54,901 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-07-21 15:46:54,902 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:46:54,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:46:54,902 INFO L85 PathProgramCache]: Analyzing trace with hash 824333858, now seen corresponding path program 1 times [2022-07-21 15:46:54,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:46:54,902 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421131803] [2022-07-21 15:46:54,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:46:54,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:46:54,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:46:55,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:46:55,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:46:55,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:46:55,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:46:55,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:46:55,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:46:55,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:55,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:46:55,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:46:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:46:55,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:46:55,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:55,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:46:55,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:46:55,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 15:46:55,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:55,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:46:55,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:46:55,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-21 15:46:55,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:55,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:46:55,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:46:55,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 15:46:55,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 15:46:55,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-21 15:46:55,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:55,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 15:46:55,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 15:46:55,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:46:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-07-21 15:46:55,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:55,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 188 [2022-07-21 15:46:55,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-21 15:46:55,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:55,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:46:55,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 214 [2022-07-21 15:46:55,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:55,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:55,151 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 394 trivial. 0 not checked. [2022-07-21 15:46:55,151 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:46:55,151 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421131803] [2022-07-21 15:46:55,151 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421131803] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:46:55,152 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:46:55,152 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-21 15:46:55,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1815946295] [2022-07-21 15:46:55,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:46:55,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-21 15:46:55,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:46:55,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-21 15:46:55,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2022-07-21 15:46:55,154 INFO L87 Difference]: Start difference. First operand 3073 states and 3907 transitions. Second operand has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (34), 7 states have call predecessors, (34), 2 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) [2022-07-21 15:47:00,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:47:00,233 INFO L93 Difference]: Finished difference Result 7508 states and 10015 transitions. [2022-07-21 15:47:00,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-21 15:47:00,234 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (34), 7 states have call predecessors, (34), 2 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) Word has length 232 [2022-07-21 15:47:00,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:47:00,243 INFO L225 Difference]: With dead ends: 7508 [2022-07-21 15:47:00,243 INFO L226 Difference]: Without dead ends: 5113 [2022-07-21 15:47:00,248 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=98, Invalid=322, Unknown=0, NotChecked=0, Total=420 [2022-07-21 15:47:00,249 INFO L413 NwaCegarLoop]: 1700 mSDtfsCounter, 2228 mSDsluCounter, 7076 mSDsCounter, 0 mSdLazyCounter, 4920 mSolverCounterSat, 1595 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2323 SdHoareTripleChecker+Valid, 8776 SdHoareTripleChecker+Invalid, 6515 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1595 IncrementalHoareTripleChecker+Valid, 4920 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.1s IncrementalHoareTripleChecker+Time [2022-07-21 15:47:00,249 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2323 Valid, 8776 Invalid, 6515 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1595 Valid, 4920 Invalid, 0 Unknown, 0 Unchecked, 4.1s Time] [2022-07-21 15:47:00,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5113 states. [2022-07-21 15:47:00,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5113 to 3032. [2022-07-21 15:47:00,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3032 states, 2041 states have (on average 1.1901028907398334) internal successors, (2429), 2088 states have internal predecessors, (2429), 683 states have call successors, (683), 288 states have call predecessors, (683), 302 states have return successors, (729), 670 states have call predecessors, (729), 681 states have call successors, (729) [2022-07-21 15:47:00,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3032 states to 3032 states and 3841 transitions. [2022-07-21 15:47:00,712 INFO L78 Accepts]: Start accepts. Automaton has 3032 states and 3841 transitions. Word has length 232 [2022-07-21 15:47:00,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:47:00,713 INFO L495 AbstractCegarLoop]: Abstraction has 3032 states and 3841 transitions. [2022-07-21 15:47:00,713 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 8.181818181818182) internal successors, (90), 5 states have internal predecessors, (90), 2 states have call successors, (34), 7 states have call predecessors, (34), 2 states have return successors, (32), 3 states have call predecessors, (32), 2 states have call successors, (32) [2022-07-21 15:47:00,713 INFO L276 IsEmpty]: Start isEmpty. Operand 3032 states and 3841 transitions. [2022-07-21 15:47:00,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2022-07-21 15:47:00,715 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:47:00,715 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 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] [2022-07-21 15:47:00,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-07-21 15:47:00,715 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:47:00,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:47:00,715 INFO L85 PathProgramCache]: Analyzing trace with hash -873731877, now seen corresponding path program 1 times [2022-07-21 15:47:00,715 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:47:00,715 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852934611] [2022-07-21 15:47:00,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:47:00,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:47:00,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:47:01,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:47:01,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:47:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:47:01,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 15:47:01,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:01,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:47:01,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:47:01,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 15:47:01,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 15:47:01,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:01,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:47:01,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:47:01,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:47:01,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 15:47:01,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:01,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:47:01,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:47:01,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 15:47:01,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:01,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:47:01,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:47:01,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 15:47:01,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:01,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:47:01,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:47:01,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-21 15:47:01,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-21 15:47:01,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-21 15:47:01,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:01,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:01,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:01,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 15:47:01,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:47:01,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:01,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-21 15:47:01,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 15:47:01,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:47:01,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-21 15:47:01,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 220 [2022-07-21 15:47:01,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-07-21 15:47:01,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 234 [2022-07-21 15:47:01,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-07-21 15:47:01,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,460 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2022-07-21 15:47:01,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:47:01,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852934611] [2022-07-21 15:47:01,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852934611] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:47:01,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1541220319] [2022-07-21 15:47:01,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:47:01,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:47:01,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:47:01,463 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 15:47:01,464 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-21 15:47:02,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:02,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 2479 conjuncts, 61 conjunts are in the unsatisfiable core [2022-07-21 15:47:02,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 15:47:02,611 INFO L356 Elim1Store]: treesize reduction 181, result has 13.4 percent of original size [2022-07-21 15:47:02,612 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 28 treesize of output 37 [2022-07-21 15:47:02,620 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:02,621 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:02,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:02,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:02,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:02,625 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-21 15:47:02,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 37 [2022-07-21 15:47:02,859 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-21 15:47:02,861 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-07-21 15:47:02,876 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2022-07-21 15:47:02,876 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-21 15:47:03,442 INFO L134 CoverageAnalysis]: Checked inductivity of 506 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2022-07-21 15:47:03,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1541220319] provided 1 perfect and 1 imperfect interpolant sequences [2022-07-21 15:47:03,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-07-21 15:47:03,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [22, 10] total 33 [2022-07-21 15:47:03,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12734651] [2022-07-21 15:47:03,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:47:03,444 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-21 15:47:03,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:47:03,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-21 15:47:03,445 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=970, Unknown=0, NotChecked=0, Total=1056 [2022-07-21 15:47:03,445 INFO L87 Difference]: Start difference. First operand 3032 states and 3841 transitions. Second operand has 9 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 4 states have call successors, (33), 4 states have call predecessors, (33), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2022-07-21 15:47:05,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:47:05,774 INFO L93 Difference]: Finished difference Result 4623 states and 5817 transitions. [2022-07-21 15:47:05,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-21 15:47:05,775 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 4 states have call successors, (33), 4 states have call predecessors, (33), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 255 [2022-07-21 15:47:05,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:47:05,782 INFO L225 Difference]: With dead ends: 4623 [2022-07-21 15:47:05,783 INFO L226 Difference]: Without dead ends: 3084 [2022-07-21 15:47:05,787 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 613 GetRequests, 578 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=98, Invalid=1162, Unknown=0, NotChecked=0, Total=1260 [2022-07-21 15:47:05,787 INFO L413 NwaCegarLoop]: 1213 mSDtfsCounter, 45 mSDsluCounter, 7443 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 8656 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 650 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2022-07-21 15:47:05,787 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 8656 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 489 Invalid, 0 Unknown, 650 Unchecked, 1.7s Time] [2022-07-21 15:47:05,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3084 states. [2022-07-21 15:47:06,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3084 to 3084. [2022-07-21 15:47:06,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3084 states, 2074 states have (on average 1.188042430086789) internal successors, (2464), 2125 states have internal predecessors, (2464), 695 states have call successors, (695), 294 states have call predecessors, (695), 309 states have return successors, (750), 679 states have call predecessors, (750), 693 states have call successors, (750) [2022-07-21 15:47:06,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3084 states to 3084 states and 3909 transitions. [2022-07-21 15:47:06,225 INFO L78 Accepts]: Start accepts. Automaton has 3084 states and 3909 transitions. Word has length 255 [2022-07-21 15:47:06,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:47:06,225 INFO L495 AbstractCegarLoop]: Abstraction has 3084 states and 3909 transitions. [2022-07-21 15:47:06,225 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 11.75) internal successors, (94), 7 states have internal predecessors, (94), 4 states have call successors, (33), 4 states have call predecessors, (33), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2022-07-21 15:47:06,226 INFO L276 IsEmpty]: Start isEmpty. Operand 3084 states and 3909 transitions. [2022-07-21 15:47:06,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2022-07-21 15:47:06,228 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:47:06,228 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-21 15:47:06,266 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-21 15:47:06,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:47:06,456 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:47:06,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:47:06,456 INFO L85 PathProgramCache]: Analyzing trace with hash -1914881758, now seen corresponding path program 1 times [2022-07-21 15:47:06,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:47:06,456 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097366054] [2022-07-21 15:47:06,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:47:06,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:47:06,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:06,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:47:06,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:06,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:47:06,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:06,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:47:06,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:06,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:47:06,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:06,594 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:47:06,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:06,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:47:06,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:06,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:47:06,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:06,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:06,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:06,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:47:06,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:06,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:47:06,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:06,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:47:06,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:06,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:47:06,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:06,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:06,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:06,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:47:06,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:06,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:47:06,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:06,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 15:47:06,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:06,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:06,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:06,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:47:06,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:06,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:47:06,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:06,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-21 15:47:06,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:06,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:06,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:06,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:47:06,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:06,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:47:06,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:06,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 15:47:06,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:06,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 15:47:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:06,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-21 15:47:06,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:06,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:06,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:06,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-21 15:47:06,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:06,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:06,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:06,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-21 15:47:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:06,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-21 15:47:06,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:06,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-21 15:47:06,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:06,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-21 15:47:06,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:06,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:06,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:06,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-21 15:47:06,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:06,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:06,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:47:06,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:06,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-07-21 15:47:06,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:06,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:06,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:06,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-21 15:47:06,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:06,801 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 441 trivial. 0 not checked. [2022-07-21 15:47:06,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:47:06,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097366054] [2022-07-21 15:47:06,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097366054] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:47:06,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:47:06,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-07-21 15:47:06,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631554890] [2022-07-21 15:47:06,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:47:06,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 15:47:06,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:47:06,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 15:47:06,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-07-21 15:47:06,804 INFO L87 Difference]: Start difference. First operand 3084 states and 3909 transitions. Second operand has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 6 states have internal predecessors, (100), 4 states have call successors, (35), 9 states have call predecessors, (35), 2 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2022-07-21 15:47:13,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:47:13,659 INFO L93 Difference]: Finished difference Result 6615 states and 8623 transitions. [2022-07-21 15:47:13,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-21 15:47:13,659 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 6 states have internal predecessors, (100), 4 states have call successors, (35), 9 states have call predecessors, (35), 2 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) Word has length 251 [2022-07-21 15:47:13,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:47:13,669 INFO L225 Difference]: With dead ends: 6615 [2022-07-21 15:47:13,669 INFO L226 Difference]: Without dead ends: 4260 [2022-07-21 15:47:13,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=259, Invalid=733, Unknown=0, NotChecked=0, Total=992 [2022-07-21 15:47:13,675 INFO L413 NwaCegarLoop]: 1518 mSDtfsCounter, 2174 mSDsluCounter, 8067 mSDsCounter, 0 mSdLazyCounter, 5643 mSolverCounterSat, 2109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2279 SdHoareTripleChecker+Valid, 9585 SdHoareTripleChecker+Invalid, 7752 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2109 IncrementalHoareTripleChecker+Valid, 5643 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-07-21 15:47:13,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2279 Valid, 9585 Invalid, 7752 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2109 Valid, 5643 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-07-21 15:47:13,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4260 states. [2022-07-21 15:47:14,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4260 to 3084. [2022-07-21 15:47:14,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3084 states, 2074 states have (on average 1.1861137897782064) internal successors, (2460), 2125 states have internal predecessors, (2460), 695 states have call successors, (695), 294 states have call predecessors, (695), 309 states have return successors, (750), 679 states have call predecessors, (750), 693 states have call successors, (750) [2022-07-21 15:47:14,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3084 states to 3084 states and 3905 transitions. [2022-07-21 15:47:14,299 INFO L78 Accepts]: Start accepts. Automaton has 3084 states and 3905 transitions. Word has length 251 [2022-07-21 15:47:14,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:47:14,299 INFO L495 AbstractCegarLoop]: Abstraction has 3084 states and 3905 transitions. [2022-07-21 15:47:14,299 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 8.333333333333334) internal successors, (100), 6 states have internal predecessors, (100), 4 states have call successors, (35), 9 states have call predecessors, (35), 2 states have return successors, (33), 3 states have call predecessors, (33), 3 states have call successors, (33) [2022-07-21 15:47:14,299 INFO L276 IsEmpty]: Start isEmpty. Operand 3084 states and 3905 transitions. [2022-07-21 15:47:14,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 268 [2022-07-21 15:47:14,301 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:47:14,302 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 10, 10, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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] [2022-07-21 15:47:14,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-07-21 15:47:14,302 INFO L420 AbstractCegarLoop]: === Iteration 43 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:47:14,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:47:14,302 INFO L85 PathProgramCache]: Analyzing trace with hash -817718125, now seen corresponding path program 1 times [2022-07-21 15:47:14,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:47:14,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935224946] [2022-07-21 15:47:14,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:47:14,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:47:14,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:14,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:47:14,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:14,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:47:14,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:14,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:47:14,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:14,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:47:14,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:14,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:47:14,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:14,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:47:14,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:14,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:47:14,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:14,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:14,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:14,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:47:14,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:14,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:47:14,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:14,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:47:14,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:14,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:47:14,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:14,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:14,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:14,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:47:14,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:14,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:47:14,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:14,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 15:47:14,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:14,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:14,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:14,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:47:14,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:14,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:47:14,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:14,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-21 15:47:14,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:14,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:14,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:14,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:47:14,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:14,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:47:14,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:14,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 15:47:14,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:14,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 15:47:14,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:14,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-21 15:47:14,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:14,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:14,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:14,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-21 15:47:14,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:14,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:14,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:14,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-21 15:47:14,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:14,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-21 15:47:14,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:14,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-21 15:47:14,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:14,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 195 [2022-07-21 15:47:14,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:14,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:14,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:14,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:47:14,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:14,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:47:14,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:14,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-07-21 15:47:14,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:14,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:14,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:14,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:47:14,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:14,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:47:14,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:14,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 237 [2022-07-21 15:47:14,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:14,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 246 [2022-07-21 15:47:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:14,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 252 [2022-07-21 15:47:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:14,572 INFO L134 CoverageAnalysis]: Checked inductivity of 735 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 735 trivial. 0 not checked. [2022-07-21 15:47:14,572 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:47:14,572 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935224946] [2022-07-21 15:47:14,572 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935224946] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:47:14,572 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:47:14,573 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-21 15:47:14,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421324936] [2022-07-21 15:47:14,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:47:14,573 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-21 15:47:14,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:47:14,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-21 15:47:14,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-21 15:47:14,575 INFO L87 Difference]: Start difference. First operand 3084 states and 3905 transitions. Second operand has 8 states, 8 states have (on average 10.375) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (34), 6 states have call predecessors, (34), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2022-07-21 15:47:17,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:47:17,042 INFO L93 Difference]: Finished difference Result 3115 states and 3938 transitions. [2022-07-21 15:47:17,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-21 15:47:17,043 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (34), 6 states have call predecessors, (34), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 267 [2022-07-21 15:47:17,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:47:17,051 INFO L225 Difference]: With dead ends: 3115 [2022-07-21 15:47:17,051 INFO L226 Difference]: Without dead ends: 3113 [2022-07-21 15:47:17,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 90 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-07-21 15:47:17,053 INFO L413 NwaCegarLoop]: 1141 mSDtfsCounter, 1729 mSDsluCounter, 2518 mSDsCounter, 0 mSdLazyCounter, 1851 mSolverCounterSat, 946 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1891 SdHoareTripleChecker+Valid, 3659 SdHoareTripleChecker+Invalid, 2797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 946 IncrementalHoareTripleChecker+Valid, 1851 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2022-07-21 15:47:17,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1891 Valid, 3659 Invalid, 2797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [946 Valid, 1851 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2022-07-21 15:47:17,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3113 states. [2022-07-21 15:47:17,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3113 to 3098. [2022-07-21 15:47:17,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3098 states, 2085 states have (on average 1.1832134292565948) internal successors, (2467), 2135 states have internal predecessors, (2467), 695 states have call successors, (695), 298 states have call predecessors, (695), 313 states have return successors, (750), 679 states have call predecessors, (750), 693 states have call successors, (750) [2022-07-21 15:47:17,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3098 states to 3098 states and 3912 transitions. [2022-07-21 15:47:17,582 INFO L78 Accepts]: Start accepts. Automaton has 3098 states and 3912 transitions. Word has length 267 [2022-07-21 15:47:17,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:47:17,582 INFO L495 AbstractCegarLoop]: Abstraction has 3098 states and 3912 transitions. [2022-07-21 15:47:17,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.375) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (34), 6 states have call predecessors, (34), 1 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2022-07-21 15:47:17,583 INFO L276 IsEmpty]: Start isEmpty. Operand 3098 states and 3912 transitions. [2022-07-21 15:47:17,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2022-07-21 15:47:17,585 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:47:17,585 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-21 15:47:17,585 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable42 [2022-07-21 15:47:17,585 INFO L420 AbstractCegarLoop]: === Iteration 44 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:47:17,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:47:17,586 INFO L85 PathProgramCache]: Analyzing trace with hash -123340657, now seen corresponding path program 1 times [2022-07-21 15:47:17,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:47:17,586 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1321327359] [2022-07-21 15:47:17,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:47:17,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:47:17,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:17,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:47:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:17,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:47:17,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:17,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:47:17,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:17,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:47:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:17,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:47:17,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:17,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:47:17,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:17,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:47:17,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:17,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:17,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:17,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:47:17,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:17,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:47:17,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:17,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:47:17,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:17,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:47:17,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:17,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:17,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:17,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:47:17,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:17,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:47:17,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:17,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 15:47:17,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:17,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:17,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:17,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:47:17,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:17,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:47:17,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:17,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-21 15:47:17,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:17,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:17,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:17,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:47:17,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:17,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:47:17,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:17,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 15:47:17,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:17,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 15:47:17,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:17,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-21 15:47:17,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:17,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:17,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:18,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-21 15:47:18,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:18,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:18,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:18,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-21 15:47:18,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:18,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-21 15:47:18,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:18,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-21 15:47:18,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:18,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-21 15:47:18,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:18,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:18,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:18,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-21 15:47:18,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:18,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:18,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:18,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:47:18,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:18,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-07-21 15:47:18,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:18,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:18,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:18,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-21 15:47:18,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:18,099 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 9 proven. 28 refuted. 0 times theorem prover too weak. 404 trivial. 0 not checked. [2022-07-21 15:47:18,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:47:18,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1321327359] [2022-07-21 15:47:18,100 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1321327359] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:47:18,100 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1607306503] [2022-07-21 15:47:18,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:47:18,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:47:18,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:47:18,104 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 15:47:18,105 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-21 15:47:18,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:18,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 2195 conjuncts, 29 conjunts are in the unsatisfiable core [2022-07-21 15:47:18,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 15:47:18,984 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 205 proven. 0 refuted. 0 times theorem prover too weak. 236 trivial. 0 not checked. [2022-07-21 15:47:18,984 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 15:47:18,985 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1607306503] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:47:18,985 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 15:47:18,985 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [24] total 26 [2022-07-21 15:47:18,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425182071] [2022-07-21 15:47:18,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:47:18,986 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-07-21 15:47:18,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:47:18,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-07-21 15:47:18,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=599, Unknown=0, NotChecked=0, Total=650 [2022-07-21 15:47:18,987 INFO L87 Difference]: Start difference. First operand 3098 states and 3912 transitions. Second operand has 18 states, 17 states have (on average 6.764705882352941) internal successors, (115), 17 states have internal predecessors, (115), 7 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (34), 7 states have call predecessors, (34), 7 states have call successors, (34) [2022-07-21 15:47:19,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:47:19,934 INFO L93 Difference]: Finished difference Result 5480 states and 6853 transitions. [2022-07-21 15:47:19,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-07-21 15:47:19,935 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 6.764705882352941) internal successors, (115), 17 states have internal predecessors, (115), 7 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (34), 7 states have call predecessors, (34), 7 states have call successors, (34) Word has length 255 [2022-07-21 15:47:19,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:47:19,941 INFO L225 Difference]: With dead ends: 5480 [2022-07-21 15:47:19,941 INFO L226 Difference]: Without dead ends: 3077 [2022-07-21 15:47:19,945 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 362 GetRequests, 325 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=1211, Unknown=0, NotChecked=0, Total=1406 [2022-07-21 15:47:19,945 INFO L413 NwaCegarLoop]: 1165 mSDtfsCounter, 66 mSDsluCounter, 18539 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 19704 SdHoareTripleChecker+Invalid, 746 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 15:47:19,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 19704 Invalid, 746 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 690 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 15:47:19,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3077 states. [2022-07-21 15:47:20,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3077 to 3077. [2022-07-21 15:47:20,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3077 states, 2070 states have (on average 1.1840579710144927) internal successors, (2451), 2119 states have internal predecessors, (2451), 692 states have call successors, (692), 295 states have call predecessors, (692), 310 states have return successors, (747), 677 states have call predecessors, (747), 690 states have call successors, (747) [2022-07-21 15:47:20,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3077 states to 3077 states and 3890 transitions. [2022-07-21 15:47:20,466 INFO L78 Accepts]: Start accepts. Automaton has 3077 states and 3890 transitions. Word has length 255 [2022-07-21 15:47:20,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:47:20,466 INFO L495 AbstractCegarLoop]: Abstraction has 3077 states and 3890 transitions. [2022-07-21 15:47:20,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 6.764705882352941) internal successors, (115), 17 states have internal predecessors, (115), 7 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (34), 7 states have call predecessors, (34), 7 states have call successors, (34) [2022-07-21 15:47:20,466 INFO L276 IsEmpty]: Start isEmpty. Operand 3077 states and 3890 transitions. [2022-07-21 15:47:20,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2022-07-21 15:47:20,468 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:47:20,468 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 12, 10, 10, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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] [2022-07-21 15:47:20,490 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-21 15:47:20,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:47:20,669 INFO L420 AbstractCegarLoop]: === Iteration 45 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:47:20,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:47:20,669 INFO L85 PathProgramCache]: Analyzing trace with hash -2075890611, now seen corresponding path program 1 times [2022-07-21 15:47:20,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:47:20,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1632319285] [2022-07-21 15:47:20,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:47:20,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:47:20,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:20,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:47:20,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:20,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:47:20,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:20,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:47:20,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:20,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:47:20,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:20,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-21 15:47:20,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:20,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-07-21 15:47:20,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:20,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2022-07-21 15:47:20,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:20,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:20,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:20,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-07-21 15:47:20,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:20,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-07-21 15:47:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:20,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2022-07-21 15:47:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:20,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-07-21 15:47:20,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:20,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:20,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:20,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:47:20,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:20,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:47:20,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:20,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-07-21 15:47:20,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:20,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:20,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:20,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:47:20,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:20,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:47:20,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:20,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-21 15:47:20,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:20,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:20,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:20,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:47:20,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:20,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:47:20,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:20,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-07-21 15:47:20,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:20,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-07-21 15:47:20,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:20,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2022-07-21 15:47:20,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:20,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:20,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:20,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2022-07-21 15:47:20,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:20,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:20,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:20,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-21 15:47:20,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:20,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-07-21 15:47:20,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:20,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 187 [2022-07-21 15:47:20,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:20,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 196 [2022-07-21 15:47:20,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:20,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:20,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:20,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 207 [2022-07-21 15:47:20,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:20,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:20,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:20,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:47:20,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:20,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 227 [2022-07-21 15:47:20,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:20,937 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:20,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:20,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 240 [2022-07-21 15:47:20,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:20,956 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 3 proven. 30 refuted. 0 times theorem prover too weak. 408 trivial. 0 not checked. [2022-07-21 15:47:20,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:47:20,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1632319285] [2022-07-21 15:47:20,956 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1632319285] provided 0 perfect and 1 imperfect interpolant sequences [2022-07-21 15:47:20,956 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [558206180] [2022-07-21 15:47:20,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:47:20,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:47:20,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:47:20,960 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-21 15:47:20,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-21 15:47:21,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,782 INFO L263 TraceCheckSpWp]: Trace formula consists of 2193 conjuncts, 19 conjunts are in the unsatisfiable core [2022-07-21 15:47:21,791 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-21 15:47:21,938 INFO L134 CoverageAnalysis]: Checked inductivity of 441 backedges. 85 proven. 0 refuted. 0 times theorem prover too weak. 356 trivial. 0 not checked. [2022-07-21 15:47:21,938 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-21 15:47:21,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [558206180] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:47:21,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-07-21 15:47:21,939 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [12] total 21 [2022-07-21 15:47:21,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266555995] [2022-07-21 15:47:21,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:47:21,939 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-21 15:47:21,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:47:21,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-21 15:47:21,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=381, Unknown=0, NotChecked=0, Total=420 [2022-07-21 15:47:21,940 INFO L87 Difference]: Start difference. First operand 3077 states and 3890 transitions. Second operand has 13 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 5 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (34), 5 states have call predecessors, (34), 5 states have call successors, (34) [2022-07-21 15:47:22,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:47:22,974 INFO L93 Difference]: Finished difference Result 5701 states and 7188 transitions. [2022-07-21 15:47:22,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-21 15:47:22,974 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 5 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (34), 5 states have call predecessors, (34), 5 states have call successors, (34) Word has length 255 [2022-07-21 15:47:22,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:47:22,983 INFO L225 Difference]: With dead ends: 5701 [2022-07-21 15:47:22,983 INFO L226 Difference]: Without dead ends: 3336 [2022-07-21 15:47:22,988 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 351 GetRequests, 322 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=113, Invalid=817, Unknown=0, NotChecked=0, Total=930 [2022-07-21 15:47:22,988 INFO L413 NwaCegarLoop]: 1287 mSDtfsCounter, 213 mSDsluCounter, 13704 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 207 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 14991 SdHoareTripleChecker+Invalid, 696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 207 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-07-21 15:47:22,988 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [213 Valid, 14991 Invalid, 696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [207 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-07-21 15:47:22,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3336 states. [2022-07-21 15:47:23,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3336 to 3093. [2022-07-21 15:47:23,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3093 states, 2084 states have (on average 1.1818618042226487) internal successors, (2463), 2131 states have internal predecessors, (2463), 694 states have call successors, (694), 295 states have call predecessors, (694), 310 states have return successors, (749), 681 states have call predecessors, (749), 692 states have call successors, (749) [2022-07-21 15:47:23,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3093 states to 3093 states and 3906 transitions. [2022-07-21 15:47:23,559 INFO L78 Accepts]: Start accepts. Automaton has 3093 states and 3906 transitions. Word has length 255 [2022-07-21 15:47:23,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:47:23,560 INFO L495 AbstractCegarLoop]: Abstraction has 3093 states and 3906 transitions. [2022-07-21 15:47:23,560 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 9.333333333333334) internal successors, (112), 12 states have internal predecessors, (112), 5 states have call successors, (36), 2 states have call predecessors, (36), 4 states have return successors, (34), 5 states have call predecessors, (34), 5 states have call successors, (34) [2022-07-21 15:47:23,560 INFO L276 IsEmpty]: Start isEmpty. Operand 3093 states and 3906 transitions. [2022-07-21 15:47:23,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2022-07-21 15:47:23,562 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:47:23,562 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 14, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 3, 3, 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] [2022-07-21 15:47:23,584 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-07-21 15:47:23,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-21 15:47:23,763 INFO L420 AbstractCegarLoop]: === Iteration 46 === Targeting ldv_linux_usb_urb_usb_free_urbErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-21 15:47:23,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:47:23,764 INFO L85 PathProgramCache]: Analyzing trace with hash -756415473, now seen corresponding path program 1 times [2022-07-21 15:47:23,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:47:23,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940337355] [2022-07-21 15:47:23,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:47:23,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:47:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:23,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:47:23,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:23,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2022-07-21 15:47:23,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:23,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-21 15:47:23,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:23,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:47:23,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:23,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-21 15:47:23,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:23,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:23,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:23,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:47:23,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:47:24,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-21 15:47:24,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2022-07-21 15:47:24,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:24,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:47:24,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:47:24,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-07-21 15:47:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 15:47:24,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:24,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:47:24,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:47:24,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-07-21 15:47:24,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:24,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:47:24,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:47:24,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 124 [2022-07-21 15:47:24,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:24,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-21 15:47:24,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-21 15:47:24,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2022-07-21 15:47:24,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-21 15:47:24,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 157 [2022-07-21 15:47:24,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:24,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:24,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:24,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-07-21 15:47:24,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-07-21 15:47:24,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:24,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 15:47:24,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-07-21 15:47:24,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-07-21 15:47:24,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-07-21 15:47:24,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:24,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 229 [2022-07-21 15:47:24,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 233 [2022-07-21 15:47:24,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-21 15:47:24,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 244 [2022-07-21 15:47:24,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 255 [2022-07-21 15:47:24,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 261 [2022-07-21 15:47:24,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:24,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 272 [2022-07-21 15:47:24,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 279 [2022-07-21 15:47:24,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:24,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 290 [2022-07-21 15:47:24,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:24,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2022-07-21 15:47:24,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:24,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 315 [2022-07-21 15:47:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:24,289 INFO L134 CoverageAnalysis]: Checked inductivity of 527 backedges. 39 proven. 0 refuted. 0 times theorem prover too weak. 488 trivial. 0 not checked. [2022-07-21 15:47:24,289 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:47:24,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940337355] [2022-07-21 15:47:24,289 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940337355] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:47:24,289 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:47:24,289 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-07-21 15:47:24,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830328538] [2022-07-21 15:47:24,290 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:47:24,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-07-21 15:47:24,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:47:24,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-07-21 15:47:24,291 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=420, Unknown=0, NotChecked=0, Total=462 [2022-07-21 15:47:24,291 INFO L87 Difference]: Start difference. First operand 3093 states and 3906 transitions. Second operand has 22 states, 21 states have (on average 6.238095238095238) internal successors, (131), 14 states have internal predecessors, (131), 7 states have call successors, (46), 9 states have call predecessors, (46), 3 states have return successors, (43), 7 states have call predecessors, (43), 7 states have call successors, (43)