./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--media--usb--gspca--gspca_main.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c 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--media--usb--gspca--gspca_main.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 68ead1e29a6cc769e9e712c81a52de8a551f5275fff71a8b8c48675aa28de434 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-12 16:57:35,131 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-12 16:57:35,134 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-12 16:57:35,177 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-12 16:57:35,177 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-12 16:57:35,179 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-12 16:57:35,181 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-12 16:57:35,183 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-12 16:57:35,185 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-12 16:57:35,189 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-12 16:57:35,190 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-12 16:57:35,191 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-12 16:57:35,191 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-12 16:57:35,192 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-12 16:57:35,193 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-12 16:57:35,194 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-12 16:57:35,194 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-12 16:57:35,195 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-12 16:57:35,196 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-12 16:57:35,197 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-12 16:57:35,199 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-12 16:57:35,200 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-12 16:57:35,200 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-12 16:57:35,201 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-12 16:57:35,202 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-12 16:57:35,210 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-12 16:57:35,211 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-12 16:57:35,211 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-12 16:57:35,212 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-12 16:57:35,213 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-12 16:57:35,214 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-12 16:57:35,214 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-12 16:57:35,216 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-12 16:57:35,216 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-12 16:57:35,217 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-12 16:57:35,217 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-12 16:57:35,218 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-12 16:57:35,218 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-12 16:57:35,218 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-12 16:57:35,219 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-12 16:57:35,219 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-12 16:57:35,221 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-12 16:57:35,222 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-12 16:57:35,248 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-12 16:57:35,249 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-12 16:57:35,249 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-12 16:57:35,250 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-12 16:57:35,250 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-12 16:57:35,251 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-12 16:57:35,251 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-12 16:57:35,251 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-12 16:57:35,251 INFO L138 SettingsManager]: * Use SBE=true [2022-07-12 16:57:35,252 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-12 16:57:35,253 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-12 16:57:35,253 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-12 16:57:35,253 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-12 16:57:35,253 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-12 16:57:35,254 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-12 16:57:35,254 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-12 16:57:35,254 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-12 16:57:35,254 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-12 16:57:35,254 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-12 16:57:35,255 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-12 16:57:35,255 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-12 16:57:35,255 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 16:57:35,255 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-12 16:57:35,256 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-12 16:57:35,256 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-12 16:57:35,256 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-12 16:57:35,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-12 16:57:35,256 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-12 16:57:35,257 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-12 16:57:35,257 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-12 16:57:35,257 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 -> 68ead1e29a6cc769e9e712c81a52de8a551f5275fff71a8b8c48675aa28de434 [2022-07-12 16:57:35,507 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-12 16:57:35,533 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-12 16:57:35,536 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-12 16:57:35,537 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-12 16:57:35,539 INFO L275 PluginConnector]: CDTParser initialized [2022-07-12 16:57:35,540 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--media--usb--gspca--gspca_main.ko.cil.i [2022-07-12 16:57:35,609 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a919eb333/f50b2954bb1f41b3bbbeb1135159da62/FLAG5f470d998 [2022-07-12 16:57:36,376 INFO L306 CDTParser]: Found 1 translation units. [2022-07-12 16:57:36,377 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i [2022-07-12 16:57:36,430 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a919eb333/f50b2954bb1f41b3bbbeb1135159da62/FLAG5f470d998 [2022-07-12 16:57:36,900 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a919eb333/f50b2954bb1f41b3bbbeb1135159da62 [2022-07-12 16:57:36,905 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-12 16:57:36,906 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-12 16:57:36,907 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-12 16:57:36,908 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-12 16:57:36,910 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-12 16:57:36,911 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 04:57:36" (1/1) ... [2022-07-12 16:57:36,912 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2e5513a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:57:36, skipping insertion in model container [2022-07-12 16:57:36,912 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.07 04:57:36" (1/1) ... [2022-07-12 16:57:36,918 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-12 16:57:37,077 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-12 16:57:41,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--media--usb--gspca--gspca_main.ko.cil.i[418415,418428] [2022-07-12 16:57:41,235 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[418560,418573] [2022-07-12 16:57:41,236 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[418706,418719] [2022-07-12 16:57:41,237 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[418871,418884] [2022-07-12 16:57:41,237 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[419029,419042] [2022-07-12 16:57:41,238 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[419187,419200] [2022-07-12 16:57:41,238 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[419345,419358] [2022-07-12 16:57:41,239 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[419505,419518] [2022-07-12 16:57:41,239 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[419664,419677] [2022-07-12 16:57:41,240 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[419803,419816] [2022-07-12 16:57:41,241 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[419945,419958] [2022-07-12 16:57:41,242 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[420094,420107] [2022-07-12 16:57:41,242 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[420233,420246] [2022-07-12 16:57:41,243 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[420388,420401] [2022-07-12 16:57:41,243 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[420548,420561] [2022-07-12 16:57:41,244 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[420699,420712] [2022-07-12 16:57:41,244 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[420850,420863] [2022-07-12 16:57:41,245 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[421002,421015] [2022-07-12 16:57:41,246 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[421151,421164] [2022-07-12 16:57:41,247 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[421299,421312] [2022-07-12 16:57:41,247 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[421456,421469] [2022-07-12 16:57:41,247 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[421605,421618] [2022-07-12 16:57:41,248 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[421761,421774] [2022-07-12 16:57:41,253 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[421914,421927] [2022-07-12 16:57:41,255 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[422060,422073] [2022-07-12 16:57:41,256 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[422203,422216] [2022-07-12 16:57:41,256 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[422355,422368] [2022-07-12 16:57:41,257 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[422501,422514] [2022-07-12 16:57:41,257 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[422646,422659] [2022-07-12 16:57:41,258 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[422800,422813] [2022-07-12 16:57:41,259 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[422951,422964] [2022-07-12 16:57:41,260 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[423106,423119] [2022-07-12 16:57:41,260 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[423258,423271] [2022-07-12 16:57:41,260 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[423413,423426] [2022-07-12 16:57:41,261 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[423577,423590] [2022-07-12 16:57:41,262 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[423733,423746] [2022-07-12 16:57:41,262 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[423897,423910] [2022-07-12 16:57:41,262 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[424039,424052] [2022-07-12 16:57:41,263 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[424197,424210] [2022-07-12 16:57:41,263 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[424364,424377] [2022-07-12 16:57:41,263 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[424523,424536] [2022-07-12 16:57:41,264 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[424682,424695] [2022-07-12 16:57:41,265 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[424831,424844] [2022-07-12 16:57:41,265 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[424978,424991] [2022-07-12 16:57:41,265 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[425117,425130] [2022-07-12 16:57:41,265 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[425280,425293] [2022-07-12 16:57:41,266 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[425446,425459] [2022-07-12 16:57:41,267 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[425610,425623] [2022-07-12 16:57:41,267 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[425775,425788] [2022-07-12 16:57:41,268 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[425940,425953] [2022-07-12 16:57:41,268 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[426106,426119] [2022-07-12 16:57:41,268 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[426271,426284] [2022-07-12 16:57:41,269 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[426438,426451] [2022-07-12 16:57:41,269 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[426598,426611] [2022-07-12 16:57:41,270 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[426760,426773] [2022-07-12 16:57:41,270 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[426919,426932] [2022-07-12 16:57:41,270 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[427065,427078] [2022-07-12 16:57:41,271 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[427208,427221] [2022-07-12 16:57:41,271 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[427352,427365] [2022-07-12 16:57:41,271 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[427495,427508] [2022-07-12 16:57:41,272 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[427639,427652] [2022-07-12 16:57:41,273 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[427780,427793] [2022-07-12 16:57:41,273 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[427918,427931] [2022-07-12 16:57:41,274 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[428076,428089] [2022-07-12 16:57:41,274 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[428235,428248] [2022-07-12 16:57:41,274 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[428391,428404] [2022-07-12 16:57:41,275 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[428540,428553] [2022-07-12 16:57:41,275 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[428692,428705] [2022-07-12 16:57:41,275 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[428843,428856] [2022-07-12 16:57:41,276 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[428992,429005] [2022-07-12 16:57:41,276 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[429144,429157] [2022-07-12 16:57:41,276 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[429292,429305] [2022-07-12 16:57:41,277 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[429445,429458] [2022-07-12 16:57:41,277 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[429596,429609] [2022-07-12 16:57:41,277 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[429746,429759] [2022-07-12 16:57:41,278 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[429893,429906] [2022-07-12 16:57:41,278 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[430044,430057] [2022-07-12 16:57:41,278 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[430195,430208] [2022-07-12 16:57:41,279 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[430343,430356] [2022-07-12 16:57:41,279 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[430509,430522] [2022-07-12 16:57:41,279 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[430678,430691] [2022-07-12 16:57:41,280 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[430845,430858] [2022-07-12 16:57:41,280 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[431013,431026] [2022-07-12 16:57:41,280 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[431163,431176] [2022-07-12 16:57:41,281 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[431310,431323] [2022-07-12 16:57:41,282 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[431471,431484] [2022-07-12 16:57:41,282 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[431641,431654] [2022-07-12 16:57:41,282 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[431803,431816] [2022-07-12 16:57:41,300 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 16:57:41,342 INFO L203 MainTranslator]: Completed pre-run [2022-07-12 16:57:41,818 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[418415,418428] [2022-07-12 16:57:41,819 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[418560,418573] [2022-07-12 16:57:41,820 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[418706,418719] [2022-07-12 16:57:41,820 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[418871,418884] [2022-07-12 16:57:41,820 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[419029,419042] [2022-07-12 16:57:41,821 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[419187,419200] [2022-07-12 16:57:41,821 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[419345,419358] [2022-07-12 16:57:41,821 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[419505,419518] [2022-07-12 16:57:41,821 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[419664,419677] [2022-07-12 16:57:41,822 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[419803,419816] [2022-07-12 16:57:41,822 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[419945,419958] [2022-07-12 16:57:41,822 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[420094,420107] [2022-07-12 16:57:41,823 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[420233,420246] [2022-07-12 16:57:41,823 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[420388,420401] [2022-07-12 16:57:41,823 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[420548,420561] [2022-07-12 16:57:41,824 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[420699,420712] [2022-07-12 16:57:41,824 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[420850,420863] [2022-07-12 16:57:41,824 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[421002,421015] [2022-07-12 16:57:41,825 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[421151,421164] [2022-07-12 16:57:41,825 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[421299,421312] [2022-07-12 16:57:41,825 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[421456,421469] [2022-07-12 16:57:41,826 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[421605,421618] [2022-07-12 16:57:41,826 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[421761,421774] [2022-07-12 16:57:41,826 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[421914,421927] [2022-07-12 16:57:41,827 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[422060,422073] [2022-07-12 16:57:41,827 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[422203,422216] [2022-07-12 16:57:41,827 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[422355,422368] [2022-07-12 16:57:41,828 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[422501,422514] [2022-07-12 16:57:41,828 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[422646,422659] [2022-07-12 16:57:41,828 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[422800,422813] [2022-07-12 16:57:41,828 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[422951,422964] [2022-07-12 16:57:41,829 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[423106,423119] [2022-07-12 16:57:41,829 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[423258,423271] [2022-07-12 16:57:41,829 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[423413,423426] [2022-07-12 16:57:41,830 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[423577,423590] [2022-07-12 16:57:41,830 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[423733,423746] [2022-07-12 16:57:41,830 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[423897,423910] [2022-07-12 16:57:41,831 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[424039,424052] [2022-07-12 16:57:41,831 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[424197,424210] [2022-07-12 16:57:41,831 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[424364,424377] [2022-07-12 16:57:41,832 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[424523,424536] [2022-07-12 16:57:41,832 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[424682,424695] [2022-07-12 16:57:41,832 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[424831,424844] [2022-07-12 16:57:41,833 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[424978,424991] [2022-07-12 16:57:41,833 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[425117,425130] [2022-07-12 16:57:41,833 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[425280,425293] [2022-07-12 16:57:41,834 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[425446,425459] [2022-07-12 16:57:41,834 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[425610,425623] [2022-07-12 16:57:41,834 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[425775,425788] [2022-07-12 16:57:41,834 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[425940,425953] [2022-07-12 16:57:41,835 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[426106,426119] [2022-07-12 16:57:41,835 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[426271,426284] [2022-07-12 16:57:41,835 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[426438,426451] [2022-07-12 16:57:41,836 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[426598,426611] [2022-07-12 16:57:41,836 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[426760,426773] [2022-07-12 16:57:41,836 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[426919,426932] [2022-07-12 16:57:41,837 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[427065,427078] [2022-07-12 16:57:41,837 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[427208,427221] [2022-07-12 16:57:41,837 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[427352,427365] [2022-07-12 16:57:41,838 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[427495,427508] [2022-07-12 16:57:41,838 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[427639,427652] [2022-07-12 16:57:41,838 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[427780,427793] [2022-07-12 16:57:41,839 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[427918,427931] [2022-07-12 16:57:41,839 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[428076,428089] [2022-07-12 16:57:41,839 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[428235,428248] [2022-07-12 16:57:41,840 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[428391,428404] [2022-07-12 16:57:41,840 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[428540,428553] [2022-07-12 16:57:41,840 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[428692,428705] [2022-07-12 16:57:41,841 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[428843,428856] [2022-07-12 16:57:41,841 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[428992,429005] [2022-07-12 16:57:41,841 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[429144,429157] [2022-07-12 16:57:41,841 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[429292,429305] [2022-07-12 16:57:41,842 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[429445,429458] [2022-07-12 16:57:41,842 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[429596,429609] [2022-07-12 16:57:41,842 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[429746,429759] [2022-07-12 16:57:41,843 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[429893,429906] [2022-07-12 16:57:41,843 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[430044,430057] [2022-07-12 16:57:41,843 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[430195,430208] [2022-07-12 16:57:41,844 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[430343,430356] [2022-07-12 16:57:41,844 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[430509,430522] [2022-07-12 16:57:41,844 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[430678,430691] [2022-07-12 16:57:41,845 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[430845,430858] [2022-07-12 16:57:41,845 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[431013,431026] [2022-07-12 16:57:41,845 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[431163,431176] [2022-07-12 16:57:41,845 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[431310,431323] [2022-07-12 16:57:41,846 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[431471,431484] [2022-07-12 16:57:41,846 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[431641,431654] [2022-07-12 16:57:41,846 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[431803,431816] [2022-07-12 16:57:41,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-12 16:57:42,030 INFO L208 MainTranslator]: Completed translation [2022-07-12 16:57:42,031 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:57:42 WrapperNode [2022-07-12 16:57:42,032 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-12 16:57:42,033 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-12 16:57:42,037 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-12 16:57:42,037 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-12 16:57:42,043 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:57:42" (1/1) ... [2022-07-12 16:57:42,208 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:57:42" (1/1) ... [2022-07-12 16:57:42,429 INFO L137 Inliner]: procedures = 643, calls = 3813, calls flagged for inlining = 294, calls inlined = 195, statements flattened = 6099 [2022-07-12 16:57:42,430 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-12 16:57:42,430 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-12 16:57:42,430 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-12 16:57:42,430 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-12 16:57:42,453 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:57:42" (1/1) ... [2022-07-12 16:57:42,453 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:57:42" (1/1) ... [2022-07-12 16:57:42,508 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:57:42" (1/1) ... [2022-07-12 16:57:42,509 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:57:42" (1/1) ... [2022-07-12 16:57:42,607 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:57:42" (1/1) ... [2022-07-12 16:57:42,625 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:57:42" (1/1) ... [2022-07-12 16:57:42,656 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:57:42" (1/1) ... [2022-07-12 16:57:42,694 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-12 16:57:42,696 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-12 16:57:42,696 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-12 16:57:42,696 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-12 16:57:42,697 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:57:42" (1/1) ... [2022-07-12 16:57:42,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-12 16:57:42,712 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-12 16:57:42,724 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-12 16:57:42,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-12 16:57:42,761 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2022-07-12 16:57:42,761 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2022-07-12 16:57:42,762 INFO L130 BoogieDeclarations]: Found specification of procedure PDEBUG_MODE [2022-07-12 16:57:42,762 INFO L138 BoogieDeclarations]: Found implementation of procedure PDEBUG_MODE [2022-07-12 16:57:42,762 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-12 16:57:42,762 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-12 16:57:42,762 INFO L130 BoogieDeclarations]: Found specification of procedure alt_xfer [2022-07-12 16:57:42,762 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_xfer [2022-07-12 16:57:42,763 INFO L130 BoogieDeclarations]: Found specification of procedure vidioc_streamon [2022-07-12 16:57:42,763 INFO L138 BoogieDeclarations]: Found implementation of procedure vidioc_streamon [2022-07-12 16:57:42,763 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-12 16:57:42,763 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-12 16:57:42,763 INFO L130 BoogieDeclarations]: Found specification of procedure dev_poll [2022-07-12 16:57:42,763 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_poll [2022-07-12 16:57:42,763 INFO L130 BoogieDeclarations]: Found specification of procedure vidioc_reqbufs [2022-07-12 16:57:42,764 INFO L138 BoogieDeclarations]: Found implementation of procedure vidioc_reqbufs [2022-07-12 16:57:42,764 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-12 16:57:42,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-12 16:57:42,764 INFO L130 BoogieDeclarations]: Found specification of procedure frame_ready_nolock [2022-07-12 16:57:42,764 INFO L138 BoogieDeclarations]: Found implementation of procedure frame_ready_nolock [2022-07-12 16:57:42,764 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_usb_alloc_coherent [2022-07-12 16:57:42,764 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_usb_alloc_coherent [2022-07-12 16:57:42,765 INFO L130 BoogieDeclarations]: Found specification of procedure frame_ready [2022-07-12 16:57:42,765 INFO L138 BoogieDeclarations]: Found implementation of procedure frame_ready [2022-07-12 16:57:42,765 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_in [2022-07-12 16:57:42,765 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_in [2022-07-12 16:57:42,765 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-12 16:57:42,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-12 16:57:42,765 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-12 16:57:42,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-12 16:57:42,766 INFO L130 BoogieDeclarations]: Found specification of procedure gspca_set_alt0 [2022-07-12 16:57:42,766 INFO L138 BoogieDeclarations]: Found implementation of procedure gspca_set_alt0 [2022-07-12 16:57:42,766 INFO L130 BoogieDeclarations]: Found specification of procedure ktime_get [2022-07-12 16:57:42,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ktime_get [2022-07-12 16:57:42,766 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-12 16:57:42,766 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-12 16:57:42,767 INFO L130 BoogieDeclarations]: Found specification of procedure v4l2_ctrl_handler_free [2022-07-12 16:57:42,767 INFO L138 BoogieDeclarations]: Found implementation of procedure v4l2_ctrl_handler_free [2022-07-12 16:57:42,767 INFO L130 BoogieDeclarations]: Found specification of procedure strlcpy [2022-07-12 16:57:42,767 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcpy [2022-07-12 16:57:42,767 INFO L130 BoogieDeclarations]: Found specification of procedure int_irq [2022-07-12 16:57:42,767 INFO L138 BoogieDeclarations]: Found implementation of procedure int_irq [2022-07-12 16:57:42,768 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-12 16:57:42,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-12 16:57:42,768 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-12 16:57:42,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-12 16:57:42,768 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_queue_lock_of_gspca_dev [2022-07-12 16:57:42,768 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_queue_lock_of_gspca_dev [2022-07-12 16:57:42,768 INFO L130 BoogieDeclarations]: Found specification of procedure v4l2_ctrl_handler_setup [2022-07-12 16:57:42,769 INFO L138 BoogieDeclarations]: Found implementation of procedure v4l2_ctrl_handler_setup [2022-07-12 16:57:42,769 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-12 16:57:42,769 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_usb_lock_of_gspca_dev [2022-07-12 16:57:42,769 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_usb_lock_of_gspca_dev [2022-07-12 16:57:42,769 INFO L130 BoogieDeclarations]: Found specification of procedure gspca_stream_off [2022-07-12 16:57:42,769 INFO L138 BoogieDeclarations]: Found implementation of procedure gspca_stream_off [2022-07-12 16:57:42,769 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-12 16:57:42,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-12 16:57:42,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-12 16:57:42,770 INFO L130 BoogieDeclarations]: Found specification of procedure gspca_input_create_urb [2022-07-12 16:57:42,770 INFO L138 BoogieDeclarations]: Found implementation of procedure gspca_input_create_urb [2022-07-12 16:57:42,770 INFO L130 BoogieDeclarations]: Found specification of procedure ns_to_timeval [2022-07-12 16:57:42,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ns_to_timeval [2022-07-12 16:57:42,771 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-07-12 16:57:42,771 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-07-12 16:57:42,771 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-12 16:57:42,771 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-12 16:57:42,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-12 16:57:42,771 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-12 16:57:42,771 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-12 16:57:42,772 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-12 16:57:42,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-12 16:57:42,772 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-12 16:57:42,772 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-12 16:57:42,772 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-12 16:57:42,772 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-12 16:57:42,773 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-12 16:57:42,773 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-12 16:57:42,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-12 16:57:42,773 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-12 16:57:42,773 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-12 16:57:42,773 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-12 16:57:42,773 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-12 16:57:42,774 INFO L130 BoogieDeclarations]: Found specification of procedure dev_close [2022-07-12 16:57:42,774 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_close [2022-07-12 16:57:42,774 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-12 16:57:42,774 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-12 16:57:42,774 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2022-07-12 16:57:42,774 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2022-07-12 16:57:42,775 INFO L130 BoogieDeclarations]: Found specification of procedure v4l2_ctrl_subscribe_event [2022-07-12 16:57:42,775 INFO L138 BoogieDeclarations]: Found implementation of procedure v4l2_ctrl_subscribe_event [2022-07-12 16:57:42,775 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-12 16:57:42,775 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-12 16:57:42,775 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-12 16:57:42,775 INFO L130 BoogieDeclarations]: Found specification of procedure gspca_resume [2022-07-12 16:57:42,775 INFO L138 BoogieDeclarations]: Found implementation of procedure gspca_resume [2022-07-12 16:57:42,776 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_urbs [2022-07-12 16:57:42,776 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_urbs [2022-07-12 16:57:42,776 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-12 16:57:42,776 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-12 16:57:42,776 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-12 16:57:42,776 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-12 16:57:42,776 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-12 16:57:42,777 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 16:57:42,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-12 16:57:42,777 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2022-07-12 16:57:42,777 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2022-07-12 16:57:42,777 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-12 16:57:42,777 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-12 16:57:42,778 INFO L130 BoogieDeclarations]: Found specification of procedure dev_open [2022-07-12 16:57:42,778 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_open [2022-07-12 16:57:42,778 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_queue_lock_of_gspca_dev [2022-07-12 16:57:42,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_queue_lock_of_gspca_dev [2022-07-12 16:57:42,778 INFO L130 BoogieDeclarations]: Found specification of procedure gspca_vm_close [2022-07-12 16:57:42,778 INFO L138 BoogieDeclarations]: Found implementation of procedure gspca_vm_close [2022-07-12 16:57:42,778 INFO L130 BoogieDeclarations]: Found specification of procedure vidioc_qbuf [2022-07-12 16:57:42,779 INFO L138 BoogieDeclarations]: Found implementation of procedure vidioc_qbuf [2022-07-12 16:57:42,779 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-12 16:57:42,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-12 16:57:42,779 INFO L130 BoogieDeclarations]: Found specification of procedure input_unregister_device [2022-07-12 16:57:42,779 INFO L138 BoogieDeclarations]: Found implementation of procedure input_unregister_device [2022-07-12 16:57:42,779 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-12 16:57:42,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-12 16:57:42,780 INFO L130 BoogieDeclarations]: Found specification of procedure v4l2_event_unsubscribe [2022-07-12 16:57:42,780 INFO L138 BoogieDeclarations]: Found implementation of procedure v4l2_event_unsubscribe [2022-07-12 16:57:42,780 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-12 16:57:42,780 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-12 16:57:42,780 INFO L130 BoogieDeclarations]: Found specification of procedure wxh_to_mode [2022-07-12 16:57:42,780 INFO L138 BoogieDeclarations]: Found implementation of procedure wxh_to_mode [2022-07-12 16:57:42,780 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2022-07-12 16:57:42,781 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2022-07-12 16:57:42,781 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-12 16:57:42,781 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-12 16:57:42,781 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-12 16:57:42,781 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-12 16:57:42,781 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_interface [2022-07-12 16:57:42,781 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_interface [2022-07-12 16:57:42,782 INFO L130 BoogieDeclarations]: Found specification of procedure frame_free [2022-07-12 16:57:42,782 INFO L138 BoogieDeclarations]: Found implementation of procedure frame_free [2022-07-12 16:57:42,782 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-07-12 16:57:42,782 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-07-12 16:57:42,782 INFO L130 BoogieDeclarations]: Found specification of procedure dev_mmap [2022-07-12 16:57:42,782 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_mmap [2022-07-12 16:57:42,782 INFO L130 BoogieDeclarations]: Found specification of procedure usb_make_path [2022-07-12 16:57:42,783 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_make_path [2022-07-12 16:57:42,783 INFO L130 BoogieDeclarations]: Found specification of procedure vidioc_streamoff [2022-07-12 16:57:42,783 INFO L138 BoogieDeclarations]: Found implementation of procedure vidioc_streamoff [2022-07-12 16:57:42,783 INFO L130 BoogieDeclarations]: Found specification of procedure gspca_init_transfer [2022-07-12 16:57:42,783 INFO L138 BoogieDeclarations]: Found implementation of procedure gspca_init_transfer [2022-07-12 16:57:42,783 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2022-07-12 16:57:42,783 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2022-07-12 16:57:42,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-12 16:57:42,784 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-12 16:57:42,784 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-12 16:57:42,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-12 16:57:42,784 INFO L130 BoogieDeclarations]: Found specification of procedure video_drvdata [2022-07-12 16:57:42,784 INFO L138 BoogieDeclarations]: Found implementation of procedure video_drvdata [2022-07-12 16:57:42,784 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_free_urb [2022-07-12 16:57:42,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_free_urb [2022-07-12 16:57:42,785 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-12 16:57:42,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-12 16:57:42,785 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-12 16:57:42,785 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-12 16:57:42,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-12 16:57:42,785 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-12 16:57:42,785 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-07-12 16:57:42,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-07-12 16:57:42,786 INFO L130 BoogieDeclarations]: Found specification of procedure usb_ifnum_to_if [2022-07-12 16:57:42,786 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_ifnum_to_if [2022-07-12 16:57:42,786 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_usb_lock_of_gspca_dev [2022-07-12 16:57:42,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_usb_lock_of_gspca_dev [2022-07-12 16:57:42,786 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_usb_free_coherent [2022-07-12 16:57:42,786 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_usb_free_coherent [2022-07-12 16:57:42,787 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-12 16:57:42,787 INFO L130 BoogieDeclarations]: Found specification of procedure video_device_node_name [2022-07-12 16:57:42,787 INFO L138 BoogieDeclarations]: Found implementation of procedure video_device_node_name [2022-07-12 16:57:42,787 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_module_put [2022-07-12 16:57:42,787 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_module_put [2022-07-12 16:57:42,787 INFO L130 BoogieDeclarations]: Found specification of procedure read_alloc [2022-07-12 16:57:42,787 INFO L138 BoogieDeclarations]: Found implementation of procedure read_alloc [2022-07-12 16:57:42,788 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-12 16:57:42,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-12 16:57:42,788 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-12 16:57:42,788 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-12 16:57:42,788 INFO L130 BoogieDeclarations]: Found specification of procedure vidioc_dqbuf [2022-07-12 16:57:42,788 INFO L138 BoogieDeclarations]: Found implementation of procedure vidioc_dqbuf [2022-07-12 16:57:42,789 INFO L130 BoogieDeclarations]: Found specification of procedure video_device_release_empty [2022-07-12 16:57:42,789 INFO L138 BoogieDeclarations]: Found implementation of procedure video_device_release_empty [2022-07-12 16:57:42,789 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-12 16:57:42,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-12 16:57:42,789 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_alloc_urb [2022-07-12 16:57:42,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_alloc_urb [2022-07-12 16:57:42,789 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-12 16:57:42,789 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-12 16:57:42,790 INFO L130 BoogieDeclarations]: Found specification of procedure gspca_input_destroy_urb [2022-07-12 16:57:42,790 INFO L138 BoogieDeclarations]: Found implementation of procedure gspca_input_destroy_urb [2022-07-12 16:57:42,790 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-12 16:57:42,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-12 16:57:42,790 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-12 16:57:42,790 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-12 16:57:42,790 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-12 16:57:42,791 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-12 16:57:42,791 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-12 16:57:42,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-12 16:57:42,791 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~VOID [2022-07-12 16:57:42,791 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~VOID [2022-07-12 16:57:42,791 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-12 16:57:42,792 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-12 16:57:42,792 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-12 16:57:42,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-12 16:57:42,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-12 16:57:42,792 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-12 16:57:42,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-12 16:57:42,792 INFO L130 BoogieDeclarations]: Found specification of procedure gspca_disconnect [2022-07-12 16:57:42,793 INFO L138 BoogieDeclarations]: Found implementation of procedure gspca_disconnect [2022-07-12 16:57:42,793 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-12 16:57:42,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-12 16:57:42,793 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-12 16:57:42,793 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-12 16:57:42,793 INFO L130 BoogieDeclarations]: Found specification of procedure vidioc_s_input [2022-07-12 16:57:42,793 INFO L138 BoogieDeclarations]: Found implementation of procedure vidioc_s_input [2022-07-12 16:57:42,794 INFO L130 BoogieDeclarations]: Found specification of procedure try_fmt_vid_cap [2022-07-12 16:57:42,794 INFO L138 BoogieDeclarations]: Found implementation of procedure try_fmt_vid_cap [2022-07-12 16:57:42,794 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2022-07-12 16:57:42,794 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2022-07-12 16:57:42,794 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-12 16:57:42,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-12 16:57:42,794 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-12 16:57:42,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-12 16:57:42,795 INFO L130 BoogieDeclarations]: Found specification of procedure msecs_to_jiffies [2022-07-12 16:57:42,795 INFO L138 BoogieDeclarations]: Found implementation of procedure msecs_to_jiffies [2022-07-12 16:57:42,795 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_usb_lock_of_gspca_dev [2022-07-12 16:57:42,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_usb_lock_of_gspca_dev [2022-07-12 16:57:42,795 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-12 16:57:42,795 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-12 16:57:42,796 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-12 16:57:42,796 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~VOID [2022-07-12 16:57:42,796 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~VOID [2022-07-12 16:57:42,796 INFO L130 BoogieDeclarations]: Found specification of procedure gspca_vm_open [2022-07-12 16:57:42,796 INFO L138 BoogieDeclarations]: Found implementation of procedure gspca_vm_open [2022-07-12 16:57:43,514 INFO L234 CfgBuilder]: Building ICFG [2022-07-12 16:57:43,517 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-12 16:57:43,637 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-12 16:57:47,637 INFO L275 CfgBuilder]: Performing block encoding [2022-07-12 16:57:47,665 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-12 16:57:47,667 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-12 16:57:47,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 04:57:47 BoogieIcfgContainer [2022-07-12 16:57:47,672 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-12 16:57:47,674 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-12 16:57:47,675 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-12 16:57:47,678 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-12 16:57:47,678 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.07 04:57:36" (1/3) ... [2022-07-12 16:57:47,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f79da6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 04:57:47, skipping insertion in model container [2022-07-12 16:57:47,679 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.07 04:57:42" (2/3) ... [2022-07-12 16:57:47,679 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4f79da6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.07 04:57:47, skipping insertion in model container [2022-07-12 16:57:47,680 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.07 04:57:47" (3/3) ... [2022-07-12 16:57:47,681 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i [2022-07-12 16:57:47,694 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-12 16:57:47,694 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-07-12 16:57:47,792 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-12 16:57:47,798 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@14807735, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3f56192a [2022-07-12 16:57:47,798 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2022-07-12 16:57:47,809 INFO L276 IsEmpty]: Start isEmpty. Operand has 1803 states, 1294 states have (on average 1.3493044822256568) internal successors, (1746), 1344 states have internal predecessors, (1746), 368 states have call successors, (368), 111 states have call predecessors, (368), 110 states have return successors, (364), 357 states have call predecessors, (364), 364 states have call successors, (364) [2022-07-12 16:57:47,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-12 16:57:47,820 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:57:47,821 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 16:57:47,821 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:57:47,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:57:47,828 INFO L85 PathProgramCache]: Analyzing trace with hash 831534073, now seen corresponding path program 1 times [2022-07-12 16:57:47,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:57:47,836 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1446453975] [2022-07-12 16:57:47,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:57:47,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:57:48,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:48,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:57:48,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:48,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:57:48,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:48,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 16:57:48,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:48,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:57:48,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:48,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:48,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:48,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:57:48,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:48,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 16:57:48,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:48,621 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 16:57:48,622 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:57:48,622 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1446453975] [2022-07-12 16:57:48,622 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1446453975] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:57:48,623 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:57:48,623 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:57:48,625 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034706013] [2022-07-12 16:57:48,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:57:48,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:57:48,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:57:48,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:57:48,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:57:48,664 INFO L87 Difference]: Start difference. First operand has 1803 states, 1294 states have (on average 1.3493044822256568) internal successors, (1746), 1344 states have internal predecessors, (1746), 368 states have call successors, (368), 111 states have call predecessors, (368), 110 states have return successors, (364), 357 states have call predecessors, (364), 364 states have call successors, (364) Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-12 16:57:53,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:57:53,021 INFO L93 Difference]: Finished difference Result 3527 states and 5017 transitions. [2022-07-12 16:57:53,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:57:53,028 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 49 [2022-07-12 16:57:53,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:57:53,052 INFO L225 Difference]: With dead ends: 3527 [2022-07-12 16:57:53,052 INFO L226 Difference]: Without dead ends: 1785 [2022-07-12 16:57:53,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:57:53,073 INFO L413 NwaCegarLoop]: 2212 mSDtfsCounter, 4465 mSDsluCounter, 1281 mSDsCounter, 0 mSdLazyCounter, 2411 mSolverCounterSat, 1562 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4616 SdHoareTripleChecker+Valid, 3493 SdHoareTripleChecker+Invalid, 3973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1562 IncrementalHoareTripleChecker+Valid, 2411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-12 16:57:53,073 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4616 Valid, 3493 Invalid, 3973 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1562 Valid, 2411 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-07-12 16:57:53,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1785 states. [2022-07-12 16:57:53,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1785 to 1785. [2022-07-12 16:57:53,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1785 states, 1283 states have (on average 1.308651597817615) internal successors, (1679), 1329 states have internal predecessors, (1679), 364 states have call successors, (364), 110 states have call predecessors, (364), 109 states have return successors, (362), 355 states have call predecessors, (362), 362 states have call successors, (362) [2022-07-12 16:57:53,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1785 states and 2405 transitions. [2022-07-12 16:57:53,246 INFO L78 Accepts]: Start accepts. Automaton has 1785 states and 2405 transitions. Word has length 49 [2022-07-12 16:57:53,248 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:57:53,248 INFO L495 AbstractCegarLoop]: Abstraction has 1785 states and 2405 transitions. [2022-07-12 16:57:53,248 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 4 states have internal predecessors, (28), 2 states have call successors, (8), 4 states have call predecessors, (8), 1 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-07-12 16:57:53,249 INFO L276 IsEmpty]: Start isEmpty. Operand 1785 states and 2405 transitions. [2022-07-12 16:57:53,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-12 16:57:53,251 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:57:53,251 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 16:57:53,251 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-12 16:57:53,252 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:57:53,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:57:53,253 INFO L85 PathProgramCache]: Analyzing trace with hash 571787044, now seen corresponding path program 1 times [2022-07-12 16:57:53,253 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:57:53,253 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076111406] [2022-07-12 16:57:53,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:57:53,253 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:57:53,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:53,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:57:53,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:53,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:57:53,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:53,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 16:57:53,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:53,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:57:53,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:53,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:53,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:53,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:57:53,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:53,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 16:57:53,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:53,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 16:57:53,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:53,603 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 16:57:53,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:57:53,603 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076111406] [2022-07-12 16:57:53,603 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076111406] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:57:53,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:57:53,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:57:53,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885585666] [2022-07-12 16:57:53,604 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:57:53,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:57:53,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:57:53,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:57:53,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:57:53,606 INFO L87 Difference]: Start difference. First operand 1785 states and 2405 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-12 16:57:57,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:57:57,769 INFO L93 Difference]: Finished difference Result 1785 states and 2405 transitions. [2022-07-12 16:57:57,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:57:57,770 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 55 [2022-07-12 16:57:57,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:57:57,782 INFO L225 Difference]: With dead ends: 1785 [2022-07-12 16:57:57,782 INFO L226 Difference]: Without dead ends: 1783 [2022-07-12 16:57:57,785 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:57:57,786 INFO L413 NwaCegarLoop]: 2194 mSDtfsCounter, 4433 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2397 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4581 SdHoareTripleChecker+Valid, 3459 SdHoareTripleChecker+Invalid, 3951 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1554 IncrementalHoareTripleChecker+Valid, 2397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-07-12 16:57:57,786 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4581 Valid, 3459 Invalid, 3951 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1554 Valid, 2397 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-07-12 16:57:57,790 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2022-07-12 16:57:57,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1783. [2022-07-12 16:57:57,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1783 states, 1282 states have (on average 1.3081123244929798) internal successors, (1677), 1327 states have internal predecessors, (1677), 364 states have call successors, (364), 110 states have call predecessors, (364), 109 states have return successors, (362), 355 states have call predecessors, (362), 362 states have call successors, (362) [2022-07-12 16:57:57,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 2403 transitions. [2022-07-12 16:57:57,901 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 2403 transitions. Word has length 55 [2022-07-12 16:57:57,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:57:57,902 INFO L495 AbstractCegarLoop]: Abstraction has 1783 states and 2403 transitions. [2022-07-12 16:57:57,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 4 states have internal predecessors, (32), 2 states have call successors, (9), 4 states have call predecessors, (9), 1 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-07-12 16:57:57,902 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2403 transitions. [2022-07-12 16:57:57,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-12 16:57:57,903 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:57:57,903 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 16:57:57,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-12 16:57:57,904 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:57:57,904 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:57:57,904 INFO L85 PathProgramCache]: Analyzing trace with hash -1684624910, now seen corresponding path program 1 times [2022-07-12 16:57:57,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:57:57,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290713292] [2022-07-12 16:57:57,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:57:57,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:57:58,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:58,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:57:58,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:58,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:57:58,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:58,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 16:57:58,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:58,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:57:58,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:58,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:57:58,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:58,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:57:58,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:58,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 16:57:58,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:58,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 16:57:58,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:58,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 16:57:58,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:57:58,267 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 16:57:58,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:57:58,268 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290713292] [2022-07-12 16:57:58,268 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290713292] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:57:58,268 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:57:58,268 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:57:58,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405804210] [2022-07-12 16:57:58,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:57:58,269 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:57:58,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:57:58,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:57:58,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:57:58,271 INFO L87 Difference]: Start difference. First operand 1783 states and 2403 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 16:58:02,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:02,031 INFO L93 Difference]: Finished difference Result 1783 states and 2403 transitions. [2022-07-12 16:58:02,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:58:02,032 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) Word has length 61 [2022-07-12 16:58:02,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:02,040 INFO L225 Difference]: With dead ends: 1783 [2022-07-12 16:58:02,040 INFO L226 Difference]: Without dead ends: 1781 [2022-07-12 16:58:02,041 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:58:02,042 INFO L413 NwaCegarLoop]: 2192 mSDtfsCounter, 4427 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2395 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4574 SdHoareTripleChecker+Valid, 3457 SdHoareTripleChecker+Invalid, 3949 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1554 IncrementalHoareTripleChecker+Valid, 2395 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:02,042 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4574 Valid, 3457 Invalid, 3949 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1554 Valid, 2395 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-07-12 16:58:02,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2022-07-12 16:58:02,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1781. [2022-07-12 16:58:02,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1781 states, 1281 states have (on average 1.3075722092115534) internal successors, (1675), 1325 states have internal predecessors, (1675), 364 states have call successors, (364), 110 states have call predecessors, (364), 109 states have return successors, (362), 355 states have call predecessors, (362), 362 states have call successors, (362) [2022-07-12 16:58:02,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1781 states and 2401 transitions. [2022-07-12 16:58:02,101 INFO L78 Accepts]: Start accepts. Automaton has 1781 states and 2401 transitions. Word has length 61 [2022-07-12 16:58:02,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:02,102 INFO L495 AbstractCegarLoop]: Abstraction has 1781 states and 2401 transitions. [2022-07-12 16:58:02,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 2 states have call successors, (10), 4 states have call predecessors, (10), 1 states have return successors, (9), 2 states have call predecessors, (9), 2 states have call successors, (9) [2022-07-12 16:58:02,102 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 2401 transitions. [2022-07-12 16:58:02,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-12 16:58:02,104 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:02,104 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 16:58:02,104 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-12 16:58:02,105 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:58:02,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:02,105 INFO L85 PathProgramCache]: Analyzing trace with hash -1434663393, now seen corresponding path program 1 times [2022-07-12 16:58:02,105 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:02,105 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267367309] [2022-07-12 16:58:02,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:02,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:02,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:02,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:02,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:02,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:58:02,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:02,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 16:58:02,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:02,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:58:02,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:02,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:02,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:02,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:58:02,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:02,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 16:58:02,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:02,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 16:58:02,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:02,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 16:58:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:02,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 16:58:02,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:02,399 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 16:58:02,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:02,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267367309] [2022-07-12 16:58:02,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1267367309] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:02,400 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:02,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:58:02,400 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [100308208] [2022-07-12 16:58:02,400 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:02,401 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:58:02,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:02,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:58:02,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:58:02,402 INFO L87 Difference]: Start difference. First operand 1781 states and 2401 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-12 16:58:06,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:06,019 INFO L93 Difference]: Finished difference Result 1781 states and 2401 transitions. [2022-07-12 16:58:06,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:58:06,019 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) Word has length 67 [2022-07-12 16:58:06,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:06,028 INFO L225 Difference]: With dead ends: 1781 [2022-07-12 16:58:06,029 INFO L226 Difference]: Without dead ends: 1779 [2022-07-12 16:58:06,030 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:58:06,031 INFO L413 NwaCegarLoop]: 2190 mSDtfsCounter, 4421 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2393 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4567 SdHoareTripleChecker+Valid, 3455 SdHoareTripleChecker+Invalid, 3947 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1554 IncrementalHoareTripleChecker+Valid, 2393 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:06,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4567 Valid, 3455 Invalid, 3947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1554 Valid, 2393 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-07-12 16:58:06,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2022-07-12 16:58:06,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 1779. [2022-07-12 16:58:06,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1779 states, 1280 states have (on average 1.30703125) internal successors, (1673), 1323 states have internal predecessors, (1673), 364 states have call successors, (364), 110 states have call predecessors, (364), 109 states have return successors, (362), 355 states have call predecessors, (362), 362 states have call successors, (362) [2022-07-12 16:58:06,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2399 transitions. [2022-07-12 16:58:06,100 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2399 transitions. Word has length 67 [2022-07-12 16:58:06,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:06,101 INFO L495 AbstractCegarLoop]: Abstraction has 1779 states and 2399 transitions. [2022-07-12 16:58:06,101 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-12 16:58:06,101 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2399 transitions. [2022-07-12 16:58:06,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-12 16:58:06,102 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:06,103 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 16:58:06,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-12 16:58:06,103 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:58:06,103 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:06,104 INFO L85 PathProgramCache]: Analyzing trace with hash -901207908, now seen corresponding path program 1 times [2022-07-12 16:58:06,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:06,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137703418] [2022-07-12 16:58:06,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:06,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:06,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:06,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:06,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:06,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:58:06,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:06,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 16:58:06,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:06,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:58:06,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:06,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:06,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:06,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:58:06,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:06,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 16:58:06,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:06,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 16:58:06,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:06,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 16:58:06,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:06,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 16:58:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:06,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 16:58:06,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:06,388 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 16:58:06,389 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:06,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [137703418] [2022-07-12 16:58:06,389 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [137703418] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:06,389 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:06,389 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:58:06,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623743397] [2022-07-12 16:58:06,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:06,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:58:06,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:06,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:58:06,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:58:06,391 INFO L87 Difference]: Start difference. First operand 1779 states and 2399 transitions. Second operand has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-12 16:58:09,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:09,732 INFO L93 Difference]: Finished difference Result 1779 states and 2399 transitions. [2022-07-12 16:58:09,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:58:09,733 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) Word has length 73 [2022-07-12 16:58:09,733 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:09,741 INFO L225 Difference]: With dead ends: 1779 [2022-07-12 16:58:09,741 INFO L226 Difference]: Without dead ends: 1777 [2022-07-12 16:58:09,742 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:58:09,743 INFO L413 NwaCegarLoop]: 2188 mSDtfsCounter, 4415 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2391 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4560 SdHoareTripleChecker+Valid, 3453 SdHoareTripleChecker+Invalid, 3945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1554 IncrementalHoareTripleChecker+Valid, 2391 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:09,743 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4560 Valid, 3453 Invalid, 3945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1554 Valid, 2391 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-12 16:58:09,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2022-07-12 16:58:09,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1777. [2022-07-12 16:58:09,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1777 states, 1279 states have (on average 1.3064894448788116) internal successors, (1671), 1321 states have internal predecessors, (1671), 364 states have call successors, (364), 110 states have call predecessors, (364), 109 states have return successors, (362), 355 states have call predecessors, (362), 362 states have call successors, (362) [2022-07-12 16:58:09,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1777 states to 1777 states and 2397 transitions. [2022-07-12 16:58:09,804 INFO L78 Accepts]: Start accepts. Automaton has 1777 states and 2397 transitions. Word has length 73 [2022-07-12 16:58:09,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:09,805 INFO L495 AbstractCegarLoop]: Abstraction has 1777 states and 2397 transitions. [2022-07-12 16:58:09,805 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.333333333333333) internal successors, (44), 4 states have internal predecessors, (44), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-12 16:58:09,805 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 2397 transitions. [2022-07-12 16:58:09,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-12 16:58:09,806 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:09,807 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 16:58:09,807 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-12 16:58:09,807 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:58:09,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:09,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1789613504, now seen corresponding path program 1 times [2022-07-12 16:58:09,808 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:09,808 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977027182] [2022-07-12 16:58:09,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:09,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:09,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:09,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:09,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:58:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 16:58:10,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:58:10,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:10,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:58:10,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 16:58:10,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 16:58:10,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 16:58:10,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 16:58:10,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 16:58:10,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 16:58:10,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:10,122 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 16:58:10,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:10,122 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977027182] [2022-07-12 16:58:10,122 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977027182] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:10,123 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:10,123 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:58:10,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289996657] [2022-07-12 16:58:10,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:10,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:58:10,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:10,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:58:10,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:58:10,126 INFO L87 Difference]: Start difference. First operand 1777 states and 2397 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 16:58:13,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:13,474 INFO L93 Difference]: Finished difference Result 1777 states and 2397 transitions. [2022-07-12 16:58:13,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:58:13,474 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 79 [2022-07-12 16:58:13,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:13,483 INFO L225 Difference]: With dead ends: 1777 [2022-07-12 16:58:13,483 INFO L226 Difference]: Without dead ends: 1775 [2022-07-12 16:58:13,484 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:58:13,485 INFO L413 NwaCegarLoop]: 2186 mSDtfsCounter, 4409 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2389 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4553 SdHoareTripleChecker+Valid, 3451 SdHoareTripleChecker+Invalid, 3943 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1554 IncrementalHoareTripleChecker+Valid, 2389 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:13,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4553 Valid, 3451 Invalid, 3943 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1554 Valid, 2389 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-12 16:58:13,488 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2022-07-12 16:58:13,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1775. [2022-07-12 16:58:13,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1775 states, 1278 states have (on average 1.305946791862285) internal successors, (1669), 1319 states have internal predecessors, (1669), 364 states have call successors, (364), 110 states have call predecessors, (364), 109 states have return successors, (362), 355 states have call predecessors, (362), 362 states have call successors, (362) [2022-07-12 16:58:13,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 2395 transitions. [2022-07-12 16:58:13,551 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 2395 transitions. Word has length 79 [2022-07-12 16:58:13,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:13,552 INFO L495 AbstractCegarLoop]: Abstraction has 1775 states and 2395 transitions. [2022-07-12 16:58:13,552 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 4 states have internal predecessors, (48), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-12 16:58:13,552 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2395 transitions. [2022-07-12 16:58:13,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-12 16:58:13,553 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:13,553 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 16:58:13,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-12 16:58:13,554 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:58:13,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:13,554 INFO L85 PathProgramCache]: Analyzing trace with hash -1235042294, now seen corresponding path program 1 times [2022-07-12 16:58:13,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:13,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580406073] [2022-07-12 16:58:13,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:13,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:13,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:13,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:58:13,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 16:58:13,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:58:13,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:13,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:58:13,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 16:58:13,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 16:58:13,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,802 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 16:58:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 16:58:13,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 16:58:13,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 16:58:13,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 16:58:13,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:13,847 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 16:58:13,848 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:13,848 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580406073] [2022-07-12 16:58:13,848 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580406073] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:13,848 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:13,848 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:58:13,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736995981] [2022-07-12 16:58:13,849 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:13,849 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:58:13,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:13,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:58:13,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:58:13,850 INFO L87 Difference]: Start difference. First operand 1775 states and 2395 transitions. Second operand has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 16:58:17,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:17,051 INFO L93 Difference]: Finished difference Result 1775 states and 2395 transitions. [2022-07-12 16:58:17,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:58:17,052 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) Word has length 85 [2022-07-12 16:58:17,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:17,059 INFO L225 Difference]: With dead ends: 1775 [2022-07-12 16:58:17,059 INFO L226 Difference]: Without dead ends: 1773 [2022-07-12 16:58:17,060 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:58:17,061 INFO L413 NwaCegarLoop]: 2184 mSDtfsCounter, 4403 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2387 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4546 SdHoareTripleChecker+Valid, 3449 SdHoareTripleChecker+Invalid, 3941 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1554 IncrementalHoareTripleChecker+Valid, 2387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:17,061 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4546 Valid, 3449 Invalid, 3941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1554 Valid, 2387 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-12 16:58:17,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2022-07-12 16:58:17,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 1773. [2022-07-12 16:58:17,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1773 states, 1277 states have (on average 1.3054032889584966) internal successors, (1667), 1317 states have internal predecessors, (1667), 364 states have call successors, (364), 110 states have call predecessors, (364), 109 states have return successors, (362), 355 states have call predecessors, (362), 362 states have call successors, (362) [2022-07-12 16:58:17,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2393 transitions. [2022-07-12 16:58:17,124 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2393 transitions. Word has length 85 [2022-07-12 16:58:17,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:17,124 INFO L495 AbstractCegarLoop]: Abstraction has 1773 states and 2393 transitions. [2022-07-12 16:58:17,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.666666666666666) internal successors, (52), 4 states have internal predecessors, (52), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-12 16:58:17,125 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2393 transitions. [2022-07-12 16:58:17,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-12 16:58:17,125 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:17,126 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 16:58:17,126 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-12 16:58:17,126 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:58:17,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:17,127 INFO L85 PathProgramCache]: Analyzing trace with hash -892313890, now seen corresponding path program 1 times [2022-07-12 16:58:17,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:17,127 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65350029] [2022-07-12 16:58:17,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:17,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:17,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:17,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:58:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 16:58:17,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:58:17,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:17,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,358 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:58:17,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 16:58:17,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,376 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 16:58:17,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 16:58:17,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 16:58:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 16:58:17,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 16:58:17,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 16:58:17,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 16:58:17,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:17,437 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 16:58:17,438 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:17,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65350029] [2022-07-12 16:58:17,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65350029] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:17,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:17,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:58:17,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012286880] [2022-07-12 16:58:17,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:17,439 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:58:17,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:17,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:58:17,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:58:17,440 INFO L87 Difference]: Start difference. First operand 1773 states and 2393 transitions. Second operand has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 16:58:20,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:20,829 INFO L93 Difference]: Finished difference Result 1773 states and 2393 transitions. [2022-07-12 16:58:20,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:58:20,830 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 91 [2022-07-12 16:58:20,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:20,856 INFO L225 Difference]: With dead ends: 1773 [2022-07-12 16:58:20,856 INFO L226 Difference]: Without dead ends: 1771 [2022-07-12 16:58:20,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:58:20,871 INFO L413 NwaCegarLoop]: 2182 mSDtfsCounter, 4401 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2381 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4543 SdHoareTripleChecker+Valid, 3447 SdHoareTripleChecker+Invalid, 3935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1554 IncrementalHoareTripleChecker+Valid, 2381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:20,872 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4543 Valid, 3447 Invalid, 3935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1554 Valid, 2381 Invalid, 0 Unknown, 0 Unchecked, 3.2s Time] [2022-07-12 16:58:20,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2022-07-12 16:58:20,959 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 1771. [2022-07-12 16:58:20,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1771 states, 1276 states have (on average 1.304858934169279) internal successors, (1665), 1315 states have internal predecessors, (1665), 364 states have call successors, (364), 110 states have call predecessors, (364), 109 states have return successors, (362), 355 states have call predecessors, (362), 362 states have call successors, (362) [2022-07-12 16:58:20,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2391 transitions. [2022-07-12 16:58:20,970 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2391 transitions. Word has length 91 [2022-07-12 16:58:20,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:20,970 INFO L495 AbstractCegarLoop]: Abstraction has 1771 states and 2391 transitions. [2022-07-12 16:58:20,971 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.333333333333334) internal successors, (56), 4 states have internal predecessors, (56), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 16:58:20,971 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2391 transitions. [2022-07-12 16:58:20,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-12 16:58:20,972 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:20,972 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 16:58:20,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-12 16:58:20,972 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:58:20,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:20,973 INFO L85 PathProgramCache]: Analyzing trace with hash 1479975649, now seen corresponding path program 1 times [2022-07-12 16:58:20,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:20,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126619734] [2022-07-12 16:58:20,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:20,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:21,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:21,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:58:21,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 16:58:21,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:58:21,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:21,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:58:21,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 16:58:21,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 16:58:21,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 16:58:21,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 16:58:21,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 16:58:21,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 16:58:21,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 16:58:21,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 16:58:21,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:21,289 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 16:58:21,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:21,290 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126619734] [2022-07-12 16:58:21,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126619734] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:21,290 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:21,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:58:21,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857957924] [2022-07-12 16:58:21,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:21,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:58:21,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:21,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:58:21,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:58:21,293 INFO L87 Difference]: Start difference. First operand 1771 states and 2391 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 16:58:24,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:24,781 INFO L93 Difference]: Finished difference Result 1771 states and 2391 transitions. [2022-07-12 16:58:24,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:58:24,782 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 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 93 [2022-07-12 16:58:24,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:24,788 INFO L225 Difference]: With dead ends: 1771 [2022-07-12 16:58:24,789 INFO L226 Difference]: Without dead ends: 1769 [2022-07-12 16:58:24,790 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:58:24,790 INFO L413 NwaCegarLoop]: 2180 mSDtfsCounter, 4389 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2383 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4531 SdHoareTripleChecker+Valid, 3445 SdHoareTripleChecker+Invalid, 3937 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1554 IncrementalHoareTripleChecker+Valid, 2383 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:24,790 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4531 Valid, 3445 Invalid, 3937 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1554 Valid, 2383 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-07-12 16:58:24,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1769 states. [2022-07-12 16:58:24,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1769 to 1769. [2022-07-12 16:58:24,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1769 states, 1275 states have (on average 1.304313725490196) internal successors, (1663), 1313 states have internal predecessors, (1663), 364 states have call successors, (364), 110 states have call predecessors, (364), 109 states have return successors, (362), 355 states have call predecessors, (362), 362 states have call successors, (362) [2022-07-12 16:58:24,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 2389 transitions. [2022-07-12 16:58:24,868 INFO L78 Accepts]: Start accepts. Automaton has 1769 states and 2389 transitions. Word has length 93 [2022-07-12 16:58:24,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:24,869 INFO L495 AbstractCegarLoop]: Abstraction has 1769 states and 2389 transitions. [2022-07-12 16:58:24,869 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-12 16:58:24,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 2389 transitions. [2022-07-12 16:58:24,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-12 16:58:24,871 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:24,871 INFO L195 NwaCegarLoop]: trace histogram [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] [2022-07-12 16:58:24,871 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-12 16:58:24,871 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:58:24,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:24,872 INFO L85 PathProgramCache]: Analyzing trace with hash 782366646, now seen corresponding path program 1 times [2022-07-12 16:58:24,872 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:24,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580279455] [2022-07-12 16:58:24,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:24,872 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:24,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:25,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:58:25,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 16:58:25,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:58:25,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:25,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:58:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 16:58:25,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 16:58:25,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 16:58:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 16:58:25,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 16:58:25,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 16:58:25,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 16:58:25,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 16:58:25,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 16:58:25,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:25,171 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 16:58:25,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:25,171 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580279455] [2022-07-12 16:58:25,172 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580279455] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:25,172 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:25,172 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:58:25,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [324230427] [2022-07-12 16:58:25,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:25,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:58:25,173 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:25,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:58:25,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:58:25,174 INFO L87 Difference]: Start difference. First operand 1769 states and 2389 transitions. Second operand has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 16:58:33,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:33,456 INFO L93 Difference]: Finished difference Result 3451 states and 4689 transitions. [2022-07-12 16:58:33,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 16:58:33,457 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 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 99 [2022-07-12 16:58:33,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:33,474 INFO L225 Difference]: With dead ends: 3451 [2022-07-12 16:58:33,475 INFO L226 Difference]: Without dead ends: 3449 [2022-07-12 16:58:33,477 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-12 16:58:33,478 INFO L413 NwaCegarLoop]: 3970 mSDtfsCounter, 4725 mSDsluCounter, 2701 mSDsCounter, 0 mSdLazyCounter, 6298 mSolverCounterSat, 2160 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4851 SdHoareTripleChecker+Valid, 6671 SdHoareTripleChecker+Invalid, 8458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2160 IncrementalHoareTripleChecker+Valid, 6298 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:33,478 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4851 Valid, 6671 Invalid, 8458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2160 Valid, 6298 Invalid, 0 Unknown, 0 Unchecked, 7.9s Time] [2022-07-12 16:58:33,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3449 states. [2022-07-12 16:58:33,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3449 to 3404. [2022-07-12 16:58:33,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3404 states, 2487 states have (on average 1.3104141535987133) internal successors, (3259), 2543 states have internal predecessors, (3259), 680 states have call successors, (680), 217 states have call predecessors, (680), 216 states have return successors, (722), 663 states have call predecessors, (722), 678 states have call successors, (722) [2022-07-12 16:58:33,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3404 states to 3404 states and 4661 transitions. [2022-07-12 16:58:33,651 INFO L78 Accepts]: Start accepts. Automaton has 3404 states and 4661 transitions. Word has length 99 [2022-07-12 16:58:33,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:33,651 INFO L495 AbstractCegarLoop]: Abstraction has 3404 states and 4661 transitions. [2022-07-12 16:58:33,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.333333333333334) internal successors, (62), 4 states have internal predecessors, (62), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-12 16:58:33,652 INFO L276 IsEmpty]: Start isEmpty. Operand 3404 states and 4661 transitions. [2022-07-12 16:58:33,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-12 16:58:33,653 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:33,653 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:58:33,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-12 16:58:33,654 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:58:33,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:33,654 INFO L85 PathProgramCache]: Analyzing trace with hash -790324929, now seen corresponding path program 1 times [2022-07-12 16:58:33,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:33,654 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198193547] [2022-07-12 16:58:33,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:33,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:33,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:33,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:33,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:33,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:58:33,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:33,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 16:58:33,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:33,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:58:33,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:33,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:33,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:33,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:58:33,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:33,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 16:58:33,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:33,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 16:58:33,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:33,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 16:58:33,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:33,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 16:58:33,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:33,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 16:58:33,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:33,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 16:58:33,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:33,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 16:58:33,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:33,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 16:58:33,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:33,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 16:58:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:33,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 16:58:33,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:33,944 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 16:58:33,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:33,945 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198193547] [2022-07-12 16:58:33,945 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1198193547] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:33,945 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:33,945 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:58:33,945 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152568710] [2022-07-12 16:58:33,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:33,946 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:58:33,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:33,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:58:33,947 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:58:33,947 INFO L87 Difference]: Start difference. First operand 3404 states and 4661 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 16:58:37,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:37,702 INFO L93 Difference]: Finished difference Result 3404 states and 4661 transitions. [2022-07-12 16:58:37,703 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:58:37,703 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 105 [2022-07-12 16:58:37,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:37,721 INFO L225 Difference]: With dead ends: 3404 [2022-07-12 16:58:37,721 INFO L226 Difference]: Without dead ends: 3402 [2022-07-12 16:58:37,723 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:58:37,723 INFO L413 NwaCegarLoop]: 2178 mSDtfsCounter, 4385 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2381 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4525 SdHoareTripleChecker+Valid, 3443 SdHoareTripleChecker+Invalid, 3935 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1554 IncrementalHoareTripleChecker+Valid, 2381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:37,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4525 Valid, 3443 Invalid, 3935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1554 Valid, 2381 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-07-12 16:58:37,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3402 states. [2022-07-12 16:58:37,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3402 to 3402. [2022-07-12 16:58:37,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3402 states, 2486 states have (on average 1.3097345132743363) internal successors, (3256), 2541 states have internal predecessors, (3256), 680 states have call successors, (680), 217 states have call predecessors, (680), 216 states have return successors, (722), 663 states have call predecessors, (722), 678 states have call successors, (722) [2022-07-12 16:58:37,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3402 states to 3402 states and 4658 transitions. [2022-07-12 16:58:37,877 INFO L78 Accepts]: Start accepts. Automaton has 3402 states and 4658 transitions. Word has length 105 [2022-07-12 16:58:37,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:37,878 INFO L495 AbstractCegarLoop]: Abstraction has 3402 states and 4658 transitions. [2022-07-12 16:58:37,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 4 states have internal predecessors, (66), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-12 16:58:37,878 INFO L276 IsEmpty]: Start isEmpty. Operand 3402 states and 4658 transitions. [2022-07-12 16:58:37,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-12 16:58:37,880 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:37,880 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:58:37,880 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-12 16:58:37,880 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:58:37,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:37,881 INFO L85 PathProgramCache]: Analyzing trace with hash -9933911, now seen corresponding path program 1 times [2022-07-12 16:58:37,881 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:37,881 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869044890] [2022-07-12 16:58:37,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:37,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:37,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:38,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:38,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:38,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:58:38,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:38,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 16:58:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:38,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:58:38,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:38,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:38,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:38,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:58:38,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:38,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 16:58:38,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:38,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 16:58:38,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:38,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 16:58:38,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:38,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 16:58:38,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:38,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 16:58:38,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:38,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 16:58:38,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:38,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 16:58:38,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:38,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 16:58:38,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:38,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 16:58:38,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:38,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 16:58:38,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:38,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 16:58:38,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:38,203 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 16:58:38,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:38,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1869044890] [2022-07-12 16:58:38,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1869044890] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:38,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:38,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:58:38,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375640123] [2022-07-12 16:58:38,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:38,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:58:38,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:38,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:58:38,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:58:38,206 INFO L87 Difference]: Start difference. First operand 3402 states and 4658 transitions. Second operand has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 16:58:41,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:41,931 INFO L93 Difference]: Finished difference Result 3402 states and 4658 transitions. [2022-07-12 16:58:41,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:58:41,932 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 111 [2022-07-12 16:58:41,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:41,951 INFO L225 Difference]: With dead ends: 3402 [2022-07-12 16:58:41,951 INFO L226 Difference]: Without dead ends: 3400 [2022-07-12 16:58:41,954 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:58:41,955 INFO L413 NwaCegarLoop]: 2176 mSDtfsCounter, 4379 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2379 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4518 SdHoareTripleChecker+Valid, 3441 SdHoareTripleChecker+Invalid, 3933 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1554 IncrementalHoareTripleChecker+Valid, 2379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:41,956 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4518 Valid, 3441 Invalid, 3933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1554 Valid, 2379 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-07-12 16:58:41,960 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3400 states. [2022-07-12 16:58:42,140 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3400 to 3400. [2022-07-12 16:58:42,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3400 states, 2485 states have (on average 1.3090543259557343) internal successors, (3253), 2539 states have internal predecessors, (3253), 680 states have call successors, (680), 217 states have call predecessors, (680), 216 states have return successors, (722), 663 states have call predecessors, (722), 678 states have call successors, (722) [2022-07-12 16:58:42,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3400 states to 3400 states and 4655 transitions. [2022-07-12 16:58:42,161 INFO L78 Accepts]: Start accepts. Automaton has 3400 states and 4655 transitions. Word has length 111 [2022-07-12 16:58:42,162 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:42,162 INFO L495 AbstractCegarLoop]: Abstraction has 3400 states and 4655 transitions. [2022-07-12 16:58:42,162 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.666666666666666) internal successors, (70), 4 states have internal predecessors, (70), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-12 16:58:42,162 INFO L276 IsEmpty]: Start isEmpty. Operand 3400 states and 4655 transitions. [2022-07-12 16:58:42,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-12 16:58:42,164 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:42,164 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:58:42,164 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-12 16:58:42,164 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:58:42,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:42,165 INFO L85 PathProgramCache]: Analyzing trace with hash 151245329, now seen corresponding path program 1 times [2022-07-12 16:58:42,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:42,165 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461016472] [2022-07-12 16:58:42,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:42,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:42,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:42,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:42,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:42,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:58:42,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:42,330 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 16:58:42,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:42,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:58:42,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:42,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:42,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:42,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:58:42,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:42,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 16:58:42,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:42,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 16:58:42,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:42,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 16:58:42,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:42,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 16:58:42,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:42,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 16:58:42,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:42,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 16:58:42,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:42,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 16:58:42,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:42,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 16:58:42,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:42,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 16:58:42,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:42,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 16:58:42,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:42,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 16:58:42,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:42,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 16:58:42,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:42,473 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 16:58:42,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:42,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461016472] [2022-07-12 16:58:42,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461016472] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:42,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:42,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:58:42,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750946597] [2022-07-12 16:58:42,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:42,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:58:42,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:42,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:58:42,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:58:42,476 INFO L87 Difference]: Start difference. First operand 3400 states and 4655 transitions. Second operand has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 16:58:46,042 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:46,042 INFO L93 Difference]: Finished difference Result 3400 states and 4655 transitions. [2022-07-12 16:58:46,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:58:46,043 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 117 [2022-07-12 16:58:46,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:46,060 INFO L225 Difference]: With dead ends: 3400 [2022-07-12 16:58:46,060 INFO L226 Difference]: Without dead ends: 3398 [2022-07-12 16:58:46,063 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:58:46,064 INFO L413 NwaCegarLoop]: 2174 mSDtfsCounter, 4373 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2377 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4511 SdHoareTripleChecker+Valid, 3439 SdHoareTripleChecker+Invalid, 3931 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1554 IncrementalHoareTripleChecker+Valid, 2377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:46,064 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4511 Valid, 3439 Invalid, 3931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1554 Valid, 2377 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-07-12 16:58:46,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2022-07-12 16:58:46,216 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 3398. [2022-07-12 16:58:46,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3398 states, 2484 states have (on average 1.3083735909822867) internal successors, (3250), 2537 states have internal predecessors, (3250), 680 states have call successors, (680), 217 states have call predecessors, (680), 216 states have return successors, (722), 663 states have call predecessors, (722), 678 states have call successors, (722) [2022-07-12 16:58:46,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3398 states to 3398 states and 4652 transitions. [2022-07-12 16:58:46,238 INFO L78 Accepts]: Start accepts. Automaton has 3398 states and 4652 transitions. Word has length 117 [2022-07-12 16:58:46,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:46,239 INFO L495 AbstractCegarLoop]: Abstraction has 3398 states and 4652 transitions. [2022-07-12 16:58:46,239 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.333333333333334) internal successors, (74), 4 states have internal predecessors, (74), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-12 16:58:46,239 INFO L276 IsEmpty]: Start isEmpty. Operand 3398 states and 4652 transitions. [2022-07-12 16:58:46,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-12 16:58:46,240 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:46,240 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:58:46,241 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-12 16:58:46,241 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:58:46,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:46,241 INFO L85 PathProgramCache]: Analyzing trace with hash -159316302, now seen corresponding path program 1 times [2022-07-12 16:58:46,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:46,242 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102211518] [2022-07-12 16:58:46,242 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:46,242 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:46,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:46,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:46,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:46,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:58:46,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:46,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 16:58:46,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:46,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:58:46,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:46,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:46,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:46,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:58:46,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:46,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 16:58:46,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:46,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 16:58:46,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:46,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 16:58:46,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:46,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 16:58:46,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:46,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 16:58:46,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:46,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 16:58:46,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:46,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 16:58:46,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:46,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 16:58:46,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:46,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 16:58:46,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:46,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 16:58:46,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:46,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 16:58:46,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:46,556 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 16:58:46,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:46,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 16:58:46,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:46,574 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 16:58:46,575 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:46,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102211518] [2022-07-12 16:58:46,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102211518] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:46,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:46,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:58:46,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [834333524] [2022-07-12 16:58:46,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:46,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:58:46,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:46,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:58:46,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:58:46,577 INFO L87 Difference]: Start difference. First operand 3398 states and 4652 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 16:58:50,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:50,406 INFO L93 Difference]: Finished difference Result 3398 states and 4652 transitions. [2022-07-12 16:58:50,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:58:50,407 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) Word has length 123 [2022-07-12 16:58:50,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:50,423 INFO L225 Difference]: With dead ends: 3398 [2022-07-12 16:58:50,423 INFO L226 Difference]: Without dead ends: 3396 [2022-07-12 16:58:50,426 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:58:50,427 INFO L413 NwaCegarLoop]: 2172 mSDtfsCounter, 4367 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2375 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4504 SdHoareTripleChecker+Valid, 3437 SdHoareTripleChecker+Invalid, 3929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1554 IncrementalHoareTripleChecker+Valid, 2375 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:50,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4504 Valid, 3437 Invalid, 3929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1554 Valid, 2375 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2022-07-12 16:58:50,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3396 states. [2022-07-12 16:58:50,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3396 to 3396. [2022-07-12 16:58:50,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3396 states, 2483 states have (on average 1.3076923076923077) internal successors, (3247), 2535 states have internal predecessors, (3247), 680 states have call successors, (680), 217 states have call predecessors, (680), 216 states have return successors, (722), 663 states have call predecessors, (722), 678 states have call successors, (722) [2022-07-12 16:58:50,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3396 states to 3396 states and 4649 transitions. [2022-07-12 16:58:50,596 INFO L78 Accepts]: Start accepts. Automaton has 3396 states and 4649 transitions. Word has length 123 [2022-07-12 16:58:50,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:50,596 INFO L495 AbstractCegarLoop]: Abstraction has 3396 states and 4649 transitions. [2022-07-12 16:58:50,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-12 16:58:50,597 INFO L276 IsEmpty]: Start isEmpty. Operand 3396 states and 4649 transitions. [2022-07-12 16:58:50,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-12 16:58:50,598 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:50,598 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:58:50,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-12 16:58:50,599 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:58:50,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:50,600 INFO L85 PathProgramCache]: Analyzing trace with hash 1766972875, now seen corresponding path program 1 times [2022-07-12 16:58:50,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:50,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773174501] [2022-07-12 16:58:50,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:50,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:50,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:50,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:50,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:50,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:58:50,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:50,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 16:58:50,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:50,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:58:50,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:50,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:50,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:50,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:58:50,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:50,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 16:58:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:50,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 16:58:50,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:50,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 16:58:50,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:50,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 16:58:50,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:50,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 16:58:50,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:50,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 16:58:50,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:50,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 16:58:50,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:50,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 16:58:50,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:50,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 16:58:50,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:50,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 16:58:50,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:50,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 16:58:50,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:50,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 16:58:50,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:50,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 16:58:50,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:51,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 16:58:51,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:51,015 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 16:58:51,015 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:51,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773174501] [2022-07-12 16:58:51,015 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773174501] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:51,016 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:51,016 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:58:51,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153455829] [2022-07-12 16:58:51,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:51,016 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:58:51,017 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:51,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:58:51,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:58:51,017 INFO L87 Difference]: Start difference. First operand 3396 states and 4649 transitions. Second operand has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-12 16:58:54,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:54,693 INFO L93 Difference]: Finished difference Result 3396 states and 4649 transitions. [2022-07-12 16:58:54,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:58:54,693 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 129 [2022-07-12 16:58:54,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:54,704 INFO L225 Difference]: With dead ends: 3396 [2022-07-12 16:58:54,704 INFO L226 Difference]: Without dead ends: 3394 [2022-07-12 16:58:54,706 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:58:54,706 INFO L413 NwaCegarLoop]: 2170 mSDtfsCounter, 4361 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2373 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4497 SdHoareTripleChecker+Valid, 3435 SdHoareTripleChecker+Invalid, 3927 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1554 IncrementalHoareTripleChecker+Valid, 2373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:54,706 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4497 Valid, 3435 Invalid, 3927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1554 Valid, 2373 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-07-12 16:58:54,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3394 states. [2022-07-12 16:58:54,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3394 to 3394. [2022-07-12 16:58:54,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3394 states, 2482 states have (on average 1.3070104754230458) internal successors, (3244), 2533 states have internal predecessors, (3244), 680 states have call successors, (680), 217 states have call predecessors, (680), 216 states have return successors, (722), 663 states have call predecessors, (722), 678 states have call successors, (722) [2022-07-12 16:58:54,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3394 states to 3394 states and 4646 transitions. [2022-07-12 16:58:54,876 INFO L78 Accepts]: Start accepts. Automaton has 3394 states and 4646 transitions. Word has length 129 [2022-07-12 16:58:54,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:54,877 INFO L495 AbstractCegarLoop]: Abstraction has 3394 states and 4646 transitions. [2022-07-12 16:58:54,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.666666666666666) internal successors, (82), 4 states have internal predecessors, (82), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-12 16:58:54,877 INFO L276 IsEmpty]: Start isEmpty. Operand 3394 states and 4646 transitions. [2022-07-12 16:58:54,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-12 16:58:54,878 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:54,879 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:58:54,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-12 16:58:54,879 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:58:54,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:54,879 INFO L85 PathProgramCache]: Analyzing trace with hash 796582475, now seen corresponding path program 1 times [2022-07-12 16:58:54,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:54,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658975673] [2022-07-12 16:58:54,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:54,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:54,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:55,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:55,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:55,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:58:55,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:55,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 16:58:55,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:55,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:58:55,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:55,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:55,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:55,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:58:55,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:55,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 16:58:55,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:55,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 16:58:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:55,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 16:58:55,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:55,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 16:58:55,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:55,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 16:58:55,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:55,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 16:58:55,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:55,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 16:58:55,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:55,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 16:58:55,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:55,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 16:58:55,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:55,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 16:58:55,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:55,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 16:58:55,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:55,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 16:58:55,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:55,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 16:58:55,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:55,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 16:58:55,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:55,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 16:58:55,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:55,217 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 16:58:55,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:55,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658975673] [2022-07-12 16:58:55,220 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658975673] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:55,220 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:55,220 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:58:55,220 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966723466] [2022-07-12 16:58:55,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:55,221 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:58:55,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:55,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:58:55,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:58:55,222 INFO L87 Difference]: Start difference. First operand 3394 states and 4646 transitions. Second operand has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 16:58:59,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:58:59,200 INFO L93 Difference]: Finished difference Result 3394 states and 4646 transitions. [2022-07-12 16:58:59,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:58:59,204 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) Word has length 135 [2022-07-12 16:58:59,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:58:59,219 INFO L225 Difference]: With dead ends: 3394 [2022-07-12 16:58:59,219 INFO L226 Difference]: Without dead ends: 3392 [2022-07-12 16:58:59,222 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:58:59,223 INFO L413 NwaCegarLoop]: 2168 mSDtfsCounter, 4355 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2371 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4490 SdHoareTripleChecker+Valid, 3433 SdHoareTripleChecker+Invalid, 3925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1554 IncrementalHoareTripleChecker+Valid, 2371 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2022-07-12 16:58:59,223 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4490 Valid, 3433 Invalid, 3925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1554 Valid, 2371 Invalid, 0 Unknown, 0 Unchecked, 3.7s Time] [2022-07-12 16:58:59,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3392 states. [2022-07-12 16:58:59,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3392 to 3392. [2022-07-12 16:58:59,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3392 states, 2481 states have (on average 1.3063280935106811) internal successors, (3241), 2531 states have internal predecessors, (3241), 680 states have call successors, (680), 217 states have call predecessors, (680), 216 states have return successors, (722), 663 states have call predecessors, (722), 678 states have call successors, (722) [2022-07-12 16:58:59,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3392 states to 3392 states and 4643 transitions. [2022-07-12 16:58:59,409 INFO L78 Accepts]: Start accepts. Automaton has 3392 states and 4643 transitions. Word has length 135 [2022-07-12 16:58:59,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:58:59,410 INFO L495 AbstractCegarLoop]: Abstraction has 3392 states and 4643 transitions. [2022-07-12 16:58:59,411 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.333333333333334) internal successors, (86), 4 states have internal predecessors, (86), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-12 16:58:59,411 INFO L276 IsEmpty]: Start isEmpty. Operand 3392 states and 4643 transitions. [2022-07-12 16:58:59,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-12 16:58:59,413 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:58:59,413 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:58:59,413 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-12 16:58:59,413 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:58:59,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:58:59,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1589534682, now seen corresponding path program 1 times [2022-07-12 16:58:59,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:58:59,414 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [886259867] [2022-07-12 16:58:59,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:58:59,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:58:59,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:59,591 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:58:59,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:59,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:58:59,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:59,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 16:58:59,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:59,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:58:59,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:59,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:58:59,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:59,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:58:59,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:59,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 16:58:59,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:59,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 16:58:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:59,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 16:58:59,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:59,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 16:58:59,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:59,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 16:58:59,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:59,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 16:58:59,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:59,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 16:58:59,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:59,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 16:58:59,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:59,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 16:58:59,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:59,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 16:58:59,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:59,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 16:58:59,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:59,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 16:58:59,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:59,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 16:58:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:59,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 16:58:59,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:59,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 16:58:59,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:59,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-12 16:58:59,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:58:59,785 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 16:58:59,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:58:59,786 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [886259867] [2022-07-12 16:58:59,786 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [886259867] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:58:59,786 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:58:59,786 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:58:59,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794358128] [2022-07-12 16:58:59,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:58:59,787 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:58:59,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:58:59,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:58:59,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:58:59,788 INFO L87 Difference]: Start difference. First operand 3392 states and 4643 transitions. Second operand has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-12 16:59:03,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:59:03,609 INFO L93 Difference]: Finished difference Result 3392 states and 4643 transitions. [2022-07-12 16:59:03,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:59:03,610 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) Word has length 141 [2022-07-12 16:59:03,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:59:03,621 INFO L225 Difference]: With dead ends: 3392 [2022-07-12 16:59:03,622 INFO L226 Difference]: Without dead ends: 3390 [2022-07-12 16:59:03,623 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:59:03,624 INFO L413 NwaCegarLoop]: 2166 mSDtfsCounter, 4349 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2369 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4483 SdHoareTripleChecker+Valid, 3431 SdHoareTripleChecker+Invalid, 3923 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1554 IncrementalHoareTripleChecker+Valid, 2369 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-07-12 16:59:03,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4483 Valid, 3431 Invalid, 3923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1554 Valid, 2369 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-07-12 16:59:03,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3390 states. [2022-07-12 16:59:03,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3390 to 3390. [2022-07-12 16:59:03,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3390 states, 2480 states have (on average 1.3056451612903226) internal successors, (3238), 2529 states have internal predecessors, (3238), 680 states have call successors, (680), 217 states have call predecessors, (680), 216 states have return successors, (722), 663 states have call predecessors, (722), 678 states have call successors, (722) [2022-07-12 16:59:03,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3390 states to 3390 states and 4640 transitions. [2022-07-12 16:59:03,807 INFO L78 Accepts]: Start accepts. Automaton has 3390 states and 4640 transitions. Word has length 141 [2022-07-12 16:59:03,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:59:03,807 INFO L495 AbstractCegarLoop]: Abstraction has 3390 states and 4640 transitions. [2022-07-12 16:59:03,808 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.0) internal successors, (90), 4 states have internal predecessors, (90), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-12 16:59:03,808 INFO L276 IsEmpty]: Start isEmpty. Operand 3390 states and 4640 transitions. [2022-07-12 16:59:03,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-12 16:59:03,809 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:59:03,810 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:59:03,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-12 16:59:03,810 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:59:03,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:59:03,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1464303862, now seen corresponding path program 1 times [2022-07-12 16:59:03,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:59:03,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1979518777] [2022-07-12 16:59:03,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:59:03,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:59:03,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:03,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:59:03,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:03,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:03,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:03,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 16:59:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:03,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:59:03,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:03,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:03,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:59:03,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:03,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 16:59:03,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:04,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 16:59:04,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:04,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 16:59:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:04,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 16:59:04,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:04,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 16:59:04,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:04,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 16:59:04,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:04,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 16:59:04,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:04,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 16:59:04,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:04,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 16:59:04,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:04,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 16:59:04,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:04,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 16:59:04,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:04,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 16:59:04,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:04,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 16:59:04,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:04,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 16:59:04,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:04,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 16:59:04,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:04,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-12 16:59:04,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:04,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 16:59:04,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:04,136 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 16:59:04,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:59:04,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1979518777] [2022-07-12 16:59:04,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1979518777] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:59:04,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:59:04,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:59:04,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038795034] [2022-07-12 16:59:04,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:59:04,139 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:59:04,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:59:04,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:59:04,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:59:04,140 INFO L87 Difference]: Start difference. First operand 3390 states and 4640 transitions. Second operand has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-12 16:59:07,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:59:07,711 INFO L93 Difference]: Finished difference Result 3390 states and 4640 transitions. [2022-07-12 16:59:07,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:59:07,712 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 147 [2022-07-12 16:59:07,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:59:07,728 INFO L225 Difference]: With dead ends: 3390 [2022-07-12 16:59:07,729 INFO L226 Difference]: Without dead ends: 3388 [2022-07-12 16:59:07,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:59:07,732 INFO L413 NwaCegarLoop]: 2164 mSDtfsCounter, 4343 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2367 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4476 SdHoareTripleChecker+Valid, 3429 SdHoareTripleChecker+Invalid, 3921 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1554 IncrementalHoareTripleChecker+Valid, 2367 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2022-07-12 16:59:07,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4476 Valid, 3429 Invalid, 3921 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1554 Valid, 2367 Invalid, 0 Unknown, 0 Unchecked, 3.3s Time] [2022-07-12 16:59:07,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3388 states. [2022-07-12 16:59:07,902 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3388 to 3388. [2022-07-12 16:59:07,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3388 states, 2479 states have (on average 1.3049616780960065) internal successors, (3235), 2527 states have internal predecessors, (3235), 680 states have call successors, (680), 217 states have call predecessors, (680), 216 states have return successors, (722), 663 states have call predecessors, (722), 678 states have call successors, (722) [2022-07-12 16:59:07,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3388 states to 3388 states and 4637 transitions. [2022-07-12 16:59:07,923 INFO L78 Accepts]: Start accepts. Automaton has 3388 states and 4637 transitions. Word has length 147 [2022-07-12 16:59:07,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:59:07,924 INFO L495 AbstractCegarLoop]: Abstraction has 3388 states and 4637 transitions. [2022-07-12 16:59:07,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.666666666666666) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-07-12 16:59:07,924 INFO L276 IsEmpty]: Start isEmpty. Operand 3388 states and 4637 transitions. [2022-07-12 16:59:07,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-12 16:59:07,926 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:59:07,926 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:59:07,927 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-12 16:59:07,928 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:59:07,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:59:07,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1160454884, now seen corresponding path program 1 times [2022-07-12 16:59:07,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:59:07,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284142136] [2022-07-12 16:59:07,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:59:07,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:59:08,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:08,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:59:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:08,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:08,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:08,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 16:59:08,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:08,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:59:08,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:08,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:08,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:08,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:59:08,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:08,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 16:59:08,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:08,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 16:59:08,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:08,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 16:59:08,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:08,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 16:59:08,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:08,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 16:59:08,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:08,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 16:59:08,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:08,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 16:59:08,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:08,207 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 16:59:08,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:08,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 16:59:08,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:08,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 16:59:08,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:08,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 16:59:08,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:08,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 16:59:08,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:08,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 16:59:08,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:08,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 16:59:08,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:08,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 16:59:08,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:08,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-12 16:59:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:08,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 16:59:08,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:08,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-12 16:59:08,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:08,299 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 16:59:08,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:59:08,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284142136] [2022-07-12 16:59:08,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1284142136] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:59:08,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:59:08,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:59:08,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600100774] [2022-07-12 16:59:08,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:59:08,301 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:59:08,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:59:08,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:59:08,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:59:08,302 INFO L87 Difference]: Start difference. First operand 3388 states and 4637 transitions. Second operand has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-12 16:59:15,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:59:15,452 INFO L93 Difference]: Finished difference Result 6689 states and 9291 transitions. [2022-07-12 16:59:15,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-12 16:59:15,453 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 153 [2022-07-12 16:59:15,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:59:15,485 INFO L225 Difference]: With dead ends: 6689 [2022-07-12 16:59:15,485 INFO L226 Difference]: Without dead ends: 6687 [2022-07-12 16:59:15,490 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-12 16:59:15,491 INFO L413 NwaCegarLoop]: 2431 mSDtfsCounter, 6613 mSDsluCounter, 1709 mSDsCounter, 0 mSdLazyCounter, 5127 mSolverCounterSat, 2645 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6731 SdHoareTripleChecker+Valid, 4140 SdHoareTripleChecker+Invalid, 7772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2645 IncrementalHoareTripleChecker+Valid, 5127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.7s IncrementalHoareTripleChecker+Time [2022-07-12 16:59:15,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6731 Valid, 4140 Invalid, 7772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2645 Valid, 5127 Invalid, 0 Unknown, 0 Unchecked, 6.7s Time] [2022-07-12 16:59:15,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6687 states. [2022-07-12 16:59:15,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6687 to 6590. [2022-07-12 16:59:15,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6590 states, 4857 states have (on average 1.3094502779493515) internal successors, (6360), 4941 states have internal predecessors, (6360), 1301 states have call successors, (1301), 420 states have call predecessors, (1301), 419 states have return successors, (1537), 1268 states have call predecessors, (1537), 1299 states have call successors, (1537) [2022-07-12 16:59:15,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6590 states to 6590 states and 9198 transitions. [2022-07-12 16:59:15,928 INFO L78 Accepts]: Start accepts. Automaton has 6590 states and 9198 transitions. Word has length 153 [2022-07-12 16:59:15,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:59:15,929 INFO L495 AbstractCegarLoop]: Abstraction has 6590 states and 9198 transitions. [2022-07-12 16:59:15,929 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.333333333333332) internal successors, (98), 4 states have internal predecessors, (98), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-07-12 16:59:15,929 INFO L276 IsEmpty]: Start isEmpty. Operand 6590 states and 9198 transitions. [2022-07-12 16:59:15,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-07-12 16:59:15,931 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:59:15,931 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:59:15,931 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-12 16:59:15,932 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:59:15,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:59:15,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1625234295, now seen corresponding path program 1 times [2022-07-12 16:59:15,932 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:59:15,932 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1283164140] [2022-07-12 16:59:15,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:59:15,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:59:15,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:16,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:59:16,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:16,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:16,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:16,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 16:59:16,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:16,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:59:16,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:16,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:16,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:16,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:59:16,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:16,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 16:59:16,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:16,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 16:59:16,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:16,139 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 16:59:16,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:16,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 16:59:16,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:16,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 16:59:16,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:16,189 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 16:59:16,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:16,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 16:59:16,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:16,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 16:59:16,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:16,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 16:59:16,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:16,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 16:59:16,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:16,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 16:59:16,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:16,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 16:59:16,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:16,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 16:59:16,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:16,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 16:59:16,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:16,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 16:59:16,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:16,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-12 16:59:16,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:16,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 16:59:16,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:16,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-12 16:59:16,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:16,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-12 16:59:16,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:16,353 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 16:59:16,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:59:16,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1283164140] [2022-07-12 16:59:16,353 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1283164140] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:59:16,353 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:59:16,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:59:16,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80004948] [2022-07-12 16:59:16,354 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:59:16,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:59:16,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:59:16,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:59:16,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:59:16,356 INFO L87 Difference]: Start difference. First operand 6590 states and 9198 transitions. Second operand has 6 states, 6 states have (on average 17.0) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-12 16:59:20,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:59:20,374 INFO L93 Difference]: Finished difference Result 6590 states and 9198 transitions. [2022-07-12 16:59:20,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-12 16:59:20,375 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 159 [2022-07-12 16:59:20,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:59:20,401 INFO L225 Difference]: With dead ends: 6590 [2022-07-12 16:59:20,401 INFO L226 Difference]: Without dead ends: 6588 [2022-07-12 16:59:20,405 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-12 16:59:20,406 INFO L413 NwaCegarLoop]: 2162 mSDtfsCounter, 4337 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2365 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4468 SdHoareTripleChecker+Valid, 3427 SdHoareTripleChecker+Invalid, 3919 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1554 IncrementalHoareTripleChecker+Valid, 2365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2022-07-12 16:59:20,406 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4468 Valid, 3427 Invalid, 3919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1554 Valid, 2365 Invalid, 0 Unknown, 0 Unchecked, 3.6s Time] [2022-07-12 16:59:20,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6588 states. [2022-07-12 16:59:20,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6588 to 6588. [2022-07-12 16:59:20,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6588 states, 4856 states have (on average 1.3091021416803954) internal successors, (6357), 4939 states have internal predecessors, (6357), 1301 states have call successors, (1301), 420 states have call predecessors, (1301), 419 states have return successors, (1537), 1268 states have call predecessors, (1537), 1299 states have call successors, (1537) [2022-07-12 16:59:20,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6588 states to 6588 states and 9195 transitions. [2022-07-12 16:59:20,829 INFO L78 Accepts]: Start accepts. Automaton has 6588 states and 9195 transitions. Word has length 159 [2022-07-12 16:59:20,829 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:59:20,829 INFO L495 AbstractCegarLoop]: Abstraction has 6588 states and 9195 transitions. [2022-07-12 16:59:20,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.0) internal successors, (102), 4 states have internal predecessors, (102), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-07-12 16:59:20,830 INFO L276 IsEmpty]: Start isEmpty. Operand 6588 states and 9195 transitions. [2022-07-12 16:59:20,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-07-12 16:59:20,832 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:59:20,832 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:59:20,832 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-12 16:59:20,832 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_usb_urb_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:59:20,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:59:20,833 INFO L85 PathProgramCache]: Analyzing trace with hash 889461959, now seen corresponding path program 1 times [2022-07-12 16:59:20,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:59:20,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001819986] [2022-07-12 16:59:20,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:59:20,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:59:20,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:20,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:59:20,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:21,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:21,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:21,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 16:59:21,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:21,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:59:21,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:21,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:21,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:59:21,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:21,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 16:59:21,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:21,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-12 16:59:21,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:21,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-12 16:59:21,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:21,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-12 16:59:21,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:21,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-12 16:59:21,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:21,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-12 16:59:21,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:21,091 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-12 16:59:21,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:21,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-12 16:59:21,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:21,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-12 16:59:21,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:21,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-12 16:59:21,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:21,128 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-12 16:59:21,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:21,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-12 16:59:21,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:21,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 16:59:21,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:21,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-12 16:59:21,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:21,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-12 16:59:21,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:21,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-12 16:59:21,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:21,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-12 16:59:21,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:21,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-12 16:59:21,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:21,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-12 16:59:21,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:21,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-12 16:59:21,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:21,224 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-07-12 16:59:21,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:59:21,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001819986] [2022-07-12 16:59:21,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001819986] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:59:21,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:59:21,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:59:21,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781003942] [2022-07-12 16:59:21,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:59:21,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:59:21,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:59:21,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:59:21,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:59:21,227 INFO L87 Difference]: Start difference. First operand 6588 states and 9195 transitions. Second operand has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-12 16:59:29,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:59:29,169 INFO L93 Difference]: Finished difference Result 13089 states and 18697 transitions. [2022-07-12 16:59:29,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 16:59:29,169 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 165 [2022-07-12 16:59:29,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:59:29,227 INFO L225 Difference]: With dead ends: 13089 [2022-07-12 16:59:29,227 INFO L226 Difference]: Without dead ends: 12840 [2022-07-12 16:59:29,241 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-07-12 16:59:29,242 INFO L413 NwaCegarLoop]: 2435 mSDtfsCounter, 6588 mSDsluCounter, 1709 mSDsCounter, 0 mSdLazyCounter, 5132 mSolverCounterSat, 2642 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6704 SdHoareTripleChecker+Valid, 4144 SdHoareTripleChecker+Invalid, 7774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2642 IncrementalHoareTripleChecker+Valid, 5132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-07-12 16:59:29,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6704 Valid, 4144 Invalid, 7774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2642 Valid, 5132 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2022-07-12 16:59:29,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12840 states. [2022-07-12 16:59:30,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12840 to 12750. [2022-07-12 16:59:30,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12750 states, 9471 states have (on average 1.3155949741315596) internal successors, (12460), 9622 states have internal predecessors, (12460), 2472 states have call successors, (2472), 798 states have call predecessors, (2472), 795 states have return successors, (3385), 2409 states have call predecessors, (3385), 2469 states have call successors, (3385) [2022-07-12 16:59:30,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12750 states to 12750 states and 18317 transitions. [2022-07-12 16:59:30,165 INFO L78 Accepts]: Start accepts. Automaton has 12750 states and 18317 transitions. Word has length 165 [2022-07-12 16:59:30,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:59:30,165 INFO L495 AbstractCegarLoop]: Abstraction has 12750 states and 18317 transitions. [2022-07-12 16:59:30,165 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.666666666666668) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-07-12 16:59:30,166 INFO L276 IsEmpty]: Start isEmpty. Operand 12750 states and 18317 transitions. [2022-07-12 16:59:30,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2022-07-12 16:59:30,172 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:59:30,172 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 41, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:59:30,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-12 16:59:30,173 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_kernel_module_module_putErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:59:30,173 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:59:30,173 INFO L85 PathProgramCache]: Analyzing trace with hash 580643187, now seen corresponding path program 1 times [2022-07-12 16:59:30,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:59:30,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157410437] [2022-07-12 16:59:30,174 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:59:30,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:59:30,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:30,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:59:30,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:30,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:30,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 16:59:30,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:30,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:59:30,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:30,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:30,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:30,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:59:30,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:30,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 16:59:30,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:30,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 16:59:30,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:30,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 16:59:30,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:30,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:30,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:30,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:30,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:30,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:30,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:30,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 16:59:30,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:30,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:30,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:30,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:30,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:30,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:30,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:30,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 16:59:30,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:30,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:30,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:30,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:30,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:30,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:30,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:30,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 16:59:30,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:30,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:30,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:30,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:30,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:30,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:30,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:30,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 16:59:30,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:30,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:30,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:30,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:30,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:30,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:30,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:30,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-12 16:59:30,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:30,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:30,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:31,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:31,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-12 16:59:31,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:31,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:31,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:31,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-12 16:59:31,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:31,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:31,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:31,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-12 16:59:31,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:31,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:31,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:31,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-12 16:59:31,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:31,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:31,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:31,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-12 16:59:31,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:31,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:31,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:31,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-12 16:59:31,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:31,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:31,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:31,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2022-07-12 16:59:31,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:31,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:31,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:31,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2022-07-12 16:59:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:31,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:31,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:31,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2022-07-12 16:59:31,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:31,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:31,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:31,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2022-07-12 16:59:31,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:31,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:31,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:31,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2022-07-12 16:59:31,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:31,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:31,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:31,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 407 [2022-07-12 16:59:31,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:31,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:31,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:31,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 428 [2022-07-12 16:59:31,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:31,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:31,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:31,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 449 [2022-07-12 16:59:31,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 457 [2022-07-12 16:59:31,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:31,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:31,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 16:59:31,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:31,537 INFO L134 CoverageAnalysis]: Checked inductivity of 5179 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5179 trivial. 0 not checked. [2022-07-12 16:59:31,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:59:31,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157410437] [2022-07-12 16:59:31,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157410437] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:59:31,538 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:59:31,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-12 16:59:31,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139947709] [2022-07-12 16:59:31,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:59:31,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-12 16:59:31,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:59:31,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-12 16:59:31,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-12 16:59:31,540 INFO L87 Difference]: Start difference. First operand 12750 states and 18317 transitions. Second operand has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (37), 5 states have call predecessors, (37), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2022-07-12 16:59:37,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:59:37,785 INFO L93 Difference]: Finished difference Result 28663 states and 43712 transitions. [2022-07-12 16:59:37,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-12 16:59:37,787 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (37), 5 states have call predecessors, (37), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 494 [2022-07-12 16:59:37,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:59:37,859 INFO L225 Difference]: With dead ends: 28663 [2022-07-12 16:59:37,859 INFO L226 Difference]: Without dead ends: 15978 [2022-07-12 16:59:37,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-12 16:59:37,969 INFO L413 NwaCegarLoop]: 2124 mSDtfsCounter, 4307 mSDsluCounter, 1591 mSDsCounter, 0 mSdLazyCounter, 3562 mSolverCounterSat, 2018 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4307 SdHoareTripleChecker+Valid, 3715 SdHoareTripleChecker+Invalid, 5580 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2018 IncrementalHoareTripleChecker+Valid, 3562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-07-12 16:59:37,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4307 Valid, 3715 Invalid, 5580 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2018 Valid, 3562 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-07-12 16:59:37,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15978 states. [2022-07-12 16:59:38,806 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15978 to 14287. [2022-07-12 16:59:38,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14287 states, 10697 states have (on average 1.3190614190894643) internal successors, (14110), 10852 states have internal predecessors, (14110), 2697 states have call successors, (2697), 798 states have call predecessors, (2697), 881 states have return successors, (4216), 2724 states have call predecessors, (4216), 2694 states have call successors, (4216) [2022-07-12 16:59:38,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14287 states to 14287 states and 21023 transitions. [2022-07-12 16:59:38,936 INFO L78 Accepts]: Start accepts. Automaton has 14287 states and 21023 transitions. Word has length 494 [2022-07-12 16:59:38,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:59:38,938 INFO L495 AbstractCegarLoop]: Abstraction has 14287 states and 21023 transitions. [2022-07-12 16:59:38,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.333333333333334) internal successors, (80), 3 states have internal predecessors, (80), 2 states have call successors, (37), 5 states have call predecessors, (37), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2022-07-12 16:59:38,938 INFO L276 IsEmpty]: Start isEmpty. Operand 14287 states and 21023 transitions. [2022-07-12 16:59:38,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2022-07-12 16:59:38,945 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:59:38,945 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 41, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:59:38,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-12 16:59:38,946 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_linux_kernel_module_module_putErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:59:38,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:59:38,946 INFO L85 PathProgramCache]: Analyzing trace with hash -99415183, now seen corresponding path program 1 times [2022-07-12 16:59:38,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:59:38,947 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822243963] [2022-07-12 16:59:38,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:59:38,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:59:39,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:39,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:59:39,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:39,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:39,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:39,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 16:59:39,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:39,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:59:39,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:39,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:39,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:39,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:59:39,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:39,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 16:59:39,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:39,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 16:59:39,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:39,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 16:59:39,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:39,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:39,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:39,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:39,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:39,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:39,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:39,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 16:59:39,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:39,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:39,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:39,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:39,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:39,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:39,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:39,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 16:59:39,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:39,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:39,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:39,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:39,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:39,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:39,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:39,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 16:59:39,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:39,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:39,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:39,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:39,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:39,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:39,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:39,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 16:59:39,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:40,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:40,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:40,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-12 16:59:40,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:40,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:40,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-12 16:59:40,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:40,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:40,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:40,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-12 16:59:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,093 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:40,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:40,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,105 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-12 16:59:40,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,115 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:40,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:40,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:40,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-12 16:59:40,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:40,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:40,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-12 16:59:40,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:40,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:40,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,194 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-12 16:59:40,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:40,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:40,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:40,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2022-07-12 16:59:40,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:40,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:40,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:40,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2022-07-12 16:59:40,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:40,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:40,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:40,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2022-07-12 16:59:40,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:40,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:40,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:40,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2022-07-12 16:59:40,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:40,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:40,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:40,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2022-07-12 16:59:40,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:40,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:40,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 407 [2022-07-12 16:59:40,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:40,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:40,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:40,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 428 [2022-07-12 16:59:40,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:40,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:40,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:40,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 449 [2022-07-12 16:59:40,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 457 [2022-07-12 16:59:40,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 16:59:40,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:40,483 INFO L134 CoverageAnalysis]: Checked inductivity of 5179 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5179 trivial. 0 not checked. [2022-07-12 16:59:40,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:59:40,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822243963] [2022-07-12 16:59:40,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822243963] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:59:40,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:59:40,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 16:59:40,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378693787] [2022-07-12 16:59:40,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:59:40,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 16:59:40,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:59:40,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 16:59:40,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 16:59:40,487 INFO L87 Difference]: Start difference. First operand 14287 states and 21023 transitions. Second operand has 8 states, 8 states have (on average 10.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (37), 5 states have call predecessors, (37), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2022-07-12 16:59:49,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 16:59:49,873 INFO L93 Difference]: Finished difference Result 30184 states and 46362 transitions. [2022-07-12 16:59:49,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-12 16:59:49,873 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (37), 5 states have call predecessors, (37), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) Word has length 494 [2022-07-12 16:59:49,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 16:59:49,966 INFO L225 Difference]: With dead ends: 30184 [2022-07-12 16:59:49,966 INFO L226 Difference]: Without dead ends: 15962 [2022-07-12 16:59:50,067 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=119, Invalid=261, Unknown=0, NotChecked=0, Total=380 [2022-07-12 16:59:50,068 INFO L413 NwaCegarLoop]: 2126 mSDtfsCounter, 4354 mSDsluCounter, 2597 mSDsCounter, 0 mSdLazyCounter, 7396 mSolverCounterSat, 2024 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4354 SdHoareTripleChecker+Valid, 4723 SdHoareTripleChecker+Invalid, 9420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2024 IncrementalHoareTripleChecker+Valid, 7396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.1s IncrementalHoareTripleChecker+Time [2022-07-12 16:59:50,068 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4354 Valid, 4723 Invalid, 9420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2024 Valid, 7396 Invalid, 0 Unknown, 0 Unchecked, 8.1s Time] [2022-07-12 16:59:50,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15962 states. [2022-07-12 16:59:51,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15962 to 14287. [2022-07-12 16:59:51,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14287 states, 10697 states have (on average 1.3179396092362345) internal successors, (14098), 10856 states have internal predecessors, (14098), 2693 states have call successors, (2693), 798 states have call predecessors, (2693), 885 states have return successors, (4216), 2720 states have call predecessors, (4216), 2690 states have call successors, (4216) [2022-07-12 16:59:51,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14287 states to 14287 states and 21007 transitions. [2022-07-12 16:59:51,125 INFO L78 Accepts]: Start accepts. Automaton has 14287 states and 21007 transitions. Word has length 494 [2022-07-12 16:59:51,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 16:59:51,126 INFO L495 AbstractCegarLoop]: Abstraction has 14287 states and 21007 transitions. [2022-07-12 16:59:51,127 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 5 states have internal predecessors, (80), 2 states have call successors, (37), 5 states have call predecessors, (37), 1 states have return successors, (35), 1 states have call predecessors, (35), 1 states have call successors, (35) [2022-07-12 16:59:51,127 INFO L276 IsEmpty]: Start isEmpty. Operand 14287 states and 21007 transitions. [2022-07-12 16:59:51,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2022-07-12 16:59:51,134 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 16:59:51,134 INFO L195 NwaCegarLoop]: trace histogram [41, 41, 41, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 16:59:51,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-12 16:59:51,134 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_linux_kernel_module_module_putErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 16:59:51,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 16:59:51,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1258511913, now seen corresponding path program 1 times [2022-07-12 16:59:51,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 16:59:51,135 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469695951] [2022-07-12 16:59:51,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 16:59:51,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 16:59:51,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 16:59:51,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:51,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 16:59:51,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 16:59:51,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:51,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 16:59:51,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 16:59:51,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 16:59:51,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 16:59:51,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:51,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:51,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:51,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 16:59:51,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:51,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:51,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:51,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 16:59:51,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:51,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:51,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:51,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 16:59:51,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:51,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:51,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:51,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 16:59:51,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:51,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:51,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-12 16:59:51,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:51,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:51,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:51,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,668 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-12 16:59:51,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:51,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:51,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:51,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-12 16:59:51,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:51,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:51,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:51,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-12 16:59:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:51,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:51,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:51,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-12 16:59:51,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:51,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:51,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:51,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-12 16:59:51,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:51,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:51,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:51,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-12 16:59:51,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:51,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:51,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:51,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2022-07-12 16:59:51,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:51,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:51,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:51,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:51,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2022-07-12 16:59:51,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:52,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:52,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:52,009 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:52,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:52,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:52,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:52,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2022-07-12 16:59:52,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:52,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:52,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:52,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:52,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:52,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:52,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:52,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2022-07-12 16:59:52,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:52,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:52,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:52,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:52,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:52,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:52,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:52,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2022-07-12 16:59:52,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:52,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:52,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:52,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:52,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:52,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:52,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:52,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 407 [2022-07-12 16:59:52,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:52,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:52,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:52,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:52,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:52,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:52,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:52,130 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 428 [2022-07-12 16:59:52,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:52,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:52,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:52,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 16:59:52,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:52,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 16:59:52,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:52,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 449 [2022-07-12 16:59:52,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:52,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 457 [2022-07-12 16:59:52,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:52,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:52,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:52,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 16:59:52,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:52,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 16:59:52,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:52,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 483 [2022-07-12 16:59:52,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 16:59:52,201 INFO L134 CoverageAnalysis]: Checked inductivity of 5191 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5191 trivial. 0 not checked. [2022-07-12 16:59:52,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 16:59:52,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [469695951] [2022-07-12 16:59:52,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [469695951] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 16:59:52,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 16:59:52,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-12 16:59:52,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834395072] [2022-07-12 16:59:52,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 16:59:52,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-12 16:59:52,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 16:59:52,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-12 16:59:52,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-12 16:59:52,205 INFO L87 Difference]: Start difference. First operand 14287 states and 21007 transitions. Second operand has 8 states, 8 states have (on average 10.25) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (38), 6 states have call predecessors, (38), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-07-12 17:00:13,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:00:13,131 INFO L93 Difference]: Finished difference Result 24293 states and 37234 transitions. [2022-07-12 17:00:13,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 17:00:13,131 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (38), 6 states have call predecessors, (38), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) Word has length 500 [2022-07-12 17:00:13,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:00:13,250 INFO L225 Difference]: With dead ends: 24293 [2022-07-12 17:00:13,250 INFO L226 Difference]: Without dead ends: 24291 [2022-07-12 17:00:13,263 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 185 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-07-12 17:00:13,264 INFO L413 NwaCegarLoop]: 4409 mSDtfsCounter, 13158 mSDsluCounter, 4164 mSDsCounter, 0 mSdLazyCounter, 15101 mSolverCounterSat, 6390 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13383 SdHoareTripleChecker+Valid, 8573 SdHoareTripleChecker+Invalid, 21491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6390 IncrementalHoareTripleChecker+Valid, 15101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.0s IncrementalHoareTripleChecker+Time [2022-07-12 17:00:13,264 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13383 Valid, 8573 Invalid, 21491 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6390 Valid, 15101 Invalid, 0 Unknown, 0 Unchecked, 19.0s Time] [2022-07-12 17:00:13,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24291 states. [2022-07-12 17:00:14,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24291 to 21695. [2022-07-12 17:00:14,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21695 states, 16257 states have (on average 1.322630251583933) internal successors, (21502), 16504 states have internal predecessors, (21502), 4109 states have call successors, (4109), 1150 states have call predecessors, (4109), 1317 states have return successors, (7202), 4184 states have call predecessors, (7202), 4106 states have call successors, (7202) [2022-07-12 17:00:14,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21695 states to 21695 states and 32813 transitions. [2022-07-12 17:00:14,845 INFO L78 Accepts]: Start accepts. Automaton has 21695 states and 32813 transitions. Word has length 500 [2022-07-12 17:00:14,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:00:14,846 INFO L495 AbstractCegarLoop]: Abstraction has 21695 states and 32813 transitions. [2022-07-12 17:00:14,846 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 5 states have internal predecessors, (82), 3 states have call successors, (38), 6 states have call predecessors, (38), 1 states have return successors, (36), 2 states have call predecessors, (36), 2 states have call successors, (36) [2022-07-12 17:00:14,846 INFO L276 IsEmpty]: Start isEmpty. Operand 21695 states and 32813 transitions. [2022-07-12 17:00:14,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2022-07-12 17:00:14,859 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:00:14,859 INFO L195 NwaCegarLoop]: trace histogram [43, 43, 43, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:00:14,859 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-12 17:00:14,859 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 17:00:14,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:00:14,860 INFO L85 PathProgramCache]: Analyzing trace with hash 2091765019, now seen corresponding path program 1 times [2022-07-12 17:00:14,860 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:00:14,860 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46807102] [2022-07-12 17:00:14,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:00:14,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:00:15,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:00:15,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:15,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 17:00:15,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 17:00:15,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:15,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:00:15,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 17:00:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 17:00:15,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 17:00:15,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:15,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:15,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:15,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 17:00:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:15,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,272 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:15,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:15,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 17:00:15,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:15,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:15,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 17:00:15,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:15,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:15,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:15,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 17:00:15,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:15,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:15,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:15,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-12 17:00:15,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:15,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:15,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:15,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-12 17:00:15,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:15,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:15,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-12 17:00:15,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:15,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:15,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-12 17:00:15,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:15,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:15,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-12 17:00:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:15,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:15,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:15,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-12 17:00:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:15,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:15,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:15,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-12 17:00:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:15,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:15,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2022-07-12 17:00:15,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:15,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:15,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:15,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2022-07-12 17:00:15,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:15,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:15,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:15,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2022-07-12 17:00:15,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:15,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:15,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:15,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2022-07-12 17:00:15,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:15,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:15,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:15,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2022-07-12 17:00:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:15,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:15,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:15,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 407 [2022-07-12 17:00:15,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:15,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:15,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:15,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 428 [2022-07-12 17:00:15,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:15,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:15,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:15,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 449 [2022-07-12 17:00:15,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 455 [2022-07-12 17:00:15,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,938 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:15,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:15,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:15,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 17:00:15,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 491 [2022-07-12 17:00:15,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:15,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 503 [2022-07-12 17:00:15,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 509 [2022-07-12 17:00:15,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 514 [2022-07-12 17:00:15,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:15,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 526 [2022-07-12 17:00:15,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:16,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:16,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:16,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:16,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:16,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 17:00:16,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:16,021 INFO L134 CoverageAnalysis]: Checked inductivity of 5579 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5579 trivial. 0 not checked. [2022-07-12 17:00:16,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:00:16,022 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46807102] [2022-07-12 17:00:16,022 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [46807102] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:00:16,022 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:00:16,022 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-12 17:00:16,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2025284669] [2022-07-12 17:00:16,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:00:16,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-12 17:00:16,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:00:16,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-12 17:00:16,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-12 17:00:16,024 INFO L87 Difference]: Start difference. First operand 21695 states and 32813 transitions. Second operand has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (44), 7 states have call predecessors, (44), 1 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2022-07-12 17:00:34,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:00:34,150 INFO L93 Difference]: Finished difference Result 46997 states and 78942 transitions. [2022-07-12 17:00:34,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-12 17:00:34,151 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (44), 7 states have call predecessors, (44), 1 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) Word has length 556 [2022-07-12 17:00:34,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:00:34,429 INFO L225 Difference]: With dead ends: 46997 [2022-07-12 17:00:34,429 INFO L226 Difference]: Without dead ends: 46995 [2022-07-12 17:00:34,463 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2022-07-12 17:00:34,464 INFO L413 NwaCegarLoop]: 3373 mSDtfsCounter, 7891 mSDsluCounter, 3297 mSDsCounter, 0 mSdLazyCounter, 13873 mSolverCounterSat, 4323 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7991 SdHoareTripleChecker+Valid, 6670 SdHoareTripleChecker+Invalid, 18196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4323 IncrementalHoareTripleChecker+Valid, 13873 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2022-07-12 17:00:34,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7991 Valid, 6670 Invalid, 18196 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4323 Valid, 13873 Invalid, 0 Unknown, 0 Unchecked, 15.1s Time] [2022-07-12 17:00:34,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46995 states. [2022-07-12 17:00:37,332 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46995 to 43311. [2022-07-12 17:00:37,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43311 states, 32449 states have (on average 1.3261117445838084) internal successors, (43031), 33060 states have internal predecessors, (43031), 8222 states have call successors, (8222), 2218 states have call predecessors, (8222), 2628 states have return successors, (19732), 8336 states have call predecessors, (19732), 8219 states have call successors, (19732) [2022-07-12 17:00:37,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43311 states to 43311 states and 70985 transitions. [2022-07-12 17:00:37,829 INFO L78 Accepts]: Start accepts. Automaton has 43311 states and 70985 transitions. Word has length 556 [2022-07-12 17:00:37,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-12 17:00:37,830 INFO L495 AbstractCegarLoop]: Abstraction has 43311 states and 70985 transitions. [2022-07-12 17:00:37,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 10.444444444444445) internal successors, (94), 4 states have internal predecessors, (94), 2 states have call successors, (44), 7 states have call predecessors, (44), 1 states have return successors, (41), 2 states have call predecessors, (41), 2 states have call successors, (41) [2022-07-12 17:00:37,830 INFO L276 IsEmpty]: Start isEmpty. Operand 43311 states and 70985 transitions. [2022-07-12 17:00:37,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2022-07-12 17:00:37,846 INFO L187 NwaCegarLoop]: Found error trace [2022-07-12 17:00:37,846 INFO L195 NwaCegarLoop]: trace histogram [43, 43, 43, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 19, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-12 17:00:37,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-12 17:00:37,846 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_alloc_usb_lock_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 28 more)] === [2022-07-12 17:00:37,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-12 17:00:37,847 INFO L85 PathProgramCache]: Analyzing trace with hash 652606852, now seen corresponding path program 1 times [2022-07-12 17:00:37,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-12 17:00:37,847 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [48665437] [2022-07-12 17:00:37,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-12 17:00:37,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-12 17:00:38,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:38,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-12 17:00:38,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:38,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:38,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:38,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-12 17:00:38,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:38,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-12 17:00:38,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:38,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:38,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:38,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-12 17:00:38,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:38,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-12 17:00:38,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:38,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-12 17:00:38,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:38,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-12 17:00:38,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:38,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:38,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:38,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:38,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:38,680 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:38,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:38,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-12 17:00:38,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:38,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:38,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:38,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:38,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:38,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:38,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:38,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-12 17:00:38,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:38,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:38,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:38,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:38,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:38,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:38,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:38,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-12 17:00:38,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:38,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:38,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:38,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:38,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:38,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:38,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:38,915 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-12 17:00:38,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:38,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:38,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:38,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:38,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:38,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:38,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:38,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-12 17:00:38,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:38,949 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:38,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:38,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:38,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:38,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:38,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:38,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-12 17:00:38,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:38,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:38,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:38,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:38,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:38,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:38,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:38,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-12 17:00:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:39,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-12 17:00:39,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:39,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:39,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:39,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-12 17:00:39,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:39,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,063 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:39,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:39,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,074 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-12 17:00:39,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:39,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,090 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:39,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:39,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-12 17:00:39,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:39,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:39,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:39,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2022-07-12 17:00:39,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:39,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:39,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:39,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2022-07-12 17:00:39,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:39,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:39,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:39,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2022-07-12 17:00:39,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,190 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:39,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,196 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:39,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:39,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2022-07-12 17:00:39,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:39,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:39,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:39,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2022-07-12 17:00:39,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:39,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:39,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 407 [2022-07-12 17:00:39,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:39,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 428 [2022-07-12 17:00:39,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:39,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,308 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:39,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-12 17:00:39,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,320 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 449 [2022-07-12 17:00:39,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 455 [2022-07-12 17:00:39,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:39,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:39,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:39,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 17:00:39,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 491 [2022-07-12 17:00:39,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:39,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 503 [2022-07-12 17:00:39,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 509 [2022-07-12 17:00:39,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 514 [2022-07-12 17:00:39,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 526 [2022-07-12 17:00:39,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:39,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-12 17:00:39,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 550 [2022-07-12 17:00:39,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,457 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-12 17:00:39,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-12 17:00:39,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-12 17:00:39,470 INFO L134 CoverageAnalysis]: Checked inductivity of 5600 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5600 trivial. 0 not checked. [2022-07-12 17:00:39,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-12 17:00:39,471 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [48665437] [2022-07-12 17:00:39,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [48665437] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-12 17:00:39,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-12 17:00:39,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-12 17:00:39,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107587083] [2022-07-12 17:00:39,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-12 17:00:39,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-12 17:00:39,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-12 17:00:39,473 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-12 17:00:39,473 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-12 17:00:39,474 INFO L87 Difference]: Start difference. First operand 43311 states and 70985 transitions. Second operand has 10 states, 10 states have (on average 10.6) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (47), 8 states have call predecessors, (47), 2 states have return successors, (44), 2 states have call predecessors, (44), 1 states have call successors, (44) [2022-07-12 17:01:01,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-12 17:01:01,916 INFO L93 Difference]: Finished difference Result 61361 states and 108159 transitions. [2022-07-12 17:01:01,916 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-12 17:01:01,917 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 10.6) internal successors, (106), 4 states have internal predecessors, (106), 2 states have call successors, (47), 8 states have call predecessors, (47), 2 states have return successors, (44), 2 states have call predecessors, (44), 1 states have call successors, (44) Word has length 576 [2022-07-12 17:01:01,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-12 17:01:02,247 INFO L225 Difference]: With dead ends: 61361 [2022-07-12 17:01:02,247 INFO L226 Difference]: Without dead ends: 61359 [2022-07-12 17:01:02,281 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 207 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=196, Invalid=454, Unknown=0, NotChecked=0, Total=650 [2022-07-12 17:01:02,282 INFO L413 NwaCegarLoop]: 3499 mSDtfsCounter, 15430 mSDsluCounter, 4761 mSDsCounter, 0 mSdLazyCounter, 14650 mSolverCounterSat, 8532 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15537 SdHoareTripleChecker+Valid, 8260 SdHoareTripleChecker+Invalid, 23182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 8532 IncrementalHoareTripleChecker+Valid, 14650 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.3s IncrementalHoareTripleChecker+Time [2022-07-12 17:01:02,282 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15537 Valid, 8260 Invalid, 23182 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [8532 Valid, 14650 Invalid, 0 Unknown, 0 Unchecked, 18.3s Time] [2022-07-12 17:01:02,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61359 states.