./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 f4b24e32 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-?-f4b24e3 [2022-07-14 04:39:29,887 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-14 04:39:29,889 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-14 04:39:29,942 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-14 04:39:29,942 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-14 04:39:29,943 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-14 04:39:29,944 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-14 04:39:29,946 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-14 04:39:29,947 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-14 04:39:29,951 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-14 04:39:29,952 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-14 04:39:29,953 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-14 04:39:29,953 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-14 04:39:29,955 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-14 04:39:29,956 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-14 04:39:29,959 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-14 04:39:29,959 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-14 04:39:29,960 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-14 04:39:29,962 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-14 04:39:29,964 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-14 04:39:29,966 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-14 04:39:29,967 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-14 04:39:29,968 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-14 04:39:29,969 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-14 04:39:29,970 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-14 04:39:29,973 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-14 04:39:29,973 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-14 04:39:29,974 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-14 04:39:29,974 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-14 04:39:29,975 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-14 04:39:29,975 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-14 04:39:29,976 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-14 04:39:29,977 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-14 04:39:29,977 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-14 04:39:29,978 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-14 04:39:29,978 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-14 04:39:29,979 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-14 04:39:29,979 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-14 04:39:29,979 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-14 04:39:29,979 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-14 04:39:29,980 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-14 04:39:29,995 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-14 04:39:29,996 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-14 04:39:30,013 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-14 04:39:30,013 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-14 04:39:30,014 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-14 04:39:30,014 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-14 04:39:30,014 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-14 04:39:30,014 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-14 04:39:30,015 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-14 04:39:30,015 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-14 04:39:30,015 INFO L138 SettingsManager]: * Use SBE=true [2022-07-14 04:39:30,016 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-14 04:39:30,016 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-14 04:39:30,016 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-14 04:39:30,016 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-14 04:39:30,016 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-14 04:39:30,017 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-14 04:39:30,017 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-14 04:39:30,017 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-14 04:39:30,017 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-14 04:39:30,017 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-14 04:39:30,017 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-14 04:39:30,017 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-14 04:39:30,017 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 04:39:30,018 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-14 04:39:30,018 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-14 04:39:30,018 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-14 04:39:30,018 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-14 04:39:30,018 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-14 04:39:30,018 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-14 04:39:30,018 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-14 04:39:30,019 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-14 04:39:30,019 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-14 04:39:30,209 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-14 04:39:30,225 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-14 04:39:30,226 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-14 04:39:30,227 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-14 04:39:30,228 INFO L275 PluginConnector]: CDTParser initialized [2022-07-14 04:39:30,228 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-14 04:39:30,267 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a25f785b3/b812822c7c124478a0ecccf3325c5476/FLAGb45952eeb [2022-07-14 04:39:30,965 INFO L306 CDTParser]: Found 1 translation units. [2022-07-14 04:39:30,965 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-14 04:39:31,008 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a25f785b3/b812822c7c124478a0ecccf3325c5476/FLAGb45952eeb [2022-07-14 04:39:31,302 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a25f785b3/b812822c7c124478a0ecccf3325c5476 [2022-07-14 04:39:31,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-14 04:39:31,305 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-14 04:39:31,307 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-14 04:39:31,307 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-14 04:39:31,309 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-14 04:39:31,310 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:39:31" (1/1) ... [2022-07-14 04:39:31,310 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1719fe6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:39:31, skipping insertion in model container [2022-07-14 04:39:31,311 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.07 04:39:31" (1/1) ... [2022-07-14 04:39:31,316 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-14 04:39:31,410 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-14 04:39:33,658 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,661 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,661 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,661 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,662 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,662 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,662 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,663 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,663 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,663 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,664 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,664 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,664 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,664 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,665 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,665 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,665 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,666 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,666 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,666 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,667 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,667 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,667 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,667 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,668 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,668 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,669 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,669 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,669 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,669 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,670 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,670 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,670 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,671 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,672 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,672 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,672 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,673 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,673 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,673 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,674 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,674 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,675 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,675 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,676 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,677 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,677 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,678 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,678 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,678 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,679 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,679 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,679 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,680 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,680 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,680 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,680 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,681 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,681 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,681 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,682 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,682 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,683 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,683 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,683 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,683 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,684 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,684 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,684 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,685 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,685 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,685 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,685 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,686 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,686 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,687 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,687 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,687 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,687 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,688 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,688 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,688 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,688 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,689 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,689 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,689 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,690 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,690 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:33,704 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 04:39:33,761 INFO L203 MainTranslator]: Completed pre-run [2022-07-14 04:39:34,151 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,153 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,153 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,153 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,154 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,155 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,155 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,155 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,156 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,156 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,157 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,157 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,157 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,157 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,158 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,158 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,158 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,158 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,159 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,159 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,159 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,160 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,160 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,161 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[421914,421927] [2022-07-14 04:39:34,161 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[422060,422073] [2022-07-14 04:39:34,161 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[422203,422216] [2022-07-14 04:39:34,162 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,162 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,162 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,162 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,163 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,163 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,163 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,164 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,164 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,164 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,164 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,165 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,166 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,166 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,167 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,167 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,168 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[424831,424844] [2022-07-14 04:39:34,168 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[424978,424991] [2022-07-14 04:39:34,168 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[425117,425130] [2022-07-14 04:39:34,168 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[425280,425293] [2022-07-14 04:39:34,169 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[425446,425459] [2022-07-14 04:39:34,169 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[425610,425623] [2022-07-14 04:39:34,169 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[425775,425788] [2022-07-14 04:39:34,170 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[425940,425953] [2022-07-14 04:39:34,170 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[426106,426119] [2022-07-14 04:39:34,170 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[426271,426284] [2022-07-14 04:39:34,171 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[426438,426451] [2022-07-14 04:39:34,171 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[426598,426611] [2022-07-14 04:39:34,172 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[426760,426773] [2022-07-14 04:39:34,172 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[426919,426932] [2022-07-14 04:39:34,173 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[427065,427078] [2022-07-14 04:39:34,176 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[427208,427221] [2022-07-14 04:39:34,177 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,177 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,177 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,178 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,178 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,180 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,180 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,181 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[428391,428404] [2022-07-14 04:39:34,181 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[428540,428553] [2022-07-14 04:39:34,182 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[428692,428705] [2022-07-14 04:39:34,182 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[428843,428856] [2022-07-14 04:39:34,182 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[428992,429005] [2022-07-14 04:39:34,182 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[429144,429157] [2022-07-14 04:39:34,182 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[429292,429305] [2022-07-14 04:39:34,186 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,186 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,187 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,187 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,187 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,187 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,188 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[430343,430356] [2022-07-14 04:39:34,189 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[430509,430522] [2022-07-14 04:39:34,189 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[430678,430691] [2022-07-14 04:39:34,190 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,190 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,190 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the 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-14 04:39:34,191 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[431310,431323] [2022-07-14 04:39:34,191 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[431471,431484] [2022-07-14 04:39:34,191 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[431641,431654] [2022-07-14 04:39:34,191 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i[431803,431816] [2022-07-14 04:39:34,196 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-14 04:39:34,347 INFO L208 MainTranslator]: Completed translation [2022-07-14 04:39:34,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:39:34 WrapperNode [2022-07-14 04:39:34,347 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-14 04:39:34,348 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-14 04:39:34,348 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-14 04:39:34,348 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-14 04:39:34,352 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:39:34" (1/1) ... [2022-07-14 04:39:34,428 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:39:34" (1/1) ... [2022-07-14 04:39:34,611 INFO L137 Inliner]: procedures = 643, calls = 3813, calls flagged for inlining = 294, calls inlined = 195, statements flattened = 6099 [2022-07-14 04:39:34,611 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-14 04:39:34,612 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-14 04:39:34,613 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-14 04:39:34,613 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-14 04:39:34,618 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:39:34" (1/1) ... [2022-07-14 04:39:34,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:39:34" (1/1) ... [2022-07-14 04:39:34,660 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:39:34" (1/1) ... [2022-07-14 04:39:34,660 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:39:34" (1/1) ... [2022-07-14 04:39:34,726 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:39:34" (1/1) ... [2022-07-14 04:39:34,740 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:39:34" (1/1) ... [2022-07-14 04:39:34,759 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:39:34" (1/1) ... [2022-07-14 04:39:34,784 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-14 04:39:34,785 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-14 04:39:34,785 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-14 04:39:34,785 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-14 04:39:34,786 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:39:34" (1/1) ... [2022-07-14 04:39:34,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-14 04:39:34,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-14 04:39:34,807 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-14 04:39:34,823 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-14 04:39:34,831 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_set [2022-07-14 04:39:34,832 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_set [2022-07-14 04:39:34,832 INFO L130 BoogieDeclarations]: Found specification of procedure PDEBUG_MODE [2022-07-14 04:39:34,832 INFO L138 BoogieDeclarations]: Found implementation of procedure PDEBUG_MODE [2022-07-14 04:39:34,832 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-14 04:39:34,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-14 04:39:34,832 INFO L130 BoogieDeclarations]: Found specification of procedure alt_xfer [2022-07-14 04:39:34,832 INFO L138 BoogieDeclarations]: Found implementation of procedure alt_xfer [2022-07-14 04:39:34,832 INFO L130 BoogieDeclarations]: Found specification of procedure vidioc_streamon [2022-07-14 04:39:34,832 INFO L138 BoogieDeclarations]: Found implementation of procedure vidioc_streamon [2022-07-14 04:39:34,832 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-14 04:39:34,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-14 04:39:34,833 INFO L130 BoogieDeclarations]: Found specification of procedure dev_poll [2022-07-14 04:39:34,833 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_poll [2022-07-14 04:39:34,833 INFO L130 BoogieDeclarations]: Found specification of procedure vidioc_reqbufs [2022-07-14 04:39:34,833 INFO L138 BoogieDeclarations]: Found implementation of procedure vidioc_reqbufs [2022-07-14 04:39:34,833 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-14 04:39:34,833 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-14 04:39:34,833 INFO L130 BoogieDeclarations]: Found specification of procedure frame_ready_nolock [2022-07-14 04:39:34,833 INFO L138 BoogieDeclarations]: Found implementation of procedure frame_ready_nolock [2022-07-14 04:39:34,833 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_usb_alloc_coherent [2022-07-14 04:39:34,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_usb_alloc_coherent [2022-07-14 04:39:34,834 INFO L130 BoogieDeclarations]: Found specification of procedure frame_ready [2022-07-14 04:39:34,834 INFO L138 BoogieDeclarations]: Found implementation of procedure frame_ready [2022-07-14 04:39:34,834 INFO L130 BoogieDeclarations]: Found specification of procedure usb_endpoint_dir_in [2022-07-14 04:39:34,834 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_endpoint_dir_in [2022-07-14 04:39:34,834 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-14 04:39:34,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-14 04:39:34,834 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-14 04:39:34,834 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-14 04:39:34,834 INFO L130 BoogieDeclarations]: Found specification of procedure gspca_set_alt0 [2022-07-14 04:39:34,835 INFO L138 BoogieDeclarations]: Found implementation of procedure gspca_set_alt0 [2022-07-14 04:39:34,835 INFO L130 BoogieDeclarations]: Found specification of procedure ktime_get [2022-07-14 04:39:34,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ktime_get [2022-07-14 04:39:34,835 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-14 04:39:34,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-14 04:39:34,835 INFO L130 BoogieDeclarations]: Found specification of procedure v4l2_ctrl_handler_free [2022-07-14 04:39:34,835 INFO L138 BoogieDeclarations]: Found implementation of procedure v4l2_ctrl_handler_free [2022-07-14 04:39:34,835 INFO L130 BoogieDeclarations]: Found specification of procedure strlcpy [2022-07-14 04:39:34,835 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcpy [2022-07-14 04:39:34,835 INFO L130 BoogieDeclarations]: Found specification of procedure int_irq [2022-07-14 04:39:34,836 INFO L138 BoogieDeclarations]: Found implementation of procedure int_irq [2022-07-14 04:39:34,836 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-14 04:39:34,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-14 04:39:34,836 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-14 04:39:34,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-14 04:39:34,836 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_queue_lock_of_gspca_dev [2022-07-14 04:39:34,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_queue_lock_of_gspca_dev [2022-07-14 04:39:34,836 INFO L130 BoogieDeclarations]: Found specification of procedure v4l2_ctrl_handler_setup [2022-07-14 04:39:34,836 INFO L138 BoogieDeclarations]: Found implementation of procedure v4l2_ctrl_handler_setup [2022-07-14 04:39:34,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-14 04:39:34,837 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_usb_lock_of_gspca_dev [2022-07-14 04:39:34,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_usb_lock_of_gspca_dev [2022-07-14 04:39:34,837 INFO L130 BoogieDeclarations]: Found specification of procedure gspca_stream_off [2022-07-14 04:39:34,837 INFO L138 BoogieDeclarations]: Found implementation of procedure gspca_stream_off [2022-07-14 04:39:34,837 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-14 04:39:34,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-14 04:39:34,837 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-14 04:39:34,837 INFO L130 BoogieDeclarations]: Found specification of procedure gspca_input_create_urb [2022-07-14 04:39:34,837 INFO L138 BoogieDeclarations]: Found implementation of procedure gspca_input_create_urb [2022-07-14 04:39:34,837 INFO L130 BoogieDeclarations]: Found specification of procedure ns_to_timeval [2022-07-14 04:39:34,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ns_to_timeval [2022-07-14 04:39:34,838 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-07-14 04:39:34,838 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-07-14 04:39:34,838 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-14 04:39:34,838 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-14 04:39:34,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-14 04:39:34,838 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-14 04:39:34,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-14 04:39:34,838 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-14 04:39:34,838 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-14 04:39:34,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-14 04:39:34,839 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-14 04:39:34,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-14 04:39:34,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-14 04:39:34,839 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-14 04:39:34,839 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-14 04:39:34,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-14 04:39:34,839 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2022-07-14 04:39:34,839 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2022-07-14 04:39:34,840 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-14 04:39:34,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-14 04:39:34,840 INFO L130 BoogieDeclarations]: Found specification of procedure dev_close [2022-07-14 04:39:34,840 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_close [2022-07-14 04:39:34,840 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-14 04:39:34,840 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-14 04:39:34,840 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2022-07-14 04:39:34,840 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2022-07-14 04:39:34,840 INFO L130 BoogieDeclarations]: Found specification of procedure v4l2_ctrl_subscribe_event [2022-07-14 04:39:34,840 INFO L138 BoogieDeclarations]: Found implementation of procedure v4l2_ctrl_subscribe_event [2022-07-14 04:39:34,841 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-14 04:39:34,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-14 04:39:34,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-14 04:39:34,841 INFO L130 BoogieDeclarations]: Found specification of procedure gspca_resume [2022-07-14 04:39:34,841 INFO L138 BoogieDeclarations]: Found implementation of procedure gspca_resume [2022-07-14 04:39:34,841 INFO L130 BoogieDeclarations]: Found specification of procedure destroy_urbs [2022-07-14 04:39:34,841 INFO L138 BoogieDeclarations]: Found implementation of procedure destroy_urbs [2022-07-14 04:39:34,841 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-14 04:39:34,841 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-14 04:39:34,841 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-14 04:39:34,842 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-14 04:39:34,842 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-07-14 04:39:34,842 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-07-14 04:39:34,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-07-14 04:39:34,842 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2022-07-14 04:39:34,842 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2022-07-14 04:39:34,842 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2022-07-14 04:39:34,842 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2022-07-14 04:39:34,842 INFO L130 BoogieDeclarations]: Found specification of procedure dev_open [2022-07-14 04:39:34,842 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_open [2022-07-14 04:39:34,842 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_queue_lock_of_gspca_dev [2022-07-14 04:39:34,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_queue_lock_of_gspca_dev [2022-07-14 04:39:34,843 INFO L130 BoogieDeclarations]: Found specification of procedure gspca_vm_close [2022-07-14 04:39:34,843 INFO L138 BoogieDeclarations]: Found implementation of procedure gspca_vm_close [2022-07-14 04:39:34,843 INFO L130 BoogieDeclarations]: Found specification of procedure vidioc_qbuf [2022-07-14 04:39:34,843 INFO L138 BoogieDeclarations]: Found implementation of procedure vidioc_qbuf [2022-07-14 04:39:34,843 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-14 04:39:34,843 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_irq_check_alloc_flags [2022-07-14 04:39:34,843 INFO L130 BoogieDeclarations]: Found specification of procedure input_unregister_device [2022-07-14 04:39:34,843 INFO L138 BoogieDeclarations]: Found implementation of procedure input_unregister_device [2022-07-14 04:39:34,843 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-14 04:39:34,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-14 04:39:34,844 INFO L130 BoogieDeclarations]: Found specification of procedure v4l2_event_unsubscribe [2022-07-14 04:39:34,844 INFO L138 BoogieDeclarations]: Found implementation of procedure v4l2_event_unsubscribe [2022-07-14 04:39:34,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-14 04:39:34,844 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-14 04:39:34,844 INFO L130 BoogieDeclarations]: Found specification of procedure wxh_to_mode [2022-07-14 04:39:34,844 INFO L138 BoogieDeclarations]: Found implementation of procedure wxh_to_mode [2022-07-14 04:39:34,844 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2022-07-14 04:39:34,844 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2022-07-14 04:39:34,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-14 04:39:34,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-14 04:39:34,845 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-14 04:39:34,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-14 04:39:34,845 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_interface [2022-07-14 04:39:34,845 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_interface [2022-07-14 04:39:34,845 INFO L130 BoogieDeclarations]: Found specification of procedure frame_free [2022-07-14 04:39:34,845 INFO L138 BoogieDeclarations]: Found implementation of procedure frame_free [2022-07-14 04:39:34,845 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2022-07-14 04:39:34,845 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2022-07-14 04:39:34,845 INFO L130 BoogieDeclarations]: Found specification of procedure dev_mmap [2022-07-14 04:39:34,845 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_mmap [2022-07-14 04:39:34,845 INFO L130 BoogieDeclarations]: Found specification of procedure usb_make_path [2022-07-14 04:39:34,846 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_make_path [2022-07-14 04:39:34,846 INFO L130 BoogieDeclarations]: Found specification of procedure vidioc_streamoff [2022-07-14 04:39:34,846 INFO L138 BoogieDeclarations]: Found implementation of procedure vidioc_streamoff [2022-07-14 04:39:34,846 INFO L130 BoogieDeclarations]: Found specification of procedure gspca_init_transfer [2022-07-14 04:39:34,846 INFO L138 BoogieDeclarations]: Found implementation of procedure gspca_init_transfer [2022-07-14 04:39:34,846 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2022-07-14 04:39:34,846 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2022-07-14 04:39:34,846 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-07-14 04:39:34,846 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-07-14 04:39:34,846 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-14 04:39:34,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-14 04:39:34,847 INFO L130 BoogieDeclarations]: Found specification of procedure video_drvdata [2022-07-14 04:39:34,847 INFO L138 BoogieDeclarations]: Found implementation of procedure video_drvdata [2022-07-14 04:39:34,847 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_free_urb [2022-07-14 04:39:34,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_free_urb [2022-07-14 04:39:34,847 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-14 04:39:34,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-14 04:39:34,847 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-14 04:39:34,847 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-14 04:39:34,847 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-14 04:39:34,847 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-14 04:39:34,848 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-07-14 04:39:34,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~int [2022-07-14 04:39:34,848 INFO L130 BoogieDeclarations]: Found specification of procedure usb_ifnum_to_if [2022-07-14 04:39:34,848 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_ifnum_to_if [2022-07-14 04:39:34,848 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_usb_lock_of_gspca_dev [2022-07-14 04:39:34,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_unlock_usb_lock_of_gspca_dev [2022-07-14 04:39:34,848 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_usb_free_coherent [2022-07-14 04:39:34,848 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_usb_free_coherent [2022-07-14 04:39:34,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-14 04:39:34,848 INFO L130 BoogieDeclarations]: Found specification of procedure video_device_node_name [2022-07-14 04:39:34,848 INFO L138 BoogieDeclarations]: Found implementation of procedure video_device_node_name [2022-07-14 04:39:34,849 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_module_put [2022-07-14 04:39:34,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_module_put [2022-07-14 04:39:34,849 INFO L130 BoogieDeclarations]: Found specification of procedure read_alloc [2022-07-14 04:39:34,849 INFO L138 BoogieDeclarations]: Found implementation of procedure read_alloc [2022-07-14 04:39:34,849 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-14 04:39:34,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-14 04:39:34,849 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-14 04:39:34,849 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-14 04:39:34,849 INFO L130 BoogieDeclarations]: Found specification of procedure vidioc_dqbuf [2022-07-14 04:39:34,849 INFO L138 BoogieDeclarations]: Found implementation of procedure vidioc_dqbuf [2022-07-14 04:39:34,850 INFO L130 BoogieDeclarations]: Found specification of procedure video_device_release_empty [2022-07-14 04:39:34,850 INFO L138 BoogieDeclarations]: Found implementation of procedure video_device_release_empty [2022-07-14 04:39:34,850 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-14 04:39:34,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_alloc_usb_lock_check_alloc_flags [2022-07-14 04:39:34,850 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_usb_alloc_urb [2022-07-14 04:39:34,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_usb_alloc_urb [2022-07-14 04:39:34,850 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-14 04:39:34,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-14 04:39:34,850 INFO L130 BoogieDeclarations]: Found specification of procedure gspca_input_destroy_urb [2022-07-14 04:39:34,850 INFO L138 BoogieDeclarations]: Found implementation of procedure gspca_input_destroy_urb [2022-07-14 04:39:34,850 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-14 04:39:34,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_lock [2022-07-14 04:39:34,851 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-14 04:39:34,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-14 04:39:34,851 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2022-07-14 04:39:34,851 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2022-07-14 04:39:34,851 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-14 04:39:34,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-14 04:39:34,851 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~VOID [2022-07-14 04:39:34,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~TO~VOID [2022-07-14 04:39:34,851 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-14 04:39:34,851 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-14 04:39:34,852 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-14 04:39:34,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_mutex__one_thread_double_unlock [2022-07-14 04:39:34,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-14 04:39:34,852 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-14 04:39:34,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-14 04:39:34,852 INFO L130 BoogieDeclarations]: Found specification of procedure gspca_disconnect [2022-07-14 04:39:34,852 INFO L138 BoogieDeclarations]: Found implementation of procedure gspca_disconnect [2022-07-14 04:39:34,852 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-14 04:39:34,852 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-14 04:39:34,852 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-14 04:39:34,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-14 04:39:34,853 INFO L130 BoogieDeclarations]: Found specification of procedure vidioc_s_input [2022-07-14 04:39:34,853 INFO L138 BoogieDeclarations]: Found implementation of procedure vidioc_s_input [2022-07-14 04:39:34,853 INFO L130 BoogieDeclarations]: Found specification of procedure try_fmt_vid_cap [2022-07-14 04:39:34,853 INFO L138 BoogieDeclarations]: Found implementation of procedure try_fmt_vid_cap [2022-07-14 04:39:34,853 INFO L130 BoogieDeclarations]: Found specification of procedure __wake_up [2022-07-14 04:39:34,853 INFO L138 BoogieDeclarations]: Found implementation of procedure __wake_up [2022-07-14 04:39:34,853 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-14 04:39:34,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-14 04:39:34,853 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-14 04:39:34,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-14 04:39:34,854 INFO L130 BoogieDeclarations]: Found specification of procedure msecs_to_jiffies [2022-07-14 04:39:34,854 INFO L138 BoogieDeclarations]: Found implementation of procedure msecs_to_jiffies [2022-07-14 04:39:34,854 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_usb_lock_of_gspca_dev [2022-07-14 04:39:34,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_mutex_mutex_lock_interruptible_or_killable_usb_lock_of_gspca_dev [2022-07-14 04:39:34,854 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-14 04:39:34,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-14 04:39:34,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-14 04:39:34,854 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~VOID [2022-07-14 04:39:34,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~VOID [2022-07-14 04:39:34,854 INFO L130 BoogieDeclarations]: Found specification of procedure gspca_vm_open [2022-07-14 04:39:34,854 INFO L138 BoogieDeclarations]: Found implementation of procedure gspca_vm_open [2022-07-14 04:39:35,485 INFO L234 CfgBuilder]: Building ICFG [2022-07-14 04:39:35,488 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-14 04:39:35,598 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-14 04:39:38,470 INFO L275 CfgBuilder]: Performing block encoding [2022-07-14 04:39:38,481 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-14 04:39:38,482 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-14 04:39:38,484 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:39:38 BoogieIcfgContainer [2022-07-14 04:39:38,484 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-14 04:39:38,486 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-14 04:39:38,486 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-14 04:39:38,488 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-14 04:39:38,488 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.07 04:39:31" (1/3) ... [2022-07-14 04:39:38,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e5e8eec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 04:39:38, skipping insertion in model container [2022-07-14 04:39:38,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.07 04:39:34" (2/3) ... [2022-07-14 04:39:38,489 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2e5e8eec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.07 04:39:38, skipping insertion in model container [2022-07-14 04:39:38,489 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.07 04:39:38" (3/3) ... [2022-07-14 04:39:38,490 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---drivers--media--usb--gspca--gspca_main.ko.cil.i [2022-07-14 04:39:38,499 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-14 04:39:38,500 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2022-07-14 04:39:38,555 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-14 04:39:38,559 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@5b3d8669, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@56248754 [2022-07-14 04:39:38,559 INFO L358 AbstractCegarLoop]: Starting to check reachability of 30 error locations. [2022-07-14 04:39:38,566 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-14 04:39:38,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-07-14 04:39:38,572 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:39:38,572 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-14 04:39:38,573 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-14 04:39:38,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:39:38,576 INFO L85 PathProgramCache]: Analyzing trace with hash 831534073, now seen corresponding path program 1 times [2022-07-14 04:39:38,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:39:38,582 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866745432] [2022-07-14 04:39:38,582 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:38,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:39:38,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:39,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:39,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:39,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:39:39,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:39,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:39:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:39,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:39:39,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:39,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:39,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:39:39,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:39,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:39:39,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:39,078 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-14 04:39:39,079 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:39:39,079 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866745432] [2022-07-14 04:39:39,079 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866745432] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:39:39,079 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:39:39,080 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:39:39,081 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312459844] [2022-07-14 04:39:39,081 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:39:39,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:39:39,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:39:39,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:39:39,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:39:39,105 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-14 04:39:42,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:39:42,440 INFO L93 Difference]: Finished difference Result 3527 states and 5017 transitions. [2022-07-14 04:39:42,442 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:39:42,443 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-14 04:39:42,443 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:39:42,459 INFO L225 Difference]: With dead ends: 3527 [2022-07-14 04:39:42,459 INFO L226 Difference]: Without dead ends: 1785 [2022-07-14 04:39:42,474 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-14 04:39:42,476 INFO L413 NwaCegarLoop]: 2212 mSDtfsCounter, 4465 mSDsluCounter, 1281 mSDsCounter, 0 mSdLazyCounter, 2411 mSolverCounterSat, 1562 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4616 SdHoareTripleChecker+Valid, 3493 SdHoareTripleChecker+Invalid, 3973 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1562 IncrementalHoareTripleChecker+Valid, 2411 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:39:42,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4616 Valid, 3493 Invalid, 3973 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1562 Valid, 2411 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-07-14 04:39:42,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1785 states. [2022-07-14 04:39:42,565 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1785 to 1785. [2022-07-14 04:39:42,569 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-14 04:39:42,578 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1785 states and 2405 transitions. [2022-07-14 04:39:42,580 INFO L78 Accepts]: Start accepts. Automaton has 1785 states and 2405 transitions. Word has length 49 [2022-07-14 04:39:42,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:39:42,581 INFO L495 AbstractCegarLoop]: Abstraction has 1785 states and 2405 transitions. [2022-07-14 04:39:42,582 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-14 04:39:42,582 INFO L276 IsEmpty]: Start isEmpty. Operand 1785 states and 2405 transitions. [2022-07-14 04:39:42,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-14 04:39:42,583 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:39:42,583 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-14 04:39:42,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-14 04:39:42,584 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-14 04:39:42,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:39:42,584 INFO L85 PathProgramCache]: Analyzing trace with hash 571787044, now seen corresponding path program 1 times [2022-07-14 04:39:42,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:39:42,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [14780296] [2022-07-14 04:39:42,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:42,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:39:42,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:42,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:42,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:42,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:39:42,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:42,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:39:42,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:42,762 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:39:42,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:42,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:42,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:39:42,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:42,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:39:42,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:42,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:39:42,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:42,800 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-14 04:39:42,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:39:42,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [14780296] [2022-07-14 04:39:42,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [14780296] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:39:42,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:39:42,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:39:42,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [905129054] [2022-07-14 04:39:42,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:39:42,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:39:42,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:39:42,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:39:42,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:39:42,803 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-14 04:39:46,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:39:46,012 INFO L93 Difference]: Finished difference Result 1785 states and 2405 transitions. [2022-07-14 04:39:46,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:39:46,012 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-14 04:39:46,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:39:46,021 INFO L225 Difference]: With dead ends: 1785 [2022-07-14 04:39:46,021 INFO L226 Difference]: Without dead ends: 1783 [2022-07-14 04:39:46,021 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-14 04:39:46,024 INFO L413 NwaCegarLoop]: 2194 mSDtfsCounter, 4433 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2397 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s 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.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:39:46,024 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.1s Time] [2022-07-14 04:39:46,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1783 states. [2022-07-14 04:39:46,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1783 to 1783. [2022-07-14 04:39:46,084 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-14 04:39:46,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1783 states to 1783 states and 2403 transitions. [2022-07-14 04:39:46,092 INFO L78 Accepts]: Start accepts. Automaton has 1783 states and 2403 transitions. Word has length 55 [2022-07-14 04:39:46,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:39:46,093 INFO L495 AbstractCegarLoop]: Abstraction has 1783 states and 2403 transitions. [2022-07-14 04:39:46,094 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-14 04:39:46,094 INFO L276 IsEmpty]: Start isEmpty. Operand 1783 states and 2403 transitions. [2022-07-14 04:39:46,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-07-14 04:39:46,096 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:39:46,097 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-14 04:39:46,097 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-14 04:39:46,097 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-14 04:39:46,097 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:39:46,097 INFO L85 PathProgramCache]: Analyzing trace with hash -1684624910, now seen corresponding path program 1 times [2022-07-14 04:39:46,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:39:46,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1985583734] [2022-07-14 04:39:46,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:46,098 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:39:46,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:46,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:46,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:46,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:39:46,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:46,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:39:46,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:46,314 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:39:46,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:46,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:46,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:46,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:39:46,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:46,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:39:46,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:46,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:39:46,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:46,362 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-14 04:39:46,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:46,372 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-14 04:39:46,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:39:46,372 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1985583734] [2022-07-14 04:39:46,372 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1985583734] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:39:46,372 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:39:46,372 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:39:46,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [413614548] [2022-07-14 04:39:46,373 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:39:46,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:39:46,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:39:46,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:39:46,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:39:46,374 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-14 04:39:49,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:39:49,581 INFO L93 Difference]: Finished difference Result 1783 states and 2403 transitions. [2022-07-14 04:39:49,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:39:49,582 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-14 04:39:49,582 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:39:49,589 INFO L225 Difference]: With dead ends: 1783 [2022-07-14 04:39:49,589 INFO L226 Difference]: Without dead ends: 1781 [2022-07-14 04:39:49,590 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-14 04:39:49,591 INFO L413 NwaCegarLoop]: 2192 mSDtfsCounter, 4427 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2395 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s 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.0s IncrementalHoareTripleChecker+Time [2022-07-14 04:39:49,591 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.0s Time] [2022-07-14 04:39:49,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1781 states. [2022-07-14 04:39:49,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1781 to 1781. [2022-07-14 04:39:49,629 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-14 04:39:49,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1781 states to 1781 states and 2401 transitions. [2022-07-14 04:39:49,636 INFO L78 Accepts]: Start accepts. Automaton has 1781 states and 2401 transitions. Word has length 61 [2022-07-14 04:39:49,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:39:49,636 INFO L495 AbstractCegarLoop]: Abstraction has 1781 states and 2401 transitions. [2022-07-14 04:39:49,636 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-14 04:39:49,636 INFO L276 IsEmpty]: Start isEmpty. Operand 1781 states and 2401 transitions. [2022-07-14 04:39:49,637 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-07-14 04:39:49,637 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:39:49,637 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-14 04:39:49,638 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-14 04:39:49,638 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-14 04:39:49,638 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:39:49,638 INFO L85 PathProgramCache]: Analyzing trace with hash -1434663393, now seen corresponding path program 1 times [2022-07-14 04:39:49,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:39:49,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063227106] [2022-07-14 04:39:49,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:49,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:39:49,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:49,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:49,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:49,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:39:49,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:49,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:39:49,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:49,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:39:49,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:49,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:49,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:49,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:39:49,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:49,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:39:49,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:49,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:39:49,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:49,847 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-14 04:39:49,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:49,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-14 04:39:49,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:49,860 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-14 04:39:49,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:39:49,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063227106] [2022-07-14 04:39:49,861 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063227106] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:39:49,861 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:39:49,861 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:39:49,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653884620] [2022-07-14 04:39:49,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:39:49,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:39:49,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:39:49,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:39:49,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:39:49,863 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-14 04:39:52,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:39:52,917 INFO L93 Difference]: Finished difference Result 1781 states and 2401 transitions. [2022-07-14 04:39:52,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:39:52,918 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-14 04:39:52,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:39:52,925 INFO L225 Difference]: With dead ends: 1781 [2022-07-14 04:39:52,925 INFO L226 Difference]: Without dead ends: 1779 [2022-07-14 04:39:52,926 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-14 04:39:52,926 INFO L413 NwaCegarLoop]: 2190 mSDtfsCounter, 4421 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2393 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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, 2.9s IncrementalHoareTripleChecker+Time [2022-07-14 04:39:52,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4567 Valid, 3455 Invalid, 3947 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1554 Valid, 2393 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-14 04:39:52,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1779 states. [2022-07-14 04:39:52,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1779 to 1779. [2022-07-14 04:39:52,974 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-14 04:39:52,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1779 states to 1779 states and 2399 transitions. [2022-07-14 04:39:52,982 INFO L78 Accepts]: Start accepts. Automaton has 1779 states and 2399 transitions. Word has length 67 [2022-07-14 04:39:52,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:39:52,982 INFO L495 AbstractCegarLoop]: Abstraction has 1779 states and 2399 transitions. [2022-07-14 04:39:52,982 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-14 04:39:52,983 INFO L276 IsEmpty]: Start isEmpty. Operand 1779 states and 2399 transitions. [2022-07-14 04:39:52,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-07-14 04:39:52,987 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:39:52,987 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-14 04:39:52,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-14 04:39:52,987 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-14 04:39:52,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:39:52,988 INFO L85 PathProgramCache]: Analyzing trace with hash -901207908, now seen corresponding path program 1 times [2022-07-14 04:39:52,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:39:52,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163120029] [2022-07-14 04:39:52,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:52,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:39:53,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:53,142 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:53,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:53,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:39:53,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:53,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:39:53,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:53,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:39:53,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:53,182 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:53,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:53,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:39:53,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:53,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:39:53,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:53,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:39:53,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:53,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-14 04:39:53,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:53,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-14 04:39:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:53,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-14 04:39:53,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:53,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-14 04:39:53,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:39:53,224 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163120029] [2022-07-14 04:39:53,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163120029] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:39:53,225 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:39:53,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:39:53,225 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422592310] [2022-07-14 04:39:53,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:39:53,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:39:53,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:39:53,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:39:53,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:39:53,227 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-14 04:39:56,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:39:56,112 INFO L93 Difference]: Finished difference Result 1779 states and 2399 transitions. [2022-07-14 04:39:56,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:39:56,113 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-14 04:39:56,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:39:56,120 INFO L225 Difference]: With dead ends: 1779 [2022-07-14 04:39:56,120 INFO L226 Difference]: Without dead ends: 1777 [2022-07-14 04:39:56,121 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-14 04:39:56,123 INFO L413 NwaCegarLoop]: 2188 mSDtfsCounter, 4415 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2391 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s 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, 2.8s IncrementalHoareTripleChecker+Time [2022-07-14 04:39:56,125 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4560 Valid, 3453 Invalid, 3945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1554 Valid, 2391 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-14 04:39:56,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1777 states. [2022-07-14 04:39:56,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1777 to 1777. [2022-07-14 04:39:56,161 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-14 04:39:56,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1777 states to 1777 states and 2397 transitions. [2022-07-14 04:39:56,169 INFO L78 Accepts]: Start accepts. Automaton has 1777 states and 2397 transitions. Word has length 73 [2022-07-14 04:39:56,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:39:56,169 INFO L495 AbstractCegarLoop]: Abstraction has 1777 states and 2397 transitions. [2022-07-14 04:39:56,169 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-14 04:39:56,170 INFO L276 IsEmpty]: Start isEmpty. Operand 1777 states and 2397 transitions. [2022-07-14 04:39:56,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-07-14 04:39:56,170 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:39:56,171 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-14 04:39:56,171 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-14 04:39:56,171 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-14 04:39:56,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:39:56,171 INFO L85 PathProgramCache]: Analyzing trace with hash -1789613504, now seen corresponding path program 1 times [2022-07-14 04:39:56,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:39:56,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17105651] [2022-07-14 04:39:56,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:56,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:39:56,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:56,275 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:56,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:56,287 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:39:56,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:56,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:39:56,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:56,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:39:56,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:56,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:56,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:56,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:39:56,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:56,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:39:56,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:56,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:39:56,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:56,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-14 04:39:56,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:56,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-14 04:39:56,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:56,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-14 04:39:56,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:56,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-14 04:39:56,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:56,356 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-14 04:39:56,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:39:56,356 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17105651] [2022-07-14 04:39:56,356 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17105651] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:39:56,356 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:39:56,356 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:39:56,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965391479] [2022-07-14 04:39:56,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:39:56,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:39:56,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:39:56,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:39:56,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:39:56,358 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-14 04:39:59,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:39:59,502 INFO L93 Difference]: Finished difference Result 1777 states and 2397 transitions. [2022-07-14 04:39:59,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:39:59,502 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-14 04:39:59,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:39:59,508 INFO L225 Difference]: With dead ends: 1777 [2022-07-14 04:39:59,508 INFO L226 Difference]: Without dead ends: 1775 [2022-07-14 04:39:59,509 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-14 04:39:59,509 INFO L413 NwaCegarLoop]: 2186 mSDtfsCounter, 4409 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2389 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s 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.0s IncrementalHoareTripleChecker+Time [2022-07-14 04:39:59,509 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.0s Time] [2022-07-14 04:39:59,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1775 states. [2022-07-14 04:39:59,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1775 to 1775. [2022-07-14 04:39:59,543 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-14 04:39:59,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1775 states to 1775 states and 2395 transitions. [2022-07-14 04:39:59,547 INFO L78 Accepts]: Start accepts. Automaton has 1775 states and 2395 transitions. Word has length 79 [2022-07-14 04:39:59,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:39:59,548 INFO L495 AbstractCegarLoop]: Abstraction has 1775 states and 2395 transitions. [2022-07-14 04:39:59,548 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-14 04:39:59,548 INFO L276 IsEmpty]: Start isEmpty. Operand 1775 states and 2395 transitions. [2022-07-14 04:39:59,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2022-07-14 04:39:59,548 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:39:59,549 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-14 04:39:59,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-14 04:39:59,549 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-14 04:39:59,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:39:59,549 INFO L85 PathProgramCache]: Analyzing trace with hash -1235042294, now seen corresponding path program 1 times [2022-07-14 04:39:59,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:39:59,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116093886] [2022-07-14 04:39:59,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:39:59,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:39:59,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,641 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:39:59,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:39:59,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:39:59,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:39:59,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:39:59,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:39:59,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:39:59,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:39:59,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-14 04:39:59,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-14 04:39:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-14 04:39:59,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-14 04:39:59,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 04:39:59,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:39:59,731 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-14 04:39:59,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:39:59,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116093886] [2022-07-14 04:39:59,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116093886] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:39:59,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:39:59,732 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:39:59,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723279320] [2022-07-14 04:39:59,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:39:59,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:39:59,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:39:59,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:39:59,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:39:59,734 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-14 04:40:02,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:02,412 INFO L93 Difference]: Finished difference Result 1775 states and 2395 transitions. [2022-07-14 04:40:02,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:40:02,415 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-14 04:40:02,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:02,422 INFO L225 Difference]: With dead ends: 1775 [2022-07-14 04:40:02,422 INFO L226 Difference]: Without dead ends: 1773 [2022-07-14 04:40:02,423 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-14 04:40:02,424 INFO L413 NwaCegarLoop]: 2184 mSDtfsCounter, 4403 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2387 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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, 2.6s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:02,425 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4546 Valid, 3449 Invalid, 3941 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1554 Valid, 2387 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-07-14 04:40:02,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1773 states. [2022-07-14 04:40:02,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1773 to 1773. [2022-07-14 04:40:02,477 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-14 04:40:02,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1773 states to 1773 states and 2393 transitions. [2022-07-14 04:40:02,482 INFO L78 Accepts]: Start accepts. Automaton has 1773 states and 2393 transitions. Word has length 85 [2022-07-14 04:40:02,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:02,482 INFO L495 AbstractCegarLoop]: Abstraction has 1773 states and 2393 transitions. [2022-07-14 04:40:02,483 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-14 04:40:02,483 INFO L276 IsEmpty]: Start isEmpty. Operand 1773 states and 2393 transitions. [2022-07-14 04:40:02,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-07-14 04:40:02,487 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:40:02,487 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-14 04:40:02,487 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-14 04:40:02,487 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-14 04:40:02,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:40:02,488 INFO L85 PathProgramCache]: Analyzing trace with hash -892313890, now seen corresponding path program 1 times [2022-07-14 04:40:02,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:40:02,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195413575] [2022-07-14 04:40:02,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:40:02,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:40:02,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:02,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:40:02,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:40:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:40:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:40:02,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:40:02,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:40:02,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-14 04:40:02,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-14 04:40:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-14 04:40:02,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-14 04:40:02,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 04:40:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-14 04:40:02,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:02,711 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-14 04:40:02,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:40:02,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [195413575] [2022-07-14 04:40:02,712 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [195413575] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:40:02,712 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:40:02,712 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:40:02,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2136779935] [2022-07-14 04:40:02,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:40:02,713 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:40:02,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:40:02,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:40:02,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:40:02,713 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-14 04:40:05,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:05,025 INFO L93 Difference]: Finished difference Result 1773 states and 2393 transitions. [2022-07-14 04:40:05,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:40:05,026 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-14 04:40:05,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:05,042 INFO L225 Difference]: With dead ends: 1773 [2022-07-14 04:40:05,043 INFO L226 Difference]: Without dead ends: 1771 [2022-07-14 04:40:05,044 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-14 04:40:05,044 INFO L413 NwaCegarLoop]: 2182 mSDtfsCounter, 4401 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2381 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s 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, 2.2s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:05,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4543 Valid, 3447 Invalid, 3935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1554 Valid, 2381 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-14 04:40:05,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1771 states. [2022-07-14 04:40:05,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1771 to 1771. [2022-07-14 04:40:05,142 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-14 04:40:05,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1771 states to 1771 states and 2391 transitions. [2022-07-14 04:40:05,146 INFO L78 Accepts]: Start accepts. Automaton has 1771 states and 2391 transitions. Word has length 91 [2022-07-14 04:40:05,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:05,147 INFO L495 AbstractCegarLoop]: Abstraction has 1771 states and 2391 transitions. [2022-07-14 04:40:05,147 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-14 04:40:05,147 INFO L276 IsEmpty]: Start isEmpty. Operand 1771 states and 2391 transitions. [2022-07-14 04:40:05,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-07-14 04:40:05,148 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:40:05,148 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-14 04:40:05,148 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-14 04:40:05,148 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-14 04:40:05,149 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:40:05,149 INFO L85 PathProgramCache]: Analyzing trace with hash 1479975649, now seen corresponding path program 1 times [2022-07-14 04:40:05,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:40:05,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909007943] [2022-07-14 04:40:05,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:40:05,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:40:05,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:05,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:40:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:40:05,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:40:05,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:05,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:40:05,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:40:05,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:40:05,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-14 04:40:05,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-14 04:40:05,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-14 04:40:05,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-14 04:40:05,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 04:40:05,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-14 04:40:05,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:05,505 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-14 04:40:05,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:40:05,505 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909007943] [2022-07-14 04:40:05,505 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909007943] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:40:05,505 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:40:05,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:40:05,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498135818] [2022-07-14 04:40:05,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:40:05,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:40:05,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:40:05,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:40:05,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:40:05,507 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-14 04:40:08,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:08,719 INFO L93 Difference]: Finished difference Result 1771 states and 2391 transitions. [2022-07-14 04:40:08,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:40:08,720 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-14 04:40:08,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:08,737 INFO L225 Difference]: With dead ends: 1771 [2022-07-14 04:40:08,737 INFO L226 Difference]: Without dead ends: 1769 [2022-07-14 04:40:08,738 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-14 04:40:08,740 INFO L413 NwaCegarLoop]: 2180 mSDtfsCounter, 4389 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2383 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s 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.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:08,740 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.1s Time] [2022-07-14 04:40:08,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1769 states. [2022-07-14 04:40:08,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1769 to 1769. [2022-07-14 04:40:08,822 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-14 04:40:08,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1769 states to 1769 states and 2389 transitions. [2022-07-14 04:40:08,831 INFO L78 Accepts]: Start accepts. Automaton has 1769 states and 2389 transitions. Word has length 93 [2022-07-14 04:40:08,831 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:08,831 INFO L495 AbstractCegarLoop]: Abstraction has 1769 states and 2389 transitions. [2022-07-14 04:40:08,832 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-14 04:40:08,832 INFO L276 IsEmpty]: Start isEmpty. Operand 1769 states and 2389 transitions. [2022-07-14 04:40:08,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-07-14 04:40:08,833 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:40:08,833 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-14 04:40:08,833 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-14 04:40:08,833 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-14 04:40:08,833 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:40:08,833 INFO L85 PathProgramCache]: Analyzing trace with hash 782366646, now seen corresponding path program 1 times [2022-07-14 04:40:08,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:40:08,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143902366] [2022-07-14 04:40:08,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:40:08,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:40:08,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,965 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:08,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:40:08,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:40:08,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:40:08,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:08,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:08,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:40:08,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:40:09,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:40:09,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-14 04:40:09,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-14 04:40:09,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-14 04:40:09,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-14 04:40:09,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 04:40:09,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-14 04:40:09,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-14 04:40:09,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:09,060 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-14 04:40:09,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:40:09,061 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143902366] [2022-07-14 04:40:09,061 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143902366] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:40:09,061 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:40:09,061 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:40:09,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1412007767] [2022-07-14 04:40:09,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:40:09,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:40:09,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:40:09,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:40:09,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:40:09,062 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-14 04:40:16,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:16,372 INFO L93 Difference]: Finished difference Result 3451 states and 4689 transitions. [2022-07-14 04:40:16,373 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 04:40:16,373 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-14 04:40:16,373 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:16,387 INFO L225 Difference]: With dead ends: 3451 [2022-07-14 04:40:16,387 INFO L226 Difference]: Without dead ends: 3449 [2022-07-14 04:40:16,388 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-14 04:40:16,388 INFO L413 NwaCegarLoop]: 3970 mSDtfsCounter, 4725 mSDsluCounter, 2701 mSDsCounter, 0 mSdLazyCounter, 6296 mSolverCounterSat, 2162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4851 SdHoareTripleChecker+Valid, 6671 SdHoareTripleChecker+Invalid, 8458 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2162 IncrementalHoareTripleChecker+Valid, 6296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:16,389 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4851 Valid, 6671 Invalid, 8458 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2162 Valid, 6296 Invalid, 0 Unknown, 0 Unchecked, 7.1s Time] [2022-07-14 04:40:16,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3449 states. [2022-07-14 04:40:16,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3449 to 3404. [2022-07-14 04:40:16,492 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-14 04:40:16,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3404 states to 3404 states and 4661 transitions. [2022-07-14 04:40:16,501 INFO L78 Accepts]: Start accepts. Automaton has 3404 states and 4661 transitions. Word has length 99 [2022-07-14 04:40:16,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:16,502 INFO L495 AbstractCegarLoop]: Abstraction has 3404 states and 4661 transitions. [2022-07-14 04:40:16,502 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-14 04:40:16,502 INFO L276 IsEmpty]: Start isEmpty. Operand 3404 states and 4661 transitions. [2022-07-14 04:40:16,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-07-14 04:40:16,504 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:40:16,504 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-14 04:40:16,504 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-14 04:40:16,504 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-14 04:40:16,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:40:16,505 INFO L85 PathProgramCache]: Analyzing trace with hash -790324929, now seen corresponding path program 1 times [2022-07-14 04:40:16,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:40:16,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860834766] [2022-07-14 04:40:16,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:40:16,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:40:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:16,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,607 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:40:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:40:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:40:16,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:16,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:40:16,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:40:16,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:40:16,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-14 04:40:16,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-14 04:40:16,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-14 04:40:16,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-14 04:40:16,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 04:40:16,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,665 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-14 04:40:16,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-14 04:40:16,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 04:40:16,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:16,681 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-14 04:40:16,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:40:16,682 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860834766] [2022-07-14 04:40:16,682 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860834766] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:40:16,682 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:40:16,682 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:40:16,682 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [334402010] [2022-07-14 04:40:16,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:40:16,682 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:40:16,683 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:40:16,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:40:16,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:40:16,684 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-14 04:40:19,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:19,159 INFO L93 Difference]: Finished difference Result 3404 states and 4661 transitions. [2022-07-14 04:40:19,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:40:19,159 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-14 04:40:19,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:19,195 INFO L225 Difference]: With dead ends: 3404 [2022-07-14 04:40:19,196 INFO L226 Difference]: Without dead ends: 3402 [2022-07-14 04:40:19,197 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-14 04:40:19,197 INFO L413 NwaCegarLoop]: 2178 mSDtfsCounter, 4385 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2381 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.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, 2.2s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:19,197 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4525 Valid, 3443 Invalid, 3935 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1554 Valid, 2381 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-14 04:40:19,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3402 states. [2022-07-14 04:40:19,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3402 to 3402. [2022-07-14 04:40:19,285 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-14 04:40:19,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3402 states to 3402 states and 4658 transitions. [2022-07-14 04:40:19,295 INFO L78 Accepts]: Start accepts. Automaton has 3402 states and 4658 transitions. Word has length 105 [2022-07-14 04:40:19,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:19,296 INFO L495 AbstractCegarLoop]: Abstraction has 3402 states and 4658 transitions. [2022-07-14 04:40:19,296 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-14 04:40:19,296 INFO L276 IsEmpty]: Start isEmpty. Operand 3402 states and 4658 transitions. [2022-07-14 04:40:19,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-07-14 04:40:19,298 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:40:19,298 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-14 04:40:19,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-14 04:40:19,298 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-14 04:40:19,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:40:19,299 INFO L85 PathProgramCache]: Analyzing trace with hash -9933911, now seen corresponding path program 1 times [2022-07-14 04:40:19,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:40:19,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323809672] [2022-07-14 04:40:19,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:40:19,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:40:19,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:19,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:19,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:19,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:40:19,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:19,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:40:19,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:19,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:40:19,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:19,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:19,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:19,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:40:19,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:19,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:40:19,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:19,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:40:19,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:19,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-14 04:40:19,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:19,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-14 04:40:19,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:19,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-14 04:40:19,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:19,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-14 04:40:19,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:19,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 04:40:19,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:19,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-14 04:40:19,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:19,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-14 04:40:19,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:19,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 04:40:19,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:19,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-14 04:40:19,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:19,491 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-14 04:40:19,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:40:19,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323809672] [2022-07-14 04:40:19,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323809672] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:40:19,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:40:19,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:40:19,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [539456200] [2022-07-14 04:40:19,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:40:19,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:40:19,492 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:40:19,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:40:19,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:40:19,493 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-14 04:40:21,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:21,837 INFO L93 Difference]: Finished difference Result 3402 states and 4658 transitions. [2022-07-14 04:40:21,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:40:21,838 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-14 04:40:21,838 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:21,865 INFO L225 Difference]: With dead ends: 3402 [2022-07-14 04:40:21,883 INFO L226 Difference]: Without dead ends: 3400 [2022-07-14 04:40:21,885 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-14 04:40:21,888 INFO L413 NwaCegarLoop]: 2176 mSDtfsCounter, 4379 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2379 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s 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, 2.2s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:21,889 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4518 Valid, 3441 Invalid, 3933 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1554 Valid, 2379 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2022-07-14 04:40:21,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3400 states. [2022-07-14 04:40:22,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3400 to 3400. [2022-07-14 04:40:22,028 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-14 04:40:22,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3400 states to 3400 states and 4655 transitions. [2022-07-14 04:40:22,037 INFO L78 Accepts]: Start accepts. Automaton has 3400 states and 4655 transitions. Word has length 111 [2022-07-14 04:40:22,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:22,037 INFO L495 AbstractCegarLoop]: Abstraction has 3400 states and 4655 transitions. [2022-07-14 04:40:22,037 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-14 04:40:22,038 INFO L276 IsEmpty]: Start isEmpty. Operand 3400 states and 4655 transitions. [2022-07-14 04:40:22,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-07-14 04:40:22,039 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:40:22,039 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-14 04:40:22,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-14 04:40:22,040 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-14 04:40:22,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:40:22,040 INFO L85 PathProgramCache]: Analyzing trace with hash 151245329, now seen corresponding path program 1 times [2022-07-14 04:40:22,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:40:22,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930597353] [2022-07-14 04:40:22,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:40:22,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:40:22,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:22,145 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:22,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:22,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:40:22,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:22,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:40:22,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:22,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:40:22,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:22,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:22,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:22,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:40:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:22,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:40:22,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:22,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:40:22,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:22,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-14 04:40:22,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:22,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-14 04:40:22,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:22,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-14 04:40:22,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:22,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-14 04:40:22,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:22,211 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 04:40:22,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:22,216 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-14 04:40:22,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:22,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-14 04:40:22,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:22,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 04:40:22,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:22,232 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-14 04:40:22,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:22,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-14 04:40:22,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:22,244 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-14 04:40:22,244 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:40:22,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930597353] [2022-07-14 04:40:22,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [930597353] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:40:22,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:40:22,245 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:40:22,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [239861038] [2022-07-14 04:40:22,245 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:40:22,245 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:40:22,245 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:40:22,246 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:40:22,246 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:40:22,246 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-14 04:40:25,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:25,224 INFO L93 Difference]: Finished difference Result 3400 states and 4655 transitions. [2022-07-14 04:40:25,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:40:25,229 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-14 04:40:25,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:25,248 INFO L225 Difference]: With dead ends: 3400 [2022-07-14 04:40:25,250 INFO L226 Difference]: Without dead ends: 3398 [2022-07-14 04:40:25,251 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-14 04:40:25,254 INFO L413 NwaCegarLoop]: 2174 mSDtfsCounter, 4373 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2377 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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, 2.8s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:25,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4511 Valid, 3439 Invalid, 3931 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1554 Valid, 2377 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2022-07-14 04:40:25,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3398 states. [2022-07-14 04:40:25,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3398 to 3398. [2022-07-14 04:40:25,363 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-14 04:40:25,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3398 states to 3398 states and 4652 transitions. [2022-07-14 04:40:25,372 INFO L78 Accepts]: Start accepts. Automaton has 3398 states and 4652 transitions. Word has length 117 [2022-07-14 04:40:25,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:25,374 INFO L495 AbstractCegarLoop]: Abstraction has 3398 states and 4652 transitions. [2022-07-14 04:40:25,374 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-14 04:40:25,374 INFO L276 IsEmpty]: Start isEmpty. Operand 3398 states and 4652 transitions. [2022-07-14 04:40:25,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-07-14 04:40:25,375 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:40:25,375 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-14 04:40:25,376 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-14 04:40:25,376 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-14 04:40:25,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:40:25,376 INFO L85 PathProgramCache]: Analyzing trace with hash -159316302, now seen corresponding path program 1 times [2022-07-14 04:40:25,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:40:25,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108145170] [2022-07-14 04:40:25,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:40:25,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:40:25,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:25,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:25,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:25,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:40:25,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:25,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:40:25,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:25,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:40:25,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:25,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:25,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:25,511 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:40:25,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:25,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:40:25,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:25,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:40:25,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:25,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-14 04:40:25,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:25,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-14 04:40:25,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:25,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-14 04:40:25,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:25,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-14 04:40:25,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:25,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 04:40:25,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:25,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-14 04:40:25,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:25,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-14 04:40:25,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:25,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 04:40:25,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:25,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-14 04:40:25,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:25,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-14 04:40:25,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:25,575 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 04:40:25,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:25,579 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-14 04:40:25,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:40:25,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108145170] [2022-07-14 04:40:25,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108145170] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:40:25,580 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:40:25,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:40:25,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037761983] [2022-07-14 04:40:25,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:40:25,581 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:40:25,581 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:40:25,581 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:40:25,581 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:40:25,581 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-14 04:40:28,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:28,341 INFO L93 Difference]: Finished difference Result 3398 states and 4652 transitions. [2022-07-14 04:40:28,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:40:28,341 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-14 04:40:28,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:28,352 INFO L225 Difference]: With dead ends: 3398 [2022-07-14 04:40:28,353 INFO L226 Difference]: Without dead ends: 3396 [2022-07-14 04:40:28,355 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-14 04:40:28,356 INFO L413 NwaCegarLoop]: 2172 mSDtfsCounter, 4367 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2375 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s 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, 2.6s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:28,356 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4504 Valid, 3437 Invalid, 3929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1554 Valid, 2375 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2022-07-14 04:40:28,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3396 states. [2022-07-14 04:40:28,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3396 to 3396. [2022-07-14 04:40:28,444 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-14 04:40:28,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3396 states to 3396 states and 4649 transitions. [2022-07-14 04:40:28,452 INFO L78 Accepts]: Start accepts. Automaton has 3396 states and 4649 transitions. Word has length 123 [2022-07-14 04:40:28,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:28,453 INFO L495 AbstractCegarLoop]: Abstraction has 3396 states and 4649 transitions. [2022-07-14 04:40:28,453 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-14 04:40:28,453 INFO L276 IsEmpty]: Start isEmpty. Operand 3396 states and 4649 transitions. [2022-07-14 04:40:28,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-07-14 04:40:28,454 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:40:28,454 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-14 04:40:28,454 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-14 04:40:28,455 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-14 04:40:28,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:40:28,455 INFO L85 PathProgramCache]: Analyzing trace with hash 1766972875, now seen corresponding path program 1 times [2022-07-14 04:40:28,455 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:40:28,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023080598] [2022-07-14 04:40:28,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:40:28,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:40:28,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:28,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:28,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:28,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:40:28,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:28,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:40:28,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:28,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:40:28,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:28,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:28,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:28,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:40:28,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:28,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:40:28,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:28,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:40:28,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:28,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-14 04:40:28,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:28,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-14 04:40:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:28,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-14 04:40:28,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:28,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-14 04:40:28,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:28,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 04:40:28,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:28,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-14 04:40:28,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:28,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-14 04:40:28,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:28,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 04:40:28,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:28,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-14 04:40:28,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:28,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-14 04:40:28,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:28,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 04:40:28,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:28,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-14 04:40:28,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:28,756 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-14 04:40:28,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:40:28,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023080598] [2022-07-14 04:40:28,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1023080598] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:40:28,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:40:28,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:40:28,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364277365] [2022-07-14 04:40:28,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:40:28,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:40:28,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:40:28,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:40:28,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:40:28,758 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-14 04:40:31,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:31,790 INFO L93 Difference]: Finished difference Result 3396 states and 4649 transitions. [2022-07-14 04:40:31,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:40:31,790 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-14 04:40:31,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:31,800 INFO L225 Difference]: With dead ends: 3396 [2022-07-14 04:40:31,800 INFO L226 Difference]: Without dead ends: 3394 [2022-07-14 04:40:31,801 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-14 04:40:31,801 INFO L413 NwaCegarLoop]: 2170 mSDtfsCounter, 4361 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2373 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s 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, 2.9s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:31,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4497 Valid, 3435 Invalid, 3927 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1554 Valid, 2373 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-14 04:40:31,804 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3394 states. [2022-07-14 04:40:31,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3394 to 3394. [2022-07-14 04:40:31,966 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-14 04:40:31,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3394 states to 3394 states and 4646 transitions. [2022-07-14 04:40:31,975 INFO L78 Accepts]: Start accepts. Automaton has 3394 states and 4646 transitions. Word has length 129 [2022-07-14 04:40:31,976 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:31,976 INFO L495 AbstractCegarLoop]: Abstraction has 3394 states and 4646 transitions. [2022-07-14 04:40:31,976 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-14 04:40:31,976 INFO L276 IsEmpty]: Start isEmpty. Operand 3394 states and 4646 transitions. [2022-07-14 04:40:31,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-07-14 04:40:31,977 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:40:31,977 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-14 04:40:31,978 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-14 04:40:31,978 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-14 04:40:31,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:40:31,978 INFO L85 PathProgramCache]: Analyzing trace with hash 796582475, now seen corresponding path program 1 times [2022-07-14 04:40:31,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:40:31,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806218292] [2022-07-14 04:40:31,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:40:31,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:40:32,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:32,097 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:32,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:32,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:40:32,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:32,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:40:32,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:32,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:40:32,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:32,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:32,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:32,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:40:32,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:32,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:40:32,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:32,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:40:32,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:32,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-14 04:40:32,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:32,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-14 04:40:32,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:32,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-14 04:40:32,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:32,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-14 04:40:32,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:32,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 04:40:32,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:32,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-14 04:40:32,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:32,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-14 04:40:32,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:32,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 04:40:32,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:32,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-14 04:40:32,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:32,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-14 04:40:32,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:32,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 04:40:32,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:32,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-14 04:40:32,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:32,229 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-14 04:40:32,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:32,239 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-14 04:40:32,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:40:32,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806218292] [2022-07-14 04:40:32,241 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806218292] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:40:32,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:40:32,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:40:32,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1416513296] [2022-07-14 04:40:32,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:40:32,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:40:32,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:40:32,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:40:32,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:40:32,243 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-14 04:40:35,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:35,290 INFO L93 Difference]: Finished difference Result 3394 states and 4646 transitions. [2022-07-14 04:40:35,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:40:35,290 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-14 04:40:35,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:35,301 INFO L225 Difference]: With dead ends: 3394 [2022-07-14 04:40:35,301 INFO L226 Difference]: Without dead ends: 3392 [2022-07-14 04:40:35,302 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-14 04:40:35,304 INFO L413 NwaCegarLoop]: 2168 mSDtfsCounter, 4355 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2371 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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, 2.9s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:35,305 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4490 Valid, 3433 Invalid, 3925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1554 Valid, 2371 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-14 04:40:35,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3392 states. [2022-07-14 04:40:35,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3392 to 3392. [2022-07-14 04:40:35,419 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-14 04:40:35,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3392 states to 3392 states and 4643 transitions. [2022-07-14 04:40:35,428 INFO L78 Accepts]: Start accepts. Automaton has 3392 states and 4643 transitions. Word has length 135 [2022-07-14 04:40:35,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:35,428 INFO L495 AbstractCegarLoop]: Abstraction has 3392 states and 4643 transitions. [2022-07-14 04:40:35,428 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-14 04:40:35,429 INFO L276 IsEmpty]: Start isEmpty. Operand 3392 states and 4643 transitions. [2022-07-14 04:40:35,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2022-07-14 04:40:35,430 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:40:35,430 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-14 04:40:35,430 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-14 04:40:35,430 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-14 04:40:35,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:40:35,430 INFO L85 PathProgramCache]: Analyzing trace with hash -1589534682, now seen corresponding path program 1 times [2022-07-14 04:40:35,431 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:40:35,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148382920] [2022-07-14 04:40:35,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:40:35,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:40:35,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:35,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:35,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:35,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:40:35,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:35,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:40:35,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:35,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:40:35,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:35,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:35,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:35,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:40:35,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:35,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:40:35,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:35,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:40:35,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:35,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-14 04:40:35,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:35,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-14 04:40:35,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:35,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-14 04:40:35,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:35,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-14 04:40:35,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:35,623 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 04:40:35,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:35,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-14 04:40:35,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:35,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-14 04:40:35,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:35,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 04:40:35,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:35,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-14 04:40:35,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:35,653 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-14 04:40:35,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:35,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 04:40:35,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:35,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-14 04:40:35,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:35,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-14 04:40:35,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:35,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-14 04:40:35,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:35,675 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-14 04:40:35,675 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:40:35,675 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148382920] [2022-07-14 04:40:35,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148382920] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:40:35,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:40:35,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:40:35,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890816020] [2022-07-14 04:40:35,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:40:35,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:40:35,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:40:35,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:40:35,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:40:35,677 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-14 04:40:38,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:38,727 INFO L93 Difference]: Finished difference Result 3392 states and 4643 transitions. [2022-07-14 04:40:38,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:40:38,728 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-14 04:40:38,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:38,737 INFO L225 Difference]: With dead ends: 3392 [2022-07-14 04:40:38,737 INFO L226 Difference]: Without dead ends: 3390 [2022-07-14 04:40:38,739 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:40:38,739 INFO L413 NwaCegarLoop]: 2166 mSDtfsCounter, 4349 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2369 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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, 2.9s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:38,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4483 Valid, 3431 Invalid, 3923 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1554 Valid, 2369 Invalid, 0 Unknown, 0 Unchecked, 2.9s Time] [2022-07-14 04:40:38,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3390 states. [2022-07-14 04:40:38,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3390 to 3390. [2022-07-14 04:40:38,841 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-14 04:40:38,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3390 states to 3390 states and 4640 transitions. [2022-07-14 04:40:38,851 INFO L78 Accepts]: Start accepts. Automaton has 3390 states and 4640 transitions. Word has length 141 [2022-07-14 04:40:38,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:38,852 INFO L495 AbstractCegarLoop]: Abstraction has 3390 states and 4640 transitions. [2022-07-14 04:40:38,852 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-14 04:40:38,852 INFO L276 IsEmpty]: Start isEmpty. Operand 3390 states and 4640 transitions. [2022-07-14 04:40:38,854 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-07-14 04:40:38,854 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:40:38,854 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-14 04:40:38,854 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-14 04:40:38,855 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-14 04:40:38,855 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:40:38,855 INFO L85 PathProgramCache]: Analyzing trace with hash -1464303862, now seen corresponding path program 1 times [2022-07-14 04:40:38,855 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:40:38,855 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439395554] [2022-07-14 04:40:38,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:40:38,856 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:40:38,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:38,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:38,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:38,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:40:38,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:38,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:40:38,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:38,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:40:38,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:38,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:38,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:38,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:40:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:38,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:40:38,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:38,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:40:38,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:38,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-14 04:40:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:38,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-14 04:40:38,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:38,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-14 04:40:38,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:39,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-14 04:40:39,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:39,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 04:40:39,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:39,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-14 04:40:39,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:39,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-14 04:40:39,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:39,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 04:40:39,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:39,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-14 04:40:39,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:39,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-14 04:40:39,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:39,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 04:40:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:39,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-14 04:40:39,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:39,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-14 04:40:39,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:39,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-14 04:40:39,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:39,053 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 04:40:39,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:39,058 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-14 04:40:39,058 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:40:39,058 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439395554] [2022-07-14 04:40:39,058 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439395554] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:40:39,058 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:40:39,059 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:40:39,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306651401] [2022-07-14 04:40:39,059 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:40:39,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:40:39,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:40:39,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:40:39,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:40:39,061 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-14 04:40:42,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:42,226 INFO L93 Difference]: Finished difference Result 3390 states and 4640 transitions. [2022-07-14 04:40:42,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:40:42,227 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-14 04:40:42,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:42,255 INFO L225 Difference]: With dead ends: 3390 [2022-07-14 04:40:42,256 INFO L226 Difference]: Without dead ends: 3388 [2022-07-14 04:40:42,257 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-14 04:40:42,257 INFO L413 NwaCegarLoop]: 2164 mSDtfsCounter, 4343 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2367 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s 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.0s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:42,258 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.0s Time] [2022-07-14 04:40:42,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3388 states. [2022-07-14 04:40:42,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3388 to 3388. [2022-07-14 04:40:42,483 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-14 04:40:42,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3388 states to 3388 states and 4637 transitions. [2022-07-14 04:40:42,509 INFO L78 Accepts]: Start accepts. Automaton has 3388 states and 4637 transitions. Word has length 147 [2022-07-14 04:40:42,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:42,509 INFO L495 AbstractCegarLoop]: Abstraction has 3388 states and 4637 transitions. [2022-07-14 04:40:42,510 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-14 04:40:42,510 INFO L276 IsEmpty]: Start isEmpty. Operand 3388 states and 4637 transitions. [2022-07-14 04:40:42,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-07-14 04:40:42,511 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:40:42,511 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-14 04:40:42,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-07-14 04:40:42,511 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-14 04:40:42,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:40:42,512 INFO L85 PathProgramCache]: Analyzing trace with hash 1160454884, now seen corresponding path program 1 times [2022-07-14 04:40:42,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:40:42,512 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [191188480] [2022-07-14 04:40:42,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:40:42,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:40:42,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:42,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:42,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:42,738 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:40:42,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:42,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:40:42,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:42,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:40:42,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:42,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:42,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:40:42,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:42,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:40:42,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:42,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:40:42,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:42,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-14 04:40:42,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:42,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-14 04:40:42,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:42,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-14 04:40:42,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:42,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-14 04:40:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:42,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 04:40:42,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:42,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-14 04:40:42,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:42,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-14 04:40:42,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:42,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 04:40:42,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:42,885 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-14 04:40:42,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:42,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-14 04:40:42,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:42,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 04:40:42,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:42,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-14 04:40:42,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:42,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-14 04:40:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:42,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-14 04:40:42,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:42,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 04:40:42,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:42,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-14 04:40:42,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:42,955 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-14 04:40:42,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:40:42,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [191188480] [2022-07-14 04:40:42,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [191188480] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:40:42,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:40:42,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:40:42,956 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920434889] [2022-07-14 04:40:42,956 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:40:42,957 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:40:42,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:40:42,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:40:42,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:40:42,958 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-14 04:40:49,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:49,125 INFO L93 Difference]: Finished difference Result 6689 states and 9291 transitions. [2022-07-14 04:40:49,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-14 04:40:49,126 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-14 04:40:49,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:49,142 INFO L225 Difference]: With dead ends: 6689 [2022-07-14 04:40:49,142 INFO L226 Difference]: Without dead ends: 6687 [2022-07-14 04:40:49,144 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-14 04:40:49,145 INFO L413 NwaCegarLoop]: 2433 mSDtfsCounter, 6609 mSDsluCounter, 1709 mSDsCounter, 0 mSdLazyCounter, 5131 mSolverCounterSat, 2643 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6727 SdHoareTripleChecker+Valid, 4142 SdHoareTripleChecker+Invalid, 7774 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2643 IncrementalHoareTripleChecker+Valid, 5131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:49,145 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6727 Valid, 4142 Invalid, 7774 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2643 Valid, 5131 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2022-07-14 04:40:49,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6687 states. [2022-07-14 04:40:49,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6687 to 6590. [2022-07-14 04:40:49,356 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-14 04:40:49,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6590 states to 6590 states and 9198 transitions. [2022-07-14 04:40:49,378 INFO L78 Accepts]: Start accepts. Automaton has 6590 states and 9198 transitions. Word has length 153 [2022-07-14 04:40:49,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:49,379 INFO L495 AbstractCegarLoop]: Abstraction has 6590 states and 9198 transitions. [2022-07-14 04:40:49,379 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-14 04:40:49,379 INFO L276 IsEmpty]: Start isEmpty. Operand 6590 states and 9198 transitions. [2022-07-14 04:40:49,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-07-14 04:40:49,380 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:40:49,380 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-14 04:40:49,381 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-07-14 04:40:49,381 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-14 04:40:49,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:40:49,381 INFO L85 PathProgramCache]: Analyzing trace with hash -1625234295, now seen corresponding path program 1 times [2022-07-14 04:40:49,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:40:49,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270518940] [2022-07-14 04:40:49,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:40:49,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:40:49,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:49,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:49,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:49,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:40:49,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:49,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:40:49,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:49,489 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:40:49,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:49,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:49,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:49,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:40:49,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:49,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:40:49,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:49,504 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:40:49,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:49,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-14 04:40:49,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:49,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-14 04:40:49,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:49,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-14 04:40:49,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:49,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-14 04:40:49,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:49,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 04:40:49,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:49,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-14 04:40:49,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:49,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-14 04:40:49,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:49,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 04:40:49,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:49,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-14 04:40:49,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:49,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-14 04:40:49,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:49,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 04:40:49,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:49,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-14 04:40:49,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:49,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-14 04:40:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:49,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-14 04:40:49,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:49,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 04:40:49,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:49,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-14 04:40:49,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:49,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-14 04:40:49,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:49,647 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-14 04:40:49,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:40:49,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270518940] [2022-07-14 04:40:49,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270518940] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:40:49,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:40:49,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:40:49,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746094118] [2022-07-14 04:40:49,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:40:49,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:40:49,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:40:49,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:40:49,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:40:49,649 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-14 04:40:52,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:52,294 INFO L93 Difference]: Finished difference Result 6590 states and 9198 transitions. [2022-07-14 04:40:52,294 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-14 04:40:52,295 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-14 04:40:52,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:52,337 INFO L225 Difference]: With dead ends: 6590 [2022-07-14 04:40:52,338 INFO L226 Difference]: Without dead ends: 6588 [2022-07-14 04:40:52,340 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-14 04:40:52,341 INFO L413 NwaCegarLoop]: 2162 mSDtfsCounter, 4337 mSDsluCounter, 1265 mSDsCounter, 0 mSdLazyCounter, 2365 mSolverCounterSat, 1554 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.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, 2.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:52,342 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4468 Valid, 3427 Invalid, 3919 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1554 Valid, 2365 Invalid, 0 Unknown, 0 Unchecked, 2.4s Time] [2022-07-14 04:40:52,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6588 states. [2022-07-14 04:40:52,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6588 to 6588. [2022-07-14 04:40:52,568 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-14 04:40:52,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6588 states to 6588 states and 9195 transitions. [2022-07-14 04:40:52,591 INFO L78 Accepts]: Start accepts. Automaton has 6588 states and 9195 transitions. Word has length 159 [2022-07-14 04:40:52,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:52,591 INFO L495 AbstractCegarLoop]: Abstraction has 6588 states and 9195 transitions. [2022-07-14 04:40:52,592 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-14 04:40:52,592 INFO L276 IsEmpty]: Start isEmpty. Operand 6588 states and 9195 transitions. [2022-07-14 04:40:52,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 166 [2022-07-14 04:40:52,593 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:40:52,593 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-14 04:40:52,593 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-07-14 04:40:52,593 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-14 04:40:52,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:40:52,594 INFO L85 PathProgramCache]: Analyzing trace with hash 889461959, now seen corresponding path program 1 times [2022-07-14 04:40:52,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:40:52,594 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199432086] [2022-07-14 04:40:52,594 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:40:52,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:40:52,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:52,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:52,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:52,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:40:52,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:52,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:40:52,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:52,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:40:52,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:52,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:52,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:52,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:40:52,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:52,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:40:52,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:52,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-07-14 04:40:52,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:52,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-07-14 04:40:52,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:52,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-07-14 04:40:52,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:52,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-07-14 04:40:52,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:52,775 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2022-07-14 04:40:52,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:52,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2022-07-14 04:40:52,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:52,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2022-07-14 04:40:52,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:52,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2022-07-14 04:40:52,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:52,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2022-07-14 04:40:52,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:52,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-07-14 04:40:52,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:52,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 107 [2022-07-14 04:40:52,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:52,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 04:40:52,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:52,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-07-14 04:40:52,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:52,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-07-14 04:40:52,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:52,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2022-07-14 04:40:52,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:52,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2022-07-14 04:40:52,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:52,834 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2022-07-14 04:40:52,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:52,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2022-07-14 04:40:52,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:52,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-14 04:40:52,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:52,849 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-14 04:40:52,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:40:52,850 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199432086] [2022-07-14 04:40:52,850 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199432086] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:40:52,850 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:40:52,850 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:40:52,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474897378] [2022-07-14 04:40:52,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:40:52,850 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:40:52,851 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:40:52,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:40:52,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:40:52,852 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-14 04:40:58,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:40:58,639 INFO L93 Difference]: Finished difference Result 13089 states and 18697 transitions. [2022-07-14 04:40:58,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 04:40:58,639 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-14 04:40:58,639 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:40:58,677 INFO L225 Difference]: With dead ends: 13089 [2022-07-14 04:40:58,677 INFO L226 Difference]: Without dead ends: 12840 [2022-07-14 04:40:58,685 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-14 04:40:58,686 INFO L413 NwaCegarLoop]: 2433 mSDtfsCounter, 6592 mSDsluCounter, 1709 mSDsCounter, 0 mSdLazyCounter, 5128 mSolverCounterSat, 2644 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6708 SdHoareTripleChecker+Valid, 4142 SdHoareTripleChecker+Invalid, 7772 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2644 IncrementalHoareTripleChecker+Valid, 5128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.2s IncrementalHoareTripleChecker+Time [2022-07-14 04:40:58,686 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6708 Valid, 4142 Invalid, 7772 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2644 Valid, 5128 Invalid, 0 Unknown, 0 Unchecked, 5.2s Time] [2022-07-14 04:40:58,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12840 states. [2022-07-14 04:40:59,168 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12840 to 12750. [2022-07-14 04:40:59,179 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-14 04:40:59,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12750 states to 12750 states and 18317 transitions. [2022-07-14 04:40:59,232 INFO L78 Accepts]: Start accepts. Automaton has 12750 states and 18317 transitions. Word has length 165 [2022-07-14 04:40:59,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:40:59,232 INFO L495 AbstractCegarLoop]: Abstraction has 12750 states and 18317 transitions. [2022-07-14 04:40:59,232 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-14 04:40:59,232 INFO L276 IsEmpty]: Start isEmpty. Operand 12750 states and 18317 transitions. [2022-07-14 04:40:59,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2022-07-14 04:40:59,236 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:40:59,237 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-14 04:40:59,237 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-07-14 04:40:59,237 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-14 04:40:59,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:40:59,237 INFO L85 PathProgramCache]: Analyzing trace with hash 580643187, now seen corresponding path program 1 times [2022-07-14 04:40:59,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:40:59,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [803268060] [2022-07-14 04:40:59,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:40:59,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:40:59,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:40:59,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:40:59,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:40:59,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:40:59,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:59,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:40:59,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:40:59,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:40:59,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 04:40:59,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:59,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:59,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:40:59,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-14 04:40:59,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:59,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:59,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:40:59,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,610 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:40:59,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:59,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:59,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:40:59,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 04:40:59,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:59,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:59,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:40:59,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 04:40:59,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:59,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:59,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:40:59,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-14 04:40:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:59,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:40:59,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-14 04:40:59,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:59,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:59,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:40:59,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-14 04:40:59,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:59,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:59,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:40:59,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-14 04:40:59,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:59,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:59,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:40:59,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-14 04:40:59,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:59,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:40:59,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-14 04:40:59,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:59,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:40:59,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-14 04:40:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:59,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:59,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,833 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:40:59,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2022-07-14 04:40:59,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:59,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:59,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:40:59,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2022-07-14 04:40:59,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:59,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:59,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:40:59,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2022-07-14 04:40:59,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:59,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:59,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:40:59,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2022-07-14 04:40:59,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:59,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:59,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:40:59,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2022-07-14 04:40:59,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:59,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:59,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:40:59,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 407 [2022-07-14 04:40:59,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:59,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:59,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:40:59,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 428 [2022-07-14 04:40:59,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:40:59,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:40:59,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:40:59,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:00,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:00,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:00,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 449 [2022-07-14 04:41:00,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:00,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 457 [2022-07-14 04:41:00,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:00,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:00,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:00,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:00,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:00,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 04:41:00,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:00,039 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-14 04:41:00,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:41:00,039 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [803268060] [2022-07-14 04:41:00,039 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [803268060] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:41:00,039 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:41:00,039 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-14 04:41:00,040 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1221554668] [2022-07-14 04:41:00,040 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:41:00,040 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-14 04:41:00,040 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:41:00,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-14 04:41:00,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-14 04:41:00,041 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-14 04:41:05,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:41:05,270 INFO L93 Difference]: Finished difference Result 28663 states and 43712 transitions. [2022-07-14 04:41:05,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-14 04:41:05,271 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-14 04:41:05,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:41:05,331 INFO L225 Difference]: With dead ends: 28663 [2022-07-14 04:41:05,331 INFO L226 Difference]: Without dead ends: 15978 [2022-07-14 04:41:05,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-07-14 04:41:05,417 INFO L413 NwaCegarLoop]: 2128 mSDtfsCounter, 4305 mSDsluCounter, 1591 mSDsCounter, 0 mSdLazyCounter, 3560 mSolverCounterSat, 2013 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4305 SdHoareTripleChecker+Valid, 3719 SdHoareTripleChecker+Invalid, 5573 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2013 IncrementalHoareTripleChecker+Valid, 3560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.3s IncrementalHoareTripleChecker+Time [2022-07-14 04:41:05,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4305 Valid, 3719 Invalid, 5573 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2013 Valid, 3560 Invalid, 0 Unknown, 0 Unchecked, 4.3s Time] [2022-07-14 04:41:05,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15978 states. [2022-07-14 04:41:06,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15978 to 14287. [2022-07-14 04:41:06,167 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-14 04:41:06,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14287 states to 14287 states and 21023 transitions. [2022-07-14 04:41:06,234 INFO L78 Accepts]: Start accepts. Automaton has 14287 states and 21023 transitions. Word has length 494 [2022-07-14 04:41:06,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:41:06,235 INFO L495 AbstractCegarLoop]: Abstraction has 14287 states and 21023 transitions. [2022-07-14 04:41:06,235 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-14 04:41:06,235 INFO L276 IsEmpty]: Start isEmpty. Operand 14287 states and 21023 transitions. [2022-07-14 04:41:06,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 495 [2022-07-14 04:41:06,240 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:41:06,240 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-14 04:41:06,240 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-07-14 04:41:06,240 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-14 04:41:06,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:41:06,241 INFO L85 PathProgramCache]: Analyzing trace with hash -99415183, now seen corresponding path program 1 times [2022-07-14 04:41:06,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:41:06,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833093107] [2022-07-14 04:41:06,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:41:06,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:41:06,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:41:06,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,671 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:06,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:41:06,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:41:06,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:06,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,694 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:41:06,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:41:06,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:41:06,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 04:41:06,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:06,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,723 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:06,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:06,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-14 04:41:06,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:06,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:06,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:06,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:41:06,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:06,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:06,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:06,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 04:41:06,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:06,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:06,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:06,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 04:41:06,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:06,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:06,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:06,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-14 04:41:06,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:06,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:06,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:06,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-14 04:41:06,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,819 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:06,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:06,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:06,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-14 04:41:06,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:06,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:06,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:06,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-14 04:41:06,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:06,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:06,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:06,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,867 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-14 04:41:06,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:06,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,877 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:06,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:06,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-14 04:41:06,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:06,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,894 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:06,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:06,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-14 04:41:06,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:06,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:06,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:06,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2022-07-14 04:41:06,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:06,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:06,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,931 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:06,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2022-07-14 04:41:06,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:06,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:06,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:06,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2022-07-14 04:41:06,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:06,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:06,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:06,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2022-07-14 04:41:06,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:06,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:06,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:06,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2022-07-14 04:41:06,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:06,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:06,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:07,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:07,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:07,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:07,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:07,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 407 [2022-07-14 04:41:07,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:07,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:07,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:07,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:07,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:07,021 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:07,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 428 [2022-07-14 04:41:07,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:07,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:07,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:07,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:07,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:07,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:07,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:07,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 449 [2022-07-14 04:41:07,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:07,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 457 [2022-07-14 04:41:07,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:07,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:07,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:07,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:07,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:07,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 04:41:07,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:07,061 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-14 04:41:07,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:41:07,062 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833093107] [2022-07-14 04:41:07,062 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1833093107] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:41:07,062 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:41:07,062 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 04:41:07,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1632809743] [2022-07-14 04:41:07,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:41:07,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 04:41:07,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:41:07,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 04:41:07,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-14 04:41:07,065 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-14 04:41:14,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:41:14,198 INFO L93 Difference]: Finished difference Result 30184 states and 46362 transitions. [2022-07-14 04:41:14,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 04:41:14,198 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-14 04:41:14,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:41:14,257 INFO L225 Difference]: With dead ends: 30184 [2022-07-14 04:41:14,257 INFO L226 Difference]: Without dead ends: 15962 [2022-07-14 04:41:14,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 179 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=119, Invalid=261, Unknown=0, NotChecked=0, Total=380 [2022-07-14 04:41:14,312 INFO L413 NwaCegarLoop]: 2125 mSDtfsCounter, 4354 mSDsluCounter, 2597 mSDsCounter, 0 mSdLazyCounter, 7400 mSolverCounterSat, 2020 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4354 SdHoareTripleChecker+Valid, 4722 SdHoareTripleChecker+Invalid, 9420 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2020 IncrementalHoareTripleChecker+Valid, 7400 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:41:14,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4354 Valid, 4722 Invalid, 9420 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2020 Valid, 7400 Invalid, 0 Unknown, 0 Unchecked, 6.1s Time] [2022-07-14 04:41:14,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15962 states. [2022-07-14 04:41:14,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15962 to 14287. [2022-07-14 04:41:14,923 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-14 04:41:15,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14287 states to 14287 states and 21007 transitions. [2022-07-14 04:41:15,007 INFO L78 Accepts]: Start accepts. Automaton has 14287 states and 21007 transitions. Word has length 494 [2022-07-14 04:41:15,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:41:15,008 INFO L495 AbstractCegarLoop]: Abstraction has 14287 states and 21007 transitions. [2022-07-14 04:41:15,008 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-14 04:41:15,008 INFO L276 IsEmpty]: Start isEmpty. Operand 14287 states and 21007 transitions. [2022-07-14 04:41:15,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 501 [2022-07-14 04:41:15,014 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:41:15,014 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-14 04:41:15,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-07-14 04:41:15,014 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-14 04:41:15,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:41:15,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1258511913, now seen corresponding path program 1 times [2022-07-14 04:41:15,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:41:15,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1411737299] [2022-07-14 04:41:15,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:41:15,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:41:15,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:41:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:15,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:41:15,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:41:15,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:15,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:41:15,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:41:15,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:41:15,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 04:41:15,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:15,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:15,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:15,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-14 04:41:15,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:15,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:15,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:15,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:41:15,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:15,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:15,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:15,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 04:41:15,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:15,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:15,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:15,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 04:41:15,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:15,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,499 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:15,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:15,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-14 04:41:15,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:15,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:15,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:15,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-14 04:41:15,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:15,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:15,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:15,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-14 04:41:15,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:15,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:15,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:15,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-14 04:41:15,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:15,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:15,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:15,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-14 04:41:15,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:15,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:15,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:15,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-14 04:41:15,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:15,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:15,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:15,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-14 04:41:15,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,630 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:15,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:15,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:15,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2022-07-14 04:41:15,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:15,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:15,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:15,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,715 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2022-07-14 04:41:15,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:15,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:15,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:15,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2022-07-14 04:41:15,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:15,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:15,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:15,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2022-07-14 04:41:15,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:15,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:15,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:15,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2022-07-14 04:41:15,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:15,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:15,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:15,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 407 [2022-07-14 04:41:15,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:15,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:15,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 428 [2022-07-14 04:41:15,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:15,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:15,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:15,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 449 [2022-07-14 04:41:15,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 457 [2022-07-14 04:41:15,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,863 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:15,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:15,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 04:41:15,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 483 [2022-07-14 04:41:15,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:15,877 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-14 04:41:15,877 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:41:15,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1411737299] [2022-07-14 04:41:15,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1411737299] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:41:15,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:41:15,878 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 04:41:15,878 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931904584] [2022-07-14 04:41:15,878 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:41:15,879 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 04:41:15,879 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:41:15,879 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 04:41:15,879 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-07-14 04:41:15,879 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-14 04:41:32,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:41:32,572 INFO L93 Difference]: Finished difference Result 24293 states and 37234 transitions. [2022-07-14 04:41:32,572 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-14 04:41:32,572 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-14 04:41:32,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:41:32,648 INFO L225 Difference]: With dead ends: 24293 [2022-07-14 04:41:32,649 INFO L226 Difference]: Without dead ends: 24291 [2022-07-14 04:41:32,660 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-14 04:41:32,660 INFO L413 NwaCegarLoop]: 4494 mSDtfsCounter, 13108 mSDsluCounter, 4164 mSDsCounter, 0 mSdLazyCounter, 15321 mSolverCounterSat, 6397 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13316 SdHoareTripleChecker+Valid, 8658 SdHoareTripleChecker+Invalid, 21718 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6397 IncrementalHoareTripleChecker+Valid, 15321 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.3s IncrementalHoareTripleChecker+Time [2022-07-14 04:41:32,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13316 Valid, 8658 Invalid, 21718 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6397 Valid, 15321 Invalid, 0 Unknown, 0 Unchecked, 15.3s Time] [2022-07-14 04:41:32,676 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24291 states. [2022-07-14 04:41:33,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24291 to 21695. [2022-07-14 04:41:33,676 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-14 04:41:33,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21695 states to 21695 states and 32813 transitions. [2022-07-14 04:41:33,784 INFO L78 Accepts]: Start accepts. Automaton has 21695 states and 32813 transitions. Word has length 500 [2022-07-14 04:41:33,784 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:41:33,785 INFO L495 AbstractCegarLoop]: Abstraction has 21695 states and 32813 transitions. [2022-07-14 04:41:33,785 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-14 04:41:33,785 INFO L276 IsEmpty]: Start isEmpty. Operand 21695 states and 32813 transitions. [2022-07-14 04:41:33,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 557 [2022-07-14 04:41:33,788 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:41:33,789 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-14 04:41:33,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-07-14 04:41:33,789 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-14 04:41:33,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:41:33,789 INFO L85 PathProgramCache]: Analyzing trace with hash 2091765019, now seen corresponding path program 1 times [2022-07-14 04:41:33,789 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:41:33,790 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717996795] [2022-07-14 04:41:33,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:41:33,790 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:41:33,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:33,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:41:33,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:33,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:33,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:33,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:41:33,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:33,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:41:34,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:34,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:41:34,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:41:34,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:41:34,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 04:41:34,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:34,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,034 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:34,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:34,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-14 04:41:34,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:34,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:34,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:34,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:41:34,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:34,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:34,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:34,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 04:41:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:34,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,080 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:34,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:34,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 04:41:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:34,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:34,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:34,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-14 04:41:34,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,108 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:34,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:34,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:34,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,117 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-14 04:41:34,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,127 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:34,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:34,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-14 04:41:34,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:34,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:34,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:34,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-14 04:41:34,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:34,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:34,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,165 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:34,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-14 04:41:34,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:34,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:34,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:34,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-14 04:41:34,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:34,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:34,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,203 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:34,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,206 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-14 04:41:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:34,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:34,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:34,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2022-07-14 04:41:34,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,238 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:34,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,241 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:34,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:34,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2022-07-14 04:41:34,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,255 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:34,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:34,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:34,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2022-07-14 04:41:34,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,274 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:34,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:34,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:34,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2022-07-14 04:41:34,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,291 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:34,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:34,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:34,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,301 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2022-07-14 04:41:34,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:34,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:34,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:34,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 407 [2022-07-14 04:41:34,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:34,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:34,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:34,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 428 [2022-07-14 04:41:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:34,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,345 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:34,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:34,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 449 [2022-07-14 04:41:34,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 455 [2022-07-14 04:41:34,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:34,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:34,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:34,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 04:41:34,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 491 [2022-07-14 04:41:34,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,393 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:34,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 503 [2022-07-14 04:41:34,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 509 [2022-07-14 04:41:34,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 514 [2022-07-14 04:41:34,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 526 [2022-07-14 04:41:34,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:34,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 04:41:34,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:34,424 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-14 04:41:34,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:41:34,424 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717996795] [2022-07-14 04:41:34,424 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717996795] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:41:34,424 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:41:34,424 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-07-14 04:41:34,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [412342228] [2022-07-14 04:41:34,424 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:41:34,425 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-14 04:41:34,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:41:34,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-14 04:41:34,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-07-14 04:41:34,426 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-14 04:41:49,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:41:49,375 INFO L93 Difference]: Finished difference Result 46997 states and 78942 transitions. [2022-07-14 04:41:49,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-07-14 04:41:49,376 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-14 04:41:49,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:41:49,551 INFO L225 Difference]: With dead ends: 46997 [2022-07-14 04:41:49,551 INFO L226 Difference]: Without dead ends: 46995 [2022-07-14 04:41:49,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=138, Invalid=282, Unknown=0, NotChecked=0, Total=420 [2022-07-14 04:41:49,578 INFO L413 NwaCegarLoop]: 3371 mSDtfsCounter, 7891 mSDsluCounter, 3297 mSDsCounter, 0 mSdLazyCounter, 13866 mSolverCounterSat, 4318 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7991 SdHoareTripleChecker+Valid, 6668 SdHoareTripleChecker+Invalid, 18184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4318 IncrementalHoareTripleChecker+Valid, 13866 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 12.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:41:49,578 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7991 Valid, 6668 Invalid, 18184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4318 Valid, 13866 Invalid, 0 Unknown, 0 Unchecked, 12.4s Time] [2022-07-14 04:41:49,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46995 states. [2022-07-14 04:41:51,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46995 to 43311. [2022-07-14 04:41:51,808 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-14 04:41:52,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43311 states to 43311 states and 70985 transitions. [2022-07-14 04:41:52,305 INFO L78 Accepts]: Start accepts. Automaton has 43311 states and 70985 transitions. Word has length 556 [2022-07-14 04:41:52,305 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:41:52,305 INFO L495 AbstractCegarLoop]: Abstraction has 43311 states and 70985 transitions. [2022-07-14 04:41:52,306 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-14 04:41:52,306 INFO L276 IsEmpty]: Start isEmpty. Operand 43311 states and 70985 transitions. [2022-07-14 04:41:52,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 577 [2022-07-14 04:41:52,312 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:41:52,312 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-14 04:41:52,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-07-14 04:41:52,313 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-14 04:41:52,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:41:52,313 INFO L85 PathProgramCache]: Analyzing trace with hash 652606852, now seen corresponding path program 1 times [2022-07-14 04:41:52,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:41:52,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251286965] [2022-07-14 04:41:52,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:41:52,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:41:52,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:52,829 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:41:52,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:52,841 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:52,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:52,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:41:52,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:52,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:41:52,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:52,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:52,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:52,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:41:52,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:52,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:41:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:52,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:41:52,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:52,889 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 04:41:52,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:52,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:52,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:52,902 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:52,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:52,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:52,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:52,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-14 04:41:52,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:52,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:52,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:52,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:52,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:52,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:52,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:52,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:41:52,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:52,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:52,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:52,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:52,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:52,944 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:52,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:52,947 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 04:41:52,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:52,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:52,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:52,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:52,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:52,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:52,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:52,963 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 04:41:52,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:52,969 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:52,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:52,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:52,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:52,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:52,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:52,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-14 04:41:52,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:52,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:52,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:52,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:52,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:52,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:52,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:52,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-14 04:41:52,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:53,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:53,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:53,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-14 04:41:53,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:53,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,041 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:53,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:53,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-14 04:41:53,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,068 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:53,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:53,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:53,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-14 04:41:53,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,099 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:53,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:53,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:53,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-14 04:41:53,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:53,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:53,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:53,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-14 04:41:53,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:53,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:53,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,176 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:53,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,179 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2022-07-14 04:41:53,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:53,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:53,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:53,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2022-07-14 04:41:53,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:53,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:53,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:53,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,256 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2022-07-14 04:41:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,267 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:53,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:53,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2022-07-14 04:41:53,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:53,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:53,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:53,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2022-07-14 04:41:53,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:53,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:53,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:53,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 407 [2022-07-14 04:41:53,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:53,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:53,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:53,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,331 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 428 [2022-07-14 04:41:53,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:53,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,342 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:53,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:41:53,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 449 [2022-07-14 04:41:53,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,366 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 455 [2022-07-14 04:41:53,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:53,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:53,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:53,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 04:41:53,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 491 [2022-07-14 04:41:53,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,396 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:53,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 503 [2022-07-14 04:41:53,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 509 [2022-07-14 04:41:53,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 514 [2022-07-14 04:41:53,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 526 [2022-07-14 04:41:53,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:53,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:53,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 04:41:53,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 550 [2022-07-14 04:41:53,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:41:53,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,447 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:41:53,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:41:53,452 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-14 04:41:53,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:41:53,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251286965] [2022-07-14 04:41:53,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251286965] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:41:53,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:41:53,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-07-14 04:41:53,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833937597] [2022-07-14 04:41:53,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:41:53,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-14 04:41:53,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:41:53,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-14 04:41:53,455 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-07-14 04:41:53,455 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-14 04:42:12,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:42:12,144 INFO L93 Difference]: Finished difference Result 61361 states and 108159 transitions. [2022-07-14 04:42:12,144 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-14 04:42:12,144 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-14 04:42:12,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:42:12,421 INFO L225 Difference]: With dead ends: 61361 [2022-07-14 04:42:12,421 INFO L226 Difference]: Without dead ends: 61359 [2022-07-14 04:42:12,455 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-14 04:42:12,456 INFO L413 NwaCegarLoop]: 3503 mSDtfsCounter, 15430 mSDsluCounter, 4761 mSDsCounter, 0 mSdLazyCounter, 14658 mSolverCounterSat, 8525 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15537 SdHoareTripleChecker+Valid, 8264 SdHoareTripleChecker+Invalid, 23183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 8525 IncrementalHoareTripleChecker+Valid, 14658 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 15.1s IncrementalHoareTripleChecker+Time [2022-07-14 04:42:12,456 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15537 Valid, 8264 Invalid, 23183 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [8525 Valid, 14658 Invalid, 0 Unknown, 0 Unchecked, 15.1s Time] [2022-07-14 04:42:12,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61359 states. [2022-07-14 04:42:15,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61359 to 51554. [2022-07-14 04:42:15,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51554 states, 38807 states have (on average 1.328085139278996) internal successors, (51539), 39500 states have internal predecessors, (51539), 9442 states have call successors, (9442), 2230 states have call predecessors, (9442), 3293 states have return successors, (25435), 10175 states have call predecessors, (25435), 9439 states have call successors, (25435) [2022-07-14 04:42:16,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51554 states to 51554 states and 86416 transitions. [2022-07-14 04:42:16,155 INFO L78 Accepts]: Start accepts. Automaton has 51554 states and 86416 transitions. Word has length 576 [2022-07-14 04:42:16,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:42:16,156 INFO L495 AbstractCegarLoop]: Abstraction has 51554 states and 86416 transitions. [2022-07-14 04:42:16,156 INFO L496 AbstractCegarLoop]: INTERPOLANT 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) [2022-07-14 04:42:16,156 INFO L276 IsEmpty]: Start isEmpty. Operand 51554 states and 86416 transitions. [2022-07-14 04:42:16,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 593 [2022-07-14 04:42:16,162 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:42:16,162 INFO L195 NwaCegarLoop]: trace histogram [45, 45, 45, 20, 20, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:42:16,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-07-14 04:42:16,163 INFO L420 AbstractCegarLoop]: === Iteration 27 === 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-14 04:42:16,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:42:16,163 INFO L85 PathProgramCache]: Analyzing trace with hash 1131922067, now seen corresponding path program 1 times [2022-07-14 04:42:16,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:42:16,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597818923] [2022-07-14 04:42:16,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:42:16,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:42:16,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:42:16,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:16,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:42:16,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:42:16,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:16,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:42:16,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,634 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:42:16,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:42:16,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,647 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 04:42:16,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:16,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:16,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,660 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:16,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-14 04:42:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:16,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:16,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:16,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:42:16,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:16,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:16,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 04:42:16,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:16,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:16,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:16,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 04:42:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:16,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:16,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:16,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-14 04:42:16,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:16,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:16,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-14 04:42:16,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:16,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:16,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:16,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,748 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-14 04:42:16,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:16,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:16,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,763 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-14 04:42:16,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:16,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:16,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:16,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,780 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-14 04:42:16,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:16,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:16,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:16,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-14 04:42:16,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:16,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:16,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:16,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-14 04:42:16,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:16,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:16,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,823 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:16,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,826 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2022-07-14 04:42:16,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:16,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:16,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,839 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2022-07-14 04:42:16,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,851 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:16,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:16,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2022-07-14 04:42:16,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:16,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,868 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:16,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:16,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2022-07-14 04:42:16,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:16,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:16,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:16,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2022-07-14 04:42:16,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,896 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:16,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:16,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:16,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,907 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 407 [2022-07-14 04:42:16,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,913 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:16,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:16,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 428 [2022-07-14 04:42:16,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:16,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,935 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:16,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:16,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 449 [2022-07-14 04:42:16,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,954 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 455 [2022-07-14 04:42:16,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:16,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:16,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:16,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,978 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 04:42:16,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 491 [2022-07-14 04:42:16,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:16,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 503 [2022-07-14 04:42:16,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 509 [2022-07-14 04:42:16,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:16,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 514 [2022-07-14 04:42:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:17,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 526 [2022-07-14 04:42:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:17,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:17,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:17,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:17,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:17,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 04:42:17,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:17,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:42:17,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:17,023 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:42:17,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:17,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-14 04:42:17,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:17,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 566 [2022-07-14 04:42:17,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:17,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:17,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:17,058 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:17,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:17,063 INFO L134 CoverageAnalysis]: Checked inductivity of 6005 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6005 trivial. 0 not checked. [2022-07-14 04:42:17,063 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:42:17,063 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597818923] [2022-07-14 04:42:17,063 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597818923] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:42:17,063 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:42:17,063 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-14 04:42:17,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504178028] [2022-07-14 04:42:17,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:42:17,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 04:42:17,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:42:17,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 04:42:17,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-14 04:42:17,065 INFO L87 Difference]: Start difference. First operand 51554 states and 86416 transitions. Second operand has 11 states, 11 states have (on average 9.909090909090908) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (50), 7 states have call predecessors, (50), 2 states have return successors, (47), 2 states have call predecessors, (47), 1 states have call successors, (47) [2022-07-14 04:42:33,647 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:42:33,648 INFO L93 Difference]: Finished difference Result 116639 states and 218333 transitions. [2022-07-14 04:42:33,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-07-14 04:42:33,649 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 9.909090909090908) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (50), 7 states have call predecessors, (50), 2 states have return successors, (47), 2 states have call predecessors, (47), 1 states have call successors, (47) Word has length 592 [2022-07-14 04:42:33,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:42:34,072 INFO L225 Difference]: With dead ends: 116639 [2022-07-14 04:42:34,073 INFO L226 Difference]: Without dead ends: 65150 [2022-07-14 04:42:34,672 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 236 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=195, Invalid=561, Unknown=0, NotChecked=0, Total=756 [2022-07-14 04:42:34,673 INFO L413 NwaCegarLoop]: 2391 mSDtfsCounter, 7742 mSDsluCounter, 3466 mSDsCounter, 0 mSdLazyCounter, 12540 mSolverCounterSat, 4174 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7742 SdHoareTripleChecker+Valid, 5857 SdHoareTripleChecker+Invalid, 16714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4174 IncrementalHoareTripleChecker+Valid, 12540 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.7s IncrementalHoareTripleChecker+Time [2022-07-14 04:42:34,673 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7742 Valid, 5857 Invalid, 16714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4174 Valid, 12540 Invalid, 0 Unknown, 0 Unchecked, 10.7s Time] [2022-07-14 04:42:34,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65150 states. [2022-07-14 04:42:38,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65150 to 52071. [2022-07-14 04:42:38,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52071 states, 39239 states have (on average 1.325951221998522) internal successors, (52029), 39893 states have internal predecessors, (52029), 9463 states have call successors, (9463), 2230 states have call predecessors, (9463), 3357 states have return successors, (25795), 10299 states have call predecessors, (25795), 9460 states have call successors, (25795) [2022-07-14 04:42:38,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52071 states to 52071 states and 87287 transitions. [2022-07-14 04:42:38,816 INFO L78 Accepts]: Start accepts. Automaton has 52071 states and 87287 transitions. Word has length 592 [2022-07-14 04:42:38,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:42:38,816 INFO L495 AbstractCegarLoop]: Abstraction has 52071 states and 87287 transitions. [2022-07-14 04:42:38,816 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 9.909090909090908) internal successors, (109), 5 states have internal predecessors, (109), 2 states have call successors, (50), 7 states have call predecessors, (50), 2 states have return successors, (47), 2 states have call predecessors, (47), 1 states have call successors, (47) [2022-07-14 04:42:38,817 INFO L276 IsEmpty]: Start isEmpty. Operand 52071 states and 87287 transitions. [2022-07-14 04:42:38,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 594 [2022-07-14 04:42:38,822 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:42:38,823 INFO L195 NwaCegarLoop]: trace histogram [45, 45, 45, 20, 20, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:42:38,823 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-07-14 04:42:38,823 INFO L420 AbstractCegarLoop]: === Iteration 28 === 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-14 04:42:38,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:42:38,823 INFO L85 PathProgramCache]: Analyzing trace with hash 1862004231, now seen corresponding path program 1 times [2022-07-14 04:42:38,824 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:42:38,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1038267214] [2022-07-14 04:42:38,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:42:38,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:42:38,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:38,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:42:38,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:38,981 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:38,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:38,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:42:38,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:38,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:42:38,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:38,994 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:38,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:38,997 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:42:38,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:42:39,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:42:39,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 04:42:39,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:39,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,020 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:39,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:39,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-14 04:42:39,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,030 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:39,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:39,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,036 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:39,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,039 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:42:39,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,043 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:39,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:39,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,049 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:39,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 04:42:39,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,057 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:39,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:39,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,062 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:39,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,065 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 04:42:39,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,070 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:39,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:39,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:39,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-14 04:42:39,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:39,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,086 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:39,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:39,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,092 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-14 04:42:39,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:39,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:39,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-14 04:42:39,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:39,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:39,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:39,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-14 04:42:39,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:39,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:39,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:39,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-14 04:42:39,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:39,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:39,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:39,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-14 04:42:39,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:39,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,414 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:39,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:39,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-14 04:42:39,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:39,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:39,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:39,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,432 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2022-07-14 04:42:39,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:39,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:39,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:39,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2022-07-14 04:42:39,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:39,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:39,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:39,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2022-07-14 04:42:39,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:39,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:39,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:39,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2022-07-14 04:42:39,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:39,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:39,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,482 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:39,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2022-07-14 04:42:39,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:39,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,494 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:39,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:39,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 407 [2022-07-14 04:42:39,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:39,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:39,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:39,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,513 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 428 [2022-07-14 04:42:39,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,518 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:39,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:39,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:42:39,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 449 [2022-07-14 04:42:39,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 455 [2022-07-14 04:42:39,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:39,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:39,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:39,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 04:42:39,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 491 [2022-07-14 04:42:39,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:39,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 503 [2022-07-14 04:42:39,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 509 [2022-07-14 04:42:39,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 514 [2022-07-14 04:42:39,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 527 [2022-07-14 04:42:39,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,578 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:39,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,582 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:39,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 04:42:39,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:42:39,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,590 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:42:39,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-14 04:42:39,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 567 [2022-07-14 04:42:39,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:42:39,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:42:39,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:42:39,621 INFO L134 CoverageAnalysis]: Checked inductivity of 6005 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6005 trivial. 0 not checked. [2022-07-14 04:42:39,621 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:42:39,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1038267214] [2022-07-14 04:42:39,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1038267214] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:42:39,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:42:39,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-14 04:42:39,622 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190818882] [2022-07-14 04:42:39,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:42:39,622 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 04:42:39,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:42:39,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 04:42:39,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-14 04:42:39,623 INFO L87 Difference]: Start difference. First operand 52071 states and 87287 transitions. Second operand has 11 states, 11 states have (on average 10.0) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (50), 7 states have call predecessors, (50), 2 states have return successors, (47), 2 states have call predecessors, (47), 1 states have call successors, (47) [2022-07-14 04:42:49,420 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-14 04:42:58,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:42:58,714 INFO L93 Difference]: Finished difference Result 116532 states and 216429 transitions. [2022-07-14 04:42:58,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-14 04:42:58,715 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 10.0) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (50), 7 states have call predecessors, (50), 2 states have return successors, (47), 2 states have call predecessors, (47), 1 states have call successors, (47) Word has length 593 [2022-07-14 04:42:58,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:42:59,186 INFO L225 Difference]: With dead ends: 116532 [2022-07-14 04:42:59,186 INFO L226 Difference]: Without dead ends: 64526 [2022-07-14 04:42:59,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=175, Invalid=475, Unknown=0, NotChecked=0, Total=650 [2022-07-14 04:42:59,976 INFO L413 NwaCegarLoop]: 2370 mSDtfsCounter, 6719 mSDsluCounter, 3822 mSDsCounter, 0 mSdLazyCounter, 13692 mSolverCounterSat, 3454 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6719 SdHoareTripleChecker+Valid, 6192 SdHoareTripleChecker+Invalid, 17147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3454 IncrementalHoareTripleChecker+Valid, 13692 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 13.4s IncrementalHoareTripleChecker+Time [2022-07-14 04:42:59,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6719 Valid, 6192 Invalid, 17147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3454 Valid, 13692 Invalid, 1 Unknown, 0 Unchecked, 13.4s Time] [2022-07-14 04:43:00,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64526 states. [2022-07-14 04:43:03,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64526 to 52071. [2022-07-14 04:43:03,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52071 states, 39259 states have (on average 1.3242568583000076) internal successors, (51989), 39873 states have internal predecessors, (51989), 9443 states have call successors, (9443), 2230 states have call predecessors, (9443), 3357 states have return successors, (25480), 10319 states have call predecessors, (25480), 9440 states have call successors, (25480) [2022-07-14 04:43:04,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52071 states to 52071 states and 86912 transitions. [2022-07-14 04:43:04,066 INFO L78 Accepts]: Start accepts. Automaton has 52071 states and 86912 transitions. Word has length 593 [2022-07-14 04:43:04,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:43:04,067 INFO L495 AbstractCegarLoop]: Abstraction has 52071 states and 86912 transitions. [2022-07-14 04:43:04,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 10.0) internal successors, (110), 5 states have internal predecessors, (110), 2 states have call successors, (50), 7 states have call predecessors, (50), 2 states have return successors, (47), 2 states have call predecessors, (47), 1 states have call successors, (47) [2022-07-14 04:43:04,067 INFO L276 IsEmpty]: Start isEmpty. Operand 52071 states and 86912 transitions. [2022-07-14 04:43:04,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2022-07-14 04:43:04,074 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:43:04,075 INFO L195 NwaCegarLoop]: trace histogram [45, 45, 45, 20, 20, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:43:04,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-07-14 04:43:04,075 INFO L420 AbstractCegarLoop]: === Iteration 29 === 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-14 04:43:04,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:43:04,076 INFO L85 PathProgramCache]: Analyzing trace with hash 823444174, now seen corresponding path program 1 times [2022-07-14 04:43:04,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:43:04,076 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [766152493] [2022-07-14 04:43:04,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:43:04,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:43:04,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:43:04,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:43:04,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:43:04,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,240 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:04,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,243 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:43:04,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:43:04,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:43:04,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 04:43:04,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,263 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:04,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:43:04,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:04,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-14 04:43:04,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:04,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:43:04,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,282 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:04,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:43:04,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:04,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:43:04,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:04,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 04:43:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:04,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,307 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:43:04,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:04,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 04:43:04,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:04,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:43:04,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:04,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,327 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-14 04:43:04,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:04,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:43:04,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:04,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-14 04:43:04,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,347 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:04,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:43:04,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:04,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,355 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-14 04:43:04,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:04,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:43:04,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:04,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-14 04:43:04,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:04,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:43:04,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:04,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-14 04:43:04,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:04,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:43:04,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:04,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-14 04:43:04,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:04,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:43:04,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:04,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-14 04:43:04,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,421 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:04,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:43:04,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,427 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:04,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2022-07-14 04:43:04,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:04,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,438 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:43:04,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:04,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2022-07-14 04:43:04,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:04,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:43:04,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:04,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2022-07-14 04:43:04,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:04,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:43:04,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:04,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2022-07-14 04:43:04,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:04,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,481 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:43:04,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:04,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2022-07-14 04:43:04,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:04,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:43:04,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:04,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 407 [2022-07-14 04:43:04,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:04,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:43:04,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,512 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:04,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 428 [2022-07-14 04:43:04,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:04,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:43:04,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:04,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 449 [2022-07-14 04:43:04,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 455 [2022-07-14 04:43:04,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:04,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,551 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:04,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:04,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 04:43:04,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 491 [2022-07-14 04:43:04,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:04,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 503 [2022-07-14 04:43:04,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 509 [2022-07-14 04:43:04,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 514 [2022-07-14 04:43:04,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 533 [2022-07-14 04:43:04,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:04,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:04,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 04:43:04,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:43:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:43:04,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,792 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-14 04:43:04,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,800 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 574 [2022-07-14 04:43:04,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:04,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:43:04,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:04,809 INFO L134 CoverageAnalysis]: Checked inductivity of 6005 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6005 trivial. 0 not checked. [2022-07-14 04:43:04,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:43:04,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [766152493] [2022-07-14 04:43:04,810 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [766152493] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:43:04,810 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:43:04,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-07-14 04:43:04,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345360859] [2022-07-14 04:43:04,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:43:04,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-14 04:43:04,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:43:04,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-14 04:43:04,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-07-14 04:43:04,812 INFO L87 Difference]: Start difference. First operand 52071 states and 86912 transitions. Second operand has 8 states, 8 states have (on average 15.0) internal successors, (120), 3 states have internal predecessors, (120), 2 states have call successors, (50), 7 states have call predecessors, (50), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2022-07-14 04:43:18,027 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-14 04:43:18,027 INFO L93 Difference]: Finished difference Result 116508 states and 204905 transitions. [2022-07-14 04:43:18,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-07-14 04:43:18,028 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 15.0) internal successors, (120), 3 states have internal predecessors, (120), 2 states have call successors, (50), 7 states have call predecessors, (50), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) Word has length 603 [2022-07-14 04:43:18,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-14 04:43:18,726 INFO L225 Difference]: With dead ends: 116508 [2022-07-14 04:43:18,726 INFO L226 Difference]: Without dead ends: 64502 [2022-07-14 04:43:19,065 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=118, Invalid=262, Unknown=0, NotChecked=0, Total=380 [2022-07-14 04:43:19,066 INFO L413 NwaCegarLoop]: 2367 mSDtfsCounter, 6711 mSDsluCounter, 2313 mSDsCounter, 0 mSdLazyCounter, 6682 mSolverCounterSat, 3474 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6711 SdHoareTripleChecker+Valid, 4680 SdHoareTripleChecker+Invalid, 10156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3474 IncrementalHoareTripleChecker+Valid, 6682 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.2s IncrementalHoareTripleChecker+Time [2022-07-14 04:43:19,066 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6711 Valid, 4680 Invalid, 10156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3474 Valid, 6682 Invalid, 0 Unknown, 0 Unchecked, 8.2s Time] [2022-07-14 04:43:19,110 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64502 states. [2022-07-14 04:43:22,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64502 to 52111. [2022-07-14 04:43:22,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52111 states, 39299 states have (on average 1.3239268174762717) internal successors, (52029), 39913 states have internal predecessors, (52029), 9443 states have call successors, (9443), 2230 states have call predecessors, (9443), 3357 states have return successors, (25480), 10319 states have call predecessors, (25480), 9440 states have call successors, (25480) [2022-07-14 04:43:23,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52111 states to 52111 states and 86952 transitions. [2022-07-14 04:43:23,055 INFO L78 Accepts]: Start accepts. Automaton has 52111 states and 86952 transitions. Word has length 603 [2022-07-14 04:43:23,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-14 04:43:23,056 INFO L495 AbstractCegarLoop]: Abstraction has 52111 states and 86952 transitions. [2022-07-14 04:43:23,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 15.0) internal successors, (120), 3 states have internal predecessors, (120), 2 states have call successors, (50), 7 states have call predecessors, (50), 1 states have return successors, (47), 1 states have call predecessors, (47), 1 states have call successors, (47) [2022-07-14 04:43:23,057 INFO L276 IsEmpty]: Start isEmpty. Operand 52111 states and 86952 transitions. [2022-07-14 04:43:23,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 604 [2022-07-14 04:43:23,073 INFO L187 NwaCegarLoop]: Found error trace [2022-07-14 04:43:23,074 INFO L195 NwaCegarLoop]: trace histogram [45, 45, 45, 20, 20, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-14 04:43:23,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-07-14 04:43:23,074 INFO L420 AbstractCegarLoop]: === Iteration 30 === 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-14 04:43:23,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-14 04:43:23,075 INFO L85 PathProgramCache]: Analyzing trace with hash 143385804, now seen corresponding path program 1 times [2022-07-14 04:43:23,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-14 04:43:23,075 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389822408] [2022-07-14 04:43:23,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-14 04:43:23,075 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-14 04:43:23,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-14 04:43:23,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:23,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-07-14 04:43:23,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-07-14 04:43:23,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:23,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,549 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-07-14 04:43:23,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,553 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-07-14 04:43:23,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-07-14 04:43:23,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-07-14 04:43:23,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:23,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:43:23,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,580 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:23,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-07-14 04:43:23,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,589 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:23,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:43:23,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:23,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,599 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2022-07-14 04:43:23,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:23,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:43:23,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:23,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-07-14 04:43:23,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:23,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:43:23,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:23,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2022-07-14 04:43:23,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:23,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:43:23,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,645 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:23,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2022-07-14 04:43:23,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:23,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:43:23,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:23,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,666 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 176 [2022-07-14 04:43:23,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,673 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:23,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:43:23,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:23,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 197 [2022-07-14 04:43:23,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,691 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:23,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,695 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:43:23,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,698 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:23,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 218 [2022-07-14 04:43:23,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:23,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:43:23,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:23,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 239 [2022-07-14 04:43:23,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:23,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:43:23,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:23,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 260 [2022-07-14 04:43:23,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:23,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,747 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:43:23,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:23,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,754 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 281 [2022-07-14 04:43:23,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:23,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:43:23,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:23,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 302 [2022-07-14 04:43:23,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:23,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:43:23,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:23,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 323 [2022-07-14 04:43:23,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,797 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:23,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,801 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:43:23,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:23,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,809 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 344 [2022-07-14 04:43:23,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:23,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:43:23,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:23,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 365 [2022-07-14 04:43:23,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:23,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:43:23,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,850 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:23,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 386 [2022-07-14 04:43:23,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:23,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:43:23,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,869 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:23,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 407 [2022-07-14 04:43:23,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:23,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,900 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:43:23,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:23,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 428 [2022-07-14 04:43:23,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,917 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:23,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:43:23,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-07-14 04:43:23,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 449 [2022-07-14 04:43:23,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,941 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 455 [2022-07-14 04:43:23,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,951 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:23,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,956 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:23,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:23,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-07-14 04:43:23,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 491 [2022-07-14 04:43:23,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:23,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 503 [2022-07-14 04:43:23,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 509 [2022-07-14 04:43:23,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 514 [2022-07-14 04:43:23,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 533 [2022-07-14 04:43:23,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:23,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:23,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:24,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:24,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:24,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-07-14 04:43:24,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:24,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-14 04:43:24,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:24,011 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-07-14 04:43:24,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:24,014 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2022-07-14 04:43:24,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:24,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 574 [2022-07-14 04:43:24,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:24,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-14 04:43:24,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:24,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-07-14 04:43:24,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-14 04:43:24,046 INFO L134 CoverageAnalysis]: Checked inductivity of 6005 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6005 trivial. 0 not checked. [2022-07-14 04:43:24,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-14 04:43:24,047 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389822408] [2022-07-14 04:43:24,047 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389822408] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-14 04:43:24,047 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-14 04:43:24,047 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-07-14 04:43:24,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867604857] [2022-07-14 04:43:24,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-14 04:43:24,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-07-14 04:43:24,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-14 04:43:24,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-07-14 04:43:24,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-07-14 04:43:24,048 INFO L87 Difference]: Start difference. First operand 52111 states and 86952 transitions. Second operand has 11 states, 11 states have (on average 10.909090909090908) internal successors, (120), 5 states have internal predecessors, (120), 2 states have call successors, (50), 7 states have call predecessors, (50), 2 states have return successors, (47), 2 states have call predecessors, (47), 1 states have call successors, (47) [2022-07-14 04:43:30,911 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-07-14 04:43:32,419 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers []