./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 ae007674 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-dev-ae00767 [2021-12-28 05:24:36,144 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-28 05:24:36,146 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-28 05:24:36,185 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-28 05:24:36,185 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-28 05:24:36,189 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-28 05:24:36,190 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-28 05:24:36,194 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-28 05:24:36,196 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-28 05:24:36,204 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-28 05:24:36,205 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-28 05:24:36,206 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-28 05:24:36,206 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-28 05:24:36,208 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-28 05:24:36,209 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-28 05:24:36,214 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-28 05:24:36,215 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-28 05:24:36,216 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-28 05:24:36,218 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-28 05:24:36,223 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-28 05:24:36,224 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-28 05:24:36,225 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-28 05:24:36,227 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-28 05:24:36,228 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-28 05:24:36,233 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-28 05:24:36,239 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-28 05:24:36,239 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-28 05:24:36,240 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-28 05:24:36,241 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-28 05:24:36,242 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-28 05:24:36,242 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-28 05:24:36,242 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-28 05:24:36,244 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-28 05:24:36,244 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-28 05:24:36,245 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-28 05:24:36,246 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-28 05:24:36,246 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-28 05:24:36,247 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-28 05:24:36,247 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-28 05:24:36,248 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-28 05:24:36,249 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-28 05:24:36,253 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2021-12-28 05:24:36,281 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-28 05:24:36,281 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-28 05:24:36,282 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-28 05:24:36,282 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-28 05:24:36,283 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-28 05:24:36,283 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-28 05:24:36,285 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-28 05:24:36,285 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-28 05:24:36,285 INFO L138 SettingsManager]: * Use SBE=true [2021-12-28 05:24:36,285 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-28 05:24:36,286 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-28 05:24:36,286 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-28 05:24:36,287 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-28 05:24:36,287 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-28 05:24:36,287 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-28 05:24:36,287 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-28 05:24:36,287 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-28 05:24:36,288 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-28 05:24:36,288 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-28 05:24:36,288 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-28 05:24:36,288 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-28 05:24:36,289 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 05:24:36,289 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-28 05:24:36,289 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-28 05:24:36,289 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-28 05:24:36,289 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-28 05:24:36,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-28 05:24:36,290 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-28 05:24:36,290 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-28 05:24:36,290 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-28 05:24:36,290 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 [2021-12-28 05:24:36,608 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-28 05:24:36,638 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-28 05:24:36,640 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-28 05:24:36,642 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-28 05:24:36,642 INFO L275 PluginConnector]: CDTParser initialized [2021-12-28 05:24:36,643 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 [2021-12-28 05:24:36,698 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9c67207a/841968582a734723ba958256ecdfcb2c/FLAG535da7cee [2021-12-28 05:24:37,412 INFO L306 CDTParser]: Found 1 translation units. [2021-12-28 05:24:37,414 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 [2021-12-28 05:24:37,464 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9c67207a/841968582a734723ba958256ecdfcb2c/FLAG535da7cee [2021-12-28 05:24:37,507 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f9c67207a/841968582a734723ba958256ecdfcb2c [2021-12-28 05:24:37,509 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-28 05:24:37,511 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-28 05:24:37,513 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-28 05:24:37,513 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-28 05:24:37,516 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-28 05:24:37,517 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:24:37" (1/1) ... [2021-12-28 05:24:37,517 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fa624b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:24:37, skipping insertion in model container [2021-12-28 05:24:37,518 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.12 05:24:37" (1/1) ... [2021-12-28 05:24:37,523 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-28 05:24:37,673 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-28 05:24:39,198 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273031,273044] [2021-12-28 05:24:39,201 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273176,273189] [2021-12-28 05:24:39,201 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273322,273335] [2021-12-28 05:24:39,201 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273487,273500] [2021-12-28 05:24:39,202 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273645,273658] [2021-12-28 05:24:39,202 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273803,273816] [2021-12-28 05:24:39,203 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[273961,273974] [2021-12-28 05:24:39,203 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274121,274134] [2021-12-28 05:24:39,203 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274280,274293] [2021-12-28 05:24:39,204 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274419,274432] [2021-12-28 05:24:39,204 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274561,274574] [2021-12-28 05:24:39,205 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274710,274723] [2021-12-28 05:24:39,205 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[274849,274862] [2021-12-28 05:24:39,205 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275004,275017] [2021-12-28 05:24:39,206 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275164,275177] [2021-12-28 05:24:39,206 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275315,275328] [2021-12-28 05:24:39,207 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275466,275479] [2021-12-28 05:24:39,207 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275618,275631] [2021-12-28 05:24:39,207 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275767,275780] [2021-12-28 05:24:39,208 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[275915,275928] [2021-12-28 05:24:39,208 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276072,276085] [2021-12-28 05:24:39,208 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276221,276234] [2021-12-28 05:24:39,209 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276377,276390] [2021-12-28 05:24:39,209 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276530,276543] [2021-12-28 05:24:39,210 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276676,276689] [2021-12-28 05:24:39,210 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276819,276832] [2021-12-28 05:24:39,210 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[276971,276984] [2021-12-28 05:24:39,211 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277117,277130] [2021-12-28 05:24:39,211 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277262,277275] [2021-12-28 05:24:39,212 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277416,277429] [2021-12-28 05:24:39,212 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277567,277580] [2021-12-28 05:24:39,212 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277722,277735] [2021-12-28 05:24:39,213 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[277874,277887] [2021-12-28 05:24:39,213 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278029,278042] [2021-12-28 05:24:39,213 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278193,278206] [2021-12-28 05:24:39,214 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278349,278362] [2021-12-28 05:24:39,214 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278513,278526] [2021-12-28 05:24:39,215 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278655,278668] [2021-12-28 05:24:39,215 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278813,278826] [2021-12-28 05:24:39,215 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[278980,278993] [2021-12-28 05:24:39,216 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279139,279152] [2021-12-28 05:24:39,216 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279298,279311] [2021-12-28 05:24:39,216 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279447,279460] [2021-12-28 05:24:39,217 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279594,279607] [2021-12-28 05:24:39,217 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279733,279746] [2021-12-28 05:24:39,217 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[279896,279909] [2021-12-28 05:24:39,218 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280062,280075] [2021-12-28 05:24:39,218 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280226,280239] [2021-12-28 05:24:39,218 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280391,280404] [2021-12-28 05:24:39,219 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280556,280569] [2021-12-28 05:24:39,219 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280722,280735] [2021-12-28 05:24:39,220 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[280887,280900] [2021-12-28 05:24:39,220 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281054,281067] [2021-12-28 05:24:39,220 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281214,281227] [2021-12-28 05:24:39,221 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281376,281389] [2021-12-28 05:24:39,221 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281535,281548] [2021-12-28 05:24:39,221 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281681,281694] [2021-12-28 05:24:39,222 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281824,281837] [2021-12-28 05:24:39,222 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[281968,281981] [2021-12-28 05:24:39,222 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282111,282124] [2021-12-28 05:24:39,223 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282255,282268] [2021-12-28 05:24:39,223 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282396,282409] [2021-12-28 05:24:39,224 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282534,282547] [2021-12-28 05:24:39,224 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282692,282705] [2021-12-28 05:24:39,224 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[282851,282864] [2021-12-28 05:24:39,225 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283007,283020] [2021-12-28 05:24:39,225 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283156,283169] [2021-12-28 05:24:39,225 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283308,283321] [2021-12-28 05:24:39,226 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283459,283472] [2021-12-28 05:24:39,226 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283608,283621] [2021-12-28 05:24:39,227 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283760,283773] [2021-12-28 05:24:39,227 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283908,283921] [2021-12-28 05:24:39,227 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284061,284074] [2021-12-28 05:24:39,228 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284212,284225] [2021-12-28 05:24:39,228 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284362,284375] [2021-12-28 05:24:39,228 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284509,284522] [2021-12-28 05:24:39,229 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284660,284673] [2021-12-28 05:24:39,229 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284811,284824] [2021-12-28 05:24:39,229 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284959,284972] [2021-12-28 05:24:39,230 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285125,285138] [2021-12-28 05:24:39,230 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285294,285307] [2021-12-28 05:24:39,231 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285461,285474] [2021-12-28 05:24:39,231 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285629,285642] [2021-12-28 05:24:39,232 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285779,285792] [2021-12-28 05:24:39,232 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[285926,285939] [2021-12-28 05:24:39,232 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286087,286100] [2021-12-28 05:24:39,233 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286257,286270] [2021-12-28 05:24:39,233 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[286419,286432] [2021-12-28 05:24:39,240 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 05:24:39,264 INFO L203 MainTranslator]: Completed pre-run [2021-12-28 05:24:39,486 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,487 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,488 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,488 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,489 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,490 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,491 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,492 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,495 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,496 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,497 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,497 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,497 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,498 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,498 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,499 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,499 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,500 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,500 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,500 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,501 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,502 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,503 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,503 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,503 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,504 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,504 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,505 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,505 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,505 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,506 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,506 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,507 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,507 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,507 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,508 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,509 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,509 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,509 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,510 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,511 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,512 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,512 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,512 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,513 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,513 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,513 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,514 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,514 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,515 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,515 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,516 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,516 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,516 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,517 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,517 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,518 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,518 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,518 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,519 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,519 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,520 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,521 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,522 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,524 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,525 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,525 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,526 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,526 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,527 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[283608,283621] [2021-12-28 05:24:39,528 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,535 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,535 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,540 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284212,284225] [2021-12-28 05:24:39,540 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i[284362,284375] [2021-12-28 05:24:39,541 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,541 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,542 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,543 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,544 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,544 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,545 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,545 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,546 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,546 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,546 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,547 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,547 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for 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] [2021-12-28 05:24:39,550 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-28 05:24:39,706 INFO L208 MainTranslator]: Completed translation [2021-12-28 05:24:39,707 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:24:39 WrapperNode [2021-12-28 05:24:39,707 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-28 05:24:39,708 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-28 05:24:39,708 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-28 05:24:39,708 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-28 05:24:39,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:24:39" (1/1) ... [2021-12-28 05:24:39,791 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:24:39" (1/1) ... [2021-12-28 05:24:39,921 INFO L137 Inliner]: procedures = 526, calls = 1327, calls flagged for inlining = 223, calls inlined = 134, statements flattened = 2372 [2021-12-28 05:24:39,921 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-28 05:24:39,922 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-28 05:24:39,922 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-28 05:24:39,922 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-28 05:24:39,930 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:24:39" (1/1) ... [2021-12-28 05:24:39,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:24:39" (1/1) ... [2021-12-28 05:24:39,952 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:24:39" (1/1) ... [2021-12-28 05:24:39,953 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:24:39" (1/1) ... [2021-12-28 05:24:40,015 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:24:39" (1/1) ... [2021-12-28 05:24:40,023 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:24:39" (1/1) ... [2021-12-28 05:24:40,035 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:24:39" (1/1) ... [2021-12-28 05:24:40,052 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-28 05:24:40,053 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-28 05:24:40,053 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-28 05:24:40,054 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-28 05:24:40,054 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:24:39" (1/1) ... [2021-12-28 05:24:40,060 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-28 05:24:40,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-28 05:24:40,084 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) [2021-12-28 05:24:40,110 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 [2021-12-28 05:24:40,126 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2021-12-28 05:24:40,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2021-12-28 05:24:40,127 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2021-12-28 05:24:40,127 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2021-12-28 05:24:40,127 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-12-28 05:24:40,150 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2021-12-28 05:24:40,151 INFO L130 BoogieDeclarations]: Found specification of procedure __might_sleep [2021-12-28 05:24:40,151 INFO L138 BoogieDeclarations]: Found implementation of procedure __might_sleep [2021-12-28 05:24:40,151 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2021-12-28 05:24:40,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2021-12-28 05:24:40,151 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2021-12-28 05:24:40,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2021-12-28 05:24:40,151 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2021-12-28 05:24:40,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2021-12-28 05:24:40,152 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_lock_read_buffer_lock_of_lego_usb_tower [2021-12-28 05:24:40,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_lock_read_buffer_lock_of_lego_usb_tower [2021-12-28 05:24:40,153 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2021-12-28 05:24:40,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2021-12-28 05:24:40,153 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2021-12-28 05:24:40,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2021-12-28 05:24:40,154 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2021-12-28 05:24:40,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2021-12-28 05:24:40,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-12-28 05:24:40,154 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2021-12-28 05:24:40,155 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2021-12-28 05:24:40,155 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2021-12-28 05:24:40,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2021-12-28 05:24:40,155 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2021-12-28 05:24:40,155 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2021-12-28 05:24:40,155 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2021-12-28 05:24:40,155 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2021-12-28 05:24:40,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2021-12-28 05:24:40,156 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2021-12-28 05:24:40,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2021-12-28 05:24:40,156 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_irq_112 [2021-12-28 05:24:40,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_irq_112 [2021-12-28 05:24:40,156 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-12-28 05:24:40,156 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2021-12-28 05:24:40,156 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-12-28 05:24:40,157 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2021-12-28 05:24:40,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2021-12-28 05:24:40,157 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2021-12-28 05:24:40,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2021-12-28 05:24:40,157 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2021-12-28 05:24:40,157 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2021-12-28 05:24:40,157 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2021-12-28 05:24:40,157 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2021-12-28 05:24:40,157 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2021-12-28 05:24:40,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2021-12-28 05:24:40,158 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_to_wait_event [2021-12-28 05:24:40,158 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_to_wait_event [2021-12-28 05:24:40,158 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2021-12-28 05:24:40,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2021-12-28 05:24:40,158 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_open_disc_mutex [2021-12-28 05:24:40,158 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_open_disc_mutex [2021-12-28 05:24:40,158 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_lock_of_lego_usb_tower [2021-12-28 05:24:40,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_lock_of_lego_usb_tower [2021-12-28 05:24:40,159 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-12-28 05:24:40,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2021-12-28 05:24:40,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-12-28 05:24:40,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-28 05:24:40,159 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2021-12-28 05:24:40,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2021-12-28 05:24:40,160 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-12-28 05:24:40,160 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2021-12-28 05:24:40,160 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2021-12-28 05:24:40,160 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2021-12-28 05:24:40,160 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2021-12-28 05:24:40,160 INFO L130 BoogieDeclarations]: Found specification of procedure usb_control_msg [2021-12-28 05:24:40,160 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_control_msg [2021-12-28 05:24:40,161 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2021-12-28 05:24:40,161 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2021-12-28 05:24:40,161 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2021-12-28 05:24:40,164 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2021-12-28 05:24:40,164 INFO L130 BoogieDeclarations]: Found specification of procedure __init_waitqueue_head [2021-12-28 05:24:40,164 INFO L138 BoogieDeclarations]: Found implementation of procedure __init_waitqueue_head [2021-12-28 05:24:40,164 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_open_disc_mutex [2021-12-28 05:24:40,165 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_open_disc_mutex [2021-12-28 05:24:40,165 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_timeout [2021-12-28 05:24:40,165 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_timeout [2021-12-28 05:24:40,165 INFO L130 BoogieDeclarations]: Found specification of procedure finish_wait [2021-12-28 05:24:40,165 INFO L138 BoogieDeclarations]: Found implementation of procedure finish_wait [2021-12-28 05:24:40,166 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-28 05:24:40,166 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-28 05:24:40,167 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2021-12-28 05:24:40,167 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2021-12-28 05:24:40,167 INFO L130 BoogieDeclarations]: Found specification of procedure tower_disconnect [2021-12-28 05:24:40,167 INFO L138 BoogieDeclarations]: Found implementation of procedure tower_disconnect [2021-12-28 05:24:40,167 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2021-12-28 05:24:40,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2021-12-28 05:24:40,167 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2021-12-28 05:24:40,167 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2021-12-28 05:24:40,168 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_maxp [2021-12-28 05:24:40,168 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_maxp [2021-12-28 05:24:40,168 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2021-12-28 05:24:40,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2021-12-28 05:24:40,168 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_free_urb [2021-12-28 05:24:40,168 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_free_urb [2021-12-28 05:24:40,168 INFO L130 BoogieDeclarations]: Found specification of procedure poll_wait [2021-12-28 05:24:40,168 INFO L138 BoogieDeclarations]: Found implementation of procedure poll_wait [2021-12-28 05:24:40,168 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2021-12-28 05:24:40,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2021-12-28 05:24:40,169 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_lock_of_lego_usb_tower [2021-12-28 05:24:40,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_lock_of_lego_usb_tower [2021-12-28 05:24:40,169 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-12-28 05:24:40,169 INFO L130 BoogieDeclarations]: Found specification of procedure INIT_LIST_HEAD [2021-12-28 05:24:40,169 INFO L138 BoogieDeclarations]: Found implementation of procedure INIT_LIST_HEAD [2021-12-28 05:24:40,169 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2021-12-28 05:24:40,169 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2021-12-28 05:24:40,170 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-12-28 05:24:40,170 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2021-12-28 05:24:40,170 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2021-12-28 05:24:40,172 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2021-12-28 05:24:40,172 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2021-12-28 05:24:40,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2021-12-28 05:24:40,173 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2021-12-28 05:24:40,173 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2021-12-28 05:24:40,173 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2021-12-28 05:24:40,173 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2021-12-28 05:24:40,173 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_lock_of_lego_usb_tower [2021-12-28 05:24:40,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_lock_of_lego_usb_tower [2021-12-28 05:24:40,174 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2021-12-28 05:24:40,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2021-12-28 05:24:40,174 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_alloc_urb [2021-12-28 05:24:40,174 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_alloc_urb [2021-12-28 05:24:40,174 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-12-28 05:24:40,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2021-12-28 05:24:40,175 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2021-12-28 05:24:40,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2021-12-28 05:24:40,175 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2021-12-28 05:24:40,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2021-12-28 05:24:40,175 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2021-12-28 05:24:40,175 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2021-12-28 05:24:40,175 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-12-28 05:24:40,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2021-12-28 05:24:40,176 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_int_urb [2021-12-28 05:24:40,176 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_int_urb [2021-12-28 05:24:40,176 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_read_buffer_lock_of_lego_usb_tower [2021-12-28 05:24:40,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_spinlock_spin_unlock_read_buffer_lock_of_lego_usb_tower [2021-12-28 05:24:40,176 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2021-12-28 05:24:40,176 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2021-12-28 05:24:40,176 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2021-12-28 05:24:40,176 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2021-12-28 05:24:40,177 INFO L130 BoogieDeclarations]: Found specification of procedure tower_delete [2021-12-28 05:24:40,177 INFO L138 BoogieDeclarations]: Found implementation of procedure tower_delete [2021-12-28 05:24:40,177 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-12-28 05:24:40,177 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2021-12-28 05:24:40,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2021-12-28 05:24:40,177 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2021-12-28 05:24:40,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2021-12-28 05:24:40,177 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2021-12-28 05:24:40,177 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2021-12-28 05:24:40,178 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2021-12-28 05:24:40,178 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2021-12-28 05:24:40,178 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2021-12-28 05:24:40,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2021-12-28 05:24:40,178 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-12-28 05:24:40,178 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2021-12-28 05:24:40,178 INFO L130 BoogieDeclarations]: Found specification of procedure tower_check_for_read_packet [2021-12-28 05:24:40,178 INFO L138 BoogieDeclarations]: Found implementation of procedure tower_check_for_read_packet [2021-12-28 05:24:40,179 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-28 05:24:40,179 INFO L130 BoogieDeclarations]: Found specification of procedure tower_abort_transfers [2021-12-28 05:24:40,179 INFO L138 BoogieDeclarations]: Found implementation of procedure tower_abort_transfers [2021-12-28 05:24:40,179 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_irq_111 [2021-12-28 05:24:40,179 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_irq_111 [2021-12-28 05:24:40,679 INFO L234 CfgBuilder]: Building ICFG [2021-12-28 05:24:40,681 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-28 05:24:40,900 INFO L766 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2021-12-28 05:24:43,391 INFO L275 CfgBuilder]: Performing block encoding [2021-12-28 05:24:43,407 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-28 05:24:43,407 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2021-12-28 05:24:43,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:24:43 BoogieIcfgContainer [2021-12-28 05:24:43,412 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-28 05:24:43,415 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-28 05:24:43,415 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-28 05:24:43,418 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-28 05:24:43,418 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.12 05:24:37" (1/3) ... [2021-12-28 05:24:43,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a457e03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:24:43, skipping insertion in model container [2021-12-28 05:24:43,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.12 05:24:39" (2/3) ... [2021-12-28 05:24:43,433 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a457e03 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.12 05:24:43, skipping insertion in model container [2021-12-28 05:24:43,433 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.12 05:24:43" (3/3) ... [2021-12-28 05:24:43,434 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--usb--misc--legousbtower.ko.cil.i [2021-12-28 05:24:43,438 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-28 05:24:43,438 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2021-12-28 05:24:43,478 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-28 05:24:43,483 INFO L339 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-28 05:24:43,483 INFO L340 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2021-12-28 05:24:43,520 INFO L276 IsEmpty]: Start isEmpty. Operand has 988 states, 642 states have (on average 1.2819314641744548) internal successors, (823), 687 states have internal predecessors, (823), 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) [2021-12-28 05:24:43,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2021-12-28 05:24:43,533 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:24:43,533 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:24:43,536 INFO L402 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)] === [2021-12-28 05:24:43,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:24:43,541 INFO L85 PathProgramCache]: Analyzing trace with hash 248613159, now seen corresponding path program 1 times [2021-12-28 05:24:43,548 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:24:43,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061641390] [2021-12-28 05:24:43,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:24:43,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:24:43,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:44,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:24:44,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:44,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:24:44,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:44,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:24:44,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:44,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 05:24:44,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:44,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 05:24:44,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:44,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 05:24:44,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:44,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 05:24:44,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:44,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:24:44,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:44,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 05:24:44,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:44,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-28 05:24:44,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:44,135 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-28 05:24:44,135 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:24:44,136 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061641390] [2021-12-28 05:24:44,136 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061641390] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:24:44,136 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:24:44,136 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:24:44,138 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202984208] [2021-12-28 05:24:44,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:24:44,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:24:44,142 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:24:44,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:24:44,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:24:44,176 INFO L87 Difference]: Start difference. First operand has 988 states, 642 states have (on average 1.2819314641744548) internal successors, (823), 687 states have internal predecessors, (823), 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) [2021-12-28 05:24:46,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:24:46,312 INFO L93 Difference]: Finished difference Result 1927 states and 2626 transitions. [2021-12-28 05:24:46,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:24:46,314 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 [2021-12-28 05:24:46,315 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:24:46,330 INFO L225 Difference]: With dead ends: 1927 [2021-12-28 05:24:46,331 INFO L226 Difference]: Without dead ends: 970 [2021-12-28 05:24:46,338 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:24:46,340 INFO L933 BasicCegarLoop]: 1213 mSDtfsCounter, 1656 mSDsluCounter, 1499 mSDsCounter, 0 mSdLazyCounter, 1064 mSolverCounterSat, 670 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1834 SdHoareTripleChecker+Valid, 2712 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 [2021-12-28 05:24:46,341 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1834 Valid, 2712 Invalid, 1734 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [670 Valid, 1064 Invalid, 0 Unknown, 0 Unchecked, 1.9s Time] [2021-12-28 05:24:46,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 970 states. [2021-12-28 05:24:46,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 970 to 970. [2021-12-28 05:24:46,432 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 970 states, 632 states have (on average 1.2294303797468353) internal successors, (777), 672 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) [2021-12-28 05:24:46,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 970 states to 970 states and 1245 transitions. [2021-12-28 05:24:46,440 INFO L78 Accepts]: Start accepts. Automaton has 970 states and 1245 transitions. Word has length 71 [2021-12-28 05:24:46,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:24:46,442 INFO L470 AbstractCegarLoop]: Abstraction has 970 states and 1245 transitions. [2021-12-28 05:24:46,442 INFO L471 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) [2021-12-28 05:24:46,442 INFO L276 IsEmpty]: Start isEmpty. Operand 970 states and 1245 transitions. [2021-12-28 05:24:46,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2021-12-28 05:24:46,445 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:24:46,445 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:24:46,446 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-12-28 05:24:46,446 INFO L402 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)] === [2021-12-28 05:24:46,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:24:46,446 INFO L85 PathProgramCache]: Analyzing trace with hash 544752548, now seen corresponding path program 1 times [2021-12-28 05:24:46,447 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:24:46,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687303743] [2021-12-28 05:24:46,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:24:46,447 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:24:46,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:46,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:24:46,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:46,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:24:46,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:46,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:24:46,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:46,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 05:24:46,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:46,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 05:24:46,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:46,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 05:24:46,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:46,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 05:24:46,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:46,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:24:46,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:46,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 05:24:46,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:46,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-28 05:24:46,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:46,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-28 05:24:46,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:46,659 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-28 05:24:46,659 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:24:46,659 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687303743] [2021-12-28 05:24:46,660 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687303743] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:24:46,660 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:24:46,660 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:24:46,660 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509320582] [2021-12-28 05:24:46,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:24:46,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:24:46,662 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:24:46,662 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:24:46,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:24:46,663 INFO L87 Difference]: Start difference. First operand 970 states and 1245 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) [2021-12-28 05:24:48,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:24:48,566 INFO L93 Difference]: Finished difference Result 970 states and 1245 transitions. [2021-12-28 05:24:48,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:24:48,567 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 [2021-12-28 05:24:48,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:24:48,573 INFO L225 Difference]: With dead ends: 970 [2021-12-28 05:24:48,574 INFO L226 Difference]: Without dead ends: 968 [2021-12-28 05:24:48,574 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:24:48,575 INFO L933 BasicCegarLoop]: 1193 mSDtfsCounter, 1622 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 1050 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1797 SdHoareTripleChecker+Valid, 2672 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.8s IncrementalHoareTripleChecker+Time [2021-12-28 05:24:48,575 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1797 Valid, 2672 Invalid, 1710 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1050 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2021-12-28 05:24:48,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2021-12-28 05:24:48,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 968. [2021-12-28 05:24:48,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 968 states, 631 states have (on average 1.2282091917591125) internal successors, (775), 670 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) [2021-12-28 05:24:48,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 968 states to 968 states and 1243 transitions. [2021-12-28 05:24:48,625 INFO L78 Accepts]: Start accepts. Automaton has 968 states and 1243 transitions. Word has length 77 [2021-12-28 05:24:48,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:24:48,625 INFO L470 AbstractCegarLoop]: Abstraction has 968 states and 1243 transitions. [2021-12-28 05:24:48,626 INFO L471 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) [2021-12-28 05:24:48,626 INFO L276 IsEmpty]: Start isEmpty. Operand 968 states and 1243 transitions. [2021-12-28 05:24:48,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2021-12-28 05:24:48,628 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:24:48,628 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:24:48,628 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-12-28 05:24:48,629 INFO L402 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)] === [2021-12-28 05:24:48,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:24:48,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1429765362, now seen corresponding path program 1 times [2021-12-28 05:24:48,629 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:24:48,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [888527354] [2021-12-28 05:24:48,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:24:48,630 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:24:48,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:48,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:24:48,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:48,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:24:48,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:48,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:24:48,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:48,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 05:24:48,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:48,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 05:24:48,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:48,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 05:24:48,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:48,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 05:24:48,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:48,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:24:48,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:48,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 05:24:48,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:48,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-28 05:24:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:48,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-28 05:24:48,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:48,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 05:24:48,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:48,853 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-28 05:24:48,853 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:24:48,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [888527354] [2021-12-28 05:24:48,854 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [888527354] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:24:48,854 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:24:48,854 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:24:48,854 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301974258] [2021-12-28 05:24:48,855 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:24:48,855 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:24:48,855 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:24:48,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:24:48,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:24:48,857 INFO L87 Difference]: Start difference. First operand 968 states and 1243 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) [2021-12-28 05:24:50,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:24:50,697 INFO L93 Difference]: Finished difference Result 968 states and 1243 transitions. [2021-12-28 05:24:50,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:24:50,697 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 [2021-12-28 05:24:50,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:24:50,703 INFO L225 Difference]: With dead ends: 968 [2021-12-28 05:24:50,703 INFO L226 Difference]: Without dead ends: 966 [2021-12-28 05:24:50,704 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:24:50,705 INFO L933 BasicCegarLoop]: 1191 mSDtfsCounter, 1616 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 1048 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1790 SdHoareTripleChecker+Valid, 2670 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.7s IncrementalHoareTripleChecker+Time [2021-12-28 05:24:50,705 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1790 Valid, 2670 Invalid, 1708 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1048 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-12-28 05:24:50,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 966 states. [2021-12-28 05:24:50,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 966 to 966. [2021-12-28 05:24:50,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 966 states, 630 states have (on average 1.226984126984127) internal successors, (773), 668 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) [2021-12-28 05:24:50,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 966 states to 966 states and 1241 transitions. [2021-12-28 05:24:50,764 INFO L78 Accepts]: Start accepts. Automaton has 966 states and 1241 transitions. Word has length 83 [2021-12-28 05:24:50,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:24:50,764 INFO L470 AbstractCegarLoop]: Abstraction has 966 states and 1241 transitions. [2021-12-28 05:24:50,765 INFO L471 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) [2021-12-28 05:24:50,765 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1241 transitions. [2021-12-28 05:24:50,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2021-12-28 05:24:50,766 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:24:50,766 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:24:50,767 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-12-28 05:24:50,767 INFO L402 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)] === [2021-12-28 05:24:50,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:24:50,767 INFO L85 PathProgramCache]: Analyzing trace with hash -454572405, now seen corresponding path program 1 times [2021-12-28 05:24:50,767 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:24:50,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [525610695] [2021-12-28 05:24:50,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:24:50,768 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:24:50,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:50,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:24:50,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:50,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:24:50,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:50,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:24:50,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:50,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 05:24:50,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:50,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 05:24:50,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:50,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 05:24:50,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:50,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 05:24:50,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:50,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:24:50,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:50,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 05:24:50,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:50,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-28 05:24:50,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:50,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-28 05:24:50,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:50,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 05:24:50,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:50,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-28 05:24:50,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:50,987 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-28 05:24:50,987 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:24:50,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [525610695] [2021-12-28 05:24:50,987 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [525610695] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:24:50,987 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:24:50,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:24:50,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182432050] [2021-12-28 05:24:50,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:24:50,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:24:50,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:24:50,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:24:50,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:24:50,989 INFO L87 Difference]: Start difference. First operand 966 states and 1241 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) [2021-12-28 05:24:52,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:24:52,568 INFO L93 Difference]: Finished difference Result 966 states and 1241 transitions. [2021-12-28 05:24:52,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:24:52,569 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 [2021-12-28 05:24:52,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:24:52,574 INFO L225 Difference]: With dead ends: 966 [2021-12-28 05:24:52,574 INFO L226 Difference]: Without dead ends: 964 [2021-12-28 05:24:52,575 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:24:52,580 INFO L933 BasicCegarLoop]: 1189 mSDtfsCounter, 1610 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 1046 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1783 SdHoareTripleChecker+Valid, 2668 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.5s IncrementalHoareTripleChecker+Time [2021-12-28 05:24:52,582 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1783 Valid, 2668 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1046 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-12-28 05:24:52,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 964 states. [2021-12-28 05:24:52,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 964 to 964. [2021-12-28 05:24:52,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 964 states, 629 states have (on average 1.2257551669316376) internal successors, (771), 666 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) [2021-12-28 05:24:52,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 964 states to 964 states and 1239 transitions. [2021-12-28 05:24:52,621 INFO L78 Accepts]: Start accepts. Automaton has 964 states and 1239 transitions. Word has length 89 [2021-12-28 05:24:52,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:24:52,621 INFO L470 AbstractCegarLoop]: Abstraction has 964 states and 1239 transitions. [2021-12-28 05:24:52,622 INFO L471 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) [2021-12-28 05:24:52,622 INFO L276 IsEmpty]: Start isEmpty. Operand 964 states and 1239 transitions. [2021-12-28 05:24:52,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2021-12-28 05:24:52,624 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:24:52,624 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:24:52,625 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-12-28 05:24:52,625 INFO L402 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)] === [2021-12-28 05:24:52,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:24:52,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1517419958, now seen corresponding path program 1 times [2021-12-28 05:24:52,625 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:24:52,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [960981094] [2021-12-28 05:24:52,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:24:52,626 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:24:52,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:52,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:24:52,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:52,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:24:52,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:52,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:24:52,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:52,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 05:24:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:52,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 05:24:52,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:52,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 05:24:52,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:52,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 05:24:52,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:52,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:24:52,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:52,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 05:24:52,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:52,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-28 05:24:52,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:52,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-28 05:24:52,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:52,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 05:24:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:52,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-28 05:24:52,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:52,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-28 05:24:52,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:52,837 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-28 05:24:52,838 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:24:52,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [960981094] [2021-12-28 05:24:52,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [960981094] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:24:52,838 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:24:52,838 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:24:52,838 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1706083846] [2021-12-28 05:24:52,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:24:52,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:24:52,839 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:24:52,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:24:52,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:24:52,840 INFO L87 Difference]: Start difference. First operand 964 states and 1239 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) [2021-12-28 05:24:54,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:24:54,408 INFO L93 Difference]: Finished difference Result 964 states and 1239 transitions. [2021-12-28 05:24:54,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:24:54,409 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 [2021-12-28 05:24:54,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:24:54,414 INFO L225 Difference]: With dead ends: 964 [2021-12-28 05:24:54,414 INFO L226 Difference]: Without dead ends: 962 [2021-12-28 05:24:54,414 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:24:54,415 INFO L933 BasicCegarLoop]: 1187 mSDtfsCounter, 1604 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 1044 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1776 SdHoareTripleChecker+Valid, 2666 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.5s IncrementalHoareTripleChecker+Time [2021-12-28 05:24:54,415 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1776 Valid, 2666 Invalid, 1704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1044 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-12-28 05:24:54,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2021-12-28 05:24:54,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 962. [2021-12-28 05:24:54,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 962 states, 628 states have (on average 1.2245222929936306) internal successors, (769), 664 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) [2021-12-28 05:24:54,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 962 states to 962 states and 1237 transitions. [2021-12-28 05:24:54,453 INFO L78 Accepts]: Start accepts. Automaton has 962 states and 1237 transitions. Word has length 95 [2021-12-28 05:24:54,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:24:54,454 INFO L470 AbstractCegarLoop]: Abstraction has 962 states and 1237 transitions. [2021-12-28 05:24:54,454 INFO L471 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) [2021-12-28 05:24:54,454 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1237 transitions. [2021-12-28 05:24:54,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2021-12-28 05:24:54,455 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:24:54,456 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:24:54,456 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-12-28 05:24:54,456 INFO L402 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)] === [2021-12-28 05:24:54,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:24:54,456 INFO L85 PathProgramCache]: Analyzing trace with hash 179646454, now seen corresponding path program 1 times [2021-12-28 05:24:54,457 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:24:54,457 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083844106] [2021-12-28 05:24:54,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:24:54,457 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:24:54,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:54,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:24:54,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:54,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:24:54,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:54,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:24:54,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:54,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 05:24:54,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:54,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 05:24:54,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:54,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 05:24:54,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:54,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 05:24:54,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:54,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:24:54,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:54,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 05:24:54,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:54,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-28 05:24:54,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:54,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-28 05:24:54,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:54,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 05:24:54,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:54,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-28 05:24:54,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:54,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-28 05:24:54,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:54,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-28 05:24:54,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:54,655 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-28 05:24:54,655 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:24:54,655 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083844106] [2021-12-28 05:24:54,656 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083844106] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:24:54,656 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:24:54,656 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:24:54,656 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176119441] [2021-12-28 05:24:54,656 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:24:54,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:24:54,657 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:24:54,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:24:54,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:24:54,658 INFO L87 Difference]: Start difference. First operand 962 states and 1237 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) [2021-12-28 05:24:56,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:24:56,499 INFO L93 Difference]: Finished difference Result 962 states and 1237 transitions. [2021-12-28 05:24:56,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:24:56,499 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 [2021-12-28 05:24:56,500 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:24:56,504 INFO L225 Difference]: With dead ends: 962 [2021-12-28 05:24:56,504 INFO L226 Difference]: Without dead ends: 960 [2021-12-28 05:24:56,505 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:24:56,505 INFO L933 BasicCegarLoop]: 1185 mSDtfsCounter, 1598 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 1042 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1769 SdHoareTripleChecker+Valid, 2664 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.7s IncrementalHoareTripleChecker+Time [2021-12-28 05:24:56,506 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1769 Valid, 2664 Invalid, 1702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1042 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2021-12-28 05:24:56,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2021-12-28 05:24:56,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 960. [2021-12-28 05:24:56,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 960 states, 627 states have (on average 1.223285486443381) internal successors, (767), 662 states have internal predecessors, (767), 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) [2021-12-28 05:24:56,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1235 transitions. [2021-12-28 05:24:56,543 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1235 transitions. Word has length 101 [2021-12-28 05:24:56,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:24:56,544 INFO L470 AbstractCegarLoop]: Abstraction has 960 states and 1235 transitions. [2021-12-28 05:24:56,544 INFO L471 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) [2021-12-28 05:24:56,544 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1235 transitions. [2021-12-28 05:24:56,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2021-12-28 05:24:56,546 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:24:56,547 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:24:56,547 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-12-28 05:24:56,548 INFO L402 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)] === [2021-12-28 05:24:56,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:24:56,548 INFO L85 PathProgramCache]: Analyzing trace with hash -862139684, now seen corresponding path program 1 times [2021-12-28 05:24:56,549 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:24:56,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036457978] [2021-12-28 05:24:56,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:24:56,549 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:24:56,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:56,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:24:56,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:56,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:24:56,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:56,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:24:56,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:56,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 05:24:56,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:56,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 05:24:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:56,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 05:24:56,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:56,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 05:24:56,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:56,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:24:56,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:56,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 05:24:56,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:56,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-28 05:24:56,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:56,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-28 05:24:56,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:56,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 05:24:56,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:56,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-28 05:24:56,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:56,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-28 05:24:56,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:56,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-28 05:24:56,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:56,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-28 05:24:56,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:56,749 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-28 05:24:56,749 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:24:56,749 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036457978] [2021-12-28 05:24:56,749 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036457978] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:24:56,749 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:24:56,750 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:24:56,750 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586049850] [2021-12-28 05:24:56,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:24:56,750 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:24:56,750 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:24:56,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:24:56,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:24:56,751 INFO L87 Difference]: Start difference. First operand 960 states and 1235 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) [2021-12-28 05:24:58,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:24:58,340 INFO L93 Difference]: Finished difference Result 960 states and 1235 transitions. [2021-12-28 05:24:58,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:24:58,341 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 [2021-12-28 05:24:58,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:24:58,346 INFO L225 Difference]: With dead ends: 960 [2021-12-28 05:24:58,346 INFO L226 Difference]: Without dead ends: 958 [2021-12-28 05:24:58,346 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:24:58,347 INFO L933 BasicCegarLoop]: 1183 mSDtfsCounter, 1592 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 1040 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1762 SdHoareTripleChecker+Valid, 2662 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.5s IncrementalHoareTripleChecker+Time [2021-12-28 05:24:58,347 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1762 Valid, 2662 Invalid, 1700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1040 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-12-28 05:24:58,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 958 states. [2021-12-28 05:24:58,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 958 to 958. [2021-12-28 05:24:58,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 958 states, 626 states have (on average 1.2220447284345048) internal successors, (765), 660 states have internal predecessors, (765), 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) [2021-12-28 05:24:58,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1233 transitions. [2021-12-28 05:24:58,385 INFO L78 Accepts]: Start accepts. Automaton has 958 states and 1233 transitions. Word has length 107 [2021-12-28 05:24:58,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:24:58,385 INFO L470 AbstractCegarLoop]: Abstraction has 958 states and 1233 transitions. [2021-12-28 05:24:58,385 INFO L471 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) [2021-12-28 05:24:58,386 INFO L276 IsEmpty]: Start isEmpty. Operand 958 states and 1233 transitions. [2021-12-28 05:24:58,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2021-12-28 05:24:58,387 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:24:58,387 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:24:58,387 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-12-28 05:24:58,387 INFO L402 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)] === [2021-12-28 05:24:58,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:24:58,388 INFO L85 PathProgramCache]: Analyzing trace with hash 215029627, now seen corresponding path program 1 times [2021-12-28 05:24:58,388 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:24:58,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932981431] [2021-12-28 05:24:58,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:24:58,389 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:24:58,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:58,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:24:58,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:58,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:24:58,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:58,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:24:58,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:58,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 05:24:58,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:58,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 05:24:58,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:58,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 05:24:58,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:58,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 05:24:58,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:58,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:24:58,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:58,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 05:24:58,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:58,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-28 05:24:58,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:58,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-28 05:24:58,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:58,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 05:24:58,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:58,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-28 05:24:58,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:58,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-28 05:24:58,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:58,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-28 05:24:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:58,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-28 05:24:58,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:58,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-28 05:24:58,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:24:58,651 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-28 05:24:58,652 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:24:58,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932981431] [2021-12-28 05:24:58,652 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932981431] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:24:58,652 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:24:58,652 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:24:58,653 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1282918004] [2021-12-28 05:24:58,653 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:24:58,653 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:24:58,653 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:24:58,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:24:58,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:24:58,654 INFO L87 Difference]: Start difference. First operand 958 states and 1233 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) [2021-12-28 05:25:00,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:25:00,358 INFO L93 Difference]: Finished difference Result 958 states and 1233 transitions. [2021-12-28 05:25:00,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:25:00,359 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 [2021-12-28 05:25:00,359 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:25:00,364 INFO L225 Difference]: With dead ends: 958 [2021-12-28 05:25:00,364 INFO L226 Difference]: Without dead ends: 956 [2021-12-28 05:25:00,364 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:25:00,365 INFO L933 BasicCegarLoop]: 1181 mSDtfsCounter, 1590 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1759 SdHoareTripleChecker+Valid, 2660 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.6s IncrementalHoareTripleChecker+Time [2021-12-28 05:25:00,365 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1759 Valid, 2660 Invalid, 1694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-12-28 05:25:00,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 956 states. [2021-12-28 05:25:00,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 956 to 956. [2021-12-28 05:25:00,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 956 states, 625 states have (on average 1.2208) internal successors, (763), 658 states have internal predecessors, (763), 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) [2021-12-28 05:25:00,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 956 states to 956 states and 1231 transitions. [2021-12-28 05:25:00,400 INFO L78 Accepts]: Start accepts. Automaton has 956 states and 1231 transitions. Word has length 113 [2021-12-28 05:25:00,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:25:00,401 INFO L470 AbstractCegarLoop]: Abstraction has 956 states and 1231 transitions. [2021-12-28 05:25:00,401 INFO L471 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) [2021-12-28 05:25:00,401 INFO L276 IsEmpty]: Start isEmpty. Operand 956 states and 1231 transitions. [2021-12-28 05:25:00,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2021-12-28 05:25:00,402 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:00,403 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:25:00,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-12-28 05:25:00,403 INFO L402 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)] === [2021-12-28 05:25:00,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:00,403 INFO L85 PathProgramCache]: Analyzing trace with hash 485176158, now seen corresponding path program 1 times [2021-12-28 05:25:00,404 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:00,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607968449] [2021-12-28 05:25:00,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:00,404 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:00,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:00,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:00,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:00,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:00,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:00,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:25:00,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:00,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 05:25:00,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:00,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 05:25:00,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:00,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 05:25:00,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:00,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 05:25:00,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:00,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:00,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:00,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 05:25:00,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:00,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-28 05:25:00,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:00,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-28 05:25:00,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:00,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 05:25:00,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:00,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-28 05:25:00,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:00,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-28 05:25:00,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:00,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-28 05:25:00,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:00,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-28 05:25:00,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:00,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-28 05:25:00,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:00,602 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-28 05:25:00,602 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:00,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607968449] [2021-12-28 05:25:00,603 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607968449] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:00,603 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:25:00,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:25:00,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555115925] [2021-12-28 05:25:00,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:00,604 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:25:00,604 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:00,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:25:00,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:25:00,605 INFO L87 Difference]: Start difference. First operand 956 states and 1231 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) [2021-12-28 05:25:02,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:25:02,147 INFO L93 Difference]: Finished difference Result 956 states and 1231 transitions. [2021-12-28 05:25:02,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:25:02,148 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 [2021-12-28 05:25:02,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:25:02,152 INFO L225 Difference]: With dead ends: 956 [2021-12-28 05:25:02,152 INFO L226 Difference]: Without dead ends: 954 [2021-12-28 05:25:02,153 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:25:02,153 INFO L933 BasicCegarLoop]: 1179 mSDtfsCounter, 1578 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 1036 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1747 SdHoareTripleChecker+Valid, 2658 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.4s IncrementalHoareTripleChecker+Time [2021-12-28 05:25:02,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1747 Valid, 2658 Invalid, 1696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1036 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-12-28 05:25:02,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 954 states. [2021-12-28 05:25:02,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 954 to 954. [2021-12-28 05:25:02,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 954 states, 624 states have (on average 1.2195512820512822) internal successors, (761), 656 states have internal predecessors, (761), 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) [2021-12-28 05:25:02,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 954 states to 954 states and 1229 transitions. [2021-12-28 05:25:02,210 INFO L78 Accepts]: Start accepts. Automaton has 954 states and 1229 transitions. Word has length 115 [2021-12-28 05:25:02,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:25:02,210 INFO L470 AbstractCegarLoop]: Abstraction has 954 states and 1229 transitions. [2021-12-28 05:25:02,211 INFO L471 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) [2021-12-28 05:25:02,211 INFO L276 IsEmpty]: Start isEmpty. Operand 954 states and 1229 transitions. [2021-12-28 05:25:02,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2021-12-28 05:25:02,213 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:02,213 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:25:02,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-12-28 05:25:02,214 INFO L402 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)] === [2021-12-28 05:25:02,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:02,214 INFO L85 PathProgramCache]: Analyzing trace with hash 907436211, now seen corresponding path program 1 times [2021-12-28 05:25:02,214 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:02,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510386440] [2021-12-28 05:25:02,215 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:02,215 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:02,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:02,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:02,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:02,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:02,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:02,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:25:02,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:02,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 05:25:02,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:02,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 05:25:02,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:02,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 05:25:02,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:02,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 05:25:02,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:02,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:02,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:02,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 05:25:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:02,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-28 05:25:02,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:02,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-28 05:25:02,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:02,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 05:25:02,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:02,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-28 05:25:02,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:02,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-28 05:25:02,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:02,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-28 05:25:02,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:02,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-28 05:25:02,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:02,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-28 05:25:02,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:02,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-28 05:25:02,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:02,393 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-28 05:25:02,393 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:02,393 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510386440] [2021-12-28 05:25:02,393 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510386440] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:02,393 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:25:02,393 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:25:02,393 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2002625014] [2021-12-28 05:25:02,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:02,394 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:25:02,394 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:02,394 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:25:02,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:25:02,395 INFO L87 Difference]: Start difference. First operand 954 states and 1229 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) [2021-12-28 05:25:03,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:25:03,901 INFO L93 Difference]: Finished difference Result 954 states and 1229 transitions. [2021-12-28 05:25:03,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:25:03,908 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 [2021-12-28 05:25:03,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:25:03,913 INFO L225 Difference]: With dead ends: 954 [2021-12-28 05:25:03,913 INFO L226 Difference]: Without dead ends: 952 [2021-12-28 05:25:03,913 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:25:03,914 INFO L933 BasicCegarLoop]: 1177 mSDtfsCounter, 1574 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 1034 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1742 SdHoareTripleChecker+Valid, 2656 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.4s IncrementalHoareTripleChecker+Time [2021-12-28 05:25:03,916 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1742 Valid, 2656 Invalid, 1694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1034 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2021-12-28 05:25:03,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2021-12-28 05:25:03,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 952. [2021-12-28 05:25:03,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 623 states have (on average 1.218298555377207) 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) [2021-12-28 05:25:03,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1227 transitions. [2021-12-28 05:25:03,961 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1227 transitions. Word has length 121 [2021-12-28 05:25:03,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:25:03,963 INFO L470 AbstractCegarLoop]: Abstraction has 952 states and 1227 transitions. [2021-12-28 05:25:03,963 INFO L471 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) [2021-12-28 05:25:03,963 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1227 transitions. [2021-12-28 05:25:03,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-12-28 05:25:03,965 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:03,965 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:25:03,965 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-12-28 05:25:03,965 INFO L402 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)] === [2021-12-28 05:25:03,966 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:03,966 INFO L85 PathProgramCache]: Analyzing trace with hash -289800848, now seen corresponding path program 1 times [2021-12-28 05:25:03,966 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:03,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1454488920] [2021-12-28 05:25:03,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:03,966 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:04,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:04,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:04,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:04,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:04,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:04,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:25:04,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:04,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 05:25:04,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:04,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-28 05:25:04,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:04,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:04,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:04,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:04,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:04,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:04,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:04,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-28 05:25:04,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:04,219 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:04,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:04,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:04,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:04,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:04,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:04,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-28 05:25:04,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:04,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:04,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:04,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:04,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:04,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:04,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:04,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-28 05:25:04,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:04,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:04,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:04,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:04,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:04,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:04,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:04,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-28 05:25:04,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:04,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:04,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:04,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:04,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:04,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:04,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-28 05:25:04,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:04,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-28 05:25:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:04,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-12-28 05:25:04,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:04,348 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2021-12-28 05:25:04,349 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:04,349 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1454488920] [2021-12-28 05:25:04,349 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1454488920] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:04,349 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:25:04,349 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-28 05:25:04,350 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854518270] [2021-12-28 05:25:04,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:04,350 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 05:25:04,350 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:04,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 05:25:04,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-28 05:25:04,351 INFO L87 Difference]: Start difference. First operand 952 states and 1227 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) [2021-12-28 05:25:07,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:25:07,398 INFO L93 Difference]: Finished difference Result 1878 states and 2427 transitions. [2021-12-28 05:25:07,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 05:25:07,399 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 [2021-12-28 05:25:07,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:25:07,406 INFO L225 Difference]: With dead ends: 1878 [2021-12-28 05:25:07,406 INFO L226 Difference]: Without dead ends: 965 [2021-12-28 05:25:07,409 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:25:07,410 INFO L933 BasicCegarLoop]: 1171 mSDtfsCounter, 1892 mSDsluCounter, 2952 mSDsCounter, 0 mSdLazyCounter, 2670 mSolverCounterSat, 954 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2074 SdHoareTripleChecker+Valid, 4123 SdHoareTripleChecker+Invalid, 3624 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 954 IncrementalHoareTripleChecker+Valid, 2670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2021-12-28 05:25:07,410 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2074 Valid, 4123 Invalid, 3624 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [954 Valid, 2670 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2021-12-28 05:25:07,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2021-12-28 05:25:07,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 952. [2021-12-28 05:25:07,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 952 states, 623 states have (on average 1.21669341894061) internal successors, (758), 654 states have internal predecessors, (758), 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) [2021-12-28 05:25:07,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1226 transitions. [2021-12-28 05:25:07,459 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1226 transitions. Word has length 164 [2021-12-28 05:25:07,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:25:07,460 INFO L470 AbstractCegarLoop]: Abstraction has 952 states and 1226 transitions. [2021-12-28 05:25:07,461 INFO L471 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) [2021-12-28 05:25:07,461 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1226 transitions. [2021-12-28 05:25:07,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2021-12-28 05:25:07,462 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:07,463 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:25:07,463 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-12-28 05:25:07,463 INFO L402 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)] === [2021-12-28 05:25:07,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:07,463 INFO L85 PathProgramCache]: Analyzing trace with hash -289741266, now seen corresponding path program 1 times [2021-12-28 05:25:07,463 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:07,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817759610] [2021-12-28 05:25:07,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:07,464 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:07,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:07,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:07,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:07,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:07,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:07,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:25:07,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:07,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 05:25:07,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:07,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-28 05:25:07,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:07,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:07,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:07,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:07,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:07,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:07,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:07,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-28 05:25:07,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:07,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:07,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:07,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:07,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:07,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:07,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-28 05:25:07,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:07,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:07,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:07,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:07,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:07,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-28 05:25:07,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:07,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:07,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:07,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:07,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:07,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:07,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:07,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-28 05:25:07,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:07,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:07,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:07,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:07,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:07,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:07,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:07,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-28 05:25:07,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:07,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-28 05:25:07,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:07,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2021-12-28 05:25:07,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:07,717 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2021-12-28 05:25:07,717 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:07,717 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817759610] [2021-12-28 05:25:07,717 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817759610] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:07,717 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:25:07,717 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-12-28 05:25:07,717 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204293107] [2021-12-28 05:25:07,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:07,718 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-12-28 05:25:07,718 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:07,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-12-28 05:25:07,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-12-28 05:25:07,719 INFO L87 Difference]: Start difference. First operand 952 states and 1226 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) [2021-12-28 05:25:09,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:25:09,958 INFO L93 Difference]: Finished difference Result 965 states and 1247 transitions. [2021-12-28 05:25:09,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-28 05:25:09,960 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 [2021-12-28 05:25:09,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:25:09,964 INFO L225 Difference]: With dead ends: 965 [2021-12-28 05:25:09,964 INFO L226 Difference]: Without dead ends: 963 [2021-12-28 05:25:09,965 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:25:09,966 INFO L933 BasicCegarLoop]: 1172 mSDtfsCounter, 967 mSDsluCounter, 2520 mSDsCounter, 0 mSdLazyCounter, 1882 mSolverCounterSat, 848 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 967 SdHoareTripleChecker+Valid, 3692 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.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:25:09,966 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [967 Valid, 3692 Invalid, 2730 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [848 Valid, 1882 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2021-12-28 05:25:09,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states. [2021-12-28 05:25:10,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 950. [2021-12-28 05:25:10,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 622 states have (on average 1.2154340836012862) internal successors, (756), 652 states have internal predecessors, (756), 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) [2021-12-28 05:25:10,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1224 transitions. [2021-12-28 05:25:10,013 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1224 transitions. Word has length 164 [2021-12-28 05:25:10,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:25:10,013 INFO L470 AbstractCegarLoop]: Abstraction has 950 states and 1224 transitions. [2021-12-28 05:25:10,014 INFO L471 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) [2021-12-28 05:25:10,014 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1224 transitions. [2021-12-28 05:25:10,015 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2021-12-28 05:25:10,015 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:10,015 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:25:10,016 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-12-28 05:25:10,016 INFO L402 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)] === [2021-12-28 05:25:10,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:10,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1029929949, now seen corresponding path program 1 times [2021-12-28 05:25:10,016 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:10,017 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097950668] [2021-12-28 05:25:10,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:10,017 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:10,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:10,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:10,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:10,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:10,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:10,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:25:10,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:10,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 05:25:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:10,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 05:25:10,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:10,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 05:25:10,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:10,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 05:25:10,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:10,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:10,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:10,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 05:25:10,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:10,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-28 05:25:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:10,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-28 05:25:10,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:10,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 05:25:10,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:10,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-28 05:25:10,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:10,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-28 05:25:10,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:10,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-28 05:25:10,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:10,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-28 05:25:10,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:10,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-28 05:25:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:10,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-28 05:25:10,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:10,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-28 05:25:10,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:10,240 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-28 05:25:10,241 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:10,241 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097950668] [2021-12-28 05:25:10,241 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097950668] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:10,241 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:25:10,241 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:25:10,241 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607234286] [2021-12-28 05:25:10,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:10,242 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:25:10,242 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:10,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:25:10,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:25:10,243 INFO L87 Difference]: Start difference. First operand 950 states and 1224 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) [2021-12-28 05:25:11,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:25:11,924 INFO L93 Difference]: Finished difference Result 950 states and 1224 transitions. [2021-12-28 05:25:11,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:25:11,925 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 [2021-12-28 05:25:11,925 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:25:11,929 INFO L225 Difference]: With dead ends: 950 [2021-12-28 05:25:11,929 INFO L226 Difference]: Without dead ends: 948 [2021-12-28 05:25:11,930 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:25:11,930 INFO L933 BasicCegarLoop]: 1172 mSDtfsCounter, 1559 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 1029 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1726 SdHoareTripleChecker+Valid, 2651 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 [2021-12-28 05:25:11,930 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1726 Valid, 2651 Invalid, 1689 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1029 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-12-28 05:25:11,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 948 states. [2021-12-28 05:25:11,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 948 to 948. [2021-12-28 05:25:11,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 948 states, 621 states have (on average 1.214170692431562) internal successors, (754), 650 states have internal predecessors, (754), 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) [2021-12-28 05:25:11,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 948 states to 948 states and 1222 transitions. [2021-12-28 05:25:11,974 INFO L78 Accepts]: Start accepts. Automaton has 948 states and 1222 transitions. Word has length 127 [2021-12-28 05:25:11,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:25:11,975 INFO L470 AbstractCegarLoop]: Abstraction has 948 states and 1222 transitions. [2021-12-28 05:25:11,975 INFO L471 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) [2021-12-28 05:25:11,975 INFO L276 IsEmpty]: Start isEmpty. Operand 948 states and 1222 transitions. [2021-12-28 05:25:11,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2021-12-28 05:25:11,977 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:11,977 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:25:11,977 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-12-28 05:25:11,978 INFO L402 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)] === [2021-12-28 05:25:11,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:11,978 INFO L85 PathProgramCache]: Analyzing trace with hash 2095809396, now seen corresponding path program 1 times [2021-12-28 05:25:11,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:11,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14568079] [2021-12-28 05:25:11,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:11,979 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:12,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:12,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:12,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:12,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:12,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:12,096 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:25:12,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:12,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 05:25:12,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:12,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-28 05:25:12,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:12,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:12,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:12,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:12,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:12,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:12,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-28 05:25:12,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:12,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:12,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:12,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:12,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:12,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:12,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:12,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-28 05:25:12,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:12,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:12,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:12,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:12,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:12,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:12,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-28 05:25:12,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:12,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:12,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:12,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:12,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:12,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:12,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:12,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-28 05:25:12,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:12,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:12,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:12,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:12,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:12,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:12,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:12,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-28 05:25:12,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:12,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-28 05:25:12,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:12,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2021-12-28 05:25:12,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:12,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:12,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:12,250 INFO L134 CoverageAnalysis]: Checked inductivity of 377 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 377 trivial. 0 not checked. [2021-12-28 05:25:12,250 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:12,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14568079] [2021-12-28 05:25:12,251 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14568079] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:12,251 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:25:12,251 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:25:12,251 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71001930] [2021-12-28 05:25:12,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:12,252 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:25:12,252 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:12,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:25:12,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:25:12,253 INFO L87 Difference]: Start difference. First operand 948 states and 1222 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) [2021-12-28 05:25:13,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:25:13,877 INFO L93 Difference]: Finished difference Result 1866 states and 2413 transitions. [2021-12-28 05:25:13,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:25:13,877 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 [2021-12-28 05:25:13,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:25:13,882 INFO L225 Difference]: With dead ends: 1866 [2021-12-28 05:25:13,883 INFO L226 Difference]: Without dead ends: 957 [2021-12-28 05:25:13,885 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:25:13,886 INFO L933 BasicCegarLoop]: 1165 mSDtfsCounter, 1853 mSDsluCounter, 1280 mSDsCounter, 0 mSdLazyCounter, 673 mSolverCounterSat, 949 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2034 SdHoareTripleChecker+Valid, 2445 SdHoareTripleChecker+Invalid, 1622 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 949 IncrementalHoareTripleChecker+Valid, 673 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2021-12-28 05:25:13,889 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2034 Valid, 2445 Invalid, 1622 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [949 Valid, 673 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-12-28 05:25:13,891 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2021-12-28 05:25:13,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 944. [2021-12-28 05:25:13,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 944 states, 618 states have (on average 1.2119741100323624) internal successors, (749), 646 states have internal predecessors, (749), 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) [2021-12-28 05:25:13,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 944 states to 944 states and 1217 transitions. [2021-12-28 05:25:13,970 INFO L78 Accepts]: Start accepts. Automaton has 944 states and 1217 transitions. Word has length 171 [2021-12-28 05:25:13,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:25:13,972 INFO L470 AbstractCegarLoop]: Abstraction has 944 states and 1217 transitions. [2021-12-28 05:25:13,972 INFO L471 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) [2021-12-28 05:25:13,972 INFO L276 IsEmpty]: Start isEmpty. Operand 944 states and 1217 transitions. [2021-12-28 05:25:13,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2021-12-28 05:25:13,974 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:13,974 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:25:13,974 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-12-28 05:25:13,975 INFO L402 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)] === [2021-12-28 05:25:13,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:13,975 INFO L85 PathProgramCache]: Analyzing trace with hash 664932848, now seen corresponding path program 1 times [2021-12-28 05:25:13,975 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:13,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735811289] [2021-12-28 05:25:13,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:13,976 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:14,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:14,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:14,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:14,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:14,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:14,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:25:14,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:14,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 05:25:14,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:14,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 05:25:14,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:14,113 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 05:25:14,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:14,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 05:25:14,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:14,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:14,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:14,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 05:25:14,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:14,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-28 05:25:14,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:14,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-28 05:25:14,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:14,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 05:25:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:14,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-28 05:25:14,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:14,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-28 05:25:14,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:14,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-28 05:25:14,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:14,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-28 05:25:14,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:14,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-28 05:25:14,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:14,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-28 05:25:14,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:14,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-28 05:25:14,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:14,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-28 05:25:14,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:14,175 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-28 05:25:14,176 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:14,176 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735811289] [2021-12-28 05:25:14,176 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735811289] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:14,176 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:25:14,176 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:25:14,176 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993683166] [2021-12-28 05:25:14,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:14,177 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:25:14,177 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:14,178 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:25:14,178 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:25:14,178 INFO L87 Difference]: Start difference. First operand 944 states and 1217 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) [2021-12-28 05:25:15,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:25:15,794 INFO L93 Difference]: Finished difference Result 944 states and 1217 transitions. [2021-12-28 05:25:15,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:25:15,795 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 [2021-12-28 05:25:15,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:25:15,798 INFO L225 Difference]: With dead ends: 944 [2021-12-28 05:25:15,799 INFO L226 Difference]: Without dead ends: 942 [2021-12-28 05:25:15,799 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:25:15,800 INFO L933 BasicCegarLoop]: 1165 mSDtfsCounter, 1538 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 1022 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1704 SdHoareTripleChecker+Valid, 2644 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.5s IncrementalHoareTripleChecker+Time [2021-12-28 05:25:15,800 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1704 Valid, 2644 Invalid, 1682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1022 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-12-28 05:25:15,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 942 states. [2021-12-28 05:25:15,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 942 to 942. [2021-12-28 05:25:15,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 942 states, 617 states have (on average 1.2106969205834683) internal successors, (747), 644 states have internal predecessors, (747), 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) [2021-12-28 05:25:15,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 942 states to 942 states and 1215 transitions. [2021-12-28 05:25:15,844 INFO L78 Accepts]: Start accepts. Automaton has 942 states and 1215 transitions. Word has length 133 [2021-12-28 05:25:15,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:25:15,845 INFO L470 AbstractCegarLoop]: Abstraction has 942 states and 1215 transitions. [2021-12-28 05:25:15,845 INFO L471 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) [2021-12-28 05:25:15,845 INFO L276 IsEmpty]: Start isEmpty. Operand 942 states and 1215 transitions. [2021-12-28 05:25:15,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2021-12-28 05:25:15,847 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:15,847 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:25:15,847 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-12-28 05:25:15,847 INFO L402 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)] === [2021-12-28 05:25:15,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:15,848 INFO L85 PathProgramCache]: Analyzing trace with hash -793485747, now seen corresponding path program 1 times [2021-12-28 05:25:15,848 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:15,848 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047418554] [2021-12-28 05:25:15,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:15,848 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:15,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:15,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:15,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:15,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:15,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:15,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:25:15,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:15,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 05:25:15,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:15,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 05:25:15,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:15,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 05:25:15,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:15,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 05:25:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:16,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:16,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:16,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 05:25:16,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:16,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-28 05:25:16,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:16,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 05:25:16,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:16,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 05:25:16,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:16,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:16,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:16,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:16,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:16,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:16,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:16,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-28 05:25:16,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:16,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:16,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:16,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:16,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:16,050 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:16,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:16,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-12-28 05:25:16,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:16,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:16,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:16,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:16,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:16,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:16,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:16,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-28 05:25:16,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:16,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-28 05:25:16,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:16,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-12-28 05:25:16,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:16,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:16,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:16,152 INFO L134 CoverageAnalysis]: Checked inductivity of 276 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 276 trivial. 0 not checked. [2021-12-28 05:25:16,152 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:16,153 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047418554] [2021-12-28 05:25:16,154 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047418554] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:16,154 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:25:16,154 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2021-12-28 05:25:16,155 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1566077370] [2021-12-28 05:25:16,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:16,155 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2021-12-28 05:25:16,156 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:16,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-12-28 05:25:16,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2021-12-28 05:25:16,156 INFO L87 Difference]: Start difference. First operand 942 states and 1215 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) [2021-12-28 05:25:19,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:25:19,424 INFO L93 Difference]: Finished difference Result 1900 states and 2489 transitions. [2021-12-28 05:25:19,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-28 05:25:19,424 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 [2021-12-28 05:25:19,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:25:19,429 INFO L225 Difference]: With dead ends: 1900 [2021-12-28 05:25:19,429 INFO L226 Difference]: Without dead ends: 1232 [2021-12-28 05:25:19,431 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:25:19,432 INFO L933 BasicCegarLoop]: 1289 mSDtfsCounter, 1418 mSDsluCounter, 3903 mSDsCounter, 0 mSdLazyCounter, 3540 mSolverCounterSat, 1233 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1418 SdHoareTripleChecker+Valid, 5192 SdHoareTripleChecker+Invalid, 4773 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1233 IncrementalHoareTripleChecker+Valid, 3540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2021-12-28 05:25:19,432 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1418 Valid, 5192 Invalid, 4773 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1233 Valid, 3540 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2021-12-28 05:25:19,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1232 states. [2021-12-28 05:25:19,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1232 to 947. [2021-12-28 05:25:19,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 947 states, 621 states have (on average 1.209339774557166) internal successors, (751), 648 states have internal predecessors, (751), 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) [2021-12-28 05:25:19,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 947 states to 947 states and 1222 transitions. [2021-12-28 05:25:19,506 INFO L78 Accepts]: Start accepts. Automaton has 947 states and 1222 transitions. Word has length 167 [2021-12-28 05:25:19,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:25:19,507 INFO L470 AbstractCegarLoop]: Abstraction has 947 states and 1222 transitions. [2021-12-28 05:25:19,508 INFO L471 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) [2021-12-28 05:25:19,508 INFO L276 IsEmpty]: Start isEmpty. Operand 947 states and 1222 transitions. [2021-12-28 05:25:19,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2021-12-28 05:25:19,510 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:19,510 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:25:19,510 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-12-28 05:25:19,510 INFO L402 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)] === [2021-12-28 05:25:19,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:19,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1553023, now seen corresponding path program 1 times [2021-12-28 05:25:19,511 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:19,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725240178] [2021-12-28 05:25:19,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:19,511 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:19,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:19,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:19,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:19,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:19,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:19,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:25:19,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:19,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 05:25:19,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:19,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 05:25:19,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:19,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 05:25:19,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:19,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 05:25:19,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:19,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:19,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:19,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 05:25:19,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:19,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-28 05:25:19,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:19,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-28 05:25:19,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:19,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 05:25:19,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:19,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-28 05:25:19,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:19,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-28 05:25:19,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:19,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-28 05:25:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:19,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-28 05:25:19,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:19,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-28 05:25:19,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:19,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-28 05:25:19,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:19,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-28 05:25:19,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:19,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-28 05:25:19,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:19,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-28 05:25:19,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:19,757 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-28 05:25:19,757 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:19,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725240178] [2021-12-28 05:25:19,757 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725240178] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:19,757 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:25:19,757 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:25:19,758 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408533786] [2021-12-28 05:25:19,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:19,759 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:25:19,759 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:19,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:25:19,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:25:19,760 INFO L87 Difference]: Start difference. First operand 947 states and 1222 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) [2021-12-28 05:25:21,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:25:21,428 INFO L93 Difference]: Finished difference Result 947 states and 1222 transitions. [2021-12-28 05:25:21,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:25:21,428 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 [2021-12-28 05:25:21,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:25:21,432 INFO L225 Difference]: With dead ends: 947 [2021-12-28 05:25:21,432 INFO L226 Difference]: Without dead ends: 945 [2021-12-28 05:25:21,432 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:25:21,433 INFO L933 BasicCegarLoop]: 1163 mSDtfsCounter, 1532 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 1020 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1697 SdHoareTripleChecker+Valid, 2642 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.6s IncrementalHoareTripleChecker+Time [2021-12-28 05:25:21,433 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1697 Valid, 2642 Invalid, 1680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1020 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-12-28 05:25:21,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 945 states. [2021-12-28 05:25:21,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 945 to 945. [2021-12-28 05:25:21,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 945 states, 620 states have (on average 1.2080645161290322) internal successors, (749), 646 states have internal predecessors, (749), 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) [2021-12-28 05:25:21,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 945 states to 945 states and 1220 transitions. [2021-12-28 05:25:21,491 INFO L78 Accepts]: Start accepts. Automaton has 945 states and 1220 transitions. Word has length 139 [2021-12-28 05:25:21,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:25:21,492 INFO L470 AbstractCegarLoop]: Abstraction has 945 states and 1220 transitions. [2021-12-28 05:25:21,492 INFO L471 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) [2021-12-28 05:25:21,492 INFO L276 IsEmpty]: Start isEmpty. Operand 945 states and 1220 transitions. [2021-12-28 05:25:21,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2021-12-28 05:25:21,494 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:21,494 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:25:21,494 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-12-28 05:25:21,495 INFO L402 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)] === [2021-12-28 05:25:21,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:21,495 INFO L85 PathProgramCache]: Analyzing trace with hash 155827134, now seen corresponding path program 1 times [2021-12-28 05:25:21,495 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:21,495 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [997135205] [2021-12-28 05:25:21,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:21,496 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:21,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:21,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:21,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:21,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:21,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:21,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:25:21,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:21,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 05:25:21,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:21,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 05:25:21,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:21,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 05:25:21,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:21,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 05:25:21,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:21,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:21,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:21,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 05:25:21,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:21,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-28 05:25:21,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:21,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-28 05:25:21,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:21,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 05:25:21,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:21,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-28 05:25:21,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:21,658 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-28 05:25:21,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:21,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-28 05:25:21,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:21,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-28 05:25:21,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:21,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-28 05:25:21,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:21,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-28 05:25:21,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:21,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-28 05:25:21,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:21,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-28 05:25:21,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:21,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-28 05:25:21,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:21,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-28 05:25:21,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:21,714 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-28 05:25:21,714 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:21,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [997135205] [2021-12-28 05:25:21,715 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [997135205] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:21,715 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:25:21,715 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:25:21,715 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1898371004] [2021-12-28 05:25:21,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:21,716 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:25:21,716 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:21,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:25:21,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:25:21,717 INFO L87 Difference]: Start difference. First operand 945 states and 1220 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) [2021-12-28 05:25:23,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:25:23,461 INFO L93 Difference]: Finished difference Result 945 states and 1220 transitions. [2021-12-28 05:25:23,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:25:23,461 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 [2021-12-28 05:25:23,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:25:23,465 INFO L225 Difference]: With dead ends: 945 [2021-12-28 05:25:23,465 INFO L226 Difference]: Without dead ends: 943 [2021-12-28 05:25:23,466 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:25:23,466 INFO L933 BasicCegarLoop]: 1161 mSDtfsCounter, 1526 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 1018 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1690 SdHoareTripleChecker+Valid, 2640 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 [2021-12-28 05:25:23,467 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1690 Valid, 2640 Invalid, 1678 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1018 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2021-12-28 05:25:23,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 943 states. [2021-12-28 05:25:23,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 943 to 943. [2021-12-28 05:25:23,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 943 states, 619 states have (on average 1.2067851373182552) internal successors, (747), 644 states have internal predecessors, (747), 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) [2021-12-28 05:25:23,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 943 states to 943 states and 1218 transitions. [2021-12-28 05:25:23,522 INFO L78 Accepts]: Start accepts. Automaton has 943 states and 1218 transitions. Word has length 145 [2021-12-28 05:25:23,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:25:23,522 INFO L470 AbstractCegarLoop]: Abstraction has 943 states and 1218 transitions. [2021-12-28 05:25:23,522 INFO L471 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) [2021-12-28 05:25:23,523 INFO L276 IsEmpty]: Start isEmpty. Operand 943 states and 1218 transitions. [2021-12-28 05:25:23,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2021-12-28 05:25:23,525 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:23,525 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:25:23,525 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-12-28 05:25:23,525 INFO L402 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)] === [2021-12-28 05:25:23,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:23,526 INFO L85 PathProgramCache]: Analyzing trace with hash -190426035, now seen corresponding path program 1 times [2021-12-28 05:25:23,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:23,526 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2024120637] [2021-12-28 05:25:23,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:23,526 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:23,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:23,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:23,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:23,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:23,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:23,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:25:23,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:23,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 05:25:23,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:23,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 05:25:23,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:23,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 05:25:23,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:23,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 05:25:23,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:23,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:23,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:23,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 05:25:23,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:23,733 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-28 05:25:23,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:23,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2021-12-28 05:25:23,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:23,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2021-12-28 05:25:23,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:23,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:23,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:23,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:23,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:23,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:23,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:23,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2021-12-28 05:25:23,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:23,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:23,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:23,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:23,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:23,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:23,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:23,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2021-12-28 05:25:23,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:23,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:23,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:23,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:23,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:23,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:23,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:23,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-28 05:25:23,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:23,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2021-12-28 05:25:23,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:23,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2021-12-28 05:25:23,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:23,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:23,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:23,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-12-28 05:25:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:23,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2021-12-28 05:25:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:23,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:25:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:23,879 INFO L134 CoverageAnalysis]: Checked inductivity of 369 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 369 trivial. 0 not checked. [2021-12-28 05:25:23,879 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:23,880 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2024120637] [2021-12-28 05:25:23,880 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2024120637] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:23,880 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:25:23,880 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2021-12-28 05:25:23,880 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1915208138] [2021-12-28 05:25:23,880 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:23,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-28 05:25:23,882 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:23,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-28 05:25:23,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2021-12-28 05:25:23,883 INFO L87 Difference]: Start difference. First operand 943 states and 1218 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) [2021-12-28 05:25:26,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:25:26,047 INFO L93 Difference]: Finished difference Result 1056 states and 1337 transitions. [2021-12-28 05:25:26,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-12-28 05:25:26,048 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 [2021-12-28 05:25:26,048 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:25:26,052 INFO L225 Difference]: With dead ends: 1056 [2021-12-28 05:25:26,053 INFO L226 Difference]: Without dead ends: 1054 [2021-12-28 05:25:26,053 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:25:26,054 INFO L933 BasicCegarLoop]: 1191 mSDtfsCounter, 1876 mSDsluCounter, 2583 mSDsCounter, 0 mSdLazyCounter, 2102 mSolverCounterSat, 1016 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2028 SdHoareTripleChecker+Valid, 3774 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.0s IncrementalHoareTripleChecker+Time [2021-12-28 05:25:26,054 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2028 Valid, 3774 Invalid, 3118 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1016 Valid, 2102 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2021-12-28 05:25:26,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1054 states. [2021-12-28 05:25:26,110 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1054 to 1037. [2021-12-28 05:25:26,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1037 states, 682 states have (on average 1.2023460410557185) internal successors, (820), 707 states have internal predecessors, (820), 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) [2021-12-28 05:25:26,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1037 states to 1037 states and 1315 transitions. [2021-12-28 05:25:26,115 INFO L78 Accepts]: Start accepts. Automaton has 1037 states and 1315 transitions. Word has length 183 [2021-12-28 05:25:26,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:25:26,116 INFO L470 AbstractCegarLoop]: Abstraction has 1037 states and 1315 transitions. [2021-12-28 05:25:26,116 INFO L471 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) [2021-12-28 05:25:26,116 INFO L276 IsEmpty]: Start isEmpty. Operand 1037 states and 1315 transitions. [2021-12-28 05:25:26,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2021-12-28 05:25:26,118 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:26,118 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:25:26,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-12-28 05:25:26,119 INFO L402 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)] === [2021-12-28 05:25:26,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:26,119 INFO L85 PathProgramCache]: Analyzing trace with hash 1747305839, now seen corresponding path program 1 times [2021-12-28 05:25:26,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:26,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301424266] [2021-12-28 05:25:26,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:26,120 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:26,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:26,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:26,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:26,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:26,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:26,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:25:26,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:26,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 05:25:26,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:26,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2021-12-28 05:25:26,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:26,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2021-12-28 05:25:26,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:26,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2021-12-28 05:25:26,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:26,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:26,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:26,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2021-12-28 05:25:26,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:26,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2021-12-28 05:25:26,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:26,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2021-12-28 05:25:26,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:26,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2021-12-28 05:25:26,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:26,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2021-12-28 05:25:26,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:26,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2021-12-28 05:25:26,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:26,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2021-12-28 05:25:26,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:26,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2021-12-28 05:25:26,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:26,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2021-12-28 05:25:26,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:26,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2021-12-28 05:25:26,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:26,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2021-12-28 05:25:26,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:26,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2021-12-28 05:25:26,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:26,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 129 [2021-12-28 05:25:26,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:26,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2021-12-28 05:25:26,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:26,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-28 05:25:26,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:26,351 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2021-12-28 05:25:26,351 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:26,351 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301424266] [2021-12-28 05:25:26,352 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301424266] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:26,352 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:25:26,352 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:25:26,352 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282424134] [2021-12-28 05:25:26,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:26,353 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:25:26,353 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:26,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:25:26,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:25:26,354 INFO L87 Difference]: Start difference. First operand 1037 states and 1315 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) [2021-12-28 05:25:27,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-28 05:25:27,966 INFO L93 Difference]: Finished difference Result 1037 states and 1315 transitions. [2021-12-28 05:25:27,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-12-28 05:25:27,966 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 [2021-12-28 05:25:27,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-28 05:25:27,970 INFO L225 Difference]: With dead ends: 1037 [2021-12-28 05:25:27,970 INFO L226 Difference]: Without dead ends: 1035 [2021-12-28 05:25:27,971 INFO L932 BasicCegarLoop]: 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 [2021-12-28 05:25:27,971 INFO L933 BasicCegarLoop]: 1159 mSDtfsCounter, 1520 mSDsluCounter, 1479 mSDsCounter, 0 mSdLazyCounter, 1016 mSolverCounterSat, 660 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1683 SdHoareTripleChecker+Valid, 2638 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.5s IncrementalHoareTripleChecker+Time [2021-12-28 05:25:27,971 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1683 Valid, 2638 Invalid, 1676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [660 Valid, 1016 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2021-12-28 05:25:27,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1035 states. [2021-12-28 05:25:28,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1035 to 1035. [2021-12-28 05:25:28,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1035 states, 681 states have (on average 1.2011747430249633) internal successors, (818), 705 states have internal predecessors, (818), 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) [2021-12-28 05:25:28,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1035 states to 1035 states and 1313 transitions. [2021-12-28 05:25:28,041 INFO L78 Accepts]: Start accepts. Automaton has 1035 states and 1313 transitions. Word has length 151 [2021-12-28 05:25:28,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-28 05:25:28,042 INFO L470 AbstractCegarLoop]: Abstraction has 1035 states and 1313 transitions. [2021-12-28 05:25:28,042 INFO L471 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) [2021-12-28 05:25:28,042 INFO L276 IsEmpty]: Start isEmpty. Operand 1035 states and 1313 transitions. [2021-12-28 05:25:28,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2021-12-28 05:25:28,044 INFO L506 BasicCegarLoop]: Found error trace [2021-12-28 05:25:28,045 INFO L514 BasicCegarLoop]: 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] [2021-12-28 05:25:28,045 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2021-12-28 05:25:28,045 INFO L402 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)] === [2021-12-28 05:25:28,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-28 05:25:28,045 INFO L85 PathProgramCache]: Analyzing trace with hash 1924683292, now seen corresponding path program 1 times [2021-12-28 05:25:28,046 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-28 05:25:28,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965046999] [2021-12-28 05:25:28,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-28 05:25:28,046 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-28 05:25:28,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:28,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2021-12-28 05:25:28,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:28,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2021-12-28 05:25:28,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:28,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2021-12-28 05:25:28,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:28,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 05:25:28,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:28,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2021-12-28 05:25:28,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:28,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:28,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:28,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:28,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:28,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:28,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:28,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2021-12-28 05:25:28,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:28,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:28,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:28,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:28,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:28,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:28,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:28,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2021-12-28 05:25:28,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:28,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:28,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:28,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:28,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:28,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:28,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2021-12-28 05:25:28,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:28,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:28,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:28,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:28,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:28,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:28,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:28,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2021-12-28 05:25:28,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:28,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:28,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:28,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2021-12-28 05:25:28,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:28,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2021-12-28 05:25:28,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:28,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2021-12-28 05:25:28,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:28,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 141 [2021-12-28 05:25:28,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:28,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2021-12-28 05:25:28,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:28,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:28,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:28,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:28,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:28,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:28,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2021-12-28 05:25:28,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:28,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2021-12-28 05:25:28,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:28,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2021-12-28 05:25:28,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:28,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2021-12-28 05:25:28,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-28 05:25:28,319 INFO L134 CoverageAnalysis]: Checked inductivity of 383 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 383 trivial. 0 not checked. [2021-12-28 05:25:28,319 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-28 05:25:28,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965046999] [2021-12-28 05:25:28,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965046999] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-28 05:25:28,319 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-28 05:25:28,319 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-12-28 05:25:28,320 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13604016] [2021-12-28 05:25:28,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-28 05:25:28,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2021-12-28 05:25:28,320 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-28 05:25:28,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-12-28 05:25:28,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-12-28 05:25:28,321 INFO L87 Difference]: Start difference. First operand 1035 states and 1313 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)