./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 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/bin/uautomizer-ug76WZFUDN --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 --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 11:54:02,388 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 11:54:02,390 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 11:54:02,414 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 11:54:02,414 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 11:54:02,422 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 11:54:02,425 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 11:54:02,428 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 11:54:02,430 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 11:54:02,435 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 11:54:02,437 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 11:54:02,439 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 11:54:02,439 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 11:54:02,444 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 11:54:02,445 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 11:54:02,446 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 11:54:02,447 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 11:54:02,447 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 11:54:02,449 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 11:54:02,454 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 11:54:02,456 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 11:54:02,458 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 11:54:02,459 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 11:54:02,460 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 11:54:02,471 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 11:54:02,472 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 11:54:02,472 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 11:54:02,473 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 11:54:02,473 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 11:54:02,474 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 11:54:02,474 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 11:54:02,475 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 11:54:02,476 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 11:54:02,477 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 11:54:02,478 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 11:54:02,478 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 11:54:02,479 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 11:54:02,479 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 11:54:02,479 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 11:54:02,480 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 11:54:02,481 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 11:54:02,487 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-20 11:54:02,523 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 11:54:02,523 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 11:54:02,524 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 11:54:02,524 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 11:54:02,525 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 11:54:02,525 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 11:54:02,526 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 11:54:02,526 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 11:54:02,526 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 11:54:02,527 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 11:54:02,528 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 11:54:02,528 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 11:54:02,528 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 11:54:02,529 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 11:54:02,529 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 11:54:02,529 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 11:54:02,529 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 11:54:02,529 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 11:54:02,530 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 11:54:02,530 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 11:54:02,530 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 11:54:02,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:54:02,531 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 11:54:02,531 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 11:54:02,531 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 11:54:02,531 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 11:54:02,532 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 11:54:02,532 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 11:54:02,533 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 11:54:02,533 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 11:54:02,533 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/bin/uautomizer-ug76WZFUDN/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/bin/uautomizer-ug76WZFUDN 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-11-20 11:54:02,804 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 11:54:02,831 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 11:54:02,834 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 11:54:02,836 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 11:54:02,836 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 11:54:02,837 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i [2022-11-20 11:54:06,016 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 11:54:06,972 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 11:54:06,973 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i [2022-11-20 11:54:07,052 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/bin/uautomizer-ug76WZFUDN/data/96bbf1743/e18c58365c3c44328d0b801904e5d235/FLAG99c367c5b [2022-11-20 11:54:07,071 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/bin/uautomizer-ug76WZFUDN/data/96bbf1743/e18c58365c3c44328d0b801904e5d235 [2022-11-20 11:54:07,076 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 11:54:07,078 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 11:54:07,083 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 11:54:07,083 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 11:54:07,087 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 11:54:07,088 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:54:07" (1/1) ... [2022-11-20 11:54:07,089 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a0c498a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:54:07, skipping insertion in model container [2022-11-20 11:54:07,089 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 11:54:07" (1/1) ... [2022-11-20 11:54:07,096 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 11:54:07,434 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 11:54:19,320 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1177218,1177231] [2022-11-20 11:54:19,324 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1177363,1177376] [2022-11-20 11:54:19,325 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1177509,1177522] [2022-11-20 11:54:19,326 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1177674,1177687] [2022-11-20 11:54:19,326 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1177832,1177845] [2022-11-20 11:54:19,327 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1177990,1178003] [2022-11-20 11:54:19,327 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1178148,1178161] [2022-11-20 11:54:19,327 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1178308,1178321] [2022-11-20 11:54:19,328 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1178467,1178480] [2022-11-20 11:54:19,328 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1178606,1178619] [2022-11-20 11:54:19,329 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1178748,1178761] [2022-11-20 11:54:19,329 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1178897,1178910] [2022-11-20 11:54:19,329 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1179036,1179049] [2022-11-20 11:54:19,330 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1179191,1179204] [2022-11-20 11:54:19,331 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1179351,1179364] [2022-11-20 11:54:19,331 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1179502,1179515] [2022-11-20 11:54:19,332 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1179653,1179666] [2022-11-20 11:54:19,332 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1179805,1179818] [2022-11-20 11:54:19,333 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1179954,1179967] [2022-11-20 11:54:19,333 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1180102,1180115] [2022-11-20 11:54:19,334 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1180259,1180272] [2022-11-20 11:54:19,334 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1180408,1180421] [2022-11-20 11:54:19,334 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1180564,1180577] [2022-11-20 11:54:19,335 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1180717,1180730] [2022-11-20 11:54:19,335 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1180863,1180876] [2022-11-20 11:54:19,336 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1181006,1181019] [2022-11-20 11:54:19,337 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1181158,1181171] [2022-11-20 11:54:19,337 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1181304,1181317] [2022-11-20 11:54:19,338 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1181449,1181462] [2022-11-20 11:54:19,338 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1181603,1181616] [2022-11-20 11:54:19,338 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1181754,1181767] [2022-11-20 11:54:19,339 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1181909,1181922] [2022-11-20 11:54:19,339 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1182061,1182074] [2022-11-20 11:54:19,340 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1182216,1182229] [2022-11-20 11:54:19,340 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1182380,1182393] [2022-11-20 11:54:19,351 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1182536,1182549] [2022-11-20 11:54:19,352 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1182700,1182713] [2022-11-20 11:54:19,352 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1182842,1182855] [2022-11-20 11:54:19,353 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1183000,1183013] [2022-11-20 11:54:19,353 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1183167,1183180] [2022-11-20 11:54:19,354 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1183326,1183339] [2022-11-20 11:54:19,354 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1183485,1183498] [2022-11-20 11:54:19,355 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1183634,1183647] [2022-11-20 11:54:19,356 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1183781,1183794] [2022-11-20 11:54:19,359 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1183920,1183933] [2022-11-20 11:54:19,360 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1184083,1184096] [2022-11-20 11:54:19,361 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1184249,1184262] [2022-11-20 11:54:19,361 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1184413,1184426] [2022-11-20 11:54:19,363 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1184578,1184591] [2022-11-20 11:54:19,364 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1184743,1184756] [2022-11-20 11:54:19,365 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1184909,1184922] [2022-11-20 11:54:19,365 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1185074,1185087] [2022-11-20 11:54:19,366 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1185241,1185254] [2022-11-20 11:54:19,367 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1185401,1185414] [2022-11-20 11:54:19,367 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1185563,1185576] [2022-11-20 11:54:19,367 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1185722,1185735] [2022-11-20 11:54:19,368 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1185868,1185881] [2022-11-20 11:54:19,368 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1186011,1186024] [2022-11-20 11:54:19,369 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1186155,1186168] [2022-11-20 11:54:19,369 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1186298,1186311] [2022-11-20 11:54:19,370 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1186442,1186455] [2022-11-20 11:54:19,371 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1186583,1186596] [2022-11-20 11:54:19,372 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1186721,1186734] [2022-11-20 11:54:19,372 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1186879,1186892] [2022-11-20 11:54:19,373 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1187038,1187051] [2022-11-20 11:54:19,373 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1187194,1187207] [2022-11-20 11:54:19,373 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1187343,1187356] [2022-11-20 11:54:19,374 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1187495,1187508] [2022-11-20 11:54:19,375 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1187646,1187659] [2022-11-20 11:54:19,376 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1187795,1187808] [2022-11-20 11:54:19,376 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1187947,1187960] [2022-11-20 11:54:19,377 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1188095,1188108] [2022-11-20 11:54:19,377 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1188248,1188261] [2022-11-20 11:54:19,378 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1188399,1188412] [2022-11-20 11:54:19,379 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1188549,1188562] [2022-11-20 11:54:19,379 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1188696,1188709] [2022-11-20 11:54:19,380 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1188847,1188860] [2022-11-20 11:54:19,381 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1188998,1189011] [2022-11-20 11:54:19,382 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1189146,1189159] [2022-11-20 11:54:19,382 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1189312,1189325] [2022-11-20 11:54:19,383 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1189481,1189494] [2022-11-20 11:54:19,385 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1189648,1189661] [2022-11-20 11:54:19,385 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1189816,1189829] [2022-11-20 11:54:19,386 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1189966,1189979] [2022-11-20 11:54:19,386 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1190113,1190126] [2022-11-20 11:54:19,386 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1190274,1190287] [2022-11-20 11:54:19,387 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1190444,1190457] [2022-11-20 11:54:19,387 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1190606,1190619] [2022-11-20 11:54:19,403 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:54:19,457 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 11:54:20,184 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1177218,1177231] [2022-11-20 11:54:20,185 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1177363,1177376] [2022-11-20 11:54:20,187 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1177509,1177522] [2022-11-20 11:54:20,187 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1177674,1177687] [2022-11-20 11:54:20,188 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1177832,1177845] [2022-11-20 11:54:20,189 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1177990,1178003] [2022-11-20 11:54:20,190 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1178148,1178161] [2022-11-20 11:54:20,190 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1178308,1178321] [2022-11-20 11:54:20,191 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1178467,1178480] [2022-11-20 11:54:20,192 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1178606,1178619] [2022-11-20 11:54:20,192 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1178748,1178761] [2022-11-20 11:54:20,193 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1178897,1178910] [2022-11-20 11:54:20,193 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1179036,1179049] [2022-11-20 11:54:20,198 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1179191,1179204] [2022-11-20 11:54:20,199 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1179351,1179364] [2022-11-20 11:54:20,200 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1179502,1179515] [2022-11-20 11:54:20,200 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1179653,1179666] [2022-11-20 11:54:20,201 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1179805,1179818] [2022-11-20 11:54:20,202 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1179954,1179967] [2022-11-20 11:54:20,202 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1180102,1180115] [2022-11-20 11:54:20,203 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1180259,1180272] [2022-11-20 11:54:20,203 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1180408,1180421] [2022-11-20 11:54:20,203 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1180564,1180577] [2022-11-20 11:54:20,204 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1180717,1180730] [2022-11-20 11:54:20,204 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1180863,1180876] [2022-11-20 11:54:20,205 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1181006,1181019] [2022-11-20 11:54:20,205 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1181158,1181171] [2022-11-20 11:54:20,206 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1181304,1181317] [2022-11-20 11:54:20,207 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1181449,1181462] [2022-11-20 11:54:20,207 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1181603,1181616] [2022-11-20 11:54:20,208 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1181754,1181767] [2022-11-20 11:54:20,208 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1181909,1181922] [2022-11-20 11:54:20,208 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1182061,1182074] [2022-11-20 11:54:20,210 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1182216,1182229] [2022-11-20 11:54:20,210 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1182380,1182393] [2022-11-20 11:54:20,211 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1182536,1182549] [2022-11-20 11:54:20,211 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1182700,1182713] [2022-11-20 11:54:20,212 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1182842,1182855] [2022-11-20 11:54:20,212 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1183000,1183013] [2022-11-20 11:54:20,212 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1183167,1183180] [2022-11-20 11:54:20,214 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1183326,1183339] [2022-11-20 11:54:20,214 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1183485,1183498] [2022-11-20 11:54:20,215 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1183634,1183647] [2022-11-20 11:54:20,215 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1183781,1183794] [2022-11-20 11:54:20,216 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1183920,1183933] [2022-11-20 11:54:20,216 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1184083,1184096] [2022-11-20 11:54:20,217 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1184249,1184262] [2022-11-20 11:54:20,217 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1184413,1184426] [2022-11-20 11:54:20,217 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1184578,1184591] [2022-11-20 11:54:20,218 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1184743,1184756] [2022-11-20 11:54:20,219 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1184909,1184922] [2022-11-20 11:54:20,219 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1185074,1185087] [2022-11-20 11:54:20,220 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1185241,1185254] [2022-11-20 11:54:20,221 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1185401,1185414] [2022-11-20 11:54:20,221 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1185563,1185576] [2022-11-20 11:54:20,222 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1185722,1185735] [2022-11-20 11:54:20,222 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1185868,1185881] [2022-11-20 11:54:20,222 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1186011,1186024] [2022-11-20 11:54:20,223 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1186155,1186168] [2022-11-20 11:54:20,223 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1186298,1186311] [2022-11-20 11:54:20,224 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1186442,1186455] [2022-11-20 11:54:20,224 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1186583,1186596] [2022-11-20 11:54:20,225 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1186721,1186734] [2022-11-20 11:54:20,226 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1186879,1186892] [2022-11-20 11:54:20,234 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1187038,1187051] [2022-11-20 11:54:20,235 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1187194,1187207] [2022-11-20 11:54:20,236 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1187343,1187356] [2022-11-20 11:54:20,237 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1187495,1187508] [2022-11-20 11:54:20,238 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1187646,1187659] [2022-11-20 11:54:20,238 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1187795,1187808] [2022-11-20 11:54:20,240 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1187947,1187960] [2022-11-20 11:54:20,240 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1188095,1188108] [2022-11-20 11:54:20,240 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1188248,1188261] [2022-11-20 11:54:20,245 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1188399,1188412] [2022-11-20 11:54:20,246 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1188549,1188562] [2022-11-20 11:54:20,246 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1188696,1188709] [2022-11-20 11:54:20,247 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1188847,1188860] [2022-11-20 11:54:20,247 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1188998,1189011] [2022-11-20 11:54:20,249 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1189146,1189159] [2022-11-20 11:54:20,250 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1189312,1189325] [2022-11-20 11:54:20,250 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1189481,1189494] [2022-11-20 11:54:20,250 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1189648,1189661] [2022-11-20 11:54:20,251 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1189816,1189829] [2022-11-20 11:54:20,252 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1189966,1189979] [2022-11-20 11:54:20,252 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1190113,1190126] [2022-11-20 11:54:20,253 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1190274,1190287] [2022-11-20 11:54:20,253 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1190444,1190457] [2022-11-20 11:54:20,254 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i[1190606,1190619] [2022-11-20 11:54:20,259 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 11:54:21,131 INFO L208 MainTranslator]: Completed translation [2022-11-20 11:54:21,131 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:54:21 WrapperNode [2022-11-20 11:54:21,132 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 11:54:21,133 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 11:54:21,133 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 11:54:21,133 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 11:54:21,140 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:54:21" (1/1) ... [2022-11-20 11:54:21,369 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:54:21" (1/1) ... [2022-11-20 11:54:21,810 INFO L138 Inliner]: procedures = 1178, calls = 4177, calls flagged for inlining = 795, calls inlined = 711, statements flattened = 14799 [2022-11-20 11:54:21,810 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 11:54:21,811 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 11:54:21,811 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 11:54:21,811 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 11:54:21,822 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:54:21" (1/1) ... [2022-11-20 11:54:21,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:54:21" (1/1) ... [2022-11-20 11:54:21,964 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:54:21" (1/1) ... [2022-11-20 11:54:21,968 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:54:21" (1/1) ... [2022-11-20 11:54:22,272 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:54:21" (1/1) ... [2022-11-20 11:54:22,312 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:54:21" (1/1) ... [2022-11-20 11:54:22,364 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:54:21" (1/1) ... [2022-11-20 11:54:22,497 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:54:21" (1/1) ... [2022-11-20 11:54:22,648 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 11:54:22,650 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 11:54:22,650 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 11:54:22,651 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 11:54:22,652 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:54:21" (1/1) ... [2022-11-20 11:54:22,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 11:54:22,681 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 11:54:22,720 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 11:54:22,792 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e5466ce7-6eff-4108-bb37-5ed5af18595d/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 11:54:22,841 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-11-20 11:54:22,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-11-20 11:54:22,854 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_create [2022-11-20 11:54:22,854 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_create [2022-11-20 11:54:22,854 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-11-20 11:54:22,854 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-11-20 11:54:22,855 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_write_setup [2022-11-20 11:54:22,855 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_write_setup [2022-11-20 11:54:22,855 INFO L130 BoogieDeclarations]: Found specification of procedure xdr_write_pages [2022-11-20 11:54:22,855 INFO L138 BoogieDeclarations]: Found implementation of procedure xdr_write_pages [2022-11-20 11:54:22,855 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_alloc_createdata [2022-11-20 11:54:22,855 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_alloc_createdata [2022-11-20 11:54:22,856 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_lock_check_bounds [2022-11-20 11:54:22,856 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_lock_check_bounds [2022-11-20 11:54:22,857 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_mkdir [2022-11-20 11:54:22,857 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_mkdir [2022-11-20 11:54:22,857 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_rename_setup [2022-11-20 11:54:22,857 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_rename_setup [2022-11-20 11:54:22,859 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-11-20 11:54:22,859 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-11-20 11:54:22,859 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_lookup [2022-11-20 11:54:22,859 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_lookup [2022-11-20 11:54:22,860 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-11-20 11:54:22,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-11-20 11:54:22,860 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 11:54:22,860 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-11-20 11:54:22,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-11-20 11:54:22,860 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-11-20 11:54:22,860 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-11-20 11:54:22,861 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2022-11-20 11:54:22,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2022-11-20 11:54:22,861 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_unlink [2022-11-20 11:54:22,861 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_stat_to_errno [2022-11-20 11:54:22,861 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_stat_to_errno [2022-11-20 11:54:22,861 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-11-20 11:54:22,861 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-11-20 11:54:22,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 11:54:22,862 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_readdir [2022-11-20 11:54:22,862 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_readdir [2022-11-20 11:54:22,862 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 11:54:22,862 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-11-20 11:54:22,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-11-20 11:54:22,862 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 11:54:22,863 INFO L130 BoogieDeclarations]: Found specification of procedure encode_sattr [2022-11-20 11:54:22,863 INFO L138 BoogieDeclarations]: Found implementation of procedure encode_sattr [2022-11-20 11:54:22,863 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_rename_rpc_prepare [2022-11-20 11:54:22,863 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_rename_rpc_prepare [2022-11-20 11:54:22,863 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_unlink_rpc_prepare [2022-11-20 11:54:22,863 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_unlink_rpc_prepare [2022-11-20 11:54:22,863 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_rmdir [2022-11-20 11:54:22,864 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_rmdir [2022-11-20 11:54:22,864 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_free_client [2022-11-20 11:54:22,864 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_free_client [2022-11-20 11:54:22,864 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 11:54:22,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 11:54:22,864 INFO L130 BoogieDeclarations]: Found specification of procedure __kuid_val [2022-11-20 11:54:22,864 INFO L138 BoogieDeclarations]: Found implementation of procedure __kuid_val [2022-11-20 11:54:22,865 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-20 11:54:22,865 INFO L130 BoogieDeclarations]: Found specification of procedure xdr_encode_current_server_time [2022-11-20 11:54:22,865 INFO L138 BoogieDeclarations]: Found implementation of procedure xdr_encode_current_server_time [2022-11-20 11:54:22,865 INFO L130 BoogieDeclarations]: Found specification of procedure __be32_to_cpup [2022-11-20 11:54:22,866 INFO L138 BoogieDeclarations]: Found implementation of procedure __be32_to_cpup [2022-11-20 11:54:22,866 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_commit_rpc_prepare [2022-11-20 11:54:22,866 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_commit_rpc_prepare [2022-11-20 11:54:22,866 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_readlink [2022-11-20 11:54:22,866 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_readlink [2022-11-20 11:54:22,866 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_invalidate_atime [2022-11-20 11:54:22,866 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_invalidate_atime [2022-11-20 11:54:22,867 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_clone_server [2022-11-20 11:54:22,867 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_clone_server [2022-11-20 11:54:22,867 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-11-20 11:54:22,868 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-11-20 11:54:22,872 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_pgio_rpc_prepare [2022-11-20 11:54:22,872 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_pgio_rpc_prepare [2022-11-20 11:54:22,872 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_permission [2022-11-20 11:54:22,872 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_permission [2022-11-20 11:54:22,872 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-11-20 11:54:22,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-11-20 11:54:22,873 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 11:54:22,873 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-11-20 11:54:22,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-11-20 11:54:22,873 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 11:54:22,875 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_symlink [2022-11-20 11:54:22,875 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_symlink [2022-11-20 11:54:22,875 INFO L130 BoogieDeclarations]: Found specification of procedure xdr_encode_time [2022-11-20 11:54:22,875 INFO L138 BoogieDeclarations]: Found implementation of procedure xdr_encode_time [2022-11-20 11:54:22,876 INFO L130 BoogieDeclarations]: Found specification of procedure NFS_I [2022-11-20 11:54:22,876 INFO L138 BoogieDeclarations]: Found implementation of procedure NFS_I [2022-11-20 11:54:22,876 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_rename_done [2022-11-20 11:54:22,876 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_rename_done [2022-11-20 11:54:22,876 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-11-20 11:54:22,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-11-20 11:54:22,876 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-11-20 11:54:22,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-11-20 11:54:22,877 INFO L130 BoogieDeclarations]: Found specification of procedure xdr_decode_time [2022-11-20 11:54:22,877 INFO L138 BoogieDeclarations]: Found implementation of procedure xdr_decode_time [2022-11-20 11:54:22,877 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_getattr [2022-11-20 11:54:22,877 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_getattr [2022-11-20 11:54:22,877 INFO L130 BoogieDeclarations]: Found specification of procedure decode_attrstat [2022-11-20 11:54:22,877 INFO L138 BoogieDeclarations]: Found implementation of procedure decode_attrstat [2022-11-20 11:54:22,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 11:54:22,891 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-20 11:54:22,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-20 11:54:22,891 INFO L130 BoogieDeclarations]: Found specification of procedure __kgid_val [2022-11-20 11:54:22,891 INFO L138 BoogieDeclarations]: Found implementation of procedure __kgid_val [2022-11-20 11:54:22,891 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_alloc_client [2022-11-20 11:54:22,891 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_alloc_client [2022-11-20 11:54:22,892 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_lock [2022-11-20 11:54:22,892 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_lock [2022-11-20 11:54:22,892 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_statfs [2022-11-20 11:54:22,892 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_statfs [2022-11-20 11:54:22,892 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_remove [2022-11-20 11:54:22,892 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_remove [2022-11-20 11:54:22,892 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_read_done [2022-11-20 11:54:22,892 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_read_done [2022-11-20 11:54:22,893 INFO L130 BoogieDeclarations]: Found specification of procedure prepare_reply_buffer [2022-11-20 11:54:22,893 INFO L138 BoogieDeclarations]: Found implementation of procedure prepare_reply_buffer [2022-11-20 11:54:22,893 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_read_setup [2022-11-20 11:54:22,894 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_read_setup [2022-11-20 11:54:22,894 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-11-20 11:54:22,894 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-11-20 11:54:22,894 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_return_delegation [2022-11-20 11:54:22,894 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_return_delegation [2022-11-20 11:54:22,894 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-20 11:54:22,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-20 11:54:22,895 INFO L130 BoogieDeclarations]: Found specification of procedure encode_fhandle [2022-11-20 11:54:22,895 INFO L138 BoogieDeclarations]: Found implementation of procedure encode_fhandle [2022-11-20 11:54:22,895 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-11-20 11:54:22,895 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-11-20 11:54:22,895 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-11-20 11:54:22,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-11-20 11:54:22,896 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_instantiate [2022-11-20 11:54:22,896 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_instantiate [2022-11-20 11:54:22,896 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_commit_setup [2022-11-20 11:54:22,896 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_commit_setup [2022-11-20 11:54:22,896 INFO L130 BoogieDeclarations]: Found specification of procedure NFS_SERVER [2022-11-20 11:54:22,896 INFO L138 BoogieDeclarations]: Found implementation of procedure NFS_SERVER [2022-11-20 11:54:22,896 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-11-20 11:54:22,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-11-20 11:54:22,897 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-11-20 11:54:22,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-11-20 11:54:22,897 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-11-20 11:54:22,897 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-11-20 11:54:22,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 11:54:22,897 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_link [2022-11-20 11:54:22,897 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_link [2022-11-20 11:54:22,898 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-11-20 11:54:22,898 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_pathconf [2022-11-20 11:54:22,898 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_pathconf [2022-11-20 11:54:22,898 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_rename [2022-11-20 11:54:22,898 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_rename [2022-11-20 11:54:22,898 INFO L130 BoogieDeclarations]: Found specification of procedure NFS_FH [2022-11-20 11:54:22,898 INFO L138 BoogieDeclarations]: Found implementation of procedure NFS_FH [2022-11-20 11:54:22,899 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-20 11:54:22,899 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-11-20 11:54:22,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-11-20 11:54:22,899 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2022-11-20 11:54:22,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2022-11-20 11:54:22,899 INFO L130 BoogieDeclarations]: Found specification of procedure decode_stat [2022-11-20 11:54:22,899 INFO L138 BoogieDeclarations]: Found implementation of procedure decode_stat [2022-11-20 11:54:22,899 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-11-20 11:54:22,900 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-11-20 11:54:22,900 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-11-20 11:54:22,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-11-20 11:54:22,900 INFO L130 BoogieDeclarations]: Found specification of procedure nfs2_xdr_enc_writeargs [2022-11-20 11:54:22,900 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs2_xdr_enc_writeargs [2022-11-20 11:54:22,900 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-11-20 11:54:22,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-11-20 11:54:22,901 INFO L130 BoogieDeclarations]: Found specification of procedure xdr_read_pages [2022-11-20 11:54:22,901 INFO L138 BoogieDeclarations]: Found implementation of procedure xdr_read_pages [2022-11-20 11:54:22,901 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_rmdir [2022-11-20 11:54:22,901 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_rmdir [2022-11-20 11:54:22,901 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-11-20 11:54:22,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-11-20 11:54:22,901 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_fattr_init [2022-11-20 11:54:22,901 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_fattr_init [2022-11-20 11:54:22,902 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_setattr [2022-11-20 11:54:22,902 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_setattr [2022-11-20 11:54:22,902 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_fsinfo [2022-11-20 11:54:22,902 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_fsinfo [2022-11-20 11:54:22,902 INFO L130 BoogieDeclarations]: Found specification of procedure print_overflow_msg [2022-11-20 11:54:22,902 INFO L138 BoogieDeclarations]: Found implementation of procedure print_overflow_msg [2022-11-20 11:54:22,902 INFO L130 BoogieDeclarations]: Found specification of procedure xdr_inline_decode [2022-11-20 11:54:22,903 INFO L138 BoogieDeclarations]: Found implementation of procedure xdr_inline_decode [2022-11-20 11:54:22,903 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_free_createdata [2022-11-20 11:54:22,903 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_free_createdata [2022-11-20 11:54:22,903 INFO L130 BoogieDeclarations]: Found specification of procedure decode_fattr [2022-11-20 11:54:22,903 INFO L138 BoogieDeclarations]: Found implementation of procedure decode_fattr [2022-11-20 11:54:22,903 INFO L130 BoogieDeclarations]: Found specification of procedure NFS_CLIENT [2022-11-20 11:54:22,903 INFO L138 BoogieDeclarations]: Found implementation of procedure NFS_CLIENT [2022-11-20 11:54:22,903 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-11-20 11:54:22,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-11-20 11:54:22,904 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_write_done [2022-11-20 11:54:22,904 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_write_done [2022-11-20 11:54:22,904 INFO L130 BoogieDeclarations]: Found specification of procedure __fswab32 [2022-11-20 11:54:22,904 INFO L138 BoogieDeclarations]: Found implementation of procedure __fswab32 [2022-11-20 11:54:22,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-20 11:54:22,904 INFO L130 BoogieDeclarations]: Found specification of procedure rpc_call_start [2022-11-20 11:54:22,904 INFO L138 BoogieDeclarations]: Found implementation of procedure rpc_call_start [2022-11-20 11:54:22,905 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-20 11:54:22,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-20 11:54:22,905 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-11-20 11:54:22,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-11-20 11:54:22,905 INFO L130 BoogieDeclarations]: Found specification of procedure nfs2_xdr_dec_attrstat [2022-11-20 11:54:22,905 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs2_xdr_dec_attrstat [2022-11-20 11:54:22,905 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_get_root [2022-11-20 11:54:22,905 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_get_root [2022-11-20 11:54:22,906 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_try_mount [2022-11-20 11:54:22,906 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_try_mount [2022-11-20 11:54:22,911 INFO L130 BoogieDeclarations]: Found specification of procedure nfs2_decode_dirent [2022-11-20 11:54:22,911 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs2_decode_dirent [2022-11-20 11:54:22,911 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_create_server [2022-11-20 11:54:22,911 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_create_server [2022-11-20 11:54:22,911 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_mknod [2022-11-20 11:54:22,911 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_mknod [2022-11-20 11:54:22,911 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~TO~int [2022-11-20 11:54:22,911 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~TO~int [2022-11-20 11:54:22,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-20 11:54:22,912 INFO L130 BoogieDeclarations]: Found specification of procedure xdr_reserve_space [2022-11-20 11:54:22,912 INFO L138 BoogieDeclarations]: Found implementation of procedure xdr_reserve_space [2022-11-20 11:54:22,912 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-11-20 11:54:22,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-11-20 11:54:22,912 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_close_context [2022-11-20 11:54:22,912 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_close_context [2022-11-20 11:54:22,912 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-11-20 11:54:22,912 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-11-20 11:54:22,912 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_init_client [2022-11-20 11:54:22,912 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_init_client [2022-11-20 11:54:22,913 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-11-20 11:54:22,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-11-20 11:54:22,913 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-20 11:54:22,913 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-20 11:54:22,913 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_unlink_done [2022-11-20 11:54:22,913 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_unlink_done [2022-11-20 11:54:22,913 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-11-20 11:54:22,913 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-11-20 11:54:22,913 INFO L130 BoogieDeclarations]: Found specification of procedure rpc_call_sync [2022-11-20 11:54:22,913 INFO L138 BoogieDeclarations]: Found implementation of procedure rpc_call_sync [2022-11-20 11:54:22,914 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-11-20 11:54:22,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-11-20 11:54:22,914 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_submount [2022-11-20 11:54:22,914 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_submount [2022-11-20 11:54:22,914 INFO L130 BoogieDeclarations]: Found specification of procedure encode_diropargs [2022-11-20 11:54:22,914 INFO L138 BoogieDeclarations]: Found implementation of procedure encode_diropargs [2022-11-20 11:54:22,914 INFO L130 BoogieDeclarations]: Found specification of procedure xdr_time_not_set [2022-11-20 11:54:22,914 INFO L138 BoogieDeclarations]: Found implementation of procedure xdr_time_not_set [2022-11-20 11:54:22,914 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-11-20 11:54:22,914 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-11-20 11:54:22,915 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-11-20 11:54:22,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-11-20 11:54:22,915 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_proc_unlink_setup [2022-11-20 11:54:22,915 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_proc_unlink_setup [2022-11-20 11:54:22,915 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-11-20 11:54:22,915 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~TO~int [2022-11-20 11:54:22,915 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_setattr [2022-11-20 11:54:22,915 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 11:54:22,915 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_mark_for_revalidate [2022-11-20 11:54:22,915 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_mark_for_revalidate [2022-11-20 11:54:22,916 INFO L130 BoogieDeclarations]: Found specification of procedure nfs_have_delegation [2022-11-20 11:54:22,916 INFO L138 BoogieDeclarations]: Found implementation of procedure nfs_have_delegation [2022-11-20 11:54:26,067 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 11:54:26,071 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 11:54:26,702 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-20 11:54:37,749 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 11:54:37,788 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 11:54:37,788 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-11-20 11:54:37,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:54:37 BoogieIcfgContainer [2022-11-20 11:54:37,796 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 11:54:37,798 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 11:54:37,799 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 11:54:37,802 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 11:54:37,809 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 11:54:07" (1/3) ... [2022-11-20 11:54:37,810 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a1ff322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:54:37, skipping insertion in model container [2022-11-20 11:54:37,810 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 11:54:21" (2/3) ... [2022-11-20 11:54:37,811 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2a1ff322 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 11:54:37, skipping insertion in model container [2022-11-20 11:54:37,811 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 11:54:37" (3/3) ... [2022-11-20 11:54:37,812 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---fs--nfs--nfsv2.ko.cil.i [2022-11-20 11:54:37,831 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 11:54:37,831 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2022-11-20 11:54:37,985 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 11:54:37,991 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@518b12e3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 11:54:37,991 INFO L358 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2022-11-20 11:54:38,011 INFO L276 IsEmpty]: Start isEmpty. Operand has 5391 states, 3395 states have (on average 1.2500736377025037) internal successors, (4244), 3748 states have internal predecessors, (4244), 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-11-20 11:54:38,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-11-20 11:54:38,021 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:54:38,022 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-11-20 11:54:38,022 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-11-20 11:54:38,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:54:38,028 INFO L85 PathProgramCache]: Analyzing trace with hash -170243191, now seen corresponding path program 1 times [2022-11-20 11:54:38,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:54:38,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1674042487] [2022-11-20 11:54:38,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:54:38,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:54:38,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:39,266 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:54:39,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:39,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 11:54:39,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:39,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 11:54:39,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:39,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 11:54:39,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:39,410 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:54:39,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:39,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 11:54:39,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:39,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-20 11:54:39,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:54:39,490 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 11:54:39,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:54:39,490 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1674042487] [2022-11-20 11:54:39,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1674042487] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:54:39,491 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:54:39,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:54:39,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1771712982] [2022-11-20 11:54:39,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:54:39,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:54:39,499 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:54:39,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:54:39,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:54:39,546 INFO L87 Difference]: Start difference. First operand has 5391 states, 3395 states have (on average 1.2500736377025037) internal successors, (4244), 3748 states have internal predecessors, (4244), 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-11-20 11:54:42,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 11:54:45,084 WARN L539 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-11-20 11:55:00,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:55:00,896 INFO L93 Difference]: Finished difference Result 10687 states and 15897 transitions. [2022-11-20 11:55:00,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:55:00,905 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-11-20 11:55:00,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:55:00,979 INFO L225 Difference]: With dead ends: 10687 [2022-11-20 11:55:00,980 INFO L226 Difference]: Without dead ends: 5250 [2022-11-20 11:55:01,024 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-20 11:55:01,030 INFO L413 NwaCegarLoop]: 6450 mSDtfsCounter, 7547 mSDsluCounter, 11493 mSDsCounter, 0 mSdLazyCounter, 7379 mSolverCounterSat, 4622 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9092 SdHoareTripleChecker+Valid, 17943 SdHoareTripleChecker+Invalid, 12001 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 4622 IncrementalHoareTripleChecker+Valid, 7379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:55:01,031 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9092 Valid, 17943 Invalid, 12001 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [4622 Valid, 7379 Invalid, 0 Unknown, 0 Unchecked, 20.1s Time] [2022-11-20 11:55:01,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5250 states. [2022-11-20 11:55:01,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5250 to 5250. [2022-11-20 11:55:01,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5250 states, 3333 states have (on average 1.231923192319232) internal successors, (4106), 3648 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-11-20 11:55:01,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5250 states to 5250 states and 7656 transitions. [2022-11-20 11:55:01,967 INFO L78 Accepts]: Start accepts. Automaton has 5250 states and 7656 transitions. Word has length 50 [2022-11-20 11:55:01,969 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:55:01,969 INFO L495 AbstractCegarLoop]: Abstraction has 5250 states and 7656 transitions. [2022-11-20 11:55:01,970 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-11-20 11:55:01,970 INFO L276 IsEmpty]: Start isEmpty. Operand 5250 states and 7656 transitions. [2022-11-20 11:55:01,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2022-11-20 11:55:01,974 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:55:01,975 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-11-20 11:55:01,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 11:55:01,975 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-11-20 11:55:01,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:55:01,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1204523555, now seen corresponding path program 1 times [2022-11-20 11:55:01,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:55:01,977 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2058749892] [2022-11-20 11:55:01,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:55:01,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:55:02,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:55:02,585 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:55:02,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:55:02,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 11:55:02,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:55:02,656 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 11:55:02,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:55:02,681 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 11:55:02,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:55:02,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:55:02,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:55:02,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 11:55:02,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:55:02,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-20 11:55:02,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:55:02,786 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 11:55:02,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:55:02,811 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 11:55:02,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:55:02,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2058749892] [2022-11-20 11:55:02,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2058749892] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:55:02,812 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:55:02,812 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:55:02,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539755276] [2022-11-20 11:55:02,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:55:02,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:55:02,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:55:02,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:55:02,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:55:02,816 INFO L87 Difference]: Start difference. First operand 5250 states and 7656 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-11-20 11:55:06,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 11:55:10,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.77s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 11:55:25,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:55:25,775 INFO L93 Difference]: Finished difference Result 5250 states and 7656 transitions. [2022-11-20 11:55:25,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:55:25,779 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-11-20 11:55:25,780 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:55:25,815 INFO L225 Difference]: With dead ends: 5250 [2022-11-20 11:55:25,815 INFO L226 Difference]: Without dead ends: 5248 [2022-11-20 11:55:25,819 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-20 11:55:25,820 INFO L413 NwaCegarLoop]: 6300 mSDtfsCounter, 7387 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 7320 mSolverCounterSat, 4498 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8917 SdHoareTripleChecker+Valid, 17509 SdHoareTripleChecker+Invalid, 11819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 7320 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.2s IncrementalHoareTripleChecker+Time [2022-11-20 11:55:25,820 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8917 Valid, 17509 Invalid, 11819 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [4498 Valid, 7320 Invalid, 1 Unknown, 0 Unchecked, 22.2s Time] [2022-11-20 11:55:25,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5248 states. [2022-11-20 11:55:26,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5248 to 5248. [2022-11-20 11:55:26,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5248 states, 3332 states have (on average 1.2316926770708283) internal successors, (4104), 3646 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-11-20 11:55:26,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5248 states to 5248 states and 7654 transitions. [2022-11-20 11:55:26,413 INFO L78 Accepts]: Start accepts. Automaton has 5248 states and 7654 transitions. Word has length 56 [2022-11-20 11:55:26,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:55:26,414 INFO L495 AbstractCegarLoop]: Abstraction has 5248 states and 7654 transitions. [2022-11-20 11:55:26,415 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-11-20 11:55:26,415 INFO L276 IsEmpty]: Start isEmpty. Operand 5248 states and 7654 transitions. [2022-11-20 11:55:26,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-11-20 11:55:26,421 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:55:26,421 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-11-20 11:55:26,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 11:55:26,423 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-11-20 11:55:26,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:55:26,425 INFO L85 PathProgramCache]: Analyzing trace with hash 1339678912, now seen corresponding path program 1 times [2022-11-20 11:55:26,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:55:26,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925937942] [2022-11-20 11:55:26,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:55:26,426 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:55:26,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:55:26,844 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:55:26,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:55:26,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 11:55:26,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:55:26,890 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 11:55:26,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:55:26,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 11:55:26,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:55:26,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:55:26,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:55:26,946 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 11:55:26,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:55:26,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-20 11:55:26,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:55:26,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 11:55:26,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:55:27,005 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-20 11:55:27,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:55:27,024 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 11:55:27,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:55:27,024 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925937942] [2022-11-20 11:55:27,025 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925937942] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:55:27,025 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:55:27,025 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:55:27,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [686512079] [2022-11-20 11:55:27,025 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:55:27,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:55:27,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:55:27,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:55:27,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:55:27,028 INFO L87 Difference]: Start difference. First operand 5248 states and 7654 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-11-20 11:55:29,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 11:55:44,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:55:44,951 INFO L93 Difference]: Finished difference Result 5248 states and 7654 transitions. [2022-11-20 11:55:44,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:55:44,955 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-11-20 11:55:44,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:55:44,984 INFO L225 Difference]: With dead ends: 5248 [2022-11-20 11:55:44,984 INFO L226 Difference]: Without dead ends: 5246 [2022-11-20 11:55:44,990 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-20 11:55:44,990 INFO L413 NwaCegarLoop]: 6300 mSDtfsCounter, 7381 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 7317 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8910 SdHoareTripleChecker+Valid, 17509 SdHoareTripleChecker+Invalid, 11815 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 7317 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:55:44,991 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8910 Valid, 17509 Invalid, 11815 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4498 Valid, 7317 Invalid, 0 Unknown, 0 Unchecked, 17.3s Time] [2022-11-20 11:55:44,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5246 states. [2022-11-20 11:55:45,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5246 to 5246. [2022-11-20 11:55:45,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5246 states, 3331 states have (on average 1.2314620234163915) internal successors, (4102), 3644 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-11-20 11:55:45,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5246 states to 5246 states and 7652 transitions. [2022-11-20 11:55:45,462 INFO L78 Accepts]: Start accepts. Automaton has 5246 states and 7652 transitions. Word has length 62 [2022-11-20 11:55:45,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:55:45,464 INFO L495 AbstractCegarLoop]: Abstraction has 5246 states and 7652 transitions. [2022-11-20 11:55:45,464 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-11-20 11:55:45,464 INFO L276 IsEmpty]: Start isEmpty. Operand 5246 states and 7652 transitions. [2022-11-20 11:55:45,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-11-20 11:55:45,469 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:55:45,469 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-11-20 11:55:45,469 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-20 11:55:45,470 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-11-20 11:55:45,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:55:45,470 INFO L85 PathProgramCache]: Analyzing trace with hash 431635452, now seen corresponding path program 1 times [2022-11-20 11:55:45,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:55:45,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048808634] [2022-11-20 11:55:45,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:55:45,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:55:45,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:55:45,940 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:55:45,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:55:45,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 11:55:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:55:45,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 11:55:45,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:55:46,007 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 11:55:46,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:55:46,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:55:46,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:55:46,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 11:55:46,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:55:46,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-20 11:55:46,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:55:46,077 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 11:55:46,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:55:46,095 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-20 11:55:46,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:55:46,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-20 11:55:46,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:55:46,137 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 11:55:46,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:55:46,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048808634] [2022-11-20 11:55:46,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048808634] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:55:46,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:55:46,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:55:46,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776661182] [2022-11-20 11:55:46,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:55:46,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:55:46,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:55:46,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:55:46,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:55:46,140 INFO L87 Difference]: Start difference. First operand 5246 states and 7652 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-11-20 11:55:49,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 11:56:06,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:56:06,498 INFO L93 Difference]: Finished difference Result 5246 states and 7652 transitions. [2022-11-20 11:56:06,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:56:06,499 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-11-20 11:56:06,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:56:06,540 INFO L225 Difference]: With dead ends: 5246 [2022-11-20 11:56:06,540 INFO L226 Difference]: Without dead ends: 5244 [2022-11-20 11:56:06,546 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-20 11:56:06,547 INFO L413 NwaCegarLoop]: 6300 mSDtfsCounter, 7375 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 7313 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8903 SdHoareTripleChecker+Valid, 17509 SdHoareTripleChecker+Invalid, 11811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 7313 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.7s IncrementalHoareTripleChecker+Time [2022-11-20 11:56:06,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8903 Valid, 17509 Invalid, 11811 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4498 Valid, 7313 Invalid, 0 Unknown, 0 Unchecked, 19.7s Time] [2022-11-20 11:56:06,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5244 states. [2022-11-20 11:56:07,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5244 to 5244. [2022-11-20 11:56:07,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5244 states, 3330 states have (on average 1.2312312312312312) internal successors, (4100), 3642 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-11-20 11:56:07,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5244 states to 5244 states and 7650 transitions. [2022-11-20 11:56:07,121 INFO L78 Accepts]: Start accepts. Automaton has 5244 states and 7650 transitions. Word has length 68 [2022-11-20 11:56:07,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:56:07,123 INFO L495 AbstractCegarLoop]: Abstraction has 5244 states and 7650 transitions. [2022-11-20 11:56:07,123 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-11-20 11:56:07,124 INFO L276 IsEmpty]: Start isEmpty. Operand 5244 states and 7650 transitions. [2022-11-20 11:56:07,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2022-11-20 11:56:07,128 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:56:07,129 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-11-20 11:56:07,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-20 11:56:07,129 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-11-20 11:56:07,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:56:07,130 INFO L85 PathProgramCache]: Analyzing trace with hash 749334112, now seen corresponding path program 1 times [2022-11-20 11:56:07,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:56:07,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714783138] [2022-11-20 11:56:07,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:56:07,130 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:56:07,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:56:07,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:56:07,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:56:07,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 11:56:07,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:56:07,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 11:56:07,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:56:07,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 11:56:07,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:56:07,646 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:56:07,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:56:07,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 11:56:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:56:07,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-20 11:56:07,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:56:07,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 11:56:07,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:56:07,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-20 11:56:07,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:56:07,721 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-20 11:56:07,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:56:07,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 11:56:07,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:56:07,756 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 11:56:07,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:56:07,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714783138] [2022-11-20 11:56:07,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714783138] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:56:07,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:56:07,757 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:56:07,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995753500] [2022-11-20 11:56:07,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:56:07,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:56:07,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:56:07,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:56:07,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:56:07,760 INFO L87 Difference]: Start difference. First operand 5244 states and 7650 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-11-20 11:56:10,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 11:56:13,909 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 11:56:27,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:56:27,261 INFO L93 Difference]: Finished difference Result 5299 states and 7703 transitions. [2022-11-20 11:56:27,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 11:56:27,261 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-11-20 11:56:27,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:56:27,292 INFO L225 Difference]: With dead ends: 5299 [2022-11-20 11:56:27,293 INFO L226 Difference]: Without dead ends: 5297 [2022-11-20 11:56:27,297 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-20 11:56:27,298 INFO L413 NwaCegarLoop]: 6302 mSDtfsCounter, 7400 mSDsluCounter, 11211 mSDsCounter, 0 mSdLazyCounter, 7430 mSolverCounterSat, 4508 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8927 SdHoareTripleChecker+Valid, 17513 SdHoareTripleChecker+Invalid, 11939 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4508 IncrementalHoareTripleChecker+Valid, 7430 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.8s IncrementalHoareTripleChecker+Time [2022-11-20 11:56:27,299 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8927 Valid, 17513 Invalid, 11939 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4508 Valid, 7430 Invalid, 1 Unknown, 0 Unchecked, 18.8s Time] [2022-11-20 11:56:27,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5297 states. [2022-11-20 11:56:27,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5297 to 5293. [2022-11-20 11:56:27,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5293 states, 3365 states have (on average 1.2294205052005944) internal successors, (4137), 3676 states have internal predecessors, (4137), 1782 states have call successors, (1782), 127 states have call predecessors, (1782), 126 states have return successors, (1780), 1516 states have call predecessors, (1780), 1780 states have call successors, (1780) [2022-11-20 11:56:27,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5293 states to 5293 states and 7699 transitions. [2022-11-20 11:56:27,894 INFO L78 Accepts]: Start accepts. Automaton has 5293 states and 7699 transitions. Word has length 74 [2022-11-20 11:56:27,895 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:56:27,895 INFO L495 AbstractCegarLoop]: Abstraction has 5293 states and 7699 transitions. [2022-11-20 11:56:27,895 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-11-20 11:56:27,895 INFO L276 IsEmpty]: Start isEmpty. Operand 5293 states and 7699 transitions. [2022-11-20 11:56:27,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-11-20 11:56:27,896 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:56:27,897 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-11-20 11:56:27,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-20 11:56:27,897 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-11-20 11:56:27,897 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:56:27,898 INFO L85 PathProgramCache]: Analyzing trace with hash 308375828, now seen corresponding path program 1 times [2022-11-20 11:56:27,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:56:27,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394061185] [2022-11-20 11:56:27,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:56:27,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:56:27,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:56:28,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:56:28,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:56:28,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 11:56:28,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:56:28,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 11:56:28,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:56:28,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 11:56:28,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:56:28,348 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:56:28,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:56:28,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 11:56:28,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:56:28,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-20 11:56:28,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:56:28,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 11:56:28,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:56:28,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-20 11:56:28,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:56:28,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-20 11:56:28,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:56:28,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 11:56:28,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:56:28,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-20 11:56:28,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:56:28,473 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 11:56:28,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:56:28,474 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394061185] [2022-11-20 11:56:28,474 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [394061185] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:56:28,474 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:56:28,474 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:56:28,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378453477] [2022-11-20 11:56:28,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:56:28,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:56:28,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:56:28,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:56:28,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:56:28,476 INFO L87 Difference]: Start difference. First operand 5293 states and 7699 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-11-20 11:56:46,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:56:46,498 INFO L93 Difference]: Finished difference Result 5293 states and 7699 transitions. [2022-11-20 11:56:46,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:56:46,498 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-11-20 11:56:46,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:56:46,521 INFO L225 Difference]: With dead ends: 5293 [2022-11-20 11:56:46,522 INFO L226 Difference]: Without dead ends: 5291 [2022-11-20 11:56:46,526 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-11-20 11:56:46,527 INFO L413 NwaCegarLoop]: 6300 mSDtfsCounter, 7363 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 7305 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 15.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8889 SdHoareTripleChecker+Valid, 17509 SdHoareTripleChecker+Invalid, 11803 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 7305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.3s IncrementalHoareTripleChecker+Time [2022-11-20 11:56:46,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8889 Valid, 17509 Invalid, 11803 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4498 Valid, 7305 Invalid, 0 Unknown, 0 Unchecked, 17.3s Time] [2022-11-20 11:56:46,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5291 states. [2022-11-20 11:56:47,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5291 to 5291. [2022-11-20 11:56:47,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5291 states, 3364 states have (on average 1.2291914387633769) internal successors, (4135), 3674 states have internal predecessors, (4135), 1782 states have call successors, (1782), 127 states have call predecessors, (1782), 126 states have return successors, (1780), 1516 states have call predecessors, (1780), 1780 states have call successors, (1780) [2022-11-20 11:56:47,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5291 states to 5291 states and 7697 transitions. [2022-11-20 11:56:47,097 INFO L78 Accepts]: Start accepts. Automaton has 5291 states and 7697 transitions. Word has length 80 [2022-11-20 11:56:47,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:56:47,098 INFO L495 AbstractCegarLoop]: Abstraction has 5291 states and 7697 transitions. [2022-11-20 11:56:47,098 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-11-20 11:56:47,098 INFO L276 IsEmpty]: Start isEmpty. Operand 5291 states and 7697 transitions. [2022-11-20 11:56:47,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-20 11:56:47,103 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:56:47,103 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 11:56:47,103 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-20 11:56:47,104 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-11-20 11:56:47,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:56:47,104 INFO L85 PathProgramCache]: Analyzing trace with hash 731614265, now seen corresponding path program 1 times [2022-11-20 11:56:47,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:56:47,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1128850170] [2022-11-20 11:56:47,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:56:47,105 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:56:47,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:56:47,525 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:56:47,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:56:47,547 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 11:56:47,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:56:47,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 11:56:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:56:47,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 11:56:47,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:56:47,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:56:47,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:56:47,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 11:56:47,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:56:47,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-20 11:56:47,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:56:47,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 11:56:47,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:56:47,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-20 11:56:47,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:56:47,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-20 11:56:47,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:56:47,701 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 11:56:47,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:56:47,717 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-20 11:56:47,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:56:47,734 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-20 11:56:47,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:56:47,752 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 11:56:47,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:56:47,752 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1128850170] [2022-11-20 11:56:47,752 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1128850170] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:56:47,753 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:56:47,753 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:56:47,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1621543112] [2022-11-20 11:56:47,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:56:47,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:56:47,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:56:47,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:56:47,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:56:47,756 INFO L87 Difference]: Start difference. First operand 5291 states and 7697 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-11-20 11:56:50,374 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 11:57:06,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:57:06,620 INFO L93 Difference]: Finished difference Result 5291 states and 7697 transitions. [2022-11-20 11:57:06,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:57:06,623 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-11-20 11:57:06,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:57:06,647 INFO L225 Difference]: With dead ends: 5291 [2022-11-20 11:57:06,647 INFO L226 Difference]: Without dead ends: 5289 [2022-11-20 11:57:06,651 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-20 11:57:06,652 INFO L413 NwaCegarLoop]: 6300 mSDtfsCounter, 7357 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 7301 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8882 SdHoareTripleChecker+Valid, 17509 SdHoareTripleChecker+Invalid, 11799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 7301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 18.0s IncrementalHoareTripleChecker+Time [2022-11-20 11:57:06,652 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8882 Valid, 17509 Invalid, 11799 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4498 Valid, 7301 Invalid, 0 Unknown, 0 Unchecked, 18.0s Time] [2022-11-20 11:57:06,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5289 states. [2022-11-20 11:57:07,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5289 to 5289. [2022-11-20 11:57:07,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5289 states, 3363 states have (on average 1.2289622360987214) internal successors, (4133), 3672 states have internal predecessors, (4133), 1782 states have call successors, (1782), 127 states have call predecessors, (1782), 126 states have return successors, (1780), 1516 states have call predecessors, (1780), 1780 states have call successors, (1780) [2022-11-20 11:57:07,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5289 states to 5289 states and 7695 transitions. [2022-11-20 11:57:07,245 INFO L78 Accepts]: Start accepts. Automaton has 5289 states and 7695 transitions. Word has length 86 [2022-11-20 11:57:07,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:57:07,245 INFO L495 AbstractCegarLoop]: Abstraction has 5289 states and 7695 transitions. [2022-11-20 11:57:07,246 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-11-20 11:57:07,246 INFO L276 IsEmpty]: Start isEmpty. Operand 5289 states and 7695 transitions. [2022-11-20 11:57:07,249 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2022-11-20 11:57:07,250 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:57:07,250 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-11-20 11:57:07,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-20 11:57:07,250 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-11-20 11:57:07,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:57:07,251 INFO L85 PathProgramCache]: Analyzing trace with hash 72546525, now seen corresponding path program 1 times [2022-11-20 11:57:07,252 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:57:07,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554627685] [2022-11-20 11:57:07,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:57:07,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:57:07,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:07,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:57:07,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:07,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 11:57:07,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:07,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 11:57:07,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:07,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 11:57:07,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:07,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:57:07,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:07,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 11:57:07,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:07,813 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-20 11:57:07,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:07,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 11:57:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:07,845 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-20 11:57:07,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:07,861 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-20 11:57:07,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:07,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 11:57:07,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:07,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-20 11:57:07,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:07,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-20 11:57:07,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:07,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-20 11:57:07,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:07,939 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 11:57:07,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:57:07,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554627685] [2022-11-20 11:57:07,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554627685] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:57:07,940 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:57:07,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:57:07,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243022953] [2022-11-20 11:57:07,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:57:07,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:57:07,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:57:07,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:57:07,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:57:07,942 INFO L87 Difference]: Start difference. First operand 5289 states and 7695 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-11-20 11:57:26,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:57:26,552 INFO L93 Difference]: Finished difference Result 5289 states and 7695 transitions. [2022-11-20 11:57:26,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:57:26,553 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-11-20 11:57:26,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:57:26,574 INFO L225 Difference]: With dead ends: 5289 [2022-11-20 11:57:26,575 INFO L226 Difference]: Without dead ends: 5287 [2022-11-20 11:57:26,578 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-20 11:57:26,579 INFO L413 NwaCegarLoop]: 6300 mSDtfsCounter, 7355 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 7293 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 16.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8879 SdHoareTripleChecker+Valid, 17509 SdHoareTripleChecker+Invalid, 11791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 7293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 17.8s IncrementalHoareTripleChecker+Time [2022-11-20 11:57:26,579 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8879 Valid, 17509 Invalid, 11791 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4498 Valid, 7293 Invalid, 0 Unknown, 0 Unchecked, 17.8s Time] [2022-11-20 11:57:26,586 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5287 states. [2022-11-20 11:57:27,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5287 to 5287. [2022-11-20 11:57:27,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5287 states, 3362 states have (on average 1.2287328970850684) internal successors, (4131), 3670 states have internal predecessors, (4131), 1782 states have call successors, (1782), 127 states have call predecessors, (1782), 126 states have return successors, (1780), 1516 states have call predecessors, (1780), 1780 states have call successors, (1780) [2022-11-20 11:57:27,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5287 states to 5287 states and 7693 transitions. [2022-11-20 11:57:27,184 INFO L78 Accepts]: Start accepts. Automaton has 5287 states and 7693 transitions. Word has length 92 [2022-11-20 11:57:27,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:57:27,185 INFO L495 AbstractCegarLoop]: Abstraction has 5287 states and 7693 transitions. [2022-11-20 11:57:27,185 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-11-20 11:57:27,185 INFO L276 IsEmpty]: Start isEmpty. Operand 5287 states and 7693 transitions. [2022-11-20 11:57:27,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-11-20 11:57:27,187 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:57:27,187 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-11-20 11:57:27,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-20 11:57:27,187 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-11-20 11:57:27,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:57:27,188 INFO L85 PathProgramCache]: Analyzing trace with hash 997867712, now seen corresponding path program 1 times [2022-11-20 11:57:27,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:57:27,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468888351] [2022-11-20 11:57:27,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:57:27,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:57:27,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:27,583 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:57:27,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:27,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 11:57:27,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:27,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 11:57:27,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:27,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 11:57:27,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:27,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:57:27,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:27,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 11:57:27,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:27,676 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-20 11:57:27,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:27,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 11:57:27,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:27,708 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-20 11:57:27,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:27,725 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-20 11:57:27,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:27,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 11:57:27,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:27,755 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-20 11:57:27,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:27,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-20 11:57:27,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:27,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-20 11:57:27,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:27,800 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 11:57:27,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:57:27,800 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468888351] [2022-11-20 11:57:27,800 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468888351] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:57:27,800 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:57:27,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:57:27,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817677791] [2022-11-20 11:57:27,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:57:27,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:57:27,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:57:27,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:57:27,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:57:27,803 INFO L87 Difference]: Start difference. First operand 5287 states and 7693 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-11-20 11:57:30,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 11:57:32,912 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 11:57:49,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:57:49,465 INFO L93 Difference]: Finished difference Result 5287 states and 7693 transitions. [2022-11-20 11:57:49,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:57:49,466 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-11-20 11:57:49,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:57:49,490 INFO L225 Difference]: With dead ends: 5287 [2022-11-20 11:57:49,490 INFO L226 Difference]: Without dead ends: 5285 [2022-11-20 11:57:49,494 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-20 11:57:49,495 INFO L413 NwaCegarLoop]: 6300 mSDtfsCounter, 7343 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 7292 mSolverCounterSat, 4498 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 19.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8867 SdHoareTripleChecker+Valid, 17509 SdHoareTripleChecker+Invalid, 11791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 7292 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.8s IncrementalHoareTripleChecker+Time [2022-11-20 11:57:49,495 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8867 Valid, 17509 Invalid, 11791 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4498 Valid, 7292 Invalid, 1 Unknown, 0 Unchecked, 20.8s Time] [2022-11-20 11:57:49,503 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5285 states. [2022-11-20 11:57:50,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5285 to 5285. [2022-11-20 11:57:50,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5285 states, 3361 states have (on average 1.228503421600714) internal successors, (4129), 3668 states have internal predecessors, (4129), 1782 states have call successors, (1782), 127 states have call predecessors, (1782), 126 states have return successors, (1780), 1516 states have call predecessors, (1780), 1780 states have call successors, (1780) [2022-11-20 11:57:50,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5285 states to 5285 states and 7691 transitions. [2022-11-20 11:57:50,136 INFO L78 Accepts]: Start accepts. Automaton has 5285 states and 7691 transitions. Word has length 94 [2022-11-20 11:57:50,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:57:50,137 INFO L495 AbstractCegarLoop]: Abstraction has 5285 states and 7691 transitions. [2022-11-20 11:57:50,137 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-11-20 11:57:50,137 INFO L276 IsEmpty]: Start isEmpty. Operand 5285 states and 7691 transitions. [2022-11-20 11:57:50,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-11-20 11:57:50,139 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:57:50,139 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-11-20 11:57:50,139 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-20 11:57:50,140 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-11-20 11:57:50,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:57:50,141 INFO L85 PathProgramCache]: Analyzing trace with hash -1738160404, now seen corresponding path program 1 times [2022-11-20 11:57:50,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:57:50,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [932424689] [2022-11-20 11:57:50,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:57:50,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:57:50,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:50,544 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:57:50,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:50,563 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 11:57:50,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:50,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 11:57:50,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:50,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 11:57:50,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:50,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:57:50,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:50,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 11:57:50,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:50,642 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-20 11:57:50,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:50,657 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 11:57:50,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:50,675 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-20 11:57:50,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:50,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-20 11:57:50,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:50,709 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 11:57:50,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:50,724 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-20 11:57:50,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:50,739 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-20 11:57:50,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:50,753 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-20 11:57:50,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:50,768 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-20 11:57:50,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:57:50,786 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 11:57:50,786 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:57:50,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [932424689] [2022-11-20 11:57:50,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [932424689] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:57:50,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:57:50,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:57:50,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1243919639] [2022-11-20 11:57:50,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:57:50,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:57:50,788 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:57:50,788 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:57:50,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:57:50,789 INFO L87 Difference]: Start difference. First operand 5285 states and 7691 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-11-20 11:57:53,344 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 11:57:55,353 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 11:58:10,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:58:10,806 INFO L93 Difference]: Finished difference Result 5285 states and 7691 transitions. [2022-11-20 11:58:10,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:58:10,806 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-11-20 11:58:10,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:58:10,824 INFO L225 Difference]: With dead ends: 5285 [2022-11-20 11:58:10,824 INFO L226 Difference]: Without dead ends: 5283 [2022-11-20 11:58:10,828 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-11-20 11:58:10,829 INFO L413 NwaCegarLoop]: 6300 mSDtfsCounter, 7339 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 7288 mSolverCounterSat, 4498 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8862 SdHoareTripleChecker+Valid, 17509 SdHoareTripleChecker+Invalid, 11787 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 7288 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.1s IncrementalHoareTripleChecker+Time [2022-11-20 11:58:10,829 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8862 Valid, 17509 Invalid, 11787 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4498 Valid, 7288 Invalid, 1 Unknown, 0 Unchecked, 19.1s Time] [2022-11-20 11:58:10,837 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5283 states. [2022-11-20 11:58:11,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5283 to 5283. [2022-11-20 11:58:11,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5283 states, 3360 states have (on average 1.2282738095238095) internal successors, (4127), 3666 states have internal predecessors, (4127), 1782 states have call successors, (1782), 127 states have call predecessors, (1782), 126 states have return successors, (1780), 1516 states have call predecessors, (1780), 1780 states have call successors, (1780) [2022-11-20 11:58:11,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5283 states to 5283 states and 7689 transitions. [2022-11-20 11:58:11,516 INFO L78 Accepts]: Start accepts. Automaton has 5283 states and 7689 transitions. Word has length 100 [2022-11-20 11:58:11,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:58:11,517 INFO L495 AbstractCegarLoop]: Abstraction has 5283 states and 7689 transitions. [2022-11-20 11:58:11,517 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-11-20 11:58:11,517 INFO L276 IsEmpty]: Start isEmpty. Operand 5283 states and 7689 transitions. [2022-11-20 11:58:11,518 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-11-20 11:58:11,519 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:58:11,519 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-11-20 11:58:11,519 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-20 11:58:11,519 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-11-20 11:58:11,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:58:11,520 INFO L85 PathProgramCache]: Analyzing trace with hash 966811042, now seen corresponding path program 1 times [2022-11-20 11:58:11,520 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:58:11,520 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034810109] [2022-11-20 11:58:11,520 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:58:11,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:58:11,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:11,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:58:11,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:11,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 11:58:11,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:11,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 11:58:11,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:11,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 11:58:11,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:11,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:58:11,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:11,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 11:58:11,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:11,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-20 11:58:11,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:11,992 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 11:58:11,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:12,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-20 11:58:12,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:12,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-20 11:58:12,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:12,040 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 11:58:12,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:12,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-20 11:58:12,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:12,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-20 11:58:12,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:12,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-20 11:58:12,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:12,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-20 11:58:12,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:12,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-20 11:58:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:12,138 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 11:58:12,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:58:12,139 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034810109] [2022-11-20 11:58:12,139 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034810109] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:58:12,139 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:58:12,139 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:58:12,140 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069093690] [2022-11-20 11:58:12,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:58:12,140 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:58:12,140 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:58:12,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:58:12,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:58:12,142 INFO L87 Difference]: Start difference. First operand 5283 states and 7689 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-11-20 11:58:15,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 11:58:17,109 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 11:58:32,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:58:32,792 INFO L93 Difference]: Finished difference Result 5283 states and 7689 transitions. [2022-11-20 11:58:32,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:58:32,792 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-11-20 11:58:32,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:58:32,810 INFO L225 Difference]: With dead ends: 5283 [2022-11-20 11:58:32,811 INFO L226 Difference]: Without dead ends: 5281 [2022-11-20 11:58:32,814 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-20 11:58:32,814 INFO L413 NwaCegarLoop]: 6300 mSDtfsCounter, 7333 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 7285 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8855 SdHoareTripleChecker+Valid, 17509 SdHoareTripleChecker+Invalid, 11783 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 7285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.7s IncrementalHoareTripleChecker+Time [2022-11-20 11:58:32,815 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8855 Valid, 17509 Invalid, 11783 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4498 Valid, 7285 Invalid, 0 Unknown, 0 Unchecked, 19.7s Time] [2022-11-20 11:58:32,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5281 states. [2022-11-20 11:58:33,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5281 to 5281. [2022-11-20 11:58:33,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5281 states, 3359 states have (on average 1.2280440607323608) internal successors, (4125), 3664 states have internal predecessors, (4125), 1782 states have call successors, (1782), 127 states have call predecessors, (1782), 126 states have return successors, (1780), 1516 states have call predecessors, (1780), 1780 states have call successors, (1780) [2022-11-20 11:58:33,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5281 states to 5281 states and 7687 transitions. [2022-11-20 11:58:33,496 INFO L78 Accepts]: Start accepts. Automaton has 5281 states and 7687 transitions. Word has length 106 [2022-11-20 11:58:33,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:58:33,497 INFO L495 AbstractCegarLoop]: Abstraction has 5281 states and 7687 transitions. [2022-11-20 11:58:33,497 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-11-20 11:58:33,497 INFO L276 IsEmpty]: Start isEmpty. Operand 5281 states and 7687 transitions. [2022-11-20 11:58:33,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2022-11-20 11:58:33,500 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:58:33,500 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-11-20 11:58:33,500 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-20 11:58:33,500 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-11-20 11:58:33,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:58:33,501 INFO L85 PathProgramCache]: Analyzing trace with hash 1743923214, now seen corresponding path program 1 times [2022-11-20 11:58:33,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:58:33,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [118009759] [2022-11-20 11:58:33,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:58:33,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:58:33,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:33,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:58:33,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:33,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 11:58:33,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:33,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 11:58:33,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:33,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 11:58:33,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:33,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:58:33,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:33,953 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 11:58:33,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:33,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-20 11:58:33,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:33,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 11:58:33,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:33,998 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-20 11:58:34,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:34,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-20 11:58:34,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:34,028 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 11:58:34,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:34,042 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-20 11:58:34,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:34,056 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-20 11:58:34,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:34,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-20 11:58:34,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:34,085 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-20 11:58:34,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:34,103 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-20 11:58:34,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:34,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-20 11:58:34,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:34,134 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 11:58:34,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:58:34,135 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [118009759] [2022-11-20 11:58:34,135 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [118009759] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:58:34,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:58:34,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:58:34,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141244804] [2022-11-20 11:58:34,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:58:34,136 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:58:34,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:58:34,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:58:34,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:58:34,137 INFO L87 Difference]: Start difference. First operand 5281 states and 7687 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-11-20 11:58:36,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 11:58:38,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 11:58:55,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:58:55,687 INFO L93 Difference]: Finished difference Result 5281 states and 7687 transitions. [2022-11-20 11:58:55,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:58:55,688 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-11-20 11:58:55,688 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:58:55,701 INFO L225 Difference]: With dead ends: 5281 [2022-11-20 11:58:55,701 INFO L226 Difference]: Without dead ends: 5279 [2022-11-20 11:58:55,703 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-20 11:58:55,704 INFO L413 NwaCegarLoop]: 6300 mSDtfsCounter, 7327 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 7280 mSolverCounterSat, 4498 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 18.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8848 SdHoareTripleChecker+Valid, 17509 SdHoareTripleChecker+Invalid, 11779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 7280 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.5s IncrementalHoareTripleChecker+Time [2022-11-20 11:58:55,704 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8848 Valid, 17509 Invalid, 11779 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4498 Valid, 7280 Invalid, 1 Unknown, 0 Unchecked, 20.5s Time] [2022-11-20 11:58:55,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5279 states. [2022-11-20 11:58:56,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5279 to 5279. [2022-11-20 11:58:56,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5279 states, 3358 states have (on average 1.2278141751042286) internal successors, (4123), 3662 states have internal predecessors, (4123), 1782 states have call successors, (1782), 127 states have call predecessors, (1782), 126 states have return successors, (1780), 1516 states have call predecessors, (1780), 1780 states have call successors, (1780) [2022-11-20 11:58:56,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5279 states to 5279 states and 7685 transitions. [2022-11-20 11:58:56,323 INFO L78 Accepts]: Start accepts. Automaton has 5279 states and 7685 transitions. Word has length 112 [2022-11-20 11:58:56,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:58:56,323 INFO L495 AbstractCegarLoop]: Abstraction has 5279 states and 7685 transitions. [2022-11-20 11:58:56,324 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-11-20 11:58:56,324 INFO L276 IsEmpty]: Start isEmpty. Operand 5279 states and 7685 transitions. [2022-11-20 11:58:56,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2022-11-20 11:58:56,326 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:58:56,326 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-11-20 11:58:56,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-20 11:58:56,326 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-11-20 11:58:56,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:58:56,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1474942881, now seen corresponding path program 1 times [2022-11-20 11:58:56,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:58:56,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572050110] [2022-11-20 11:58:56,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:58:56,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:58:56,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:56,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:58:56,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:56,742 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 11:58:56,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:56,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 11:58:56,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:56,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 11:58:56,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:56,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:58:56,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:56,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 11:58:56,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:56,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-20 11:58:56,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:56,840 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 11:58:56,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:56,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-20 11:58:56,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:56,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-20 11:58:56,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:56,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 11:58:56,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:56,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-20 11:58:56,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:56,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-20 11:58:56,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:56,932 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-20 11:58:56,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:56,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-20 11:58:56,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:56,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-20 11:58:56,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:56,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-20 11:58:56,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:57,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-20 11:58:57,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:58:57,068 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 11:58:57,068 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:58:57,068 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572050110] [2022-11-20 11:58:57,069 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572050110] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:58:57,069 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:58:57,069 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:58:57,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689956984] [2022-11-20 11:58:57,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:58:57,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:58:57,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:58:57,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:58:57,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:58:57,071 INFO L87 Difference]: Start difference. First operand 5279 states and 7685 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-11-20 11:58:59,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 11:59:01,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 11:59:19,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:59:19,884 INFO L93 Difference]: Finished difference Result 5279 states and 7685 transitions. [2022-11-20 11:59:19,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:59:19,886 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-11-20 11:59:19,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:59:19,902 INFO L225 Difference]: With dead ends: 5279 [2022-11-20 11:59:19,902 INFO L226 Difference]: Without dead ends: 5277 [2022-11-20 11:59:19,904 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-20 11:59:19,905 INFO L413 NwaCegarLoop]: 6300 mSDtfsCounter, 7321 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 7277 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8841 SdHoareTripleChecker+Valid, 17509 SdHoareTripleChecker+Invalid, 11775 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 7277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.7s IncrementalHoareTripleChecker+Time [2022-11-20 11:59:19,905 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8841 Valid, 17509 Invalid, 11775 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4498 Valid, 7277 Invalid, 0 Unknown, 0 Unchecked, 21.7s Time] [2022-11-20 11:59:19,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5277 states. [2022-11-20 11:59:20,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5277 to 5277. [2022-11-20 11:59:20,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5277 states, 3357 states have (on average 1.2275841525171285) internal successors, (4121), 3660 states have internal predecessors, (4121), 1782 states have call successors, (1782), 127 states have call predecessors, (1782), 126 states have return successors, (1780), 1516 states have call predecessors, (1780), 1780 states have call successors, (1780) [2022-11-20 11:59:20,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5277 states to 5277 states and 7683 transitions. [2022-11-20 11:59:20,522 INFO L78 Accepts]: Start accepts. Automaton has 5277 states and 7683 transitions. Word has length 118 [2022-11-20 11:59:20,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:59:20,523 INFO L495 AbstractCegarLoop]: Abstraction has 5277 states and 7683 transitions. [2022-11-20 11:59:20,523 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-11-20 11:59:20,523 INFO L276 IsEmpty]: Start isEmpty. Operand 5277 states and 7683 transitions. [2022-11-20 11:59:20,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2022-11-20 11:59:20,525 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:59:20,525 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-11-20 11:59:20,525 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-20 11:59:20,526 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-11-20 11:59:20,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:59:20,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1432693425, now seen corresponding path program 1 times [2022-11-20 11:59:20,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:59:20,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111369098] [2022-11-20 11:59:20,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:59:20,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:59:20,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:59:20,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:59:20,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:59:21,004 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 11:59:21,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:59:21,029 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 11:59:21,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:59:21,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 11:59:21,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:59:21,071 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:59:21,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:59:21,082 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 11:59:21,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:59:21,100 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-20 11:59:21,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:59:21,118 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 11:59:21,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:59:21,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-20 11:59:21,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:59:21,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-20 11:59:21,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:59:21,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 11:59:21,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:59:21,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-20 11:59:21,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:59:21,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-20 11:59:21,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:59:21,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-20 11:59:21,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:59:21,239 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-20 11:59:21,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:59:21,261 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-20 11:59:21,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:59:21,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-20 11:59:21,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:59:21,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-20 11:59:21,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:59:21,311 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-20 11:59:21,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:59:21,329 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 11:59:21,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:59:21,329 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111369098] [2022-11-20 11:59:21,329 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111369098] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:59:21,330 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:59:21,330 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:59:21,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303756534] [2022-11-20 11:59:21,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:59:21,331 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:59:21,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:59:21,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:59:21,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:59:21,332 INFO L87 Difference]: Start difference. First operand 5277 states and 7683 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-11-20 11:59:23,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 11:59:25,730 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 11:59:33,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 11:59:44,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 11:59:44,871 INFO L93 Difference]: Finished difference Result 5277 states and 7683 transitions. [2022-11-20 11:59:44,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 11:59:44,872 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-11-20 11:59:44,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 11:59:44,889 INFO L225 Difference]: With dead ends: 5277 [2022-11-20 11:59:44,890 INFO L226 Difference]: Without dead ends: 5275 [2022-11-20 11:59:44,893 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-20 11:59:44,893 INFO L413 NwaCegarLoop]: 6300 mSDtfsCounter, 7315 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 7272 mSolverCounterSat, 4498 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8834 SdHoareTripleChecker+Valid, 17509 SdHoareTripleChecker+Invalid, 11771 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 7272 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.4s IncrementalHoareTripleChecker+Time [2022-11-20 11:59:44,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8834 Valid, 17509 Invalid, 11771 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4498 Valid, 7272 Invalid, 1 Unknown, 0 Unchecked, 22.4s Time] [2022-11-20 11:59:44,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5275 states. [2022-11-20 11:59:45,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5275 to 5275. [2022-11-20 11:59:45,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5275 states, 3356 states have (on average 1.2273539928486292) internal successors, (4119), 3658 states have internal predecessors, (4119), 1782 states have call successors, (1782), 127 states have call predecessors, (1782), 126 states have return successors, (1780), 1516 states have call predecessors, (1780), 1780 states have call successors, (1780) [2022-11-20 11:59:45,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5275 states to 5275 states and 7681 transitions. [2022-11-20 11:59:45,458 INFO L78 Accepts]: Start accepts. Automaton has 5275 states and 7681 transitions. Word has length 124 [2022-11-20 11:59:45,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 11:59:45,458 INFO L495 AbstractCegarLoop]: Abstraction has 5275 states and 7681 transitions. [2022-11-20 11:59:45,459 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-11-20 11:59:45,459 INFO L276 IsEmpty]: Start isEmpty. Operand 5275 states and 7681 transitions. [2022-11-20 11:59:45,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-11-20 11:59:45,460 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 11:59:45,461 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-11-20 11:59:45,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-20 11:59:45,461 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-11-20 11:59:45,462 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 11:59:45,462 INFO L85 PathProgramCache]: Analyzing trace with hash 1544840903, now seen corresponding path program 1 times [2022-11-20 11:59:45,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 11:59:45,462 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901689434] [2022-11-20 11:59:45,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 11:59:45,463 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 11:59:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:59:45,897 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 11:59:45,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:59:45,927 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 11:59:45,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:59:45,952 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 11:59:45,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:59:45,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 11:59:45,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:59:46,001 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 11:59:46,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:59:46,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 11:59:46,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:59:46,031 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-20 11:59:46,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:59:46,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 11:59:46,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:59:46,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-20 11:59:46,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:59:46,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-20 11:59:46,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:59:46,101 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 11:59:46,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:59:46,121 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-20 11:59:46,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:59:46,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-20 11:59:46,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:59:46,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-20 11:59:46,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:59:46,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-20 11:59:46,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:59:46,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-20 11:59:46,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:59:46,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-20 11:59:46,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:59:46,227 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-20 11:59:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:59:46,244 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-20 11:59:46,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:59:46,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-20 11:59:46,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 11:59:46,275 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 11:59:46,275 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 11:59:46,275 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901689434] [2022-11-20 11:59:46,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1901689434] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 11:59:46,276 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 11:59:46,276 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 11:59:46,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1534396425] [2022-11-20 11:59:46,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 11:59:46,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 11:59:46,277 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 11:59:46,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 11:59:46,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 11:59:46,278 INFO L87 Difference]: Start difference. First operand 5275 states and 7681 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-11-20 11:59:48,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 11:59:51,090 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 12:00:06,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:00:06,549 INFO L93 Difference]: Finished difference Result 5275 states and 7681 transitions. [2022-11-20 12:00:06,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:00:06,550 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-11-20 12:00:06,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:00:06,571 INFO L225 Difference]: With dead ends: 5275 [2022-11-20 12:00:06,571 INFO L226 Difference]: Without dead ends: 5273 [2022-11-20 12:00:06,575 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:00:06,576 INFO L413 NwaCegarLoop]: 6300 mSDtfsCounter, 7309 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 7269 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8827 SdHoareTripleChecker+Valid, 17509 SdHoareTripleChecker+Invalid, 11767 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 7269 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.0s IncrementalHoareTripleChecker+Time [2022-11-20 12:00:06,576 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8827 Valid, 17509 Invalid, 11767 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4498 Valid, 7269 Invalid, 0 Unknown, 0 Unchecked, 19.0s Time] [2022-11-20 12:00:06,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5273 states. [2022-11-20 12:00:07,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5273 to 5273. [2022-11-20 12:00:07,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5273 states, 3355 states have (on average 1.227123695976155) internal successors, (4117), 3656 states have internal predecessors, (4117), 1782 states have call successors, (1782), 127 states have call predecessors, (1782), 126 states have return successors, (1780), 1516 states have call predecessors, (1780), 1780 states have call successors, (1780) [2022-11-20 12:00:07,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5273 states to 5273 states and 7679 transitions. [2022-11-20 12:00:07,292 INFO L78 Accepts]: Start accepts. Automaton has 5273 states and 7679 transitions. Word has length 130 [2022-11-20 12:00:07,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:00:07,292 INFO L495 AbstractCegarLoop]: Abstraction has 5273 states and 7679 transitions. [2022-11-20 12:00:07,292 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-11-20 12:00:07,292 INFO L276 IsEmpty]: Start isEmpty. Operand 5273 states and 7679 transitions. [2022-11-20 12:00:07,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2022-11-20 12:00:07,294 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:00:07,294 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-11-20 12:00:07,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-20 12:00:07,294 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-11-20 12:00:07,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:00:07,295 INFO L85 PathProgramCache]: Analyzing trace with hash 153746287, now seen corresponding path program 1 times [2022-11-20 12:00:07,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:00:07,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438559011] [2022-11-20 12:00:07,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:00:07,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:00:07,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:08,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:00:08,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:08,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 12:00:08,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:08,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 12:00:08,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:08,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 12:00:08,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:08,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:08,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:08,387 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 12:00:08,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:08,403 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-20 12:00:08,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:08,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 12:00:08,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:08,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-20 12:00:08,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:08,454 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-20 12:00:08,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:08,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 12:00:08,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:08,486 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-20 12:00:08,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:08,503 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-20 12:00:08,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:08,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-20 12:00:08,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:08,538 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-20 12:00:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:08,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-20 12:00:08,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:08,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-20 12:00:08,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:08,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-20 12:00:08,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:08,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-20 12:00:08,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:08,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-20 12:00:08,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:08,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-20 12:00:08,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:08,672 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 12:00:08,672 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:00:08,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438559011] [2022-11-20 12:00:08,675 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438559011] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:00:08,675 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:00:08,675 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:00:08,675 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990094134] [2022-11-20 12:00:08,675 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:00:08,676 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:00:08,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:00:08,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:00:08,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:00:08,677 INFO L87 Difference]: Start difference. First operand 5273 states and 7679 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-11-20 12:00:29,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:00:29,526 INFO L93 Difference]: Finished difference Result 5273 states and 7679 transitions. [2022-11-20 12:00:29,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:00:29,527 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-11-20 12:00:29,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:00:29,539 INFO L225 Difference]: With dead ends: 5273 [2022-11-20 12:00:29,539 INFO L226 Difference]: Without dead ends: 5271 [2022-11-20 12:00:29,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:00:29,541 INFO L413 NwaCegarLoop]: 6300 mSDtfsCounter, 7303 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 7265 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8820 SdHoareTripleChecker+Valid, 17509 SdHoareTripleChecker+Invalid, 11763 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 7265 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.6s IncrementalHoareTripleChecker+Time [2022-11-20 12:00:29,542 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8820 Valid, 17509 Invalid, 11763 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4498 Valid, 7265 Invalid, 0 Unknown, 0 Unchecked, 19.6s Time] [2022-11-20 12:00:29,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5271 states. [2022-11-20 12:00:30,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5271 to 5271. [2022-11-20 12:00:30,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5271 states, 3354 states have (on average 1.2268932617769828) internal successors, (4115), 3654 states have internal predecessors, (4115), 1782 states have call successors, (1782), 127 states have call predecessors, (1782), 126 states have return successors, (1780), 1516 states have call predecessors, (1780), 1780 states have call successors, (1780) [2022-11-20 12:00:30,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5271 states to 5271 states and 7677 transitions. [2022-11-20 12:00:30,143 INFO L78 Accepts]: Start accepts. Automaton has 5271 states and 7677 transitions. Word has length 136 [2022-11-20 12:00:30,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:00:30,144 INFO L495 AbstractCegarLoop]: Abstraction has 5271 states and 7677 transitions. [2022-11-20 12:00:30,144 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-11-20 12:00:30,144 INFO L276 IsEmpty]: Start isEmpty. Operand 5271 states and 7677 transitions. [2022-11-20 12:00:30,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2022-11-20 12:00:30,145 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:00:30,145 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-11-20 12:00:30,145 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-20 12:00:30,145 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-11-20 12:00:30,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:00:30,146 INFO L85 PathProgramCache]: Analyzing trace with hash -425823645, now seen corresponding path program 1 times [2022-11-20 12:00:30,146 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:00:30,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [377734982] [2022-11-20 12:00:30,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:00:30,146 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:00:30,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:30,517 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:00:30,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:30,539 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 12:00:30,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:30,562 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 12:00:30,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:30,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 12:00:30,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:30,597 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:30,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:30,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 12:00:30,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:30,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-20 12:00:30,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:30,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 12:00:30,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:30,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-20 12:00:30,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:30,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-20 12:00:30,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:30,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 12:00:30,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:30,690 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-20 12:00:30,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:30,705 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-20 12:00:30,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:30,720 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-20 12:00:30,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:30,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-20 12:00:30,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:30,761 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-20 12:00:30,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:30,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-20 12:00:30,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:30,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-20 12:00:30,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:30,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-20 12:00:30,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:30,818 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-20 12:00:30,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:30,832 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-20 12:00:30,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:30,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-20 12:00:30,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:30,862 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 12:00:30,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:00:30,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [377734982] [2022-11-20 12:00:30,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [377734982] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:00:30,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:00:30,863 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:00:30,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [676888350] [2022-11-20 12:00:30,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:00:30,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:00:30,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:00:30,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:00:30,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:00:30,865 INFO L87 Difference]: Start difference. First operand 5271 states and 7677 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-11-20 12:00:33,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 12:00:35,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 12:00:43,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 12:00:54,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:00:54,824 INFO L93 Difference]: Finished difference Result 5271 states and 7677 transitions. [2022-11-20 12:00:54,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:00:54,825 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-11-20 12:00:54,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:00:54,835 INFO L225 Difference]: With dead ends: 5271 [2022-11-20 12:00:54,835 INFO L226 Difference]: Without dead ends: 5269 [2022-11-20 12:00:54,836 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:00:54,837 INFO L413 NwaCegarLoop]: 6300 mSDtfsCounter, 7297 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 7261 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8813 SdHoareTripleChecker+Valid, 17509 SdHoareTripleChecker+Invalid, 11759 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 7261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.6s IncrementalHoareTripleChecker+Time [2022-11-20 12:00:54,837 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8813 Valid, 17509 Invalid, 11759 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4498 Valid, 7261 Invalid, 0 Unknown, 0 Unchecked, 22.6s Time] [2022-11-20 12:00:54,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5269 states. [2022-11-20 12:00:55,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5269 to 5269. [2022-11-20 12:00:55,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5269 states, 3353 states have (on average 1.2266626901282434) internal successors, (4113), 3652 states have internal predecessors, (4113), 1782 states have call successors, (1782), 127 states have call predecessors, (1782), 126 states have return successors, (1780), 1516 states have call predecessors, (1780), 1780 states have call successors, (1780) [2022-11-20 12:00:55,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5269 states to 5269 states and 7675 transitions. [2022-11-20 12:00:55,399 INFO L78 Accepts]: Start accepts. Automaton has 5269 states and 7675 transitions. Word has length 142 [2022-11-20 12:00:55,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:00:55,399 INFO L495 AbstractCegarLoop]: Abstraction has 5269 states and 7675 transitions. [2022-11-20 12:00:55,400 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-11-20 12:00:55,400 INFO L276 IsEmpty]: Start isEmpty. Operand 5269 states and 7675 transitions. [2022-11-20 12:00:55,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2022-11-20 12:00:55,402 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:00:55,402 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-11-20 12:00:55,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-20 12:00:55,403 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-11-20 12:00:55,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:00:55,403 INFO L85 PathProgramCache]: Analyzing trace with hash 563853865, now seen corresponding path program 1 times [2022-11-20 12:00:55,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:00:55,403 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244771507] [2022-11-20 12:00:55,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:00:55,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:00:55,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:55,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:00:55,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:55,887 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 12:00:55,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:55,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 12:00:55,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:55,919 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 12:00:55,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:55,936 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:00:55,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:55,945 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 12:00:55,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:55,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-20 12:00:55,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:55,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 12:00:55,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:55,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-20 12:00:55,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:56,002 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-20 12:00:56,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:56,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 12:00:56,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:56,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-20 12:00:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:56,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-20 12:00:56,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:56,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-20 12:00:56,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:56,076 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-20 12:00:56,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:56,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-20 12:00:56,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:56,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-20 12:00:56,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:56,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-20 12:00:56,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:56,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-20 12:00:56,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:56,156 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-20 12:00:56,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:56,172 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-20 12:00:56,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:56,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-20 12:00:56,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:56,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-20 12:00:56,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:00:56,221 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 12:00:56,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:00:56,222 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244771507] [2022-11-20 12:00:56,222 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244771507] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:00:56,222 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:00:56,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:00:56,223 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774202081] [2022-11-20 12:00:56,223 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:00:56,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:00:56,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:00:56,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:00:56,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:00:56,225 INFO L87 Difference]: Start difference. First operand 5269 states and 7675 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) [2022-11-20 12:00:58,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 12:01:01,525 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 12:01:16,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:01:16,941 INFO L93 Difference]: Finished difference Result 5269 states and 7675 transitions. [2022-11-20 12:01:16,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:01:16,942 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) Word has length 148 [2022-11-20 12:01:16,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:01:16,958 INFO L225 Difference]: With dead ends: 5269 [2022-11-20 12:01:16,958 INFO L226 Difference]: Without dead ends: 5267 [2022-11-20 12:01:16,962 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:01:16,962 INFO L413 NwaCegarLoop]: 6300 mSDtfsCounter, 7291 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 7257 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 17.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8806 SdHoareTripleChecker+Valid, 17509 SdHoareTripleChecker+Invalid, 11755 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 7257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 19.4s IncrementalHoareTripleChecker+Time [2022-11-20 12:01:16,963 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8806 Valid, 17509 Invalid, 11755 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4498 Valid, 7257 Invalid, 0 Unknown, 0 Unchecked, 19.4s Time] [2022-11-20 12:01:16,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5267 states. [2022-11-20 12:01:17,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5267 to 5267. [2022-11-20 12:01:17,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5267 states, 3352 states have (on average 1.2264319809069213) internal successors, (4111), 3650 states have internal predecessors, (4111), 1782 states have call successors, (1782), 127 states have call predecessors, (1782), 126 states have return successors, (1780), 1516 states have call predecessors, (1780), 1780 states have call successors, (1780) [2022-11-20 12:01:18,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5267 states to 5267 states and 7673 transitions. [2022-11-20 12:01:18,003 INFO L78 Accepts]: Start accepts. Automaton has 5267 states and 7673 transitions. Word has length 148 [2022-11-20 12:01:18,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:01:18,003 INFO L495 AbstractCegarLoop]: Abstraction has 5267 states and 7673 transitions. [2022-11-20 12:01:18,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 15.833333333333334) internal successors, (95), 4 states have internal predecessors, (95), 2 states have call successors, (24), 4 states have call predecessors, (24), 1 states have return successors, (23), 2 states have call predecessors, (23), 2 states have call successors, (23) [2022-11-20 12:01:18,003 INFO L276 IsEmpty]: Start isEmpty. Operand 5267 states and 7673 transitions. [2022-11-20 12:01:18,005 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 155 [2022-11-20 12:01:18,005 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:01:18,005 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:01:18,005 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-20 12:01:18,005 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_linux_usb_coherent_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-11-20 12:01:18,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:01:18,005 INFO L85 PathProgramCache]: Analyzing trace with hash -203541671, now seen corresponding path program 1 times [2022-11-20 12:01:18,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:01:18,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711307360] [2022-11-20 12:01:18,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:01:18,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:01:18,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:18,433 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:01:18,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:18,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 12:01:18,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:18,465 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 12:01:18,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:18,477 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 12:01:18,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:18,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:01:18,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:18,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 12:01:18,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:18,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-20 12:01:18,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:18,527 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 12:01:18,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:18,541 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-20 12:01:18,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:18,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-20 12:01:18,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:18,566 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 12:01:18,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:18,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-20 12:01:18,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:18,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-20 12:01:18,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:18,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-20 12:01:18,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:18,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-20 12:01:18,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:18,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-20 12:01:18,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:18,637 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-20 12:01:18,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:18,650 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-20 12:01:18,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:18,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-20 12:01:18,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:18,677 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-20 12:01:18,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:18,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-20 12:01:18,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:18,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-20 12:01:18,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:18,716 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-20 12:01:18,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:18,728 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-20 12:01:18,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:18,741 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 12:01:18,742 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:01:18,742 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711307360] [2022-11-20 12:01:18,742 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711307360] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:01:18,742 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:01:18,742 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:01:18,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762369229] [2022-11-20 12:01:18,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:01:18,743 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:01:18,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:01:18,744 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:01:18,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:01:18,744 INFO L87 Difference]: Start difference. First operand 5267 states and 7673 transitions. Second operand has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-11-20 12:01:21,413 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 12:01:23,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 12:01:43,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:01:43,852 INFO L93 Difference]: Finished difference Result 5267 states and 7673 transitions. [2022-11-20 12:01:43,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:01:43,853 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) Word has length 154 [2022-11-20 12:01:43,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:01:43,867 INFO L225 Difference]: With dead ends: 5267 [2022-11-20 12:01:43,867 INFO L226 Difference]: Without dead ends: 5265 [2022-11-20 12:01:43,870 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:01:43,871 INFO L413 NwaCegarLoop]: 6300 mSDtfsCounter, 7285 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 7253 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8799 SdHoareTripleChecker+Valid, 17509 SdHoareTripleChecker+Invalid, 11751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 7253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 23.7s IncrementalHoareTripleChecker+Time [2022-11-20 12:01:43,871 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8799 Valid, 17509 Invalid, 11751 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4498 Valid, 7253 Invalid, 0 Unknown, 0 Unchecked, 23.7s Time] [2022-11-20 12:01:43,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5265 states. [2022-11-20 12:01:44,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5265 to 5265. [2022-11-20 12:01:44,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5265 states, 3351 states have (on average 1.2262011339898538) internal successors, (4109), 3648 states have internal predecessors, (4109), 1782 states have call successors, (1782), 127 states have call predecessors, (1782), 126 states have return successors, (1780), 1516 states have call predecessors, (1780), 1780 states have call successors, (1780) [2022-11-20 12:01:44,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5265 states to 5265 states and 7671 transitions. [2022-11-20 12:01:44,622 INFO L78 Accepts]: Start accepts. Automaton has 5265 states and 7671 transitions. Word has length 154 [2022-11-20 12:01:44,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:01:44,623 INFO L495 AbstractCegarLoop]: Abstraction has 5265 states and 7671 transitions. [2022-11-20 12:01:44,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 16.5) internal successors, (99), 4 states have internal predecessors, (99), 2 states have call successors, (25), 4 states have call predecessors, (25), 1 states have return successors, (24), 2 states have call predecessors, (24), 2 states have call successors, (24) [2022-11-20 12:01:44,623 INFO L276 IsEmpty]: Start isEmpty. Operand 5265 states and 7671 transitions. [2022-11-20 12:01:44,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2022-11-20 12:01:44,625 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:01:44,626 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 15, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:01:44,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-20 12:01:44,626 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_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-11-20 12:01:44,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:01:44,627 INFO L85 PathProgramCache]: Analyzing trace with hash 279370170, now seen corresponding path program 1 times [2022-11-20 12:01:44,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:01:44,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860302014] [2022-11-20 12:01:44,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:01:44,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:01:44,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:45,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:01:45,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:45,740 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 12:01:45,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:45,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 12:01:45,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:45,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 12:01:45,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:45,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:01:45,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:45,820 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 12:01:45,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:45,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-20 12:01:45,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:45,853 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-20 12:01:45,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:45,881 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-20 12:01:45,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:45,906 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:01:45,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:45,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:01:45,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:45,926 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 12:01:45,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:45,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-20 12:01:45,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:45,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:01:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:45,964 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:01:45,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:45,974 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 12:01:45,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:45,983 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-20 12:01:45,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:46,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:01:46,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:46,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:01:46,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:46,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 12:01:46,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:46,035 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-20 12:01:46,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:46,059 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:01:46,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:46,069 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:01:46,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:46,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 12:01:46,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:46,088 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-20 12:01:46,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:46,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:01:46,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:46,123 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:01:46,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:46,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 12:01:46,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:46,148 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-20 12:01:46,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:46,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:01:46,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:46,178 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:01:46,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:46,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 12:01:46,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:46,197 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-11-20 12:01:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:46,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-11-20 12:01:46,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:46,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-11-20 12:01:46,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:01:46,240 INFO L134 CoverageAnalysis]: Checked inductivity of 603 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 603 trivial. 0 not checked. [2022-11-20 12:01:46,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:01:46,240 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860302014] [2022-11-20 12:01:46,240 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860302014] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:01:46,241 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:01:46,241 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 12:01:46,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234935575] [2022-11-20 12:01:46,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:01:46,242 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:01:46,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:01:46,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:01:46,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:01:46,243 INFO L87 Difference]: Start difference. First operand 5265 states and 7671 transitions. Second operand has 8 states, 8 states have (on average 7.125) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (24), 6 states have call predecessors, (24), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-11-20 12:01:50,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 12:01:56,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 12:02:22,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:02:22,644 INFO L93 Difference]: Finished difference Result 5456 states and 8078 transitions. [2022-11-20 12:02:22,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 12:02:22,644 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (24), 6 states have call predecessors, (24), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) Word has length 209 [2022-11-20 12:02:22,645 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:02:22,667 INFO L225 Difference]: With dead ends: 5456 [2022-11-20 12:02:22,668 INFO L226 Difference]: Without dead ends: 5454 [2022-11-20 12:02:22,671 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 74 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-11-20 12:02:22,672 INFO L413 NwaCegarLoop]: 6356 mSDtfsCounter, 8081 mSDsluCounter, 19177 mSDsCounter, 0 mSdLazyCounter, 12964 mSolverCounterSat, 6860 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9541 SdHoareTripleChecker+Valid, 25533 SdHoareTripleChecker+Invalid, 19825 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 6860 IncrementalHoareTripleChecker+Valid, 12964 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.6s IncrementalHoareTripleChecker+Time [2022-11-20 12:02:22,672 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9541 Valid, 25533 Invalid, 19825 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [6860 Valid, 12964 Invalid, 1 Unknown, 0 Unchecked, 34.6s Time] [2022-11-20 12:02:22,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5454 states. [2022-11-20 12:02:23,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5454 to 5271. [2022-11-20 12:02:23,933 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5271 states, 3356 states have (on average 1.2252681764004767) internal successors, (4112), 3652 states have internal predecessors, (4112), 1782 states have call successors, (1782), 129 states have call predecessors, (1782), 128 states have return successors, (1780), 1516 states have call predecessors, (1780), 1780 states have call successors, (1780) [2022-11-20 12:02:23,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5271 states to 5271 states and 7674 transitions. [2022-11-20 12:02:23,952 INFO L78 Accepts]: Start accepts. Automaton has 5271 states and 7674 transitions. Word has length 209 [2022-11-20 12:02:23,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:02:23,953 INFO L495 AbstractCegarLoop]: Abstraction has 5271 states and 7674 transitions. [2022-11-20 12:02:23,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 7.125) internal successors, (57), 4 states have internal predecessors, (57), 2 states have call successors, (24), 6 states have call predecessors, (24), 1 states have return successors, (20), 2 states have call predecessors, (20), 2 states have call successors, (20) [2022-11-20 12:02:23,953 INFO L276 IsEmpty]: Start isEmpty. Operand 5271 states and 7674 transitions. [2022-11-20 12:02:23,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2022-11-20 12:02:23,955 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:02:23,955 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:02:23,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-20 12:02:23,956 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_linux_usb_gadget_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-11-20 12:02:23,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:02:23,956 INFO L85 PathProgramCache]: Analyzing trace with hash -387864570, now seen corresponding path program 1 times [2022-11-20 12:02:23,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:02:23,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1747848449] [2022-11-20 12:02:23,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:02:23,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:02:24,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:24,381 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:02:24,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:24,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 12:02:24,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:24,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 12:02:24,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:24,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 12:02:24,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:24,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:02:24,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:24,483 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 12:02:24,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:24,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-20 12:02:24,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:24,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 12:02:24,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:24,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-20 12:02:24,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:24,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-20 12:02:24,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:24,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 12:02:24,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:24,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-20 12:02:24,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:24,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-20 12:02:24,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:24,614 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-20 12:02:24,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:24,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-20 12:02:24,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:24,648 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-20 12:02:24,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:24,664 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-20 12:02:24,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:24,682 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-20 12:02:24,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:24,697 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-20 12:02:24,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:24,712 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-20 12:02:24,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:24,726 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-20 12:02:24,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:24,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-20 12:02:24,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:24,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-20 12:02:24,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:24,772 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-20 12:02:24,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:24,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-20 12:02:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:24,802 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 12:02:24,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:02:24,803 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1747848449] [2022-11-20 12:02:24,803 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1747848449] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:02:24,803 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:02:24,803 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:02:24,804 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370859520] [2022-11-20 12:02:24,804 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:02:24,805 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:02:24,805 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:02:24,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:02:24,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:02:24,806 INFO L87 Difference]: Start difference. First operand 5271 states and 7674 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-11-20 12:02:28,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 12:02:30,850 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 12:02:37,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 12:02:49,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:02:49,001 INFO L93 Difference]: Finished difference Result 5273 states and 7675 transitions. [2022-11-20 12:02:49,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 12:02:49,002 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) Word has length 160 [2022-11-20 12:02:49,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:02:49,016 INFO L225 Difference]: With dead ends: 5273 [2022-11-20 12:02:49,016 INFO L226 Difference]: Without dead ends: 5271 [2022-11-20 12:02:49,018 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-20 12:02:49,019 INFO L413 NwaCegarLoop]: 6302 mSDtfsCounter, 7300 mSDsluCounter, 11211 mSDsCounter, 0 mSdLazyCounter, 7364 mSolverCounterSat, 4508 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8813 SdHoareTripleChecker+Valid, 17513 SdHoareTripleChecker+Invalid, 11873 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4508 IncrementalHoareTripleChecker+Valid, 7364 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.6s IncrementalHoareTripleChecker+Time [2022-11-20 12:02:49,019 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8813 Valid, 17513 Invalid, 11873 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4508 Valid, 7364 Invalid, 1 Unknown, 0 Unchecked, 22.6s Time] [2022-11-20 12:02:49,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5271 states. [2022-11-20 12:02:49,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5271 to 5269. [2022-11-20 12:02:49,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5269 states, 3355 states have (on average 1.225037257824143) internal successors, (4110), 3650 states have internal predecessors, (4110), 1782 states have call successors, (1782), 129 states have call predecessors, (1782), 128 states have return successors, (1780), 1516 states have call predecessors, (1780), 1780 states have call successors, (1780) [2022-11-20 12:02:49,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5269 states to 5269 states and 7672 transitions. [2022-11-20 12:02:49,874 INFO L78 Accepts]: Start accepts. Automaton has 5269 states and 7672 transitions. Word has length 160 [2022-11-20 12:02:49,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:02:49,874 INFO L495 AbstractCegarLoop]: Abstraction has 5269 states and 7672 transitions. [2022-11-20 12:02:49,874 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 4 states have internal predecessors, (103), 2 states have call successors, (26), 4 states have call predecessors, (26), 1 states have return successors, (25), 2 states have call predecessors, (25), 2 states have call successors, (25) [2022-11-20 12:02:49,875 INFO L276 IsEmpty]: Start isEmpty. Operand 5269 states and 7672 transitions. [2022-11-20 12:02:49,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 167 [2022-11-20 12:02:49,876 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:02:49,876 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:02:49,876 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-20 12:02:49,877 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ldv_linux_usb_urb_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-11-20 12:02:49,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:02:49,877 INFO L85 PathProgramCache]: Analyzing trace with hash 926913760, now seen corresponding path program 1 times [2022-11-20 12:02:49,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:02:49,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047833377] [2022-11-20 12:02:49,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:02:49,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:02:49,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:50,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:02:50,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:50,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 12:02:50,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:50,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 12:02:50,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:50,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 12:02:50,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:50,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:02:50,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:50,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 12:02:50,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:50,313 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-20 12:02:50,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:50,326 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2022-11-20 12:02:50,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:50,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 52 [2022-11-20 12:02:50,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:50,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2022-11-20 12:02:50,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:50,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-20 12:02:50,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:50,379 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2022-11-20 12:02:50,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:50,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2022-11-20 12:02:50,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:50,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2022-11-20 12:02:50,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:50,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-20 12:02:50,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:50,435 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-20 12:02:50,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:50,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2022-11-20 12:02:50,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:50,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-20 12:02:50,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:50,475 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-20 12:02:50,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:50,488 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-20 12:02:50,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:50,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2022-11-20 12:02:50,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:50,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-20 12:02:50,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:50,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-20 12:02:50,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:50,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2022-11-20 12:02:50,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:50,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2022-11-20 12:02:50,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:50,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-20 12:02:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:02:50,586 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-20 12:02:50,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:02:50,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047833377] [2022-11-20 12:02:50,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047833377] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:02:50,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:02:50,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:02:50,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833376736] [2022-11-20 12:02:50,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:02:50,588 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:02:50,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:02:50,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:02:50,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:02:50,593 INFO L87 Difference]: Start difference. First operand 5269 states and 7672 transitions. Second operand has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-11-20 12:02:53,892 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 12:02:57,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 12:03:02,401 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [] [2022-11-20 12:03:14,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:03:14,895 INFO L93 Difference]: Finished difference Result 5269 states and 7672 transitions. [2022-11-20 12:03:14,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:03:14,898 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) Word has length 166 [2022-11-20 12:03:14,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:03:14,916 INFO L225 Difference]: With dead ends: 5269 [2022-11-20 12:03:14,917 INFO L226 Difference]: Without dead ends: 5114 [2022-11-20 12:03:14,921 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:03:14,922 INFO L413 NwaCegarLoop]: 6300 mSDtfsCounter, 7264 mSDsluCounter, 11209 mSDsCounter, 0 mSdLazyCounter, 7244 mSolverCounterSat, 4498 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 21.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8776 SdHoareTripleChecker+Valid, 17509 SdHoareTripleChecker+Invalid, 11742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 4498 IncrementalHoareTripleChecker+Valid, 7244 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 22.7s IncrementalHoareTripleChecker+Time [2022-11-20 12:03:14,922 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8776 Valid, 17509 Invalid, 11742 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [4498 Valid, 7244 Invalid, 0 Unknown, 0 Unchecked, 22.7s Time] [2022-11-20 12:03:14,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5114 states. [2022-11-20 12:03:15,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5114 to 5114. [2022-11-20 12:03:15,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5114 states, 3266 states have (on average 1.230251071647275) internal successors, (4018), 3559 states have internal predecessors, (4018), 1736 states have call successors, (1736), 109 states have call predecessors, (1736), 109 states have return successors, (1736), 1472 states have call predecessors, (1736), 1736 states have call successors, (1736) [2022-11-20 12:03:15,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5114 states to 5114 states and 7490 transitions. [2022-11-20 12:03:15,730 INFO L78 Accepts]: Start accepts. Automaton has 5114 states and 7490 transitions. Word has length 166 [2022-11-20 12:03:15,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:03:15,731 INFO L495 AbstractCegarLoop]: Abstraction has 5114 states and 7490 transitions. [2022-11-20 12:03:15,731 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.833333333333332) internal successors, (107), 4 states have internal predecessors, (107), 2 states have call successors, (27), 4 states have call predecessors, (27), 1 states have return successors, (26), 2 states have call predecessors, (26), 2 states have call successors, (26) [2022-11-20 12:03:15,731 INFO L276 IsEmpty]: Start isEmpty. Operand 5114 states and 7490 transitions. [2022-11-20 12:03:15,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2022-11-20 12:03:15,732 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:03:15,732 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 16, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 6, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:03:15,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-20 12:03:15,732 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_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-11-20 12:03:15,733 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:03:15,733 INFO L85 PathProgramCache]: Analyzing trace with hash 1264836992, now seen corresponding path program 1 times [2022-11-20 12:03:15,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:03:15,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1101857211] [2022-11-20 12:03:15,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:15,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:03:15,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:16,143 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:03:16,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:16,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 12:03:16,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:16,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 12:03:16,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:16,192 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 12:03:16,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:16,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:03:16,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:16,217 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 12:03:16,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:16,230 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-20 12:03:16,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:16,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-20 12:03:16,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:16,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-20 12:03:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:16,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:03:16,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:16,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:03:16,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:16,316 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 12:03:16,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:16,328 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-20 12:03:16,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:16,420 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:03:16,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:16,431 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:03:16,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:16,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 12:03:16,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:16,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-20 12:03:16,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:16,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:03:16,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:16,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:03:16,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:16,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 12:03:16,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:16,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-20 12:03:16,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:16,500 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:03:16,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:16,508 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:03:16,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:16,516 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 12:03:16,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:16,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-20 12:03:16,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:16,536 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:03:16,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:16,552 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:03:16,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:16,561 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 12:03:16,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:16,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-20 12:03:16,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:16,587 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:03:16,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:16,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:03:16,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:16,603 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 12:03:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:16,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-11-20 12:03:16,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:16,620 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-11-20 12:03:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:16,628 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 200 [2022-11-20 12:03:16,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:16,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-11-20 12:03:16,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:16,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 210 [2022-11-20 12:03:16,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:16,652 INFO L134 CoverageAnalysis]: Checked inductivity of 663 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 663 trivial. 0 not checked. [2022-11-20 12:03:16,652 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:03:16,652 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1101857211] [2022-11-20 12:03:16,653 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1101857211] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:03:16,653 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:03:16,653 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 12:03:16,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349511395] [2022-11-20 12:03:16,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:03:16,655 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 12:03:16,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:03:16,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 12:03:16,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-11-20 12:03:16,656 INFO L87 Difference]: Start difference. First operand 5114 states and 7490 transitions. Second operand has 8 states, 8 states have (on average 8.375) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (26), 5 states have call predecessors, (26), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2022-11-20 12:03:20,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 12:03:21,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 12:03:27,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 12:03:52,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:03:52,094 INFO L93 Difference]: Finished difference Result 5297 states and 7891 transitions. [2022-11-20 12:03:52,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 12:03:52,095 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (26), 5 states have call predecessors, (26), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) Word has length 226 [2022-11-20 12:03:52,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:03:52,110 INFO L225 Difference]: With dead ends: 5297 [2022-11-20 12:03:52,111 INFO L226 Difference]: Without dead ends: 5295 [2022-11-20 12:03:52,113 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=69, Invalid=141, Unknown=0, NotChecked=0, Total=210 [2022-11-20 12:03:52,113 INFO L413 NwaCegarLoop]: 6264 mSDtfsCounter, 2154 mSDsluCounter, 23735 mSDsCounter, 0 mSdLazyCounter, 15372 mSolverCounterSat, 6019 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2154 SdHoareTripleChecker+Valid, 29999 SdHoareTripleChecker+Invalid, 21391 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 6019 IncrementalHoareTripleChecker+Valid, 15372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 33.7s IncrementalHoareTripleChecker+Time [2022-11-20 12:03:52,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2154 Valid, 29999 Invalid, 21391 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [6019 Valid, 15372 Invalid, 0 Unknown, 0 Unchecked, 33.7s Time] [2022-11-20 12:03:52,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5295 states. [2022-11-20 12:03:52,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5295 to 5112. [2022-11-20 12:03:52,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5112 states, 3265 states have (on average 1.229709035222052) internal successors, (4015), 3557 states have internal predecessors, (4015), 1736 states have call successors, (1736), 109 states have call predecessors, (1736), 109 states have return successors, (1736), 1472 states have call predecessors, (1736), 1736 states have call successors, (1736) [2022-11-20 12:03:52,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5112 states to 5112 states and 7487 transitions. [2022-11-20 12:03:52,899 INFO L78 Accepts]: Start accepts. Automaton has 5112 states and 7487 transitions. Word has length 226 [2022-11-20 12:03:52,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:03:52,899 INFO L495 AbstractCegarLoop]: Abstraction has 5112 states and 7487 transitions. [2022-11-20 12:03:52,899 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 8.375) internal successors, (67), 4 states have internal predecessors, (67), 2 states have call successors, (26), 5 states have call predecessors, (26), 1 states have return successors, (22), 1 states have call predecessors, (22), 1 states have call successors, (22) [2022-11-20 12:03:52,900 INFO L276 IsEmpty]: Start isEmpty. Operand 5112 states and 7487 transitions. [2022-11-20 12:03:52,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2022-11-20 12:03:52,905 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:03:52,905 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:03:52,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-11-20 12:03:52,906 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ldv_check_alloc_flagsErr0ASSERT_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-11-20 12:03:52,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:03:52,907 INFO L85 PathProgramCache]: Analyzing trace with hash -71832794, now seen corresponding path program 1 times [2022-11-20 12:03:52,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:03:52,907 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170859207] [2022-11-20 12:03:52,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:03:52,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:03:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:53,654 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:03:53,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:53,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 12:03:53,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:53,714 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 12:03:53,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:53,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 12:03:53,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:53,757 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:03:53,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:53,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 12:03:53,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:53,789 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-20 12:03:53,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:53,810 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-20 12:03:53,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:53,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-20 12:03:53,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:53,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:03:53,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:53,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:03:53,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:53,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 12:03:53,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:53,924 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-20 12:03:53,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:53,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:03:53,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:53,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:03:53,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:53,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 12:03:53,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:53,990 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-20 12:03:53,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:54,016 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:03:54,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:54,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:03:54,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:54,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 12:03:54,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:54,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-20 12:03:54,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:54,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:03:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:54,083 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:03:54,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:54,094 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 12:03:54,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:54,104 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-20 12:03:54,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:54,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:03:54,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:54,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:03:54,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:54,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 12:03:54,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:54,161 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-20 12:03:54,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:54,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:03:54,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:54,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:03:54,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:54,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 12:03:54,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:54,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-11-20 12:03:54,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:54,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-11-20 12:03:54,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:54,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-11-20 12:03:54,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:54,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:03:54,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:54,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:03:54,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:54,283 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-11-20 12:03:54,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:54,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-11-20 12:03:54,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:54,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-11-20 12:03:54,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:54,333 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-11-20 12:03:54,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:54,363 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:03:54,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:54,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:03:54,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:54,382 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 12:03:54,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:54,390 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-11-20 12:03:54,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:54,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-11-20 12:03:54,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:54,416 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2022-11-20 12:03:54,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:03:54,447 INFO L134 CoverageAnalysis]: Checked inductivity of 983 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 983 trivial. 0 not checked. [2022-11-20 12:03:54,447 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:03:54,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170859207] [2022-11-20 12:03:54,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170859207] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:03:54,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:03:54,448 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-20 12:03:54,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580247827] [2022-11-20 12:03:54,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:03:54,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 12:03:54,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:03:54,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 12:03:54,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2022-11-20 12:03:54,450 INFO L87 Difference]: Start difference. First operand 5112 states and 7487 transitions. Second operand has 9 states, 9 states have (on average 11.0) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (31), 5 states have call predecessors, (31), 2 states have return successors, (28), 3 states have call predecessors, (28), 2 states have call successors, (28) [2022-11-20 12:03:58,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.90s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 12:04:00,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 12:04:05,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 12:04:07,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 12:04:36,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:04:36,184 INFO L93 Difference]: Finished difference Result 10365 states and 15361 transitions. [2022-11-20 12:04:36,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-20 12:04:36,184 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (31), 5 states have call predecessors, (31), 2 states have return successors, (28), 3 states have call predecessors, (28), 2 states have call successors, (28) Word has length 301 [2022-11-20 12:04:36,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:04:36,211 INFO L225 Difference]: With dead ends: 10365 [2022-11-20 12:04:36,211 INFO L226 Difference]: Without dead ends: 5295 [2022-11-20 12:04:36,233 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2022-11-20 12:04:36,234 INFO L413 NwaCegarLoop]: 6257 mSDtfsCounter, 7672 mSDsluCounter, 22242 mSDsCounter, 0 mSdLazyCounter, 16776 mSolverCounterSat, 6626 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9212 SdHoareTripleChecker+Valid, 28499 SdHoareTripleChecker+Invalid, 23403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 6626 IncrementalHoareTripleChecker+Valid, 16776 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.8s IncrementalHoareTripleChecker+Time [2022-11-20 12:04:36,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9212 Valid, 28499 Invalid, 23403 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [6626 Valid, 16776 Invalid, 1 Unknown, 0 Unchecked, 39.8s Time] [2022-11-20 12:04:36,241 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5295 states. [2022-11-20 12:04:37,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5295 to 5112. [2022-11-20 12:04:37,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5112 states, 3265 states have (on average 1.2294027565084227) internal successors, (4014), 3557 states have internal predecessors, (4014), 1736 states have call successors, (1736), 109 states have call predecessors, (1736), 109 states have return successors, (1736), 1472 states have call predecessors, (1736), 1736 states have call successors, (1736) [2022-11-20 12:04:37,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5112 states to 5112 states and 7486 transitions. [2022-11-20 12:04:37,115 INFO L78 Accepts]: Start accepts. Automaton has 5112 states and 7486 transitions. Word has length 301 [2022-11-20 12:04:37,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:04:37,116 INFO L495 AbstractCegarLoop]: Abstraction has 5112 states and 7486 transitions. [2022-11-20 12:04:37,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 11.0) internal successors, (99), 5 states have internal predecessors, (99), 2 states have call successors, (31), 5 states have call predecessors, (31), 2 states have return successors, (28), 3 states have call predecessors, (28), 2 states have call successors, (28) [2022-11-20 12:04:37,116 INFO L276 IsEmpty]: Start isEmpty. Operand 5112 states and 7486 transitions. [2022-11-20 12:04:37,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 302 [2022-11-20 12:04:37,121 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:04:37,122 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:04:37,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-11-20 12:04:37,122 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ldv_check_alloc_flagsErr0ASSERT_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-11-20 12:04:37,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:04:37,123 INFO L85 PathProgramCache]: Analyzing trace with hash -71773212, now seen corresponding path program 1 times [2022-11-20 12:04:37,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:04:37,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [282172711] [2022-11-20 12:04:37,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:04:37,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:04:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:37,615 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:04:37,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:37,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 12:04:37,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:37,644 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 12:04:37,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:37,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 12:04:37,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:37,662 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:04:37,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:37,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 12:04:37,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:37,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-20 12:04:37,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:37,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-20 12:04:37,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:37,707 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-20 12:04:37,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:37,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:04:37,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:37,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:04:37,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:37,743 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 12:04:37,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:37,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-20 12:04:37,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:37,769 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:04:37,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:37,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:04:37,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:37,785 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 12:04:37,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:37,793 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-20 12:04:37,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:37,806 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:04:37,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:37,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:04:37,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:37,822 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 12:04:37,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:37,830 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-20 12:04:37,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:37,848 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:04:37,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:37,856 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:04:37,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:37,870 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 12:04:37,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:37,878 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-20 12:04:37,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:37,893 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:04:37,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:37,901 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:04:37,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:37,910 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 12:04:37,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:37,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-20 12:04:37,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:37,934 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:04:37,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:37,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:04:37,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:37,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 12:04:37,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:37,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-11-20 12:04:37,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:37,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-11-20 12:04:37,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:37,977 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-11-20 12:04:37,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:37,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:04:37,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:37,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:04:37,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:38,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-11-20 12:04:38,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:38,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-11-20 12:04:38,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:38,024 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-11-20 12:04:38,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:38,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-11-20 12:04:38,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:38,047 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:04:38,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:38,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:04:38,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:38,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 12:04:38,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:38,072 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-11-20 12:04:38,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:38,081 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-11-20 12:04:38,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:38,089 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2022-11-20 12:04:38,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:04:38,097 INFO L134 CoverageAnalysis]: Checked inductivity of 983 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 983 trivial. 0 not checked. [2022-11-20 12:04:38,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:04:38,097 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [282172711] [2022-11-20 12:04:38,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [282172711] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:04:38,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:04:38,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-20 12:04:38,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352467226] [2022-11-20 12:04:38,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:04:38,099 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 12:04:38,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:04:38,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 12:04:38,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-11-20 12:04:38,100 INFO L87 Difference]: Start difference. First operand 5112 states and 7486 transitions. Second operand has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (31), 4 states have call predecessors, (31), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2022-11-20 12:04:42,861 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 12:04:43,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 12:04:46,615 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 12:04:48,098 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 12:05:14,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:05:14,907 INFO L93 Difference]: Finished difference Result 5295 states and 7887 transitions. [2022-11-20 12:05:14,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 12:05:14,908 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (31), 4 states have call predecessors, (31), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 301 [2022-11-20 12:05:14,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:05:14,939 INFO L225 Difference]: With dead ends: 5295 [2022-11-20 12:05:14,939 INFO L226 Difference]: Without dead ends: 5293 [2022-11-20 12:05:14,944 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 95 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-11-20 12:05:14,944 INFO L413 NwaCegarLoop]: 6254 mSDtfsCounter, 2156 mSDsluCounter, 19030 mSDsCounter, 0 mSdLazyCounter, 12435 mSolverCounterSat, 6007 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 32.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2156 SdHoareTripleChecker+Valid, 25284 SdHoareTripleChecker+Invalid, 18443 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 6007 IncrementalHoareTripleChecker+Valid, 12435 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 35.1s IncrementalHoareTripleChecker+Time [2022-11-20 12:05:14,945 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2156 Valid, 25284 Invalid, 18443 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [6007 Valid, 12435 Invalid, 1 Unknown, 0 Unchecked, 35.1s Time] [2022-11-20 12:05:14,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5293 states. [2022-11-20 12:05:15,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5293 to 5110. [2022-11-20 12:05:15,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5110 states, 3264 states have (on average 1.2291666666666667) internal successors, (4012), 3555 states have internal predecessors, (4012), 1736 states have call successors, (1736), 109 states have call predecessors, (1736), 109 states have return successors, (1736), 1472 states have call predecessors, (1736), 1736 states have call successors, (1736) [2022-11-20 12:05:15,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5110 states to 5110 states and 7484 transitions. [2022-11-20 12:05:15,910 INFO L78 Accepts]: Start accepts. Automaton has 5110 states and 7484 transitions. Word has length 301 [2022-11-20 12:05:15,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:05:15,911 INFO L495 AbstractCegarLoop]: Abstraction has 5110 states and 7484 transitions. [2022-11-20 12:05:15,911 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 14.142857142857142) internal successors, (99), 4 states have internal predecessors, (99), 1 states have call successors, (31), 4 states have call predecessors, (31), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2022-11-20 12:05:15,911 INFO L276 IsEmpty]: Start isEmpty. Operand 5110 states and 7484 transitions. [2022-11-20 12:05:15,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 306 [2022-11-20 12:05:15,918 INFO L187 NwaCegarLoop]: Found error trace [2022-11-20 12:05:15,918 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 19, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 7, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 12:05:15,918 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-11-20 12:05:15,919 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ldv_check_alloc_flagsErr1ASSERT_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-11-20 12:05:15,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 12:05:15,919 INFO L85 PathProgramCache]: Analyzing trace with hash 289393386, now seen corresponding path program 1 times [2022-11-20 12:05:15,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 12:05:15,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092569546] [2022-11-20 12:05:15,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 12:05:15,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 12:05:16,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-20 12:05:16,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-20 12:05:16,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,424 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-11-20 12:05:16,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-11-20 12:05:16,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:05:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2022-11-20 12:05:16,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-20 12:05:16,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 45 [2022-11-20 12:05:16,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-20 12:05:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,528 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:05:16,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:05:16,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 12:05:16,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-20 12:05:16,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:05:16,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,584 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:05:16,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 12:05:16,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-20 12:05:16,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:05:16,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,631 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:05:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 12:05:16,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,649 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 114 [2022-11-20 12:05:16,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:05:16,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:05:16,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,687 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 12:05:16,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 135 [2022-11-20 12:05:16,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,718 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:05:16,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,727 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:05:16,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,735 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 12:05:16,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,744 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2022-11-20 12:05:16,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,765 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:05:16,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,771 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:05:16,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,776 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 12:05:16,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,783 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 177 [2022-11-20 12:05:16,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,790 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 182 [2022-11-20 12:05:16,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 189 [2022-11-20 12:05:16,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,808 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:05:16,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:05:16,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,824 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 205 [2022-11-20 12:05:16,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,837 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 211 [2022-11-20 12:05:16,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 216 [2022-11-20 12:05:16,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 224 [2022-11-20 12:05:16,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-20 12:05:16,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-20 12:05:16,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,903 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-20 12:05:16,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 245 [2022-11-20 12:05:16,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,920 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 282 [2022-11-20 12:05:16,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,928 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 292 [2022-11-20 12:05:16,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 12:05:16,936 INFO L134 CoverageAnalysis]: Checked inductivity of 983 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 983 trivial. 0 not checked. [2022-11-20 12:05:16,936 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 12:05:16,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092569546] [2022-11-20 12:05:16,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1092569546] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 12:05:16,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 12:05:16,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 12:05:16,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1418254326] [2022-11-20 12:05:16,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 12:05:16,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 12:05:16,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 12:05:16,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 12:05:16,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 12:05:16,939 INFO L87 Difference]: Start difference. First operand 5110 states and 7484 transitions. Second operand has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (31), 5 states have call predecessors, (31), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-11-20 12:05:19,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 12:05:21,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 12:05:30,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-20 12:05:42,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-20 12:05:42,972 INFO L93 Difference]: Finished difference Result 10357 states and 15351 transitions. [2022-11-20 12:05:42,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 12:05:42,972 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (31), 5 states have call predecessors, (31), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 305 [2022-11-20 12:05:42,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-20 12:05:42,975 INFO L225 Difference]: With dead ends: 10357 [2022-11-20 12:05:42,975 INFO L226 Difference]: Without dead ends: 0 [2022-11-20 12:05:43,011 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-20 12:05:43,011 INFO L413 NwaCegarLoop]: 6246 mSDtfsCounter, 7608 mSDsluCounter, 9618 mSDsCounter, 0 mSdLazyCounter, 6690 mSolverCounterSat, 6587 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 22.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9159 SdHoareTripleChecker+Valid, 15864 SdHoareTripleChecker+Invalid, 13278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 6587 IncrementalHoareTripleChecker+Valid, 6690 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 24.3s IncrementalHoareTripleChecker+Time [2022-11-20 12:05:43,012 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9159 Valid, 15864 Invalid, 13278 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [6587 Valid, 6690 Invalid, 1 Unknown, 0 Unchecked, 24.3s Time] [2022-11-20 12:05:43,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-20 12:05:43,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-20 12:05:43,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 12:05:43,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-20 12:05:43,016 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 305 [2022-11-20 12:05:43,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-20 12:05:43,016 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-20 12:05:43,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 17.166666666666668) internal successors, (103), 3 states have internal predecessors, (103), 2 states have call successors, (31), 5 states have call predecessors, (31), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2022-11-20 12:05:43,017 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-20 12:05:43,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-20 12:05:43,020 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_usb_coherent_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (24 of 25 remaining) [2022-11-20 12:05:43,020 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_kernel_rcu_update_lock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (23 of 25 remaining) [2022-11-20 12:05:43,021 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_kernel_rcu_update_lock_bh_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (22 of 25 remaining) [2022-11-20 12:05:43,021 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_block_genhd_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (21 of 25 remaining) [2022-11-20 12:05:43,021 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_usb_urb_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (20 of 25 remaining) [2022-11-20 12:05:43,022 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlockErr0ASSERT_VIOLATIONERROR_FUNCTION (19 of 25 remaining) [2022-11-20 12:05:43,022 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_check_alloc_flagsErr0ASSERT_VIOLATIONERROR_FUNCTION (18 of 25 remaining) [2022-11-20 12:05:43,022 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_check_alloc_flagsErr1ASSERT_VIOLATIONERROR_FUNCTION (17 of 25 remaining) [2022-11-20 12:05:43,022 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_kernel_locking_rwlock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (16 of 25 remaining) [2022-11-20 12:05:43,023 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_kernel_locking_rwlock_check_final_stateErr1ASSERT_VIOLATIONERROR_FUNCTION (15 of 25 remaining) [2022-11-20 12:05:43,023 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_mmc_sdio_func_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (14 of 25 remaining) [2022-11-20 12:05:43,023 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_lib_idr_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (13 of 25 remaining) [2022-11-20 12:05:43,023 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lockErr0ASSERT_VIOLATIONERROR_FUNCTION (12 of 25 remaining) [2022-11-20 12:05:43,024 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_fs_char_dev_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (11 of 25 remaining) [2022-11-20 12:05:43,024 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_kernel_rcu_srcu_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (10 of 25 remaining) [2022-11-20 12:05:43,024 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_arch_io_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (9 of 25 remaining) [2022-11-20 12:05:43,025 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_kernel_module_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (8 of 25 remaining) [2022-11-20 12:05:43,025 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_drivers_base_class_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (7 of 25 remaining) [2022-11-20 12:05:43,025 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_net_sock_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (6 of 25 remaining) [2022-11-20 12:05:43,025 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_usb_gadget_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (5 of 25 remaining) [2022-11-20 12:05:43,026 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_fs_sysfs_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (4 of 25 remaining) [2022-11-20 12:05:43,026 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_block_queue_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (3 of 25 remaining) [2022-11-20 12:05:43,026 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_kernel_rcu_update_lock_sched_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (2 of 25 remaining) [2022-11-20 12:05:43,026 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_net_rtnetlink_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (1 of 25 remaining) [2022-11-20 12:05:43,027 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_linux_block_request_check_final_stateErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 25 remaining) [2022-11-20 12:05:43,027 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-11-20 12:05:43,029 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.