./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 35987657 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.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 32187ad6a98dd17c1b18f8e1b845f566cde13ca56738d1b8876a5b9bb005af7a --- Real Ultimate output --- This is Ultimate 0.2.2-?-3598765 [2022-07-21 15:46:10,281 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-21 15:46:10,284 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-21 15:46:10,323 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-21 15:46:10,323 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-21 15:46:10,325 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-21 15:46:10,328 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-21 15:46:10,331 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-21 15:46:10,333 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-21 15:46:10,337 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-21 15:46:10,338 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-21 15:46:10,340 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-21 15:46:10,340 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-21 15:46:10,342 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-21 15:46:10,343 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-21 15:46:10,348 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-21 15:46:10,349 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-21 15:46:10,350 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-21 15:46:10,352 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-21 15:46:10,357 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-21 15:46:10,358 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-21 15:46:10,359 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-21 15:46:10,361 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-21 15:46:10,361 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-21 15:46:10,363 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-21 15:46:10,369 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-21 15:46:10,369 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-21 15:46:10,370 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-21 15:46:10,371 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-21 15:46:10,371 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-21 15:46:10,372 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-21 15:46:10,372 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-21 15:46:10,374 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-21 15:46:10,375 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-21 15:46:10,376 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-21 15:46:10,377 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-21 15:46:10,377 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-21 15:46:10,378 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-21 15:46:10,378 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-21 15:46:10,378 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-21 15:46:10,379 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-21 15:46:10,380 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-21 15:46:10,385 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-07-21 15:46:10,416 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-21 15:46:10,417 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-21 15:46:10,417 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-21 15:46:10,417 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-21 15:46:10,418 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-21 15:46:10,418 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-21 15:46:10,419 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-21 15:46:10,419 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-21 15:46:10,419 INFO L138 SettingsManager]: * Use SBE=true [2022-07-21 15:46:10,420 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-21 15:46:10,420 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-21 15:46:10,421 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-21 15:46:10,421 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-21 15:46:10,421 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-21 15:46:10,421 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-21 15:46:10,422 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-21 15:46:10,422 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-21 15:46:10,422 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-21 15:46:10,422 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-21 15:46:10,423 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-21 15:46:10,423 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-21 15:46:10,423 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 15:46:10,423 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-21 15:46:10,424 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-21 15:46:10,424 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-21 15:46:10,424 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-21 15:46:10,424 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-21 15:46:10,425 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-21 15:46:10,425 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-21 15:46:10,425 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-21 15:46:10,425 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 -> 32187ad6a98dd17c1b18f8e1b845f566cde13ca56738d1b8876a5b9bb005af7a [2022-07-21 15:46:10,761 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-21 15:46:10,777 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-21 15:46:10,781 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-21 15:46:10,782 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-21 15:46:10,783 INFO L275 PluginConnector]: CDTParser initialized [2022-07-21 15:46:10,784 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---fs--nfs--nfsv2.ko.cil.i [2022-07-21 15:46:10,835 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/668e0156d/7b352c3fefff4a69b2b982806b316bf6/FLAG729a8a963 [2022-07-21 15:46:11,938 INFO L306 CDTParser]: Found 1 translation units. [2022-07-21 15:46:11,939 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i [2022-07-21 15:46:12,070 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/668e0156d/7b352c3fefff4a69b2b982806b316bf6/FLAG729a8a963 [2022-07-21 15:46:12,319 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/668e0156d/7b352c3fefff4a69b2b982806b316bf6 [2022-07-21 15:46:12,321 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-21 15:46:12,323 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-21 15:46:12,326 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-21 15:46:12,326 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-21 15:46:12,329 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-21 15:46:12,329 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 03:46:12" (1/1) ... [2022-07-21 15:46:12,330 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1ed60090 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:46:12, skipping insertion in model container [2022-07-21 15:46:12,330 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.07 03:46:12" (1/1) ... [2022-07-21 15:46:12,336 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-21 15:46:12,613 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-21 15:46:23,468 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1177218,1177231] [2022-07-21 15:46:23,470 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1177363,1177376] [2022-07-21 15:46:23,471 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1177509,1177522] [2022-07-21 15:46:23,471 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1177674,1177687] [2022-07-21 15:46:23,471 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1177832,1177845] [2022-07-21 15:46:23,472 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1177990,1178003] [2022-07-21 15:46:23,472 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1178148,1178161] [2022-07-21 15:46:23,473 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1178308,1178321] [2022-07-21 15:46:23,473 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1178467,1178480] [2022-07-21 15:46:23,473 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1178606,1178619] [2022-07-21 15:46:23,474 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1178748,1178761] [2022-07-21 15:46:23,474 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1178897,1178910] [2022-07-21 15:46:23,474 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1179036,1179049] [2022-07-21 15:46:23,475 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1179191,1179204] [2022-07-21 15:46:23,475 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1179351,1179364] [2022-07-21 15:46:23,476 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1179502,1179515] [2022-07-21 15:46:23,476 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1179653,1179666] [2022-07-21 15:46:23,476 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1179805,1179818] [2022-07-21 15:46:23,479 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1179954,1179967] [2022-07-21 15:46:23,481 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1180102,1180115] [2022-07-21 15:46:23,481 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1180259,1180272] [2022-07-21 15:46:23,482 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1180408,1180421] [2022-07-21 15:46:23,483 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1180564,1180577] [2022-07-21 15:46:23,483 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1180717,1180730] [2022-07-21 15:46:23,486 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1180863,1180876] [2022-07-21 15:46:23,487 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1181006,1181019] [2022-07-21 15:46:23,487 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1181158,1181171] [2022-07-21 15:46:23,487 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1181304,1181317] [2022-07-21 15:46:23,487 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1181449,1181462] [2022-07-21 15:46:23,488 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1181603,1181616] [2022-07-21 15:46:23,488 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1181754,1181767] [2022-07-21 15:46:23,488 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1181909,1181922] [2022-07-21 15:46:23,489 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1182061,1182074] [2022-07-21 15:46:23,489 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1182216,1182229] [2022-07-21 15:46:23,489 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1182380,1182393] [2022-07-21 15:46:23,490 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1182536,1182549] [2022-07-21 15:46:23,490 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1182700,1182713] [2022-07-21 15:46:23,491 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1182842,1182855] [2022-07-21 15:46:23,491 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1183000,1183013] [2022-07-21 15:46:23,491 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1183167,1183180] [2022-07-21 15:46:23,492 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1183326,1183339] [2022-07-21 15:46:23,492 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1183485,1183498] [2022-07-21 15:46:23,492 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1183634,1183647] [2022-07-21 15:46:23,493 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1183781,1183794] [2022-07-21 15:46:23,493 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1183920,1183933] [2022-07-21 15:46:23,493 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1184083,1184096] [2022-07-21 15:46:23,494 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1184249,1184262] [2022-07-21 15:46:23,494 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1184413,1184426] [2022-07-21 15:46:23,494 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1184578,1184591] [2022-07-21 15:46:23,495 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1184743,1184756] [2022-07-21 15:46:23,495 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1184909,1184922] [2022-07-21 15:46:23,495 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1185074,1185087] [2022-07-21 15:46:23,496 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1185241,1185254] [2022-07-21 15:46:23,496 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1185401,1185414] [2022-07-21 15:46:23,496 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1185563,1185576] [2022-07-21 15:46:23,497 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1185722,1185735] [2022-07-21 15:46:23,497 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1185868,1185881] [2022-07-21 15:46:23,497 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1186011,1186024] [2022-07-21 15:46:23,498 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1186155,1186168] [2022-07-21 15:46:23,498 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1186298,1186311] [2022-07-21 15:46:23,499 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1186442,1186455] [2022-07-21 15:46:23,499 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1186583,1186596] [2022-07-21 15:46:23,499 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1186721,1186734] [2022-07-21 15:46:23,500 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1186879,1186892] [2022-07-21 15:46:23,500 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1187038,1187051] [2022-07-21 15:46:23,500 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1187194,1187207] [2022-07-21 15:46:23,501 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1187343,1187356] [2022-07-21 15:46:23,501 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1187495,1187508] [2022-07-21 15:46:23,501 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1187646,1187659] [2022-07-21 15:46:23,502 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1187795,1187808] [2022-07-21 15:46:23,502 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1187947,1187960] [2022-07-21 15:46:23,502 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1188095,1188108] [2022-07-21 15:46:23,503 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1188248,1188261] [2022-07-21 15:46:23,503 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1188399,1188412] [2022-07-21 15:46:23,503 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1188549,1188562] [2022-07-21 15:46:23,504 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1188696,1188709] [2022-07-21 15:46:23,504 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1188847,1188860] [2022-07-21 15:46:23,504 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1188998,1189011] [2022-07-21 15:46:23,505 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1189146,1189159] [2022-07-21 15:46:23,505 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1189312,1189325] [2022-07-21 15:46:23,505 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1189481,1189494] [2022-07-21 15:46:23,506 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1189648,1189661] [2022-07-21 15:46:23,506 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1189816,1189829] [2022-07-21 15:46:23,506 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1189966,1189979] [2022-07-21 15:46:23,507 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1190113,1190126] [2022-07-21 15:46:23,507 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1190274,1190287] [2022-07-21 15:46:23,507 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1190444,1190457] [2022-07-21 15:46:23,508 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1190606,1190619] [2022-07-21 15:46:23,520 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 15:46:23,550 INFO L203 MainTranslator]: Completed pre-run [2022-07-21 15:46:24,264 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1177218,1177231] [2022-07-21 15:46:24,268 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1177363,1177376] [2022-07-21 15:46:24,268 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1177509,1177522] [2022-07-21 15:46:24,268 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1177674,1177687] [2022-07-21 15:46:24,269 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1177832,1177845] [2022-07-21 15:46:24,269 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1177990,1178003] [2022-07-21 15:46:24,270 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1178148,1178161] [2022-07-21 15:46:24,270 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1178308,1178321] [2022-07-21 15:46:24,270 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1178467,1178480] [2022-07-21 15:46:24,271 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1178606,1178619] [2022-07-21 15:46:24,271 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1178748,1178761] [2022-07-21 15:46:24,271 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1178897,1178910] [2022-07-21 15:46:24,272 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1179036,1179049] [2022-07-21 15:46:24,275 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1179191,1179204] [2022-07-21 15:46:24,275 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1179351,1179364] [2022-07-21 15:46:24,275 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1179502,1179515] [2022-07-21 15:46:24,276 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1179653,1179666] [2022-07-21 15:46:24,276 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1179805,1179818] [2022-07-21 15:46:24,277 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1179954,1179967] [2022-07-21 15:46:24,277 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1180102,1180115] [2022-07-21 15:46:24,277 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1180259,1180272] [2022-07-21 15:46:24,278 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1180408,1180421] [2022-07-21 15:46:24,278 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1180564,1180577] [2022-07-21 15:46:24,279 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1180717,1180730] [2022-07-21 15:46:24,279 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1180863,1180876] [2022-07-21 15:46:24,279 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1181006,1181019] [2022-07-21 15:46:24,279 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1181158,1181171] [2022-07-21 15:46:24,280 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1181304,1181317] [2022-07-21 15:46:24,280 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1181449,1181462] [2022-07-21 15:46:24,280 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1181603,1181616] [2022-07-21 15:46:24,280 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1181754,1181767] [2022-07-21 15:46:24,281 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1181909,1181922] [2022-07-21 15:46:24,281 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1182061,1182074] [2022-07-21 15:46:24,281 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1182216,1182229] [2022-07-21 15:46:24,282 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1182380,1182393] [2022-07-21 15:46:24,282 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1182536,1182549] [2022-07-21 15:46:24,282 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1182700,1182713] [2022-07-21 15:46:24,282 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1182842,1182855] [2022-07-21 15:46:24,283 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1183000,1183013] [2022-07-21 15:46:24,283 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1183167,1183180] [2022-07-21 15:46:24,284 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1183326,1183339] [2022-07-21 15:46:24,284 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1183485,1183498] [2022-07-21 15:46:24,285 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1183634,1183647] [2022-07-21 15:46:24,285 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1183781,1183794] [2022-07-21 15:46:24,285 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1183920,1183933] [2022-07-21 15:46:24,285 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1184083,1184096] [2022-07-21 15:46:24,286 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1184249,1184262] [2022-07-21 15:46:24,286 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1184413,1184426] [2022-07-21 15:46:24,286 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1184578,1184591] [2022-07-21 15:46:24,298 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1184743,1184756] [2022-07-21 15:46:24,298 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1184909,1184922] [2022-07-21 15:46:24,298 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1185074,1185087] [2022-07-21 15:46:24,298 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1185241,1185254] [2022-07-21 15:46:24,299 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1185401,1185414] [2022-07-21 15:46:24,299 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1185563,1185576] [2022-07-21 15:46:24,299 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1185722,1185735] [2022-07-21 15:46:24,299 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1185868,1185881] [2022-07-21 15:46:24,300 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1186011,1186024] [2022-07-21 15:46:24,300 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1186155,1186168] [2022-07-21 15:46:24,300 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1186298,1186311] [2022-07-21 15:46:24,300 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1186442,1186455] [2022-07-21 15:46:24,301 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1186583,1186596] [2022-07-21 15:46:24,301 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1186721,1186734] [2022-07-21 15:46:24,301 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1186879,1186892] [2022-07-21 15:46:24,302 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1187038,1187051] [2022-07-21 15:46:24,302 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1187194,1187207] [2022-07-21 15:46:24,302 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1187343,1187356] [2022-07-21 15:46:24,303 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1187495,1187508] [2022-07-21 15:46:24,303 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1187646,1187659] [2022-07-21 15:46:24,303 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1187795,1187808] [2022-07-21 15:46:24,304 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1187947,1187960] [2022-07-21 15:46:24,304 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1188095,1188108] [2022-07-21 15:46:24,304 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1188248,1188261] [2022-07-21 15:46:24,305 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1188399,1188412] [2022-07-21 15:46:24,305 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1188549,1188562] [2022-07-21 15:46:24,305 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1188696,1188709] [2022-07-21 15:46:24,305 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1188847,1188860] [2022-07-21 15:46:24,305 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1188998,1189011] [2022-07-21 15:46:24,306 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1189146,1189159] [2022-07-21 15:46:24,306 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1189312,1189325] [2022-07-21 15:46:24,306 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1189481,1189494] [2022-07-21 15:46:24,307 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1189648,1189661] [2022-07-21 15:46:24,307 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1189816,1189829] [2022-07-21 15:46:24,307 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1189966,1189979] [2022-07-21 15:46:24,335 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1190113,1190126] [2022-07-21 15:46:24,336 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1190274,1190287] [2022-07-21 15:46:24,336 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1190444,1190457] [2022-07-21 15:46:24,336 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1190606,1190619] [2022-07-21 15:46:24,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-21 15:46:25,197 INFO L208 MainTranslator]: Completed translation [2022-07-21 15:46:25,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:46:25 WrapperNode [2022-07-21 15:46:25,198 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-21 15:46:25,199 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-21 15:46:25,207 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-21 15:46:25,207 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-21 15:46:25,221 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:46:25" (1/1) ... [2022-07-21 15:46:25,409 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:46:25" (1/1) ... [2022-07-21 15:46:25,761 INFO L137 Inliner]: procedures = 1178, calls = 4145, calls flagged for inlining = 795, calls inlined = 711, statements flattened = 14771 [2022-07-21 15:46:25,761 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-21 15:46:25,762 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-21 15:46:25,763 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-21 15:46:25,763 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-21 15:46:25,770 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:46:25" (1/1) ... [2022-07-21 15:46:25,770 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:46:25" (1/1) ... [2022-07-21 15:46:25,859 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:46:25" (1/1) ... [2022-07-21 15:46:25,860 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:46:25" (1/1) ... [2022-07-21 15:46:26,169 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:46:25" (1/1) ... [2022-07-21 15:46:26,207 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:46:25" (1/1) ... [2022-07-21 15:46:26,272 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:46:25" (1/1) ... [2022-07-21 15:46:26,411 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-21 15:46:26,412 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-21 15:46:26,412 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-21 15:46:26,412 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-21 15:46:26,412 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:46:25" (1/1) ... [2022-07-21 15:46:26,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-21 15:46:26,462 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-21 15:46:26,505 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-21 15:46:26,635 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-21 15:46:26,681 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-21 15:46:26,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-07-21 15:46:26,682 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_create [2022-07-21 15:46:26,682 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_create [2022-07-21 15:46:26,682 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-21 15:46:26,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-07-21 15:46:26,682 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_write_setup [2022-07-21 15:46:26,682 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_write_setup [2022-07-21 15:46:26,683 INFO L130 BoogieDeclarations]: Found specification of procedure xdr_write_pages [2022-07-21 15:46:26,683 INFO L138 BoogieDeclarations]: Found implementation of procedure xdr_write_pages [2022-07-21 15:46:26,683 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_alloc_createdata [2022-07-21 15:46:26,683 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_alloc_createdata [2022-07-21 15:46:26,684 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_lock_check_bounds [2022-07-21 15:46:26,684 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_lock_check_bounds [2022-07-21 15:46:26,684 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_mkdir [2022-07-21 15:46:26,684 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_mkdir [2022-07-21 15:46:26,684 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_rename_setup [2022-07-21 15:46:26,684 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_rename_setup [2022-07-21 15:46:26,684 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-07-21 15:46:26,684 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-07-21 15:46:26,685 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_lookup [2022-07-21 15:46:26,685 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_lookup [2022-07-21 15:46:26,685 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-07-21 15:46:26,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-07-21 15:46:26,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-21 15:46:26,685 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-21 15:46:26,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-07-21 15:46:26,686 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-07-21 15:46:26,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-07-21 15:46:26,686 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2022-07-21 15:46:26,686 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2022-07-21 15:46:26,686 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_unlink [2022-07-21 15:46:26,686 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_stat_to_errno [2022-07-21 15:46:26,686 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_stat_to_errno [2022-07-21 15:46:26,687 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-21 15:46:26,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-07-21 15:46:26,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-21 15:46:26,687 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_readdir [2022-07-21 15:46:26,687 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_readdir [2022-07-21 15:46:26,687 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-21 15:46:26,687 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-07-21 15:46:26,688 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-07-21 15:46:26,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-07-21 15:46:26,688 INFO L130 BoogieDeclarations]: Found specification of procedure encode_sattr [2022-07-21 15:46:26,688 INFO L138 BoogieDeclarations]: Found implementation of procedure encode_sattr [2022-07-21 15:46:26,689 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_rename_rpc_prepare [2022-07-21 15:46:26,689 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_rename_rpc_prepare [2022-07-21 15:46:26,689 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_unlink_rpc_prepare [2022-07-21 15:46:26,689 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_unlink_rpc_prepare [2022-07-21 15:46:26,689 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_rmdir [2022-07-21 15:46:26,689 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_rmdir [2022-07-21 15:46:26,689 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_free_client [2022-07-21 15:46:26,690 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_free_client [2022-07-21 15:46:26,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-21 15:46:26,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-21 15:46:26,690 INFO L130 BoogieDeclarations]: Found specification of procedure __kuid_val [2022-07-21 15:46:26,690 INFO L138 BoogieDeclarations]: Found implementation of procedure __kuid_val [2022-07-21 15:46:26,690 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-07-21 15:46:26,690 INFO L130 BoogieDeclarations]: Found specification of procedure xdr_encode_current_server_time [2022-07-21 15:46:26,691 INFO L138 BoogieDeclarations]: Found implementation of procedure xdr_encode_current_server_time [2022-07-21 15:46:26,691 INFO L130 BoogieDeclarations]: Found specification of procedure __be32_to_cpup [2022-07-21 15:46:26,691 INFO L138 BoogieDeclarations]: Found implementation of procedure __be32_to_cpup [2022-07-21 15:46:26,691 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_commit_rpc_prepare [2022-07-21 15:46:26,691 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_commit_rpc_prepare [2022-07-21 15:46:26,691 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_readlink [2022-07-21 15:46:26,691 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_readlink [2022-07-21 15:46:26,691 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_invalidate_atime [2022-07-21 15:46:26,692 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_invalidate_atime [2022-07-21 15:46:26,692 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_clone_server [2022-07-21 15:46:26,692 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_clone_server [2022-07-21 15:46:26,692 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-07-21 15:46:26,692 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-07-21 15:46:26,692 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_pgio_rpc_prepare [2022-07-21 15:46:26,696 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_pgio_rpc_prepare [2022-07-21 15:46:26,696 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_permission [2022-07-21 15:46:26,697 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_permission [2022-07-21 15:46:26,697 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-07-21 15:46:26,697 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-07-21 15:46:26,697 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-07-21 15:46:26,697 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-21 15:46:26,698 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-07-21 15:46:26,698 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-07-21 15:46:26,701 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_symlink [2022-07-21 15:46:26,702 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_symlink [2022-07-21 15:46:26,702 INFO L130 BoogieDeclarations]: Found specification of procedure xdr_encode_time [2022-07-21 15:46:26,702 INFO L138 BoogieDeclarations]: Found implementation of procedure xdr_encode_time [2022-07-21 15:46:26,702 INFO L130 BoogieDeclarations]: Found specification of procedure NFS_I [2022-07-21 15:46:26,703 INFO L138 BoogieDeclarations]: Found implementation of procedure NFS_I [2022-07-21 15:46:26,703 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_rename_done [2022-07-21 15:46:26,703 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_rename_done [2022-07-21 15:46:26,703 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-21 15:46:26,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-07-21 15:46:26,703 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-07-21 15:46:26,703 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-07-21 15:46:26,703 INFO L130 BoogieDeclarations]: Found specification of procedure xdr_decode_time [2022-07-21 15:46:26,704 INFO L138 BoogieDeclarations]: Found implementation of procedure xdr_decode_time [2022-07-21 15:46:26,704 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_getattr [2022-07-21 15:46:26,704 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_getattr [2022-07-21 15:46:26,704 INFO L130 BoogieDeclarations]: Found specification of procedure decode_attrstat [2022-07-21 15:46:26,704 INFO L138 BoogieDeclarations]: Found implementation of procedure decode_attrstat [2022-07-21 15:46:26,704 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-21 15:46:26,704 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-07-21 15:46:26,704 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-07-21 15:46:26,705 INFO L130 BoogieDeclarations]: Found specification of procedure __kgid_val [2022-07-21 15:46:26,705 INFO L138 BoogieDeclarations]: Found implementation of procedure __kgid_val [2022-07-21 15:46:26,705 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_alloc_client [2022-07-21 15:46:26,705 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_alloc_client [2022-07-21 15:46:26,705 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_lock [2022-07-21 15:46:26,705 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_lock [2022-07-21 15:46:26,705 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_statfs [2022-07-21 15:46:26,705 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_statfs [2022-07-21 15:46:26,706 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_remove [2022-07-21 15:46:26,706 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_remove [2022-07-21 15:46:26,706 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_read_done [2022-07-21 15:46:26,706 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_read_done [2022-07-21 15:46:26,706 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_reply_buffer [2022-07-21 15:46:26,706 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_reply_buffer [2022-07-21 15:46:26,706 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_read_setup [2022-07-21 15:46:26,706 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_read_setup [2022-07-21 15:46:26,707 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-07-21 15:46:26,707 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-07-21 15:46:26,707 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_return_delegation [2022-07-21 15:46:26,707 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_return_delegation [2022-07-21 15:46:26,708 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-07-21 15:46:26,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-07-21 15:46:26,708 INFO L130 BoogieDeclarations]: Found specification of procedure encode_fhandle [2022-07-21 15:46:26,708 INFO L138 BoogieDeclarations]: Found implementation of procedure encode_fhandle [2022-07-21 15:46:26,708 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-07-21 15:46:26,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-07-21 15:46:26,708 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-07-21 15:46:26,708 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-07-21 15:46:26,708 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_instantiate [2022-07-21 15:46:26,709 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_instantiate [2022-07-21 15:46:26,709 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_commit_setup [2022-07-21 15:46:26,709 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_commit_setup [2022-07-21 15:46:26,709 INFO L130 BoogieDeclarations]: Found specification of procedure NFS_SERVER [2022-07-21 15:46:26,709 INFO L138 BoogieDeclarations]: Found implementation of procedure NFS_SERVER [2022-07-21 15:46:26,709 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-07-21 15:46:26,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-07-21 15:46:26,709 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-07-21 15:46:26,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-07-21 15:46:26,710 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-07-21 15:46:26,710 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-07-21 15:46:26,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-07-21 15:46:26,710 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_link [2022-07-21 15:46:26,710 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_link [2022-07-21 15:46:26,710 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-07-21 15:46:26,710 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_pathconf [2022-07-21 15:46:26,711 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_pathconf [2022-07-21 15:46:26,711 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_rename [2022-07-21 15:46:26,711 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_rename [2022-07-21 15:46:26,711 INFO L130 BoogieDeclarations]: Found specification of procedure NFS_FH [2022-07-21 15:46:26,711 INFO L138 BoogieDeclarations]: Found implementation of procedure NFS_FH [2022-07-21 15:46:26,711 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-07-21 15:46:26,711 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-07-21 15:46:26,711 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-07-21 15:46:26,712 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2022-07-21 15:46:26,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2022-07-21 15:46:26,712 INFO L130 BoogieDeclarations]: Found specification of procedure decode_stat [2022-07-21 15:46:26,712 INFO L138 BoogieDeclarations]: Found implementation of procedure decode_stat [2022-07-21 15:46:26,712 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-07-21 15:46:26,712 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-07-21 15:46:26,712 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-07-21 15:46:26,712 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-07-21 15:46:26,713 INFO L130 BoogieDeclarations]: Found specification of procedure nfs2_xdr_enc_writeargs [2022-07-21 15:46:26,713 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs2_xdr_enc_writeargs [2022-07-21 15:46:26,713 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-07-21 15:46:26,713 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-07-21 15:46:26,713 INFO L130 BoogieDeclarations]: Found specification of procedure xdr_read_pages [2022-07-21 15:46:26,713 INFO L138 BoogieDeclarations]: Found implementation of procedure xdr_read_pages [2022-07-21 15:46:26,713 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_rmdir [2022-07-21 15:46:26,713 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_rmdir [2022-07-21 15:46:26,714 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-07-21 15:46:26,714 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-07-21 15:46:26,714 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_fattr_init [2022-07-21 15:46:26,714 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_fattr_init [2022-07-21 15:46:26,714 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_setattr [2022-07-21 15:46:26,714 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_setattr [2022-07-21 15:46:26,714 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_fsinfo [2022-07-21 15:46:26,714 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_fsinfo [2022-07-21 15:46:26,715 INFO L130 BoogieDeclarations]: Found specification of procedure print_overflow_msg [2022-07-21 15:46:26,715 INFO L138 BoogieDeclarations]: Found implementation of procedure print_overflow_msg [2022-07-21 15:46:26,715 INFO L130 BoogieDeclarations]: Found specification of procedure xdr_inline_decode [2022-07-21 15:46:26,715 INFO L138 BoogieDeclarations]: Found implementation of procedure xdr_inline_decode [2022-07-21 15:46:26,715 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_free_createdata [2022-07-21 15:46:26,715 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_free_createdata [2022-07-21 15:46:26,715 INFO L130 BoogieDeclarations]: Found specification of procedure decode_fattr [2022-07-21 15:46:26,715 INFO L138 BoogieDeclarations]: Found implementation of procedure decode_fattr [2022-07-21 15:46:26,715 INFO L130 BoogieDeclarations]: Found specification of procedure NFS_CLIENT [2022-07-21 15:46:26,716 INFO L138 BoogieDeclarations]: Found implementation of procedure NFS_CLIENT [2022-07-21 15:46:26,716 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-07-21 15:46:26,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-07-21 15:46:26,716 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_write_done [2022-07-21 15:46:26,716 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_write_done [2022-07-21 15:46:26,716 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2022-07-21 15:46:26,716 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2022-07-21 15:46:26,716 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-07-21 15:46:26,717 INFO L130 BoogieDeclarations]: Found specification of procedure rpc_call_start [2022-07-21 15:46:26,717 INFO L138 BoogieDeclarations]: Found implementation of procedure rpc_call_start [2022-07-21 15:46:26,717 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-07-21 15:46:26,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-07-21 15:46:26,719 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-21 15:46:26,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-07-21 15:46:26,720 INFO L130 BoogieDeclarations]: Found specification of procedure nfs2_xdr_dec_attrstat [2022-07-21 15:46:26,720 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs2_xdr_dec_attrstat [2022-07-21 15:46:26,720 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_get_root [2022-07-21 15:46:26,720 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_get_root [2022-07-21 15:46:26,720 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_try_mount [2022-07-21 15:46:26,720 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_try_mount [2022-07-21 15:46:26,721 INFO L130 BoogieDeclarations]: Found specification of procedure nfs2_decode_dirent [2022-07-21 15:46:26,721 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs2_decode_dirent [2022-07-21 15:46:26,721 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_create_server [2022-07-21 15:46:26,721 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_create_server [2022-07-21 15:46:26,721 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_mknod [2022-07-21 15:46:26,721 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_mknod [2022-07-21 15:46:26,722 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~TO~int [2022-07-21 15:46:26,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~TO~int [2022-07-21 15:46:26,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-07-21 15:46:26,722 INFO L130 BoogieDeclarations]: Found specification of procedure xdr_reserve_space [2022-07-21 15:46:26,722 INFO L138 BoogieDeclarations]: Found implementation of procedure xdr_reserve_space [2022-07-21 15:46:26,722 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-21 15:46:26,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-07-21 15:46:26,722 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_close_context [2022-07-21 15:46:26,723 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_close_context [2022-07-21 15:46:26,723 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-07-21 15:46:26,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-07-21 15:46:26,723 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_init_client [2022-07-21 15:46:26,723 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_init_client [2022-07-21 15:46:26,723 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-21 15:46:26,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-07-21 15:46:26,723 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-07-21 15:46:26,723 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-07-21 15:46:26,724 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_unlink_done [2022-07-21 15:46:26,724 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_unlink_done [2022-07-21 15:46:26,724 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-21 15:46:26,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-07-21 15:46:26,724 INFO L130 BoogieDeclarations]: Found specification of procedure rpc_call_sync [2022-07-21 15:46:26,724 INFO L138 BoogieDeclarations]: Found implementation of procedure rpc_call_sync [2022-07-21 15:46:26,724 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-21 15:46:26,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-07-21 15:46:26,725 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_submount [2022-07-21 15:46:26,725 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_submount [2022-07-21 15:46:26,725 INFO L130 BoogieDeclarations]: Found specification of procedure encode_diropargs [2022-07-21 15:46:26,725 INFO L138 BoogieDeclarations]: Found implementation of procedure encode_diropargs [2022-07-21 15:46:26,725 INFO L130 BoogieDeclarations]: Found specification of procedure xdr_time_not_set [2022-07-21 15:46:26,725 INFO L138 BoogieDeclarations]: Found implementation of procedure xdr_time_not_set [2022-07-21 15:46:26,725 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-07-21 15:46:26,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-07-21 15:46:26,726 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-21 15:46:26,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-07-21 15:46:26,726 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_unlink_setup [2022-07-21 15:46:26,726 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_unlink_setup [2022-07-21 15:46:26,726 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-21 15:46:26,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-07-21 15:46:26,726 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_setattr [2022-07-21 15:46:26,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-21 15:46:26,726 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_mark_for_revalidate [2022-07-21 15:46:26,727 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_mark_for_revalidate [2022-07-21 15:46:26,727 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_have_delegation [2022-07-21 15:46:26,727 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_have_delegation [2022-07-21 15:46:28,857 INFO L234 CfgBuilder]: Building ICFG [2022-07-21 15:46:28,861 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-21 15:46:29,299 INFO L764 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-07-21 15:46:36,844 INFO L275 CfgBuilder]: Performing block encoding [2022-07-21 15:46:36,883 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-21 15:46:36,884 INFO L299 CfgBuilder]: Removed 0 assume(true) statements. [2022-07-21 15:46:36,889 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:46:36 BoogieIcfgContainer [2022-07-21 15:46:36,890 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-21 15:46:36,892 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-21 15:46:36,892 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-21 15:46:36,894 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-21 15:46:36,894 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.07 03:46:12" (1/3) ... [2022-07-21 15:46:36,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31daabb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 03:46:36, skipping insertion in model container [2022-07-21 15:46:36,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.07 03:46:25" (2/3) ... [2022-07-21 15:46:36,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31daabb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.07 03:46:36, skipping insertion in model container [2022-07-21 15:46:36,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.07 03:46:36" (3/3) ... [2022-07-21 15:46:36,899 INFO L111 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i [2022-07-21 15:46:36,911 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-21 15:46:36,912 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2022-07-21 15:46:37,062 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-21 15:46:37,075 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@5622dc7d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@3e035c9f [2022-07-21 15:46:37,075 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2022-07-21 15:46:37,093 INFO L276 IsEmpty]: Start isEmpty. Operand has 5395 states, 3399 states have (on average 1.2509561635775228) internal successors, (4252), 3752 states have internal predecessors, (4252), 1850 states have call successors, (1850), 121 states have call predecessors, (1850), 120 states have return successors, (1824), 1548 states have call predecessors, (1824), 1824 states have call successors, (1824) [2022-07-21 15:46:37,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-07-21 15:46:37,102 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:46:37,103 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-21 15:46:37,103 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-07-21 15:46:37,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:46:37,109 INFO L85 PathProgramCache]: Analyzing trace with hash -944763359, now seen corresponding path program 1 times [2022-07-21 15:46:37,116 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:46:37,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854301038] [2022-07-21 15:46:37,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:46:37,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:46:37,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:37,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:46:37,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:37,756 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 15:46:37,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:37,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:46:37,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:37,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 15:46:37,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:37,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:37,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:37,858 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 15:46:37,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:37,879 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 15:46:37,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:37,899 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-21 15:46:37,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:46:37,900 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854301038] [2022-07-21 15:46:37,901 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [854301038] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:46:37,901 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:46:37,901 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:46:37,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265749828] [2022-07-21 15:46:37,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:46:37,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:46:37,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:46:37,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:46:37,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:46:37,947 INFO L87 Difference]: Start difference. First operand has 5395 states, 3399 states have (on average 1.2509561635775228) internal successors, (4252), 3752 states have internal predecessors, (4252), 1850 states have call successors, (1850), 121 states have call predecessors, (1850), 120 states have return successors, (1824), 1548 states have call predecessors, (1824), 1824 states have call successors, (1824) Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 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-21 15:46:49,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:46:49,230 INFO L93 Difference]: Finished difference Result 10695 states and 15913 transitions. [2022-07-21 15:46:49,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:46:49,237 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 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 50 [2022-07-21 15:46:49,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:46:49,289 INFO L225 Difference]: With dead ends: 10695 [2022-07-21 15:46:49,290 INFO L226 Difference]: Without dead ends: 5254 [2022-07-21 15:46:49,325 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:46:49,330 INFO L413 NwaCegarLoop]: 7579 mSDtfsCounter, 7565 mSDsluCounter, 11493 mSDsCounter, 0 mSdLazyCounter, 6262 mSolverCounterSat, 4622 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9110 SdHoareTripleChecker+Valid, 19072 SdHoareTripleChecker+Invalid, 10884 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4622 IncrementalHoareTripleChecker+Valid, 6262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.6s IncrementalHoareTripleChecker+Time [2022-07-21 15:46:49,330 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9110 Valid, 19072 Invalid, 10884 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4622 Valid, 6262 Invalid, 0 Unknown, 0 Unchecked, 10.6s Time] [2022-07-21 15:46:49,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5254 states. [2022-07-21 15:46:49,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5254 to 5254. [2022-07-21 15:46:49,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5254 states, 3337 states have (on average 1.2322445310158825) internal successors, (4112), 3652 states have internal predecessors, (4112), 1776 states have call successors, (1776), 118 states have call predecessors, (1776), 117 states have return successors, (1774), 1510 states have call predecessors, (1774), 1774 states have call successors, (1774) [2022-07-21 15:46:49,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5254 states to 5254 states and 7662 transitions. [2022-07-21 15:46:49,811 INFO L78 Accepts]: Start accepts. Automaton has 5254 states and 7662 transitions. Word has length 50 [2022-07-21 15:46:49,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:46:49,812 INFO L495 AbstractCegarLoop]: Abstraction has 5254 states and 7662 transitions. [2022-07-21 15:46:49,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 4 states have internal predecessors, (29), 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-21 15:46:49,813 INFO L276 IsEmpty]: Start isEmpty. Operand 5254 states and 7662 transitions. [2022-07-21 15:46:49,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-07-21 15:46:49,815 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:46:49,815 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] [2022-07-21 15:46:49,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-21 15:46:49,815 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-07-21 15:46:49,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:46:49,816 INFO L85 PathProgramCache]: Analyzing trace with hash -116995083, now seen corresponding path program 1 times [2022-07-21 15:46:49,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:46:49,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909647743] [2022-07-21 15:46:49,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:46:49,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:46:49,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:50,110 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:46:50,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:50,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 15:46:50,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:50,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:46:50,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:50,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 15:46:50,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:50,184 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:46:50,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:50,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 15:46:50,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:50,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 15:46:50,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:50,237 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 15:46:50,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:46:50,256 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-21 15:46:50,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:46:50,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909647743] [2022-07-21 15:46:50,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909647743] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:46:50,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:46:50,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:46:50,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697358358] [2022-07-21 15:46:50,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:46:50,259 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:46:50,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:46:50,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:46:50,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:46:50,260 INFO L87 Difference]: Start difference. First operand 5254 states and 7662 transitions. Second operand has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 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-21 15:47:00,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:47:00,851 INFO L93 Difference]: Finished difference Result 5254 states and 7662 transitions. [2022-07-21 15:47:00,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:47:00,851 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 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 56 [2022-07-21 15:47:00,851 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:47:00,879 INFO L225 Difference]: With dead ends: 5254 [2022-07-21 15:47:00,880 INFO L226 Difference]: Without dead ends: 5252 [2022-07-21 15:47:00,883 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-21 15:47:00,884 INFO L413 NwaCegarLoop]: 7421 mSDtfsCounter, 7405 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6212 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8935 SdHoareTripleChecker+Valid, 18630 SdHoareTripleChecker+Invalid, 10710 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 6212 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2022-07-21 15:47:00,884 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8935 Valid, 18630 Invalid, 10710 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4498 Valid, 6212 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time] [2022-07-21 15:47:00,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5252 states. [2022-07-21 15:47:01,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5252 to 5252. [2022-07-21 15:47:01,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5252 states, 3336 states have (on average 1.2320143884892085) internal successors, (4110), 3650 states have internal predecessors, (4110), 1776 states have call successors, (1776), 118 states have call predecessors, (1776), 117 states have return successors, (1774), 1510 states have call predecessors, (1774), 1774 states have call successors, (1774) [2022-07-21 15:47:01,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5252 states to 5252 states and 7660 transitions. [2022-07-21 15:47:01,199 INFO L78 Accepts]: Start accepts. Automaton has 5252 states and 7660 transitions. Word has length 56 [2022-07-21 15:47:01,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:47:01,200 INFO L495 AbstractCegarLoop]: Abstraction has 5252 states and 7660 transitions. [2022-07-21 15:47:01,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.5) internal successors, (33), 4 states have internal predecessors, (33), 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-21 15:47:01,201 INFO L276 IsEmpty]: Start isEmpty. Operand 5252 states and 7660 transitions. [2022-07-21 15:47:01,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-07-21 15:47:01,204 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:47:01,205 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] [2022-07-21 15:47:01,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-21 15:47:01,205 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-07-21 15:47:01,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:47:01,205 INFO L85 PathProgramCache]: Analyzing trace with hash -1415149588, now seen corresponding path program 1 times [2022-07-21 15:47:01,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:47:01,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910950084] [2022-07-21 15:47:01,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:47:01,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:47:01,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:47:01,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 15:47:01,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:47:01,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 15:47:01,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:01,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 15:47:01,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,480 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 15:47:01,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 15:47:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 15:47:01,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:01,518 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-21 15:47:01,519 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:47:01,519 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910950084] [2022-07-21 15:47:01,519 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910950084] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:47:01,519 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:47:01,519 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:47:01,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1470591484] [2022-07-21 15:47:01,520 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:47:01,520 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:47:01,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:47:01,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:47:01,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:47:01,522 INFO L87 Difference]: Start difference. First operand 5252 states and 7660 transitions. Second operand has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (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-21 15:47:11,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:47:11,087 INFO L93 Difference]: Finished difference Result 5252 states and 7660 transitions. [2022-07-21 15:47:11,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:47:11,088 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (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 62 [2022-07-21 15:47:11,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:47:11,118 INFO L225 Difference]: With dead ends: 5252 [2022-07-21 15:47:11,119 INFO L226 Difference]: Without dead ends: 5250 [2022-07-21 15:47:11,122 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-21 15:47:11,123 INFO L413 NwaCegarLoop]: 7419 mSDtfsCounter, 7399 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6210 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8928 SdHoareTripleChecker+Valid, 18628 SdHoareTripleChecker+Invalid, 10708 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 6210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.2s IncrementalHoareTripleChecker+Time [2022-07-21 15:47:11,124 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8928 Valid, 18628 Invalid, 10708 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4498 Valid, 6210 Invalid, 0 Unknown, 0 Unchecked, 9.2s Time] [2022-07-21 15:47:11,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5250 states. [2022-07-21 15:47:11,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5250 to 5250. [2022-07-21 15:47:11,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5250 states, 3335 states have (on average 1.231784107946027) internal successors, (4108), 3648 states have internal predecessors, (4108), 1776 states have call successors, (1776), 118 states have call predecessors, (1776), 117 states have return successors, (1774), 1510 states have call predecessors, (1774), 1774 states have call successors, (1774) [2022-07-21 15:47:11,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5250 states to 5250 states and 7658 transitions. [2022-07-21 15:47:11,438 INFO L78 Accepts]: Start accepts. Automaton has 5250 states and 7658 transitions. Word has length 62 [2022-07-21 15:47:11,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:47:11,439 INFO L495 AbstractCegarLoop]: Abstraction has 5250 states and 7658 transitions. [2022-07-21 15:47:11,439 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.166666666666667) internal successors, (37), 4 states have internal predecessors, (37), 2 states have call successors, (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-21 15:47:11,439 INFO L276 IsEmpty]: Start isEmpty. Operand 5250 states and 7658 transitions. [2022-07-21 15:47:11,440 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-07-21 15:47:11,440 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:47:11,441 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] [2022-07-21 15:47:11,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-07-21 15:47:11,441 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-07-21 15:47:11,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:47:11,442 INFO L85 PathProgramCache]: Analyzing trace with hash -670828120, now seen corresponding path program 1 times [2022-07-21 15:47:11,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:47:11,442 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033387475] [2022-07-21 15:47:11,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:47:11,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:47:11,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:11,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:47:11,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:11,659 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 15:47:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:11,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:47:11,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:11,686 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 15:47:11,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:11,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:11,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:11,711 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 15:47:11,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:11,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 15:47:11,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:11,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 15:47:11,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:11,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 15:47:11,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:11,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-21 15:47:11,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:11,782 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-21 15:47:11,782 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:47:11,783 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033387475] [2022-07-21 15:47:11,783 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033387475] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:47:11,783 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:47:11,783 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:47:11,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721081623] [2022-07-21 15:47:11,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:47:11,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:47:11,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:47:11,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:47:11,784 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:47:11,785 INFO L87 Difference]: Start difference. First operand 5250 states and 7658 transitions. Second operand has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-21 15:47:20,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:47:20,946 INFO L93 Difference]: Finished difference Result 5250 states and 7658 transitions. [2022-07-21 15:47:20,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:47:20,947 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (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 68 [2022-07-21 15:47:20,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:47:20,978 INFO L225 Difference]: With dead ends: 5250 [2022-07-21 15:47:20,978 INFO L226 Difference]: Without dead ends: 5248 [2022-07-21 15:47:20,984 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:47:20,984 INFO L413 NwaCegarLoop]: 7417 mSDtfsCounter, 7393 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6208 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8921 SdHoareTripleChecker+Valid, 18626 SdHoareTripleChecker+Invalid, 10706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 6208 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.9s IncrementalHoareTripleChecker+Time [2022-07-21 15:47:20,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8921 Valid, 18626 Invalid, 10706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4498 Valid, 6208 Invalid, 0 Unknown, 0 Unchecked, 8.9s Time] [2022-07-21 15:47:20,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5248 states. [2022-07-21 15:47:21,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5248 to 5248. [2022-07-21 15:47:21,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5248 states, 3334 states have (on average 1.2315536892621475) internal successors, (4106), 3646 states have internal predecessors, (4106), 1776 states have call successors, (1776), 118 states have call predecessors, (1776), 117 states have return successors, (1774), 1510 states have call predecessors, (1774), 1774 states have call successors, (1774) [2022-07-21 15:47:21,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5248 states to 5248 states and 7656 transitions. [2022-07-21 15:47:21,284 INFO L78 Accepts]: Start accepts. Automaton has 5248 states and 7656 transitions. Word has length 68 [2022-07-21 15:47:21,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:47:21,284 INFO L495 AbstractCegarLoop]: Abstraction has 5248 states and 7656 transitions. [2022-07-21 15:47:21,284 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.833333333333333) internal successors, (41), 4 states have internal predecessors, (41), 2 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (10), 2 states have call predecessors, (10), 2 states have call successors, (10) [2022-07-21 15:47:21,285 INFO L276 IsEmpty]: Start isEmpty. Operand 5248 states and 7656 transitions. [2022-07-21 15:47:21,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-07-21 15:47:21,286 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:47:21,286 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] [2022-07-21 15:47:21,286 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-07-21 15:47:21,286 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-07-21 15:47:21,287 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:47:21,287 INFO L85 PathProgramCache]: Analyzing trace with hash -135949064, now seen corresponding path program 1 times [2022-07-21 15:47:21,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:47:21,287 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450438828] [2022-07-21 15:47:21,287 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:47:21,288 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:47:21,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:47:21,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,467 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 15:47:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:47:21,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,495 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 15:47:21,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:21,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 15:47:21,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 15:47:21,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 15:47:21,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,557 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 15:47:21,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,570 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-21 15:47:21,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 15:47:21,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:21,596 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-21 15:47:21,597 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:47:21,597 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450438828] [2022-07-21 15:47:21,597 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450438828] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:47:21,597 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:47:21,597 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:47:21,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25285696] [2022-07-21 15:47:21,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:47:21,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:47:21,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:47:21,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:47:21,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:47:21,600 INFO L87 Difference]: Start difference. First operand 5248 states and 7656 transitions. Second operand has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-21 15:47:32,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:47:32,046 INFO L93 Difference]: Finished difference Result 5248 states and 7656 transitions. [2022-07-21 15:47:32,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:47:32,046 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (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 74 [2022-07-21 15:47:32,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:47:32,073 INFO L225 Difference]: With dead ends: 5248 [2022-07-21 15:47:32,073 INFO L226 Difference]: Without dead ends: 5246 [2022-07-21 15:47:32,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:47:32,077 INFO L413 NwaCegarLoop]: 7415 mSDtfsCounter, 7387 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6206 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8914 SdHoareTripleChecker+Valid, 18624 SdHoareTripleChecker+Invalid, 10704 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 6206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2022-07-21 15:47:32,078 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8914 Valid, 18624 Invalid, 10704 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4498 Valid, 6206 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time] [2022-07-21 15:47:32,084 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5246 states. [2022-07-21 15:47:32,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5246 to 5246. [2022-07-21 15:47:32,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5246 states, 3333 states have (on average 1.2313231323132314) internal successors, (4104), 3644 states have internal predecessors, (4104), 1776 states have call successors, (1776), 118 states have call predecessors, (1776), 117 states have return successors, (1774), 1510 states have call predecessors, (1774), 1774 states have call successors, (1774) [2022-07-21 15:47:32,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5246 states to 5246 states and 7654 transitions. [2022-07-21 15:47:32,395 INFO L78 Accepts]: Start accepts. Automaton has 5246 states and 7654 transitions. Word has length 74 [2022-07-21 15:47:32,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:47:32,395 INFO L495 AbstractCegarLoop]: Abstraction has 5246 states and 7654 transitions. [2022-07-21 15:47:32,395 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.5) internal successors, (45), 4 states have internal predecessors, (45), 2 states have call successors, (12), 4 states have call predecessors, (12), 1 states have return successors, (11), 2 states have call predecessors, (11), 2 states have call successors, (11) [2022-07-21 15:47:32,396 INFO L276 IsEmpty]: Start isEmpty. Operand 5246 states and 7654 transitions. [2022-07-21 15:47:32,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-07-21 15:47:32,401 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:47:32,401 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] [2022-07-21 15:47:32,401 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-07-21 15:47:32,403 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-07-21 15:47:32,404 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:47:32,404 INFO L85 PathProgramCache]: Analyzing trace with hash -107039956, now seen corresponding path program 1 times [2022-07-21 15:47:32,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:47:32,404 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452944409] [2022-07-21 15:47:32,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:47:32,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:47:32,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:32,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:47:32,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:32,581 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 15:47:32,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:32,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:47:32,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:32,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 15:47:32,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:32,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:32,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:32,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 15:47:32,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:32,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 15:47:32,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:32,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 15:47:32,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:32,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 15:47:32,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:32,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-21 15:47:32,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:32,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 15:47:32,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:32,700 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 15:47:32,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:32,712 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-21 15:47:32,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:47:32,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452944409] [2022-07-21 15:47:32,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [452944409] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:47:32,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:47:32,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:47:32,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1088135100] [2022-07-21 15:47:32,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:47:32,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:47:32,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:47:32,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:47:32,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:47:32,715 INFO L87 Difference]: Start difference. First operand 5246 states and 7654 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-21 15:47:43,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:47:43,228 INFO L93 Difference]: Finished difference Result 5246 states and 7654 transitions. [2022-07-21 15:47:43,228 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:47:43,228 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (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 80 [2022-07-21 15:47:43,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:47:43,249 INFO L225 Difference]: With dead ends: 5246 [2022-07-21 15:47:43,249 INFO L226 Difference]: Without dead ends: 5244 [2022-07-21 15:47:43,253 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:47:43,253 INFO L413 NwaCegarLoop]: 7413 mSDtfsCounter, 7381 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6204 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8907 SdHoareTripleChecker+Valid, 18622 SdHoareTripleChecker+Invalid, 10702 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 6204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2022-07-21 15:47:43,253 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8907 Valid, 18622 Invalid, 10702 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4498 Valid, 6204 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time] [2022-07-21 15:47:43,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5244 states. [2022-07-21 15:47:43,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5244 to 5244. [2022-07-21 15:47:43,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5244 states, 3332 states have (on average 1.23109243697479) internal successors, (4102), 3642 states have internal predecessors, (4102), 1776 states have call successors, (1776), 118 states have call predecessors, (1776), 117 states have return successors, (1774), 1510 states have call predecessors, (1774), 1774 states have call successors, (1774) [2022-07-21 15:47:43,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5244 states to 5244 states and 7652 transitions. [2022-07-21 15:47:43,581 INFO L78 Accepts]: Start accepts. Automaton has 5244 states and 7652 transitions. Word has length 80 [2022-07-21 15:47:43,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:47:43,582 INFO L495 AbstractCegarLoop]: Abstraction has 5244 states and 7652 transitions. [2022-07-21 15:47:43,582 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 4 states have internal predecessors, (49), 2 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-07-21 15:47:43,583 INFO L276 IsEmpty]: Start isEmpty. Operand 5244 states and 7652 transitions. [2022-07-21 15:47:43,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-07-21 15:47:43,584 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:47:43,584 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] [2022-07-21 15:47:43,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-07-21 15:47:43,584 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-07-21 15:47:43,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:47:43,585 INFO L85 PathProgramCache]: Analyzing trace with hash 1125642395, now seen corresponding path program 1 times [2022-07-21 15:47:43,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:47:43,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [300447222] [2022-07-21 15:47:43,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:47:43,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:47:43,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:43,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:47:43,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:43,752 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 15:47:43,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:43,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:47:43,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:43,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 15:47:43,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:43,788 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:43,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 15:47:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:43,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 15:47:43,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:43,825 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 15:47:43,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:43,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 15:47:43,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:43,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-21 15:47:43,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:43,859 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 15:47:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:43,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 15:47:43,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:43,882 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 15:47:43,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:43,892 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-21 15:47:43,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:47:43,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [300447222] [2022-07-21 15:47:43,893 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [300447222] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:47:43,893 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:47:43,893 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:47:43,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787571665] [2022-07-21 15:47:43,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:47:43,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:47:43,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:47:43,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:47:43,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:47:43,895 INFO L87 Difference]: Start difference. First operand 5244 states and 7652 transitions. Second operand has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-21 15:47:45,675 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:47:54,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:47:54,611 INFO L93 Difference]: Finished difference Result 5244 states and 7652 transitions. [2022-07-21 15:47:54,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:47:54,611 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (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 86 [2022-07-21 15:47:54,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:47:54,633 INFO L225 Difference]: With dead ends: 5244 [2022-07-21 15:47:54,634 INFO L226 Difference]: Without dead ends: 5242 [2022-07-21 15:47:54,638 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:47:54,639 INFO L413 NwaCegarLoop]: 7411 mSDtfsCounter, 7375 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6202 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8900 SdHoareTripleChecker+Valid, 18620 SdHoareTripleChecker+Invalid, 10700 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 6202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2022-07-21 15:47:54,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8900 Valid, 18620 Invalid, 10700 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4498 Valid, 6202 Invalid, 0 Unknown, 0 Unchecked, 10.4s Time] [2022-07-21 15:47:54,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5242 states. [2022-07-21 15:47:54,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5242 to 5242. [2022-07-21 15:47:54,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5242 states, 3331 states have (on average 1.2308616031221855) internal successors, (4100), 3640 states have internal predecessors, (4100), 1776 states have call successors, (1776), 118 states have call predecessors, (1776), 117 states have return successors, (1774), 1510 states have call predecessors, (1774), 1774 states have call successors, (1774) [2022-07-21 15:47:54,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5242 states to 5242 states and 7650 transitions. [2022-07-21 15:47:54,956 INFO L78 Accepts]: Start accepts. Automaton has 5242 states and 7650 transitions. Word has length 86 [2022-07-21 15:47:54,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:47:54,957 INFO L495 AbstractCegarLoop]: Abstraction has 5242 states and 7650 transitions. [2022-07-21 15:47:54,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.833333333333334) internal successors, (53), 4 states have internal predecessors, (53), 2 states have call successors, (14), 4 states have call predecessors, (14), 1 states have return successors, (13), 2 states have call predecessors, (13), 2 states have call successors, (13) [2022-07-21 15:47:54,957 INFO L276 IsEmpty]: Start isEmpty. Operand 5242 states and 7650 transitions. [2022-07-21 15:47:54,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-07-21 15:47:54,958 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:47:54,959 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] [2022-07-21 15:47:54,959 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-07-21 15:47:54,959 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-07-21 15:47:54,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:47:54,960 INFO L85 PathProgramCache]: Analyzing trace with hash -800428171, now seen corresponding path program 1 times [2022-07-21 15:47:54,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:47:54,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17109445] [2022-07-21 15:47:54,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:47:54,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:47:55,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:55,154 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:47:55,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:55,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 15:47:55,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:55,187 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:47:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:55,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 15:47:55,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:55,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:47:55,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:55,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 15:47:55,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:55,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 15:47:55,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:55,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 15:47:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:55,258 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 15:47:55,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:55,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-21 15:47:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:55,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 15:47:55,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:55,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 15:47:55,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:55,309 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 15:47:55,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:55,321 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 15:47:55,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:47:55,334 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-21 15:47:55,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:47:55,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17109445] [2022-07-21 15:47:55,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17109445] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:47:55,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:47:55,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:47:55,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474168272] [2022-07-21 15:47:55,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:47:55,336 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:47:55,336 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:47:55,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:47:55,336 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:47:55,337 INFO L87 Difference]: Start difference. First operand 5242 states and 7650 transitions. Second operand has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-21 15:48:05,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:48:05,303 INFO L93 Difference]: Finished difference Result 5242 states and 7650 transitions. [2022-07-21 15:48:05,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:48:05,303 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (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 92 [2022-07-21 15:48:05,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:48:05,324 INFO L225 Difference]: With dead ends: 5242 [2022-07-21 15:48:05,324 INFO L226 Difference]: Without dead ends: 5240 [2022-07-21 15:48:05,328 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:48:05,329 INFO L413 NwaCegarLoop]: 7409 mSDtfsCounter, 7373 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6196 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8897 SdHoareTripleChecker+Valid, 18618 SdHoareTripleChecker+Invalid, 10694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 6196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2022-07-21 15:48:05,329 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8897 Valid, 18618 Invalid, 10694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4498 Valid, 6196 Invalid, 0 Unknown, 0 Unchecked, 9.6s Time] [2022-07-21 15:48:05,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5240 states. [2022-07-21 15:48:05,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5240 to 5240. [2022-07-21 15:48:05,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5240 states, 3330 states have (on average 1.2306306306306307) internal successors, (4098), 3638 states have internal predecessors, (4098), 1776 states have call successors, (1776), 118 states have call predecessors, (1776), 117 states have return successors, (1774), 1510 states have call predecessors, (1774), 1774 states have call successors, (1774) [2022-07-21 15:48:05,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5240 states to 5240 states and 7648 transitions. [2022-07-21 15:48:05,668 INFO L78 Accepts]: Start accepts. Automaton has 5240 states and 7648 transitions. Word has length 92 [2022-07-21 15:48:05,669 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:48:05,669 INFO L495 AbstractCegarLoop]: Abstraction has 5240 states and 7648 transitions. [2022-07-21 15:48:05,669 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.5) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-21 15:48:05,669 INFO L276 IsEmpty]: Start isEmpty. Operand 5240 states and 7648 transitions. [2022-07-21 15:48:05,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-07-21 15:48:05,670 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:48:05,670 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] [2022-07-21 15:48:05,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-07-21 15:48:05,671 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-07-21 15:48:05,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:48:05,671 INFO L85 PathProgramCache]: Analyzing trace with hash -412192424, now seen corresponding path program 1 times [2022-07-21 15:48:05,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:48:05,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345304621] [2022-07-21 15:48:05,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:48:05,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:48:05,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:05,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:48:05,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:05,821 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 15:48:05,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:05,835 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:48:05,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:05,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 15:48:05,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:05,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:48:05,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:05,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 15:48:05,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:05,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 15:48:05,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:05,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 15:48:05,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:05,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 15:48:05,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:05,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-21 15:48:05,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:05,922 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 15:48:05,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:05,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 15:48:05,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:05,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 15:48:05,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:05,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 15:48:05,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:05,972 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-21 15:48:05,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:48:05,972 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345304621] [2022-07-21 15:48:05,973 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345304621] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:48:05,973 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:48:05,973 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:48:05,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157309726] [2022-07-21 15:48:05,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:48:05,974 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:48:05,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:48:05,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:48:05,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:48:05,975 INFO L87 Difference]: Start difference. First operand 5240 states and 7648 transitions. Second operand has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-21 15:48:16,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:48:16,100 INFO L93 Difference]: Finished difference Result 5240 states and 7648 transitions. [2022-07-21 15:48:16,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:48:16,100 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (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 94 [2022-07-21 15:48:16,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:48:16,121 INFO L225 Difference]: With dead ends: 5240 [2022-07-21 15:48:16,121 INFO L226 Difference]: Without dead ends: 5238 [2022-07-21 15:48:16,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:48:16,125 INFO L413 NwaCegarLoop]: 7407 mSDtfsCounter, 7361 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6198 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8885 SdHoareTripleChecker+Valid, 18616 SdHoareTripleChecker+Invalid, 10696 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 6198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.7s IncrementalHoareTripleChecker+Time [2022-07-21 15:48:16,126 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8885 Valid, 18616 Invalid, 10696 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4498 Valid, 6198 Invalid, 0 Unknown, 0 Unchecked, 9.7s Time] [2022-07-21 15:48:16,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5238 states. [2022-07-21 15:48:16,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5238 to 5238. [2022-07-21 15:48:16,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5238 states, 3329 states have (on average 1.2303995193751878) internal successors, (4096), 3636 states have internal predecessors, (4096), 1776 states have call successors, (1776), 118 states have call predecessors, (1776), 117 states have return successors, (1774), 1510 states have call predecessors, (1774), 1774 states have call successors, (1774) [2022-07-21 15:48:16,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5238 states to 5238 states and 7646 transitions. [2022-07-21 15:48:16,467 INFO L78 Accepts]: Start accepts. Automaton has 5238 states and 7646 transitions. Word has length 94 [2022-07-21 15:48:16,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:48:16,468 INFO L495 AbstractCegarLoop]: Abstraction has 5238 states and 7646 transitions. [2022-07-21 15:48:16,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.833333333333334) internal successors, (59), 4 states have internal predecessors, (59), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-07-21 15:48:16,468 INFO L276 IsEmpty]: Start isEmpty. Operand 5238 states and 7646 transitions. [2022-07-21 15:48:16,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-07-21 15:48:16,471 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:48:16,471 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] [2022-07-21 15:48:16,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-07-21 15:48:16,472 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-07-21 15:48:16,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:48:16,472 INFO L85 PathProgramCache]: Analyzing trace with hash 306975492, now seen corresponding path program 1 times [2022-07-21 15:48:16,473 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:48:16,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333033310] [2022-07-21 15:48:16,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:48:16,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:48:16,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:16,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:48:16,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:16,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 15:48:16,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:16,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:48:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:16,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 15:48:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:16,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:48:16,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:16,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 15:48:16,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:16,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 15:48:16,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:16,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 15:48:16,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:16,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 15:48:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:16,778 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-21 15:48:16,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:16,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 15:48:16,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:16,799 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 15:48:16,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:16,807 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 15:48:16,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:16,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 15:48:16,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:16,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 15:48:16,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:16,834 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-21 15:48:16,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:48:16,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333033310] [2022-07-21 15:48:16,835 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333033310] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:48:16,835 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:48:16,835 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:48:16,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775518456] [2022-07-21 15:48:16,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:48:16,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:48:16,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:48:16,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:48:16,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:48:16,837 INFO L87 Difference]: Start difference. First operand 5238 states and 7646 transitions. Second operand has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-21 15:48:26,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:48:26,545 INFO L93 Difference]: Finished difference Result 5238 states and 7646 transitions. [2022-07-21 15:48:26,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:48:26,547 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (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 100 [2022-07-21 15:48:26,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:48:26,568 INFO L225 Difference]: With dead ends: 5238 [2022-07-21 15:48:26,568 INFO L226 Difference]: Without dead ends: 5236 [2022-07-21 15:48:26,572 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:48:26,572 INFO L413 NwaCegarLoop]: 7405 mSDtfsCounter, 7357 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6196 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8880 SdHoareTripleChecker+Valid, 18614 SdHoareTripleChecker+Invalid, 10694 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 6196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2022-07-21 15:48:26,572 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8880 Valid, 18614 Invalid, 10694 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4498 Valid, 6196 Invalid, 0 Unknown, 0 Unchecked, 9.4s Time] [2022-07-21 15:48:26,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5236 states. [2022-07-21 15:48:26,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5236 to 5236. [2022-07-21 15:48:26,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5236 states, 3328 states have (on average 1.2301682692307692) internal successors, (4094), 3634 states have internal predecessors, (4094), 1776 states have call successors, (1776), 118 states have call predecessors, (1776), 117 states have return successors, (1774), 1510 states have call predecessors, (1774), 1774 states have call successors, (1774) [2022-07-21 15:48:26,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5236 states to 5236 states and 7644 transitions. [2022-07-21 15:48:27,030 INFO L78 Accepts]: Start accepts. Automaton has 5236 states and 7644 transitions. Word has length 100 [2022-07-21 15:48:27,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:48:27,030 INFO L495 AbstractCegarLoop]: Abstraction has 5236 states and 7644 transitions. [2022-07-21 15:48:27,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.5) internal successors, (63), 4 states have internal predecessors, (63), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) [2022-07-21 15:48:27,031 INFO L276 IsEmpty]: Start isEmpty. Operand 5236 states and 7644 transitions. [2022-07-21 15:48:27,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-07-21 15:48:27,032 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:48:27,032 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] [2022-07-21 15:48:27,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-07-21 15:48:27,032 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-07-21 15:48:27,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:48:27,037 INFO L85 PathProgramCache]: Analyzing trace with hash 2136352058, now seen corresponding path program 1 times [2022-07-21 15:48:27,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:48:27,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [256453102] [2022-07-21 15:48:27,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:48:27,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:48:27,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:27,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:48:27,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:27,186 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 15:48:27,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:27,200 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:48:27,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:27,209 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 15:48:27,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:27,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:48:27,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:27,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 15:48:27,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:27,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 15:48:27,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:27,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 15:48:27,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:27,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 15:48:27,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:27,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-21 15:48:27,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:27,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 15:48:27,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:27,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 15:48:27,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:27,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 15:48:27,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:27,297 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 15:48:27,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:27,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 15:48:27,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:27,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:48:27,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:27,325 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-21 15:48:27,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:48:27,325 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [256453102] [2022-07-21 15:48:27,326 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [256453102] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:48:27,326 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:48:27,326 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:48:27,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047425296] [2022-07-21 15:48:27,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:48:27,327 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:48:27,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:48:27,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:48:27,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:48:27,328 INFO L87 Difference]: Start difference. First operand 5236 states and 7644 transitions. Second operand has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-21 15:48:36,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:48:36,802 INFO L93 Difference]: Finished difference Result 5236 states and 7644 transitions. [2022-07-21 15:48:36,802 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:48:36,803 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (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 106 [2022-07-21 15:48:36,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:48:36,821 INFO L225 Difference]: With dead ends: 5236 [2022-07-21 15:48:36,821 INFO L226 Difference]: Without dead ends: 5234 [2022-07-21 15:48:36,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:48:36,826 INFO L413 NwaCegarLoop]: 7403 mSDtfsCounter, 7351 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6194 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8873 SdHoareTripleChecker+Valid, 18612 SdHoareTripleChecker+Invalid, 10692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 6194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2022-07-21 15:48:36,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8873 Valid, 18612 Invalid, 10692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4498 Valid, 6194 Invalid, 0 Unknown, 0 Unchecked, 9.1s Time] [2022-07-21 15:48:36,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5234 states. [2022-07-21 15:48:37,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5234 to 5234. [2022-07-21 15:48:37,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5234 states, 3327 states have (on average 1.229936880072137) internal successors, (4092), 3632 states have internal predecessors, (4092), 1776 states have call successors, (1776), 118 states have call predecessors, (1776), 117 states have return successors, (1774), 1510 states have call predecessors, (1774), 1774 states have call successors, (1774) [2022-07-21 15:48:37,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5234 states to 5234 states and 7642 transitions. [2022-07-21 15:48:37,262 INFO L78 Accepts]: Start accepts. Automaton has 5234 states and 7642 transitions. Word has length 106 [2022-07-21 15:48:37,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:48:37,263 INFO L495 AbstractCegarLoop]: Abstraction has 5234 states and 7642 transitions. [2022-07-21 15:48:37,263 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.166666666666666) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) [2022-07-21 15:48:37,263 INFO L276 IsEmpty]: Start isEmpty. Operand 5234 states and 7642 transitions. [2022-07-21 15:48:37,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-07-21 15:48:37,264 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:48:37,264 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] [2022-07-21 15:48:37,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-07-21 15:48:37,265 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-07-21 15:48:37,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:48:37,265 INFO L85 PathProgramCache]: Analyzing trace with hash 869079226, now seen corresponding path program 1 times [2022-07-21 15:48:37,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:48:37,266 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [994600680] [2022-07-21 15:48:37,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:48:37,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:48:37,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:37,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:48:37,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:37,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 15:48:37,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:37,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:48:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:37,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 15:48:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:37,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:48:37,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:37,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 15:48:37,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:37,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 15:48:37,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:37,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 15:48:37,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:37,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 15:48:37,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:37,540 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-21 15:48:37,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:37,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 15:48:37,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:37,565 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 15:48:37,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:37,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 15:48:37,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:37,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 15:48:37,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:37,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 15:48:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:37,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:48:37,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:37,632 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:48:37,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:37,646 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-21 15:48:37,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:48:37,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [994600680] [2022-07-21 15:48:37,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [994600680] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:48:37,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:48:37,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:48:37,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599345286] [2022-07-21 15:48:37,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:48:37,648 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:48:37,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:48:37,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:48:37,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:48:37,649 INFO L87 Difference]: Start difference. First operand 5234 states and 7642 transitions. Second operand has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-21 15:48:40,039 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-07-21 15:48:48,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:48:48,750 INFO L93 Difference]: Finished difference Result 5234 states and 7642 transitions. [2022-07-21 15:48:48,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:48:48,751 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (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 112 [2022-07-21 15:48:48,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:48:48,760 INFO L225 Difference]: With dead ends: 5234 [2022-07-21 15:48:48,760 INFO L226 Difference]: Without dead ends: 5232 [2022-07-21 15:48:48,761 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:48:48,762 INFO L413 NwaCegarLoop]: 7401 mSDtfsCounter, 7345 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6192 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8866 SdHoareTripleChecker+Valid, 18610 SdHoareTripleChecker+Invalid, 10690 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 6192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.8s IncrementalHoareTripleChecker+Time [2022-07-21 15:48:48,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8866 Valid, 18610 Invalid, 10690 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4498 Valid, 6192 Invalid, 0 Unknown, 0 Unchecked, 10.8s Time] [2022-07-21 15:48:48,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5232 states. [2022-07-21 15:48:49,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5232 to 5232. [2022-07-21 15:48:49,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5232 states, 3326 states have (on average 1.2297053517739025) internal successors, (4090), 3630 states have internal predecessors, (4090), 1776 states have call successors, (1776), 118 states have call predecessors, (1776), 117 states have return successors, (1774), 1510 states have call predecessors, (1774), 1774 states have call successors, (1774) [2022-07-21 15:48:49,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5232 states to 5232 states and 7640 transitions. [2022-07-21 15:48:49,106 INFO L78 Accepts]: Start accepts. Automaton has 5232 states and 7640 transitions. Word has length 112 [2022-07-21 15:48:49,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:48:49,108 INFO L495 AbstractCegarLoop]: Abstraction has 5232 states and 7640 transitions. [2022-07-21 15:48:49,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.833333333333334) internal successors, (71), 4 states have internal predecessors, (71), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) [2022-07-21 15:48:49,108 INFO L276 IsEmpty]: Start isEmpty. Operand 5232 states and 7640 transitions. [2022-07-21 15:48:49,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-07-21 15:48:49,110 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:48:49,110 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] [2022-07-21 15:48:49,110 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-07-21 15:48:49,110 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-07-21 15:48:49,110 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:48:49,111 INFO L85 PathProgramCache]: Analyzing trace with hash -574328519, now seen corresponding path program 1 times [2022-07-21 15:48:49,111 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:48:49,111 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934191621] [2022-07-21 15:48:49,111 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:48:49,111 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:48:49,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:49,253 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:48:49,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:49,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 15:48:49,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:49,280 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:48:49,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:49,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 15:48:49,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:49,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:48:49,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:49,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 15:48:49,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:49,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 15:48:49,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:49,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 15:48:49,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:49,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 15:48:49,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:49,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-21 15:48:49,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:49,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 15:48:49,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:49,360 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 15:48:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:49,368 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 15:48:49,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:49,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 15:48:49,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:49,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 15:48:49,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:49,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:48:49,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:49,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:48:49,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:49,422 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 15:48:49,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:49,434 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-21 15:48:49,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:48:49,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934191621] [2022-07-21 15:48:49,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934191621] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:48:49,435 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:48:49,435 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:48:49,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079234077] [2022-07-21 15:48:49,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:48:49,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:48:49,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:48:49,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:48:49,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:48:49,436 INFO L87 Difference]: Start difference. First operand 5232 states and 7640 transitions. Second operand has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-21 15:48:59,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:48:59,270 INFO L93 Difference]: Finished difference Result 5232 states and 7640 transitions. [2022-07-21 15:48:59,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:48:59,270 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (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 118 [2022-07-21 15:48:59,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:48:59,281 INFO L225 Difference]: With dead ends: 5232 [2022-07-21 15:48:59,281 INFO L226 Difference]: Without dead ends: 5230 [2022-07-21 15:48:59,282 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:48:59,283 INFO L413 NwaCegarLoop]: 7399 mSDtfsCounter, 7339 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6190 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8859 SdHoareTripleChecker+Valid, 18608 SdHoareTripleChecker+Invalid, 10688 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 6190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2022-07-21 15:48:59,283 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8859 Valid, 18608 Invalid, 10688 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4498 Valid, 6190 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2022-07-21 15:48:59,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5230 states. [2022-07-21 15:48:59,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5230 to 5230. [2022-07-21 15:48:59,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5230 states, 3325 states have (on average 1.2294736842105263) internal successors, (4088), 3628 states have internal predecessors, (4088), 1776 states have call successors, (1776), 118 states have call predecessors, (1776), 117 states have return successors, (1774), 1510 states have call predecessors, (1774), 1774 states have call successors, (1774) [2022-07-21 15:48:59,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5230 states to 5230 states and 7638 transitions. [2022-07-21 15:48:59,627 INFO L78 Accepts]: Start accepts. Automaton has 5230 states and 7638 transitions. Word has length 118 [2022-07-21 15:48:59,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:48:59,627 INFO L495 AbstractCegarLoop]: Abstraction has 5230 states and 7638 transitions. [2022-07-21 15:48:59,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.5) internal successors, (75), 4 states have internal predecessors, (75), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) [2022-07-21 15:48:59,627 INFO L276 IsEmpty]: Start isEmpty. Operand 5230 states and 7638 transitions. [2022-07-21 15:48:59,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-07-21 15:48:59,628 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:48:59,628 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] [2022-07-21 15:48:59,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-07-21 15:48:59,629 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-07-21 15:48:59,629 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:48:59,629 INFO L85 PathProgramCache]: Analyzing trace with hash -1828773943, now seen corresponding path program 1 times [2022-07-21 15:48:59,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:48:59,630 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277660224] [2022-07-21 15:48:59,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:48:59,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:48:59,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:59,760 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:48:59,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:59,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 15:48:59,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:59,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:48:59,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:59,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 15:48:59,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:59,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:48:59,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:59,812 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 15:48:59,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:59,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 15:48:59,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:59,828 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 15:48:59,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:59,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 15:48:59,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:59,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-21 15:48:59,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:59,854 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 15:48:59,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:59,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 15:48:59,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:59,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 15:48:59,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:59,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 15:48:59,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:59,888 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 15:48:59,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:59,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:48:59,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:59,905 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:48:59,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:59,914 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 15:48:59,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:59,923 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-21 15:48:59,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:48:59,931 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-21 15:48:59,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:48:59,932 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277660224] [2022-07-21 15:48:59,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277660224] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:48:59,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:48:59,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:48:59,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190212799] [2022-07-21 15:48:59,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:48:59,933 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:48:59,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:48:59,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:48:59,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:48:59,934 INFO L87 Difference]: Start difference. First operand 5230 states and 7638 transitions. Second operand has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-21 15:49:09,788 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:49:09,788 INFO L93 Difference]: Finished difference Result 5230 states and 7638 transitions. [2022-07-21 15:49:09,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:49:09,788 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (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 124 [2022-07-21 15:49:09,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:49:09,802 INFO L225 Difference]: With dead ends: 5230 [2022-07-21 15:49:09,802 INFO L226 Difference]: Without dead ends: 5228 [2022-07-21 15:49:09,804 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:49:09,805 INFO L413 NwaCegarLoop]: 7397 mSDtfsCounter, 7333 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6188 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8852 SdHoareTripleChecker+Valid, 18606 SdHoareTripleChecker+Invalid, 10686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 6188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.5s IncrementalHoareTripleChecker+Time [2022-07-21 15:49:09,805 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8852 Valid, 18606 Invalid, 10686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4498 Valid, 6188 Invalid, 0 Unknown, 0 Unchecked, 9.5s Time] [2022-07-21 15:49:09,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5228 states. [2022-07-21 15:49:10,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5228 to 5228. [2022-07-21 15:49:10,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5228 states, 3324 states have (on average 1.2292418772563176) internal successors, (4086), 3626 states have internal predecessors, (4086), 1776 states have call successors, (1776), 118 states have call predecessors, (1776), 117 states have return successors, (1774), 1510 states have call predecessors, (1774), 1774 states have call successors, (1774) [2022-07-21 15:49:10,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5228 states to 5228 states and 7636 transitions. [2022-07-21 15:49:10,085 INFO L78 Accepts]: Start accepts. Automaton has 5228 states and 7636 transitions. Word has length 124 [2022-07-21 15:49:10,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:49:10,085 INFO L495 AbstractCegarLoop]: Abstraction has 5228 states and 7636 transitions. [2022-07-21 15:49:10,085 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.166666666666666) internal successors, (79), 4 states have internal predecessors, (79), 2 states have call successors, (20), 4 states have call predecessors, (20), 1 states have return successors, (19), 2 states have call predecessors, (19), 2 states have call successors, (19) [2022-07-21 15:49:10,086 INFO L276 IsEmpty]: Start isEmpty. Operand 5228 states and 7636 transitions. [2022-07-21 15:49:10,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-07-21 15:49:10,086 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:49:10,086 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] [2022-07-21 15:49:10,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-07-21 15:49:10,087 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-07-21 15:49:10,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:49:10,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1873078433, now seen corresponding path program 1 times [2022-07-21 15:49:10,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:49:10,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [908292293] [2022-07-21 15:49:10,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:49:10,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:49:10,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:10,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:49:10,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:10,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 15:49:10,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:10,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:49:10,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:10,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 15:49:10,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:10,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:49:10,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:10,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 15:49:10,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:10,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 15:49:10,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:10,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 15:49:10,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:10,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 15:49:10,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:10,334 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-21 15:49:10,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:10,344 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 15:49:10,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:10,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 15:49:10,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:10,367 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 15:49:10,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:10,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 15:49:10,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:10,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 15:49:10,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:10,398 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:49:10,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:10,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:49:10,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:10,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 15:49:10,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:10,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-21 15:49:10,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:10,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-21 15:49:10,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:10,450 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-21 15:49:10,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:49:10,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [908292293] [2022-07-21 15:49:10,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [908292293] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:49:10,451 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:49:10,451 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:49:10,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1773383601] [2022-07-21 15:49:10,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:49:10,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:49:10,452 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:49:10,452 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:49:10,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:49:10,452 INFO L87 Difference]: Start difference. First operand 5228 states and 7636 transitions. Second operand has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-21 15:49:19,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:49:19,506 INFO L93 Difference]: Finished difference Result 5228 states and 7636 transitions. [2022-07-21 15:49:19,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:49:19,506 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (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 130 [2022-07-21 15:49:19,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:49:19,521 INFO L225 Difference]: With dead ends: 5228 [2022-07-21 15:49:19,521 INFO L226 Difference]: Without dead ends: 5226 [2022-07-21 15:49:19,523 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:49:19,523 INFO L413 NwaCegarLoop]: 7395 mSDtfsCounter, 7327 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6186 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8845 SdHoareTripleChecker+Valid, 18604 SdHoareTripleChecker+Invalid, 10684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 6186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.7s IncrementalHoareTripleChecker+Time [2022-07-21 15:49:19,524 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8845 Valid, 18604 Invalid, 10684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4498 Valid, 6186 Invalid, 0 Unknown, 0 Unchecked, 8.7s Time] [2022-07-21 15:49:19,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5226 states. [2022-07-21 15:49:19,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5226 to 5226. [2022-07-21 15:49:19,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5226 states, 3323 states have (on average 1.2290099307854347) internal successors, (4084), 3624 states have internal predecessors, (4084), 1776 states have call successors, (1776), 118 states have call predecessors, (1776), 117 states have return successors, (1774), 1510 states have call predecessors, (1774), 1774 states have call successors, (1774) [2022-07-21 15:49:19,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5226 states to 5226 states and 7634 transitions. [2022-07-21 15:49:19,811 INFO L78 Accepts]: Start accepts. Automaton has 5226 states and 7634 transitions. Word has length 130 [2022-07-21 15:49:19,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:49:19,811 INFO L495 AbstractCegarLoop]: Abstraction has 5226 states and 7634 transitions. [2022-07-21 15:49:19,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.833333333333334) internal successors, (83), 4 states have internal predecessors, (83), 2 states have call successors, (21), 4 states have call predecessors, (21), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-07-21 15:49:19,811 INFO L276 IsEmpty]: Start isEmpty. Operand 5226 states and 7634 transitions. [2022-07-21 15:49:19,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-07-21 15:49:19,812 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:49:19,813 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] [2022-07-21 15:49:19,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-07-21 15:49:19,813 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-07-21 15:49:19,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:49:19,813 INFO L85 PathProgramCache]: Analyzing trace with hash 595773319, now seen corresponding path program 1 times [2022-07-21 15:49:19,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:49:19,814 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1521749372] [2022-07-21 15:49:19,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:49:19,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:49:19,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:19,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:49:19,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:19,960 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 15:49:19,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:19,973 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:49:19,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:19,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 15:49:19,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:19,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:49:19,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:20,000 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 15:49:20,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:20,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 15:49:20,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:20,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 15:49:20,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:20,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 15:49:20,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:20,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-21 15:49:20,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:20,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 15:49:20,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:20,054 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 15:49:20,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:20,066 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 15:49:20,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:20,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 15:49:20,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:20,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 15:49:20,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:20,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:49:20,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:20,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:49:20,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:20,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 15:49:20,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:20,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-21 15:49:20,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:20,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-21 15:49:20,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:20,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-21 15:49:20,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:20,165 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-21 15:49:20,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:49:20,166 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1521749372] [2022-07-21 15:49:20,167 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1521749372] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:49:20,168 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:49:20,168 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:49:20,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [259248286] [2022-07-21 15:49:20,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:49:20,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:49:20,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:49:20,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:49:20,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:49:20,169 INFO L87 Difference]: Start difference. First operand 5226 states and 7634 transitions. Second operand has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-21 15:49:30,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:49:30,182 INFO L93 Difference]: Finished difference Result 5226 states and 7634 transitions. [2022-07-21 15:49:30,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:49:30,182 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (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 136 [2022-07-21 15:49:30,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:49:30,196 INFO L225 Difference]: With dead ends: 5226 [2022-07-21 15:49:30,196 INFO L226 Difference]: Without dead ends: 5224 [2022-07-21 15:49:30,199 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:49:30,199 INFO L413 NwaCegarLoop]: 7393 mSDtfsCounter, 7321 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6184 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8838 SdHoareTripleChecker+Valid, 18602 SdHoareTripleChecker+Invalid, 10682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 6184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.6s IncrementalHoareTripleChecker+Time [2022-07-21 15:49:30,199 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8838 Valid, 18602 Invalid, 10682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4498 Valid, 6184 Invalid, 0 Unknown, 0 Unchecked, 9.6s Time] [2022-07-21 15:49:30,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5224 states. [2022-07-21 15:49:30,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5224 to 5224. [2022-07-21 15:49:30,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5224 states, 3322 states have (on average 1.2287778446718844) internal successors, (4082), 3622 states have internal predecessors, (4082), 1776 states have call successors, (1776), 118 states have call predecessors, (1776), 117 states have return successors, (1774), 1510 states have call predecessors, (1774), 1774 states have call successors, (1774) [2022-07-21 15:49:30,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5224 states to 5224 states and 7632 transitions. [2022-07-21 15:49:30,537 INFO L78 Accepts]: Start accepts. Automaton has 5224 states and 7632 transitions. Word has length 136 [2022-07-21 15:49:30,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:49:30,537 INFO L495 AbstractCegarLoop]: Abstraction has 5224 states and 7632 transitions. [2022-07-21 15:49:30,538 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 14.5) internal successors, (87), 4 states have internal predecessors, (87), 2 states have call successors, (22), 4 states have call predecessors, (22), 1 states have return successors, (21), 2 states have call predecessors, (21), 2 states have call successors, (21) [2022-07-21 15:49:30,538 INFO L276 IsEmpty]: Start isEmpty. Operand 5224 states and 7632 transitions. [2022-07-21 15:49:30,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-07-21 15:49:30,539 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:49:30,539 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] [2022-07-21 15:49:30,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-07-21 15:49:30,539 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-07-21 15:49:30,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:49:30,542 INFO L85 PathProgramCache]: Analyzing trace with hash 1290209167, now seen corresponding path program 1 times [2022-07-21 15:49:30,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:49:30,543 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397934864] [2022-07-21 15:49:30,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:49:30,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:49:30,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:30,674 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:49:30,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:30,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 15:49:30,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:30,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:49:30,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:30,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 15:49:30,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:30,722 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:49:30,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:30,729 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 15:49:30,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:30,737 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 15:49:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:30,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 15:49:30,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:30,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 15:49:30,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:30,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-21 15:49:30,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:30,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 15:49:30,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:30,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 15:49:30,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:30,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 15:49:30,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:30,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 15:49:30,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:30,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 15:49:30,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:30,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:49:30,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:30,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:49:30,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:30,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 15:49:30,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:30,862 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-21 15:49:30,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:30,873 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-21 15:49:30,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:30,883 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-21 15:49:30,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:30,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-21 15:49:30,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:30,904 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-21 15:49:30,904 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:49:30,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [397934864] [2022-07-21 15:49:30,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [397934864] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:49:30,905 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:49:30,905 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:49:30,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189527307] [2022-07-21 15:49:30,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:49:30,906 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:49:30,906 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:49:30,906 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:49:30,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:49:30,907 INFO L87 Difference]: Start difference. First operand 5224 states and 7632 transitions. Second operand has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-21 15:49:41,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-21 15:49:41,463 INFO L93 Difference]: Finished difference Result 5224 states and 7632 transitions. [2022-07-21 15:49:41,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-07-21 15:49:41,463 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (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 142 [2022-07-21 15:49:41,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-21 15:49:41,477 INFO L225 Difference]: With dead ends: 5224 [2022-07-21 15:49:41,477 INFO L226 Difference]: Without dead ends: 5222 [2022-07-21 15:49:41,479 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-07-21 15:49:41,480 INFO L413 NwaCegarLoop]: 7391 mSDtfsCounter, 7315 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 6182 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8831 SdHoareTripleChecker+Valid, 18600 SdHoareTripleChecker+Invalid, 10680 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 6182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 10.2s IncrementalHoareTripleChecker+Time [2022-07-21 15:49:41,480 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8831 Valid, 18600 Invalid, 10680 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4498 Valid, 6182 Invalid, 0 Unknown, 0 Unchecked, 10.2s Time] [2022-07-21 15:49:41,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5222 states. [2022-07-21 15:49:41,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5222 to 5222. [2022-07-21 15:49:41,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5222 states, 3321 states have (on average 1.2285456187895212) internal successors, (4080), 3620 states have internal predecessors, (4080), 1776 states have call successors, (1776), 118 states have call predecessors, (1776), 117 states have return successors, (1774), 1510 states have call predecessors, (1774), 1774 states have call successors, (1774) [2022-07-21 15:49:41,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5222 states to 5222 states and 7630 transitions. [2022-07-21 15:49:41,808 INFO L78 Accepts]: Start accepts. Automaton has 5222 states and 7630 transitions. Word has length 142 [2022-07-21 15:49:41,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-21 15:49:41,809 INFO L495 AbstractCegarLoop]: Abstraction has 5222 states and 7630 transitions. [2022-07-21 15:49:41,809 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.166666666666666) internal successors, (91), 4 states have internal predecessors, (91), 2 states have call successors, (23), 4 states have call predecessors, (23), 1 states have return successors, (22), 2 states have call predecessors, (22), 2 states have call successors, (22) [2022-07-21 15:49:41,809 INFO L276 IsEmpty]: Start isEmpty. Operand 5222 states and 7630 transitions. [2022-07-21 15:49:41,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-07-21 15:49:41,810 INFO L187 NwaCegarLoop]: Found error trace [2022-07-21 15:49:41,811 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] [2022-07-21 15:49:41,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-07-21 15:49:41,811 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION, ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (and 23 more)] === [2022-07-21 15:49:41,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-21 15:49:41,811 INFO L85 PathProgramCache]: Analyzing trace with hash -315189183, now seen corresponding path program 1 times [2022-07-21 15:49:41,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-21 15:49:41,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [763778145] [2022-07-21 15:49:41,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-21 15:49:41,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-21 15:49:41,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:41,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-07-21 15:49:41,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:41,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-07-21 15:49:41,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:41,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-07-21 15:49:41,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:41,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-07-21 15:49:41,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:41,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-07-21 15:49:41,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:41,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-07-21 15:49:41,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:41,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-07-21 15:49:42,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:42,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-07-21 15:49:42,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:42,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-07-21 15:49:42,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:42,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-07-21 15:49:42,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:42,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-07-21 15:49:42,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:42,044 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-07-21 15:49:42,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:42,052 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-07-21 15:49:42,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:42,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-07-21 15:49:42,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:42,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-07-21 15:49:42,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:42,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-07-21 15:49:42,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:42,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-07-21 15:49:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:42,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-07-21 15:49:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:42,107 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-07-21 15:49:42,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:42,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-07-21 15:49:42,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:42,124 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-07-21 15:49:42,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:42,133 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-07-21 15:49:42,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:42,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-07-21 15:49:42,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-21 15:49:42,153 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-21 15:49:42,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-21 15:49:42,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [763778145] [2022-07-21 15:49:42,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [763778145] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-21 15:49:42,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-21 15:49:42,154 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-07-21 15:49:42,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666156028] [2022-07-21 15:49:42,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-21 15:49:42,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-07-21 15:49:42,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-21 15:49:42,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-07-21 15:49:42,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-07-21 15:49:42,156 INFO L87 Difference]: Start difference. First operand 5222 states and 7630 transitions. Second operand has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (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)