./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6abd4048-50c7-4c64-8e1f-d478197e214d/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6abd4048-50c7-4c64-8e1f-d478197e214d/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6abd4048-50c7-4c64-8e1f-d478197e214d/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6abd4048-50c7-4c64-8e1f-d478197e214d/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6abd4048-50c7-4c64-8e1f-d478197e214d/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6abd4048-50c7-4c64-8e1f-d478197e214d/bin/uautomizer-tPACEb0tL8 --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 1a40e66604094f312102b838d8c965fbe1879fb2092ea49e39f812ee4cfee256 --- 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-e04fb08 [2022-11-16 12:10:24,349 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 12:10:24,352 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 12:10:24,393 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 12:10:24,393 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 12:10:24,395 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 12:10:24,397 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 12:10:24,399 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 12:10:24,401 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 12:10:24,402 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 12:10:24,403 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 12:10:24,405 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 12:10:24,406 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 12:10:24,407 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 12:10:24,409 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 12:10:24,411 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 12:10:24,412 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 12:10:24,413 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 12:10:24,415 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 12:10:24,418 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 12:10:24,420 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 12:10:24,422 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 12:10:24,423 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 12:10:24,424 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 12:10:24,429 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 12:10:24,430 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 12:10:24,430 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 12:10:24,431 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 12:10:24,432 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 12:10:24,433 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 12:10:24,434 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 12:10:24,435 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 12:10:24,436 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 12:10:24,437 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 12:10:24,438 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 12:10:24,439 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 12:10:24,440 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 12:10:24,440 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 12:10:24,441 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 12:10:24,442 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 12:10:24,443 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 12:10:24,444 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6abd4048-50c7-4c64-8e1f-d478197e214d/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-16 12:10:24,471 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 12:10:24,471 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 12:10:24,472 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 12:10:24,472 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 12:10:24,473 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 12:10:24,474 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 12:10:24,474 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 12:10:24,475 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 12:10:24,475 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 12:10:24,476 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 12:10:24,476 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 12:10:24,476 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 12:10:24,477 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 12:10:24,477 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 12:10:24,477 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 12:10:24,478 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 12:10:24,478 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 12:10:24,478 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 12:10:24,479 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 12:10:24,479 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 12:10:24,479 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 12:10:24,480 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:10:24,480 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 12:10:24,480 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 12:10:24,481 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 12:10:24,481 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 12:10:24,481 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 12:10:24,482 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 12:10:24,482 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 12:10:24,482 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 12:10:24,483 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_6abd4048-50c7-4c64-8e1f-d478197e214d/bin/uautomizer-tPACEb0tL8/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_6abd4048-50c7-4c64-8e1f-d478197e214d/bin/uautomizer-tPACEb0tL8 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 -> 1a40e66604094f312102b838d8c965fbe1879fb2092ea49e39f812ee4cfee256 [2022-11-16 12:10:24,836 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 12:10:24,867 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 12:10:24,870 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 12:10:24,872 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 12:10:24,873 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 12:10:24,875 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6abd4048-50c7-4c64-8e1f-d478197e214d/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i [2022-11-16 12:10:24,965 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6abd4048-50c7-4c64-8e1f-d478197e214d/bin/uautomizer-tPACEb0tL8/data/5717e3676/392abe3345f94ecd85bc9579cdb6944d/FLAG82aadfedc [2022-11-16 12:10:26,400 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 12:10:26,401 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i [2022-11-16 12:10:26,503 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6abd4048-50c7-4c64-8e1f-d478197e214d/bin/uautomizer-tPACEb0tL8/data/5717e3676/392abe3345f94ecd85bc9579cdb6944d/FLAG82aadfedc [2022-11-16 12:10:26,925 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6abd4048-50c7-4c64-8e1f-d478197e214d/bin/uautomizer-tPACEb0tL8/data/5717e3676/392abe3345f94ecd85bc9579cdb6944d [2022-11-16 12:10:26,929 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 12:10:26,932 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 12:10:26,937 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 12:10:26,938 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 12:10:26,942 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 12:10:26,943 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:10:26" (1/1) ... [2022-11-16 12:10:26,945 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@51f62e88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:26, skipping insertion in model container [2022-11-16 12:10:26,945 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 12:10:26" (1/1) ... [2022-11-16 12:10:26,955 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 12:10:27,269 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 12:10:36,425 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[680431,680444] [2022-11-16 12:10:36,429 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[680576,680589] [2022-11-16 12:10:36,429 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[680722,680735] [2022-11-16 12:10:36,430 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[680887,680900] [2022-11-16 12:10:36,431 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681045,681058] [2022-11-16 12:10:36,432 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681203,681216] [2022-11-16 12:10:36,433 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681361,681374] [2022-11-16 12:10:36,433 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681521,681534] [2022-11-16 12:10:36,434 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681680,681693] [2022-11-16 12:10:36,435 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681819,681832] [2022-11-16 12:10:36,443 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681961,681974] [2022-11-16 12:10:36,444 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682110,682123] [2022-11-16 12:10:36,445 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682249,682262] [2022-11-16 12:10:36,445 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682404,682417] [2022-11-16 12:10:36,446 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682564,682577] [2022-11-16 12:10:36,447 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682715,682728] [2022-11-16 12:10:36,447 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682866,682879] [2022-11-16 12:10:36,448 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683018,683031] [2022-11-16 12:10:36,448 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683167,683180] [2022-11-16 12:10:36,449 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683315,683328] [2022-11-16 12:10:36,450 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683472,683485] [2022-11-16 12:10:36,450 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683621,683634] [2022-11-16 12:10:36,451 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683777,683790] [2022-11-16 12:10:36,451 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683930,683943] [2022-11-16 12:10:36,452 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684076,684089] [2022-11-16 12:10:36,452 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684219,684232] [2022-11-16 12:10:36,453 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684371,684384] [2022-11-16 12:10:36,454 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684517,684530] [2022-11-16 12:10:36,454 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684662,684675] [2022-11-16 12:10:36,455 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684816,684829] [2022-11-16 12:10:36,455 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684967,684980] [2022-11-16 12:10:36,456 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685122,685135] [2022-11-16 12:10:36,456 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685274,685287] [2022-11-16 12:10:36,457 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685429,685442] [2022-11-16 12:10:36,458 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685593,685606] [2022-11-16 12:10:36,458 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685749,685762] [2022-11-16 12:10:36,459 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685913,685926] [2022-11-16 12:10:36,459 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686055,686068] [2022-11-16 12:10:36,460 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686213,686226] [2022-11-16 12:10:36,461 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686380,686393] [2022-11-16 12:10:36,461 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686539,686552] [2022-11-16 12:10:36,462 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686698,686711] [2022-11-16 12:10:36,462 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686847,686860] [2022-11-16 12:10:36,463 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686994,687007] [2022-11-16 12:10:36,464 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687133,687146] [2022-11-16 12:10:36,464 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687296,687309] [2022-11-16 12:10:36,465 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687462,687475] [2022-11-16 12:10:36,465 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687626,687639] [2022-11-16 12:10:36,466 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687791,687804] [2022-11-16 12:10:36,467 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687956,687969] [2022-11-16 12:10:36,467 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[688122,688135] [2022-11-16 12:10:36,468 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[688287,688300] [2022-11-16 12:10:36,483 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[688454,688467] [2022-11-16 12:10:36,484 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[688614,688627] [2022-11-16 12:10:36,485 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[688776,688789] [2022-11-16 12:10:36,486 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[688935,688948] [2022-11-16 12:10:36,486 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689081,689094] [2022-11-16 12:10:36,487 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689224,689237] [2022-11-16 12:10:36,487 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689368,689381] [2022-11-16 12:10:36,488 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689511,689524] [2022-11-16 12:10:36,488 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689655,689668] [2022-11-16 12:10:36,489 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689796,689809] [2022-11-16 12:10:36,489 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689934,689947] [2022-11-16 12:10:36,490 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690092,690105] [2022-11-16 12:10:36,490 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690251,690264] [2022-11-16 12:10:36,491 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690407,690420] [2022-11-16 12:10:36,492 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690556,690569] [2022-11-16 12:10:36,492 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690708,690721] [2022-11-16 12:10:36,493 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690859,690872] [2022-11-16 12:10:36,493 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691008,691021] [2022-11-16 12:10:36,494 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691160,691173] [2022-11-16 12:10:36,495 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691308,691321] [2022-11-16 12:10:36,495 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691461,691474] [2022-11-16 12:10:36,496 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691612,691625] [2022-11-16 12:10:36,496 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691762,691775] [2022-11-16 12:10:36,497 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691909,691922] [2022-11-16 12:10:36,497 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692060,692073] [2022-11-16 12:10:36,498 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692211,692224] [2022-11-16 12:10:36,499 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692359,692372] [2022-11-16 12:10:36,499 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692525,692538] [2022-11-16 12:10:36,500 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692694,692707] [2022-11-16 12:10:36,500 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692861,692874] [2022-11-16 12:10:36,501 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693029,693042] [2022-11-16 12:10:36,501 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693179,693192] [2022-11-16 12:10:36,502 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693326,693339] [2022-11-16 12:10:36,502 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693487,693500] [2022-11-16 12:10:36,503 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693657,693670] [2022-11-16 12:10:36,503 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693819,693832] [2022-11-16 12:10:36,542 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:10:36,587 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 12:10:37,606 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[680431,680444] [2022-11-16 12:10:37,607 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[680576,680589] [2022-11-16 12:10:37,608 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[680722,680735] [2022-11-16 12:10:37,608 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[680887,680900] [2022-11-16 12:10:37,609 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681045,681058] [2022-11-16 12:10:37,609 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681203,681216] [2022-11-16 12:10:37,610 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681361,681374] [2022-11-16 12:10:37,610 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681521,681534] [2022-11-16 12:10:37,611 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681680,681693] [2022-11-16 12:10:37,611 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681819,681832] [2022-11-16 12:10:37,612 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[681961,681974] [2022-11-16 12:10:37,612 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682110,682123] [2022-11-16 12:10:37,613 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682249,682262] [2022-11-16 12:10:37,613 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682404,682417] [2022-11-16 12:10:37,614 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682564,682577] [2022-11-16 12:10:37,614 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682715,682728] [2022-11-16 12:10:37,615 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[682866,682879] [2022-11-16 12:10:37,615 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683018,683031] [2022-11-16 12:10:37,616 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683167,683180] [2022-11-16 12:10:37,616 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683315,683328] [2022-11-16 12:10:37,617 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683472,683485] [2022-11-16 12:10:37,617 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683621,683634] [2022-11-16 12:10:37,618 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683777,683790] [2022-11-16 12:10:37,618 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[683930,683943] [2022-11-16 12:10:37,619 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684076,684089] [2022-11-16 12:10:37,619 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684219,684232] [2022-11-16 12:10:37,620 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684371,684384] [2022-11-16 12:10:37,620 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684517,684530] [2022-11-16 12:10:37,621 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684662,684675] [2022-11-16 12:10:37,621 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684816,684829] [2022-11-16 12:10:37,622 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[684967,684980] [2022-11-16 12:10:37,622 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685122,685135] [2022-11-16 12:10:37,623 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685274,685287] [2022-11-16 12:10:37,623 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685429,685442] [2022-11-16 12:10:37,624 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685593,685606] [2022-11-16 12:10:37,624 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685749,685762] [2022-11-16 12:10:37,625 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[685913,685926] [2022-11-16 12:10:37,625 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686055,686068] [2022-11-16 12:10:37,626 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686213,686226] [2022-11-16 12:10:37,626 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686380,686393] [2022-11-16 12:10:37,627 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686539,686552] [2022-11-16 12:10:37,627 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686698,686711] [2022-11-16 12:10:37,628 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686847,686860] [2022-11-16 12:10:37,628 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[686994,687007] [2022-11-16 12:10:37,629 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687133,687146] [2022-11-16 12:10:37,630 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687296,687309] [2022-11-16 12:10:37,630 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687462,687475] [2022-11-16 12:10:37,631 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687626,687639] [2022-11-16 12:10:37,631 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687791,687804] [2022-11-16 12:10:37,632 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[687956,687969] [2022-11-16 12:10:37,632 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[688122,688135] [2022-11-16 12:10:37,633 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[688287,688300] [2022-11-16 12:10:37,633 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[688454,688467] [2022-11-16 12:10:37,634 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[688614,688627] [2022-11-16 12:10:37,634 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[688776,688789] [2022-11-16 12:10:37,635 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[688935,688948] [2022-11-16 12:10:37,635 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689081,689094] [2022-11-16 12:10:37,636 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689224,689237] [2022-11-16 12:10:37,636 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689368,689381] [2022-11-16 12:10:37,637 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689511,689524] [2022-11-16 12:10:37,637 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689655,689668] [2022-11-16 12:10:37,638 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689796,689809] [2022-11-16 12:10:37,638 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[689934,689947] [2022-11-16 12:10:37,639 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690092,690105] [2022-11-16 12:10:37,639 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690251,690264] [2022-11-16 12:10:37,640 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690407,690420] [2022-11-16 12:10:37,641 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690556,690569] [2022-11-16 12:10:37,641 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690708,690721] [2022-11-16 12:10:37,642 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[690859,690872] [2022-11-16 12:10:37,642 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691008,691021] [2022-11-16 12:10:37,643 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691160,691173] [2022-11-16 12:10:37,643 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691308,691321] [2022-11-16 12:10:37,644 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691461,691474] [2022-11-16 12:10:37,644 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691612,691625] [2022-11-16 12:10:37,645 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691762,691775] [2022-11-16 12:10:37,645 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[691909,691922] [2022-11-16 12:10:37,646 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692060,692073] [2022-11-16 12:10:37,646 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692211,692224] [2022-11-16 12:10:37,647 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692359,692372] [2022-11-16 12:10:37,647 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692525,692538] [2022-11-16 12:10:37,648 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692694,692707] [2022-11-16 12:10:37,648 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[692861,692874] [2022-11-16 12:10:37,649 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693029,693042] [2022-11-16 12:10:37,649 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693179,693192] [2022-11-16 12:10:37,650 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693326,693339] [2022-11-16 12:10:37,650 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693487,693500] [2022-11-16 12:10:37,650 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693657,693670] [2022-11-16 12:10:37,651 WARN L229 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_6abd4048-50c7-4c64-8e1f-d478197e214d/sv-benchmarks/c/ldv-linux-4.0-rc1-mav/linux-4.0-rc1---net--rose--rose.ko.cil.i[693819,693832] [2022-11-16 12:10:37,659 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 12:10:38,075 INFO L208 MainTranslator]: Completed translation [2022-11-16 12:10:38,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:38 WrapperNode [2022-11-16 12:10:38,076 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 12:10:38,077 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 12:10:38,077 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 12:10:38,078 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 12:10:38,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:38" (1/1) ... [2022-11-16 12:10:38,279 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:38" (1/1) ... [2022-11-16 12:10:38,753 INFO L138 Inliner]: procedures = 963, calls = 5049, calls flagged for inlining = 494, calls inlined = 305, statements flattened = 9455 [2022-11-16 12:10:38,754 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 12:10:38,755 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 12:10:38,755 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 12:10:38,755 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 12:10:38,767 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:38" (1/1) ... [2022-11-16 12:10:38,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:38" (1/1) ... [2022-11-16 12:10:38,864 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:38" (1/1) ... [2022-11-16 12:10:38,865 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:38" (1/1) ... [2022-11-16 12:10:39,066 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:38" (1/1) ... [2022-11-16 12:10:39,097 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:38" (1/1) ... [2022-11-16 12:10:39,259 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:38" (1/1) ... [2022-11-16 12:10:39,294 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:38" (1/1) ... [2022-11-16 12:10:39,360 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 12:10:39,361 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 12:10:39,362 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 12:10:39,362 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 12:10:39,363 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:38" (1/1) ... [2022-11-16 12:10:39,371 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 12:10:39,384 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6abd4048-50c7-4c64-8e1f-d478197e214d/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 12:10:39,401 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6abd4048-50c7-4c64-8e1f-d478197e214d/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 12:10:39,431 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6abd4048-50c7-4c64-8e1f-d478197e214d/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 12:10:39,456 INFO L130 BoogieDeclarations]: Found specification of procedure rose_stop_timer [2022-11-16 12:10:39,456 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_stop_timer [2022-11-16 12:10:39,456 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_skb [2022-11-16 12:10:39,456 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_skb [2022-11-16 12:10:39,457 INFO L130 BoogieDeclarations]: Found specification of procedure seq_puts [2022-11-16 12:10:39,457 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_puts [2022-11-16 12:10:39,457 INFO L130 BoogieDeclarations]: Found specification of procedure skb_queue_head_init [2022-11-16 12:10:39,458 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_queue_head_init [2022-11-16 12:10:39,458 INFO L130 BoogieDeclarations]: Found specification of procedure rose_start_heartbeat [2022-11-16 12:10:39,458 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_start_heartbeat [2022-11-16 12:10:39,458 INFO L130 BoogieDeclarations]: Found specification of procedure sock_init_data [2022-11-16 12:10:39,459 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_init_data [2022-11-16 12:10:39,459 INFO L130 BoogieDeclarations]: Found specification of procedure variable_test_bit [2022-11-16 12:10:39,459 INFO L138 BoogieDeclarations]: Found implementation of procedure variable_test_bit [2022-11-16 12:10:39,460 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_135 [2022-11-16 12:10:39,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_135 [2022-11-16 12:10:39,460 INFO L130 BoogieDeclarations]: Found specification of procedure proto_unregister [2022-11-16 12:10:39,460 INFO L138 BoogieDeclarations]: Found implementation of procedure proto_unregister [2022-11-16 12:10:39,462 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-11-16 12:10:39,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_mmc_sdio_func_check_final_state [2022-11-16 12:10:39,462 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-11-16 12:10:39,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_lock [2022-11-16 12:10:39,462 INFO L130 BoogieDeclarations]: Found specification of procedure rose_add_loopback_node [2022-11-16 12:10:39,463 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_add_loopback_node [2022-11-16 12:10:39,463 INFO L130 BoogieDeclarations]: Found specification of procedure skb_peek [2022-11-16 12:10:39,463 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_peek [2022-11-16 12:10:39,463 INFO L130 BoogieDeclarations]: Found specification of procedure sock_set_flag [2022-11-16 12:10:39,463 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_set_flag [2022-11-16 12:10:39,463 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2022-11-16 12:10:39,463 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_del_timer [2022-11-16 12:10:39,464 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_del_timer [2022-11-16 12:10:39,464 INFO L130 BoogieDeclarations]: Found specification of procedure rose_send_frame [2022-11-16 12:10:39,464 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_send_frame [2022-11-16 12:10:39,464 INFO L130 BoogieDeclarations]: Found specification of procedure rose_destroy_socket [2022-11-16 12:10:39,464 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_destroy_socket [2022-11-16 12:10:39,464 INFO L130 BoogieDeclarations]: Found specification of procedure rose_write_internal [2022-11-16 12:10:39,465 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_write_internal [2022-11-16 12:10:39,465 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_add [2022-11-16 12:10:39,465 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_add [2022-11-16 12:10:39,465 INFO L130 BoogieDeclarations]: Found specification of procedure rose_del_loopback_node [2022-11-16 12:10:39,465 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_del_loopback_node [2022-11-16 12:10:39,465 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2022-11-16 12:10:39,465 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2022-11-16 12:10:39,466 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_request_check_final_state [2022-11-16 12:10:39,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_request_check_final_state [2022-11-16 12:10:39,466 INFO L130 BoogieDeclarations]: Found specification of procedure rose_requeue_frames [2022-11-16 12:10:39,466 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_requeue_frames [2022-11-16 12:10:39,466 INFO L130 BoogieDeclarations]: Found specification of procedure rose_rx_call_request [2022-11-16 12:10:39,466 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_rx_call_request [2022-11-16 12:10:39,466 INFO L130 BoogieDeclarations]: Found specification of procedure spin_unlock_bh [2022-11-16 12:10:39,468 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_unlock_bh [2022-11-16 12:10:39,468 INFO L130 BoogieDeclarations]: Found specification of procedure rose_dev_get [2022-11-16 12:10:39,468 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_dev_get [2022-11-16 12:10:39,468 INFO L130 BoogieDeclarations]: Found specification of procedure sock_wfree [2022-11-16 12:10:39,468 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume [2022-11-16 12:10:39,469 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume [2022-11-16 12:10:39,469 INFO L130 BoogieDeclarations]: Found specification of procedure rose_new_lci [2022-11-16 12:10:39,469 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_new_lci [2022-11-16 12:10:39,469 INFO L130 BoogieDeclarations]: Found specification of procedure seq_open [2022-11-16 12:10:39,470 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_open [2022-11-16 12:10:39,470 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-11-16 12:10:39,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_bh_check_final_state [2022-11-16 12:10:39,470 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-16 12:10:39,470 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_genhd_check_final_state [2022-11-16 12:10:39,470 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_genhd_check_final_state [2022-11-16 12:10:39,471 INFO L130 BoogieDeclarations]: Found specification of procedure rose_neigh_open [2022-11-16 12:10:39,471 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_neigh_open [2022-11-16 12:10:39,471 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_err_code [2022-11-16 12:10:39,471 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_err_code [2022-11-16 12:10:39,471 INFO L130 BoogieDeclarations]: Found specification of procedure rose_validate_nr [2022-11-16 12:10:39,472 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_validate_nr [2022-11-16 12:10:39,472 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-11-16 12:10:39,472 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_srcu_check_final_state [2022-11-16 12:10:39,475 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_lock [2022-11-16 12:10:39,476 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_lock [2022-11-16 12:10:39,476 INFO L130 BoogieDeclarations]: Found specification of procedure sock_flag [2022-11-16 12:10:39,476 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_flag [2022-11-16 12:10:39,477 INFO L130 BoogieDeclarations]: Found specification of procedure timer_pending [2022-11-16 12:10:39,477 INFO L138 BoogieDeclarations]: Found implementation of procedure timer_pending [2022-11-16 12:10:39,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-16 12:10:39,478 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 12:10:39,478 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2022-11-16 12:10:39,484 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2022-11-16 12:10:39,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-16 12:10:39,485 INFO L130 BoogieDeclarations]: Found specification of procedure ax2asc [2022-11-16 12:10:39,485 INFO L138 BoogieDeclarations]: Found implementation of procedure ax2asc [2022-11-16 12:10:39,485 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2022-11-16 12:10:39,485 INFO L130 BoogieDeclarations]: Found specification of procedure rose_start_t0timer [2022-11-16 12:10:39,485 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_start_t0timer [2022-11-16 12:10:39,485 INFO L130 BoogieDeclarations]: Found specification of procedure rose_transmit_restart_request [2022-11-16 12:10:39,486 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_transmit_restart_request [2022-11-16 12:10:39,486 INFO L130 BoogieDeclarations]: Found specification of procedure skb_queue_tail [2022-11-16 12:10:39,486 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_queue_tail [2022-11-16 12:10:39,486 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_null [2022-11-16 12:10:39,486 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_null [2022-11-16 12:10:39,486 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free_netdev [2022-11-16 12:10:39,486 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free_netdev [2022-11-16 12:10:39,487 INFO L130 BoogieDeclarations]: Found specification of procedure rose_process_rx_frame [2022-11-16 12:10:39,487 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_process_rx_frame [2022-11-16 12:10:39,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 12:10:39,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 12:10:39,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~$Pointer$ [2022-11-16 12:10:39,487 INFO L130 BoogieDeclarations]: Found specification of procedure skb_push [2022-11-16 12:10:39,487 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_push [2022-11-16 12:10:39,487 INFO L130 BoogieDeclarations]: Found specification of procedure sock_hold [2022-11-16 12:10:39,488 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_hold [2022-11-16 12:10:39,488 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_size_call_parameter [2022-11-16 12:10:39,488 INFO L130 BoogieDeclarations]: Found specification of procedure ax25_cb_put [2022-11-16 12:10:39,488 INFO L138 BoogieDeclarations]: Found implementation of procedure ax25_cb_put [2022-11-16 12:10:39,488 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2022-11-16 12:10:39,488 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2022-11-16 12:10:39,488 INFO L130 BoogieDeclarations]: Found specification of procedure skb_queue_head [2022-11-16 12:10:39,489 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_queue_head [2022-11-16 12:10:39,489 INFO L130 BoogieDeclarations]: Found specification of procedure rose_clear_queues [2022-11-16 12:10:39,489 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_clear_queues [2022-11-16 12:10:39,489 INFO L130 BoogieDeclarations]: Found specification of procedure del_timer [2022-11-16 12:10:39,489 INFO L138 BoogieDeclarations]: Found implementation of procedure del_timer [2022-11-16 12:10:39,489 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_sock_check_final_state [2022-11-16 12:10:39,489 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_sock_check_final_state [2022-11-16 12:10:39,490 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_gadget_check_final_state [2022-11-16 12:10:39,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_gadget_check_final_state [2022-11-16 12:10:39,490 INFO L130 BoogieDeclarations]: Found specification of procedure rose_insert_socket [2022-11-16 12:10:39,491 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_insert_socket [2022-11-16 12:10:39,491 INFO L130 BoogieDeclarations]: Found specification of procedure rose_parse_facilities [2022-11-16 12:10:39,491 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_parse_facilities [2022-11-16 12:10:39,491 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-16 12:10:39,491 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_sysfs_check_final_state [2022-11-16 12:10:39,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_sysfs_check_final_state [2022-11-16 12:10:39,492 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-16 12:10:39,492 INFO L130 BoogieDeclarations]: Found specification of procedure add_timer [2022-11-16 12:10:39,492 INFO L138 BoogieDeclarations]: Found implementation of procedure add_timer [2022-11-16 12:10:39,492 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_bh_125 [2022-11-16 12:10:39,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_bh_125 [2022-11-16 12:10:39,492 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_bh_126 [2022-11-16 12:10:39,492 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_bh_126 [2022-11-16 12:10:39,493 INFO L130 BoogieDeclarations]: Found specification of procedure lockdep_init_map [2022-11-16 12:10:39,493 INFO L138 BoogieDeclarations]: Found implementation of procedure lockdep_init_map [2022-11-16 12:10:39,493 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2022-11-16 12:10:39,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2022-11-16 12:10:39,493 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_bh_127___0 [2022-11-16 12:10:39,493 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_bh_127___0 [2022-11-16 12:10:39,493 INFO L130 BoogieDeclarations]: Found specification of procedure rose_start_idletimer [2022-11-16 12:10:39,494 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_start_idletimer [2022-11-16 12:10:39,494 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reserve [2022-11-16 12:10:39,494 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reserve [2022-11-16 12:10:39,494 INFO L130 BoogieDeclarations]: Found specification of procedure rose_transmit_link [2022-11-16 12:10:39,494 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_transmit_link [2022-11-16 12:10:39,494 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-11-16 12:10:39,494 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_check_final_state [2022-11-16 12:10:39,494 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_urb_check_final_state [2022-11-16 12:10:39,495 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_urb_check_final_state [2022-11-16 12:10:39,495 INFO L130 BoogieDeclarations]: Found specification of procedure rose_find_socket [2022-11-16 12:10:39,495 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_find_socket [2022-11-16 12:10:39,495 INFO L130 BoogieDeclarations]: Found specification of procedure rose_remove_node [2022-11-16 12:10:39,495 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_remove_node [2022-11-16 12:10:39,495 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_lock_held [2022-11-16 12:10:39,495 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_lock_held [2022-11-16 12:10:39,496 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-16 12:10:39,496 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2022-11-16 12:10:39,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2022-11-16 12:10:39,496 INFO L130 BoogieDeclarations]: Found specification of procedure ax25_display_timer [2022-11-16 12:10:39,496 INFO L138 BoogieDeclarations]: Found implementation of procedure ax25_display_timer [2022-11-16 12:10:39,496 INFO L130 BoogieDeclarations]: Found specification of procedure rose_remove_route [2022-11-16 12:10:39,496 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_remove_route [2022-11-16 12:10:39,497 INFO L130 BoogieDeclarations]: Found specification of procedure ax25_listen_release [2022-11-16 12:10:39,497 INFO L138 BoogieDeclarations]: Found implementation of procedure ax25_listen_release [2022-11-16 12:10:39,497 INFO L130 BoogieDeclarations]: Found specification of procedure rosecmp [2022-11-16 12:10:39,497 INFO L138 BoogieDeclarations]: Found implementation of procedure rosecmp [2022-11-16 12:10:39,497 INFO L130 BoogieDeclarations]: Found specification of procedure rose_stop_ftimer [2022-11-16 12:10:39,497 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_stop_ftimer [2022-11-16 12:10:39,497 INFO L130 BoogieDeclarations]: Found specification of procedure rose_del_route_by_neigh [2022-11-16 12:10:39,497 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_del_route_by_neigh [2022-11-16 12:10:39,498 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_coherent_check_final_state [2022-11-16 12:10:39,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_coherent_check_final_state [2022-11-16 12:10:39,498 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2022-11-16 12:10:39,498 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2022-11-16 12:10:39,498 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_134 [2022-11-16 12:10:39,498 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_134 [2022-11-16 12:10:39,498 INFO L130 BoogieDeclarations]: Found specification of procedure debug_lockdep_rcu_enabled [2022-11-16 12:10:39,498 INFO L138 BoogieDeclarations]: Found implementation of procedure debug_lockdep_rcu_enabled [2022-11-16 12:10:39,499 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-16 12:10:39,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-16 12:10:39,499 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_arch_io_check_final_state [2022-11-16 12:10:39,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_arch_io_check_final_state [2022-11-16 12:10:39,499 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_module_check_final_state [2022-11-16 12:10:39,499 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_module_check_final_state [2022-11-16 12:10:39,499 INFO L130 BoogieDeclarations]: Found specification of procedure rose_setup [2022-11-16 12:10:39,500 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_setup [2022-11-16 12:10:39,500 INFO L130 BoogieDeclarations]: Found specification of procedure sk_wmem_alloc_get [2022-11-16 12:10:39,500 INFO L138 BoogieDeclarations]: Found implementation of procedure sk_wmem_alloc_get [2022-11-16 12:10:39,500 INFO L130 BoogieDeclarations]: Found specification of procedure sk_alloc [2022-11-16 12:10:39,500 INFO L138 BoogieDeclarations]: Found implementation of procedure sk_alloc [2022-11-16 12:10:39,500 INFO L130 BoogieDeclarations]: Found specification of procedure ax25cmp [2022-11-16 12:10:39,500 INFO L138 BoogieDeclarations]: Found implementation of procedure ax25cmp [2022-11-16 12:10:39,500 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_xmalloc [2022-11-16 12:10:39,501 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_xmalloc [2022-11-16 12:10:39,501 INFO L130 BoogieDeclarations]: Found specification of procedure remove_proc_entry [2022-11-16 12:10:39,501 INFO L138 BoogieDeclarations]: Found implementation of procedure remove_proc_entry [2022-11-16 12:10:39,501 INFO L130 BoogieDeclarations]: Found specification of procedure rose_start_t3timer [2022-11-16 12:10:39,501 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_start_t3timer [2022-11-16 12:10:39,505 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_dec_and_test [2022-11-16 12:10:39,505 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_dec_and_test [2022-11-16 12:10:39,505 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2022-11-16 12:10:39,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2022-11-16 12:10:39,506 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_block_queue_check_final_state [2022-11-16 12:10:39,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_block_queue_check_final_state [2022-11-16 12:10:39,506 INFO L130 BoogieDeclarations]: Found specification of procedure rose_remove_neigh [2022-11-16 12:10:39,506 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_remove_neigh [2022-11-16 12:10:39,506 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-16 12:10:39,508 INFO L130 BoogieDeclarations]: Found specification of procedure rose_disconnect [2022-11-16 12:10:39,508 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_disconnect [2022-11-16 12:10:39,508 INFO L130 BoogieDeclarations]: Found specification of procedure netdev_get_tx_queue [2022-11-16 12:10:39,509 INFO L138 BoogieDeclarations]: Found implementation of procedure netdev_get_tx_queue [2022-11-16 12:10:39,509 INFO L130 BoogieDeclarations]: Found specification of procedure sock_put [2022-11-16 12:10:39,509 INFO L138 BoogieDeclarations]: Found implementation of procedure sock_put [2022-11-16 12:10:39,509 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~int [2022-11-16 12:10:39,509 INFO L130 BoogieDeclarations]: Found specification of procedure sk_rmem_alloc_get [2022-11-16 12:10:39,509 INFO L138 BoogieDeclarations]: Found implementation of procedure sk_rmem_alloc_get [2022-11-16 12:10:39,509 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_unregister_netdev [2022-11-16 12:10:39,509 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_unregister_netdev [2022-11-16 12:10:39,510 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2022-11-16 12:10:39,510 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_in_interrupt_context [2022-11-16 12:10:39,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_in_interrupt_context [2022-11-16 12:10:39,510 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_after_alloc [2022-11-16 12:10:39,510 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_after_alloc [2022-11-16 12:10:39,510 INFO L130 BoogieDeclarations]: Found specification of procedure rose_route_free_lci [2022-11-16 12:10:39,510 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_route_free_lci [2022-11-16 12:10:39,510 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memcpy [2022-11-16 12:10:39,511 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memcpy [2022-11-16 12:10:39,511 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_register_reset_error_counter [2022-11-16 12:10:39,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_register_reset_error_counter [2022-11-16 12:10:39,511 INFO L130 BoogieDeclarations]: Found specification of procedure rose2asc [2022-11-16 12:10:39,511 INFO L138 BoogieDeclarations]: Found implementation of procedure rose2asc [2022-11-16 12:10:39,511 INFO L130 BoogieDeclarations]: Found specification of procedure rose_get_neigh [2022-11-16 12:10:39,511 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_get_neigh [2022-11-16 12:10:39,511 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_alloc_flags [2022-11-16 12:10:39,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_alloc_flags [2022-11-16 12:10:39,512 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_lib_idr_check_final_state [2022-11-16 12:10:39,512 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_lib_idr_check_final_state [2022-11-16 12:10:39,512 INFO L130 BoogieDeclarations]: Found specification of procedure skb_queue_purge [2022-11-16 12:10:39,512 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_queue_purge [2022-11-16 12:10:39,512 INFO L130 BoogieDeclarations]: Found specification of procedure proc_create [2022-11-16 12:10:39,512 INFO L138 BoogieDeclarations]: Found implementation of procedure proc_create [2022-11-16 12:10:39,512 INFO L130 BoogieDeclarations]: Found specification of procedure rose_kick [2022-11-16 12:10:39,513 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_kick [2022-11-16 12:10:39,513 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_bh_149 [2022-11-16 12:10:39,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_bh_149 [2022-11-16 12:10:39,513 INFO L130 BoogieDeclarations]: Found specification of procedure rose_start_t2timer [2022-11-16 12:10:39,513 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_start_t2timer [2022-11-16 12:10:39,513 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_seq_open [2022-11-16 12:10:39,513 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_seq_open [2022-11-16 12:10:39,513 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~VOID [2022-11-16 12:10:39,514 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~VOID [2022-11-16 12:10:39,514 INFO L130 BoogieDeclarations]: Found specification of procedure read_pnet [2022-11-16 12:10:39,514 INFO L138 BoogieDeclarations]: Found implementation of procedure read_pnet [2022-11-16 12:10:39,514 INFO L130 BoogieDeclarations]: Found specification of procedure rosecmpm [2022-11-16 12:10:39,514 INFO L138 BoogieDeclarations]: Found implementation of procedure rosecmpm [2022-11-16 12:10:39,514 INFO L130 BoogieDeclarations]: Found specification of procedure rose_enquiry_response [2022-11-16 12:10:39,514 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_enquiry_response [2022-11-16 12:10:39,515 INFO L130 BoogieDeclarations]: Found specification of procedure skb_put [2022-11-16 12:10:39,515 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_put [2022-11-16 12:10:39,515 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_usb_register_reset_error_counter [2022-11-16 12:10:39,515 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_usb_register_reset_error_counter [2022-11-16 12:10:39,515 INFO L130 BoogieDeclarations]: Found specification of procedure skb_reset_transport_header [2022-11-16 12:10:39,515 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_reset_transport_header [2022-11-16 12:10:39,515 INFO L130 BoogieDeclarations]: Found specification of procedure spin_lock_bh [2022-11-16 12:10:39,515 INFO L138 BoogieDeclarations]: Found implementation of procedure spin_lock_bh [2022-11-16 12:10:39,516 INFO L130 BoogieDeclarations]: Found specification of procedure rose_kill_by_neigh [2022-11-16 12:10:39,516 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_kill_by_neigh [2022-11-16 12:10:39,516 INFO L130 BoogieDeclarations]: Found specification of procedure skb_dequeue [2022-11-16 12:10:39,516 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_dequeue [2022-11-16 12:10:39,516 INFO L130 BoogieDeclarations]: Found specification of procedure rose_stop_t0timer [2022-11-16 12:10:39,516 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_stop_t0timer [2022-11-16 12:10:39,516 INFO L130 BoogieDeclarations]: Found specification of procedure read~unchecked~$Pointer$ [2022-11-16 12:10:39,516 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2022-11-16 12:10:39,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2022-11-16 12:10:39,517 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-11-16 12:10:39,517 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assert_linux_kernel_locking_spinlock__one_thread_double_unlock [2022-11-16 12:10:39,517 INFO L130 BoogieDeclarations]: Found specification of procedure seq_read [2022-11-16 12:10:39,517 INFO L138 BoogieDeclarations]: Found implementation of procedure seq_read [2022-11-16 12:10:39,517 INFO L130 BoogieDeclarations]: Found specification of procedure atomic_read [2022-11-16 12:10:39,517 INFO L138 BoogieDeclarations]: Found implementation of procedure atomic_read [2022-11-16 12:10:39,517 INFO L130 BoogieDeclarations]: Found specification of procedure skb_orphan [2022-11-16 12:10:39,518 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_orphan [2022-11-16 12:10:39,518 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~TO~int [2022-11-16 12:10:39,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~X~$Pointer$~X~int~X~$Pointer$~TO~int [2022-11-16 12:10:39,518 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-16 12:10:39,518 INFO L130 BoogieDeclarations]: Found specification of procedure kfree_skb [2022-11-16 12:10:39,518 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree_skb [2022-11-16 12:10:39,518 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_net_rtnetlink_check_final_state [2022-11-16 12:10:39,518 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_net_rtnetlink_check_final_state [2022-11-16 12:10:39,519 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_bh_150 [2022-11-16 12:10:39,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_bh_150 [2022-11-16 12:10:39,519 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_filter_positive_int [2022-11-16 12:10:39,519 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_filter_positive_int [2022-11-16 12:10:39,519 INFO L130 BoogieDeclarations]: Found specification of procedure skb_set_hash_from_sk [2022-11-16 12:10:39,519 INFO L138 BoogieDeclarations]: Found implementation of procedure skb_set_hash_from_sk [2022-11-16 12:10:39,519 INFO L130 BoogieDeclarations]: Found specification of procedure rose_route_frame [2022-11-16 12:10:39,519 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_route_frame [2022-11-16 12:10:39,520 INFO L130 BoogieDeclarations]: Found specification of procedure free_netdev [2022-11-16 12:10:39,520 INFO L138 BoogieDeclarations]: Found implementation of procedure free_netdev [2022-11-16 12:10:39,520 INFO L130 BoogieDeclarations]: Found specification of procedure rose_stop_idletimer [2022-11-16 12:10:39,520 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_stop_idletimer [2022-11-16 12:10:39,520 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-11-16 12:10:39,520 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_locking_rwlock_check_final_state [2022-11-16 12:10:39,520 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-16 12:10:39,520 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-16 12:10:39,521 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_bh_127 [2022-11-16 12:10:39,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_bh_127 [2022-11-16 12:10:39,521 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_unlock_bh_128 [2022-11-16 12:10:39,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_unlock_bh_128 [2022-11-16 12:10:39,521 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_fs_char_dev_check_final_state [2022-11-16 12:10:39,521 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_fs_char_dev_check_final_state [2022-11-16 12:10:39,521 INFO L130 BoogieDeclarations]: Found specification of procedure rose_route_open [2022-11-16 12:10:39,522 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_route_open [2022-11-16 12:10:39,522 INFO L130 BoogieDeclarations]: Found specification of procedure rose_nodes_open [2022-11-16 12:10:39,522 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_nodes_open [2022-11-16 12:10:39,522 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_drivers_base_class_check_final_state [2022-11-16 12:10:39,522 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_drivers_base_class_check_final_state [2022-11-16 12:10:39,522 INFO L130 BoogieDeclarations]: Found specification of procedure rose_transmit_clear_request [2022-11-16 12:10:39,522 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_transmit_clear_request [2022-11-16 12:10:39,522 INFO L130 BoogieDeclarations]: Found specification of procedure ax25_cb_put___0 [2022-11-16 12:10:39,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ax25_cb_put___0 [2022-11-16 12:10:39,523 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_spin_lock_bh_126___0 [2022-11-16 12:10:39,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_spin_lock_bh_126___0 [2022-11-16 12:10:39,523 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_free [2022-11-16 12:10:39,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_free [2022-11-16 12:10:39,523 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-11-16 12:10:39,523 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_linux_kernel_rcu_update_lock_sched_check_final_state [2022-11-16 12:10:39,523 INFO L130 BoogieDeclarations]: Found specification of procedure init_timer_key [2022-11-16 12:10:39,524 INFO L138 BoogieDeclarations]: Found implementation of procedure init_timer_key [2022-11-16 12:10:39,524 INFO L130 BoogieDeclarations]: Found specification of procedure asc2ax [2022-11-16 12:10:39,524 INFO L138 BoogieDeclarations]: Found implementation of procedure asc2ax [2022-11-16 12:10:39,524 INFO L130 BoogieDeclarations]: Found specification of procedure msecs_to_jiffies [2022-11-16 12:10:39,524 INFO L138 BoogieDeclarations]: Found implementation of procedure msecs_to_jiffies [2022-11-16 12:10:39,524 INFO L130 BoogieDeclarations]: Found specification of procedure rcu_read_unlock [2022-11-16 12:10:39,524 INFO L138 BoogieDeclarations]: Found implementation of procedure rcu_read_unlock [2022-11-16 12:10:39,524 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 12:10:39,525 INFO L130 BoogieDeclarations]: Found specification of procedure rose_frames_acked [2022-11-16 12:10:39,525 INFO L138 BoogieDeclarations]: Found implementation of procedure rose_frames_acked [2022-11-16 12:10:39,525 INFO L130 BoogieDeclarations]: Found specification of procedure net_eq [2022-11-16 12:10:39,525 INFO L138 BoogieDeclarations]: Found implementation of procedure net_eq [2022-11-16 12:10:39,525 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_netdev [2022-11-16 12:10:39,525 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_netdev [2022-11-16 12:10:41,174 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 12:10:41,179 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 12:10:41,970 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2022-11-16 12:11:39,753 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 12:11:39,785 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 12:11:39,786 INFO L300 CfgBuilder]: Removed 11 assume(true) statements. [2022-11-16 12:11:39,791 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:11:39 BoogieIcfgContainer [2022-11-16 12:11:39,792 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 12:11:39,795 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 12:11:39,796 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 12:11:39,802 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 12:11:39,803 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 12:10:26" (1/3) ... [2022-11-16 12:11:39,803 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@741da5ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:11:39, skipping insertion in model container [2022-11-16 12:11:39,804 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 12:10:38" (2/3) ... [2022-11-16 12:11:39,806 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@741da5ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 12:11:39, skipping insertion in model container [2022-11-16 12:11:39,806 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 12:11:39" (3/3) ... [2022-11-16 12:11:39,807 INFO L112 eAbstractionObserver]: Analyzing ICFG linux-4.0-rc1---net--rose--rose.ko.cil.i [2022-11-16 12:11:39,832 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 12:11:39,832 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2022-11-16 12:11:39,965 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 12:11:39,979 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;@5c76dcbe, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 12:11:39,980 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2022-11-16 12:11:39,992 INFO L276 IsEmpty]: Start isEmpty. Operand has 2933 states, 1954 states have (on average 1.3101330603889458) internal successors, (2560), 2098 states have internal predecessors, (2560), 791 states have call successors, (791), 162 states have call predecessors, (791), 161 states have return successors, (779), 738 states have call predecessors, (779), 779 states have call successors, (779) [2022-11-16 12:11:40,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-16 12:11:40,001 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:11:40,002 INFO L195 NwaCegarLoop]: trace histogram [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-16 12:11:40,002 INFO L420 AbstractCegarLoop]: === Iteration 1 === 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 24 more)] === [2022-11-16 12:11:40,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:11:40,008 INFO L85 PathProgramCache]: Analyzing trace with hash -667242363, now seen corresponding path program 1 times [2022-11-16 12:11:40,018 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:11:40,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904807271] [2022-11-16 12:11:40,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:40,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:11:40,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:41,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:11:41,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:41,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:11:41,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:41,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:11:41,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:11:41,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904807271] [2022-11-16 12:11:41,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904807271] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:11:41,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:11:41,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:11:41,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408784014] [2022-11-16 12:11:41,697 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:11:41,702 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:11:41,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:11:41,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:11:41,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:11:41,750 INFO L87 Difference]: Start difference. First operand has 2933 states, 1954 states have (on average 1.3101330603889458) internal successors, (2560), 2098 states have internal predecessors, (2560), 791 states have call successors, (791), 162 states have call predecessors, (791), 161 states have return successors, (779), 738 states have call predecessors, (779), 779 states have call successors, (779) Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:11:46,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:11:46,948 INFO L93 Difference]: Finished difference Result 6803 states and 9743 transitions. [2022-11-16 12:11:46,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 12:11:46,951 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-11-16 12:11:46,951 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:11:47,009 INFO L225 Difference]: With dead ends: 6803 [2022-11-16 12:11:47,010 INFO L226 Difference]: Without dead ends: 3863 [2022-11-16 12:11:47,044 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-11-16 12:11:47,049 INFO L413 NwaCegarLoop]: 4607 mSDtfsCounter, 3703 mSDsluCounter, 14015 mSDsCounter, 0 mSdLazyCounter, 1454 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3710 SdHoareTripleChecker+Valid, 18622 SdHoareTripleChecker+Invalid, 1455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 1454 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-11-16 12:11:47,050 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3710 Valid, 18622 Invalid, 1455 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [1 Valid, 1454 Invalid, 0 Unknown, 0 Unchecked, 4.4s Time] [2022-11-16 12:11:47,076 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3863 states. [2022-11-16 12:11:47,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3863 to 3853. [2022-11-16 12:11:47,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3853 states, 2586 states have (on average 1.2815158546017014) internal successors, (3314), 2744 states have internal predecessors, (3314), 997 states have call successors, (997), 245 states have call predecessors, (997), 244 states have return successors, (995), 948 states have call predecessors, (995), 995 states have call successors, (995) [2022-11-16 12:11:47,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3853 states to 3853 states and 5306 transitions. [2022-11-16 12:11:47,402 INFO L78 Accepts]: Start accepts. Automaton has 3853 states and 5306 transitions. Word has length 23 [2022-11-16 12:11:47,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:11:47,403 INFO L495 AbstractCegarLoop]: Abstraction has 3853 states and 5306 transitions. [2022-11-16 12:11:47,403 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:11:47,403 INFO L276 IsEmpty]: Start isEmpty. Operand 3853 states and 5306 transitions. [2022-11-16 12:11:47,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-16 12:11:47,405 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:11:47,406 INFO L195 NwaCegarLoop]: trace histogram [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-16 12:11:47,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 12:11:47,406 INFO L420 AbstractCegarLoop]: === Iteration 2 === 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 24 more)] === [2022-11-16 12:11:47,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:11:47,407 INFO L85 PathProgramCache]: Analyzing trace with hash -667182781, now seen corresponding path program 1 times [2022-11-16 12:11:47,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:11:47,407 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1628703722] [2022-11-16 12:11:47,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:47,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:11:47,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:48,116 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:11:48,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:48,137 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:11:48,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:48,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:11:48,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:11:48,149 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1628703722] [2022-11-16 12:11:48,149 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1628703722] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:11:48,149 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:11:48,149 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 12:11:48,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656850618] [2022-11-16 12:11:48,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:11:48,151 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 12:11:48,151 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:11:48,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 12:11:48,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 12:11:48,152 INFO L87 Difference]: Start difference. First operand 3853 states and 5306 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:11:48,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:11:48,377 INFO L93 Difference]: Finished difference Result 3867 states and 5323 transitions. [2022-11-16 12:11:48,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 12:11:48,378 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 23 [2022-11-16 12:11:48,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:11:48,405 INFO L225 Difference]: With dead ends: 3867 [2022-11-16 12:11:48,405 INFO L226 Difference]: Without dead ends: 3865 [2022-11-16 12:11:48,408 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 12:11:48,410 INFO L413 NwaCegarLoop]: 3982 mSDtfsCounter, 33 mSDsluCounter, 7951 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 11933 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:11:48,410 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 11933 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:11:48,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3865 states. [2022-11-16 12:11:48,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3865 to 3855. [2022-11-16 12:11:48,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3855 states, 2588 states have (on average 1.2809119010819165) internal successors, (3315), 2746 states have internal predecessors, (3315), 997 states have call successors, (997), 245 states have call predecessors, (997), 244 states have return successors, (995), 948 states have call predecessors, (995), 995 states have call successors, (995) [2022-11-16 12:11:48,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3855 states to 3855 states and 5307 transitions. [2022-11-16 12:11:48,629 INFO L78 Accepts]: Start accepts. Automaton has 3855 states and 5307 transitions. Word has length 23 [2022-11-16 12:11:48,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:11:48,629 INFO L495 AbstractCegarLoop]: Abstraction has 3855 states and 5307 transitions. [2022-11-16 12:11:48,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 1 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:11:48,630 INFO L276 IsEmpty]: Start isEmpty. Operand 3855 states and 5307 transitions. [2022-11-16 12:11:48,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-16 12:11:48,631 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:11:48,631 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 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-16 12:11:48,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 12:11:48,632 INFO L420 AbstractCegarLoop]: === Iteration 3 === 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 24 more)] === [2022-11-16 12:11:48,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:11:48,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1139773431, now seen corresponding path program 1 times [2022-11-16 12:11:48,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:11:48,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1413147804] [2022-11-16 12:11:48,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:48,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:11:48,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:49,055 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:11:49,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:49,078 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-11-16 12:11:49,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:49,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 12:11:49,095 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:11:49,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1413147804] [2022-11-16 12:11:49,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1413147804] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:11:49,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:11:49,096 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 12:11:49,096 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1399111325] [2022-11-16 12:11:49,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:11:49,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-16 12:11:49,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:11:49,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 12:11:49,098 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:11:49,098 INFO L87 Difference]: Start difference. First operand 3855 states and 5307 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:11:49,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:11:49,353 INFO L93 Difference]: Finished difference Result 7695 states and 10683 transitions. [2022-11-16 12:11:49,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 12:11:49,353 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 27 [2022-11-16 12:11:49,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:11:49,387 INFO L225 Difference]: With dead ends: 7695 [2022-11-16 12:11:49,387 INFO L226 Difference]: Without dead ends: 3849 [2022-11-16 12:11:49,412 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 12:11:49,413 INFO L413 NwaCegarLoop]: 3977 mSDtfsCounter, 3961 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3961 SdHoareTripleChecker+Valid, 3977 SdHoareTripleChecker+Invalid, 1 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:11:49,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3961 Valid, 3977 Invalid, 1 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 12:11:49,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3849 states. [2022-11-16 12:11:49,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3849 to 3849. [2022-11-16 12:11:49,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3849 states, 2583 states have (on average 1.2799070847851335) internal successors, (3306), 2740 states have internal predecessors, (3306), 997 states have call successors, (997), 245 states have call predecessors, (997), 244 states have return successors, (995), 948 states have call predecessors, (995), 995 states have call successors, (995) [2022-11-16 12:11:49,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3849 states to 3849 states and 5298 transitions. [2022-11-16 12:11:49,753 INFO L78 Accepts]: Start accepts. Automaton has 3849 states and 5298 transitions. Word has length 27 [2022-11-16 12:11:49,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:11:49,753 INFO L495 AbstractCegarLoop]: Abstraction has 3849 states and 5298 transitions. [2022-11-16 12:11:49,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-16 12:11:49,755 INFO L276 IsEmpty]: Start isEmpty. Operand 3849 states and 5298 transitions. [2022-11-16 12:11:49,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-16 12:11:49,761 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:11:49,762 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] [2022-11-16 12:11:49,762 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 12:11:49,762 INFO L420 AbstractCegarLoop]: === Iteration 4 === 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 24 more)] === [2022-11-16 12:11:49,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:11:49,763 INFO L85 PathProgramCache]: Analyzing trace with hash -1219424498, now seen corresponding path program 1 times [2022-11-16 12:11:49,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:11:49,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361081038] [2022-11-16 12:11:49,763 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:11:49,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:11:49,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:50,385 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:11:50,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:50,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 12:11:50,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:50,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 12:11:50,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:50,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-16 12:11:50,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:50,498 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:11:50,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:50,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 12:11:50,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:50,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-16 12:11:50,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:11:50,551 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-16 12:11:50,551 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:11:50,551 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361081038] [2022-11-16 12:11:50,551 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361081038] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:11:50,552 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:11:50,552 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:11:50,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1530758216] [2022-11-16 12:11:50,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:11:50,553 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:11:50,553 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:11:50,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:11:50,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:11:50,554 INFO L87 Difference]: Start difference. First operand 3849 states and 5298 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 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-16 12:11:55,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:12:09,694 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-16 12:12:14,002 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-16 12:12:15,365 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-16 12:12:17,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.67s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:12:19,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:12:25,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:12:25,639 INFO L93 Difference]: Finished difference Result 4585 states and 6202 transitions. [2022-11-16 12:12:25,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:12:25,644 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 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 51 [2022-11-16 12:12:25,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:12:25,671 INFO L225 Difference]: With dead ends: 4585 [2022-11-16 12:12:25,671 INFO L226 Difference]: Without dead ends: 4583 [2022-11-16 12:12:25,674 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 15 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-16 12:12:25,675 INFO L413 NwaCegarLoop]: 1120 mSDtfsCounter, 6955 mSDsluCounter, 1946 mSDsCounter, 0 mSdLazyCounter, 7273 mSolverCounterSat, 3849 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 31.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7232 SdHoareTripleChecker+Valid, 3066 SdHoareTripleChecker+Invalid, 11125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 3849 IncrementalHoareTripleChecker+Valid, 7273 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 34.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:12:25,675 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7232 Valid, 3066 Invalid, 11125 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [3849 Valid, 7273 Invalid, 3 Unknown, 0 Unchecked, 34.1s Time] [2022-11-16 12:12:25,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4583 states. [2022-11-16 12:12:25,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4583 to 4568. [2022-11-16 12:12:25,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4568 states, 3067 states have (on average 1.2680143462667102) internal successors, (3889), 3240 states have internal predecessors, (3889), 1150 states have call successors, (1150), 328 states have call predecessors, (1150), 327 states have return successors, (1148), 1098 states have call predecessors, (1148), 1148 states have call successors, (1148) [2022-11-16 12:12:25,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4568 states to 4568 states and 6187 transitions. [2022-11-16 12:12:25,984 INFO L78 Accepts]: Start accepts. Automaton has 4568 states and 6187 transitions. Word has length 51 [2022-11-16 12:12:25,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:12:25,984 INFO L495 AbstractCegarLoop]: Abstraction has 4568 states and 6187 transitions. [2022-11-16 12:12:25,985 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 4 states have internal predecessors, (30), 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-16 12:12:25,985 INFO L276 IsEmpty]: Start isEmpty. Operand 4568 states and 6187 transitions. [2022-11-16 12:12:25,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-11-16 12:12:25,991 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:12:25,992 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] [2022-11-16 12:12:25,992 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-16 12:12:25,992 INFO L420 AbstractCegarLoop]: === Iteration 5 === 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 24 more)] === [2022-11-16 12:12:25,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:12:25,993 INFO L85 PathProgramCache]: Analyzing trace with hash 2134911608, now seen corresponding path program 1 times [2022-11-16 12:12:25,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:12:25,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884232682] [2022-11-16 12:12:25,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:12:25,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:12:26,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:26,537 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:12:26,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:26,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 12:12:26,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:26,616 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 12:12:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:26,635 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-16 12:12:26,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:26,655 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:12:26,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:26,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 12:12:26,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:26,688 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-16 12:12:26,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:26,704 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 12:12:26,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:12:26,730 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-16 12:12:26,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:12:26,732 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884232682] [2022-11-16 12:12:26,732 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884232682] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:12:26,732 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:12:26,733 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:12:26,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [32914158] [2022-11-16 12:12:26,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:12:26,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:12:26,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:12:26,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:12:26,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:12:26,735 INFO L87 Difference]: Start difference. First operand 4568 states and 6187 transitions. Second operand has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 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-16 12:12:32,404 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-16 12:12:45,594 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-16 12:12:48,948 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-16 12:12:53,846 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-16 12:12:55,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:12:57,842 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-16 12:13:00,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:13:04,560 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:13:06,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:13:06,227 INFO L93 Difference]: Finished difference Result 4583 states and 6200 transitions. [2022-11-16 12:13:06,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:13:06,227 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 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 57 [2022-11-16 12:13:06,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:13:06,259 INFO L225 Difference]: With dead ends: 4583 [2022-11-16 12:13:06,259 INFO L226 Difference]: Without dead ends: 4581 [2022-11-16 12:13:06,262 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:13:06,263 INFO L413 NwaCegarLoop]: 1120 mSDtfsCounter, 6949 mSDsluCounter, 1946 mSDsCounter, 0 mSdLazyCounter, 7268 mSolverCounterSat, 3849 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7225 SdHoareTripleChecker+Valid, 3066 SdHoareTripleChecker+Invalid, 11121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3849 IncrementalHoareTripleChecker+Valid, 7268 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:13:06,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7225 Valid, 3066 Invalid, 11121 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3849 Valid, 7268 Invalid, 4 Unknown, 0 Unchecked, 38.6s Time] [2022-11-16 12:13:06,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4581 states. [2022-11-16 12:13:06,594 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4581 to 4566. [2022-11-16 12:13:06,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4566 states, 3066 states have (on average 1.2677756033920418) internal successors, (3887), 3238 states have internal predecessors, (3887), 1150 states have call successors, (1150), 328 states have call predecessors, (1150), 327 states have return successors, (1148), 1098 states have call predecessors, (1148), 1148 states have call successors, (1148) [2022-11-16 12:13:06,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4566 states to 4566 states and 6185 transitions. [2022-11-16 12:13:06,630 INFO L78 Accepts]: Start accepts. Automaton has 4566 states and 6185 transitions. Word has length 57 [2022-11-16 12:13:06,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:13:06,631 INFO L495 AbstractCegarLoop]: Abstraction has 4566 states and 6185 transitions. [2022-11-16 12:13:06,631 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.666666666666667) internal successors, (34), 4 states have internal predecessors, (34), 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-16 12:13:06,631 INFO L276 IsEmpty]: Start isEmpty. Operand 4566 states and 6185 transitions. [2022-11-16 12:13:06,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-11-16 12:13:06,633 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:13:06,634 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] [2022-11-16 12:13:06,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 12:13:06,635 INFO L420 AbstractCegarLoop]: === Iteration 6 === 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 24 more)] === [2022-11-16 12:13:06,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:13:06,636 INFO L85 PathProgramCache]: Analyzing trace with hash -94092271, now seen corresponding path program 1 times [2022-11-16 12:13:06,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:13:06,637 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880628458] [2022-11-16 12:13:06,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:13:06,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:13:06,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:07,303 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:13:07,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:07,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 12:13:07,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:07,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 12:13:07,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:07,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-16 12:13:07,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:07,418 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:13:07,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:07,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 12:13:07,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:07,442 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-16 12:13:07,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:07,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 12:13:07,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:07,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-16 12:13:07,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:07,491 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 12:13:07,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:13:07,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880628458] [2022-11-16 12:13:07,491 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880628458] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:13:07,492 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:13:07,492 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:13:07,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [125215209] [2022-11-16 12:13:07,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:13:07,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:13:07,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:13:07,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:13:07,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:13:07,494 INFO L87 Difference]: Start difference. First operand 4566 states and 6185 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 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-16 12:13:13,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.27s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:13:29,173 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-16 12:13:31,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:13:36,935 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-16 12:13:38,972 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-16 12:13:41,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:13:46,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:13:46,588 INFO L93 Difference]: Finished difference Result 4583 states and 6200 transitions. [2022-11-16 12:13:46,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:13:46,590 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 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 63 [2022-11-16 12:13:46,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:13:46,618 INFO L225 Difference]: With dead ends: 4583 [2022-11-16 12:13:46,618 INFO L226 Difference]: Without dead ends: 4581 [2022-11-16 12:13:46,621 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:13:46,622 INFO L413 NwaCegarLoop]: 1121 mSDtfsCounter, 6939 mSDsluCounter, 1948 mSDsCounter, 0 mSdLazyCounter, 7261 mSolverCounterSat, 3851 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 36.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7214 SdHoareTripleChecker+Valid, 3069 SdHoareTripleChecker+Invalid, 11117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3851 IncrementalHoareTripleChecker+Valid, 7261 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 38.3s IncrementalHoareTripleChecker+Time [2022-11-16 12:13:46,622 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7214 Valid, 3069 Invalid, 11117 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3851 Valid, 7261 Invalid, 5 Unknown, 0 Unchecked, 38.3s Time] [2022-11-16 12:13:46,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4581 states. [2022-11-16 12:13:46,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4581 to 4564. [2022-11-16 12:13:46,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4564 states, 3065 states have (on average 1.267536704730832) internal successors, (3885), 3236 states have internal predecessors, (3885), 1150 states have call successors, (1150), 328 states have call predecessors, (1150), 327 states have return successors, (1148), 1098 states have call predecessors, (1148), 1148 states have call successors, (1148) [2022-11-16 12:13:46,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4564 states to 4564 states and 6183 transitions. [2022-11-16 12:13:46,967 INFO L78 Accepts]: Start accepts. Automaton has 4564 states and 6183 transitions. Word has length 63 [2022-11-16 12:13:46,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:13:46,968 INFO L495 AbstractCegarLoop]: Abstraction has 4564 states and 6183 transitions. [2022-11-16 12:13:46,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 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-16 12:13:46,968 INFO L276 IsEmpty]: Start isEmpty. Operand 4564 states and 6183 transitions. [2022-11-16 12:13:46,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-11-16 12:13:46,971 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:13:46,971 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] [2022-11-16 12:13:46,971 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 12:13:46,972 INFO L420 AbstractCegarLoop]: === Iteration 7 === 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 24 more)] === [2022-11-16 12:13:46,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:13:46,972 INFO L85 PathProgramCache]: Analyzing trace with hash -2125065950, now seen corresponding path program 1 times [2022-11-16 12:13:46,972 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:13:46,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438881478] [2022-11-16 12:13:46,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:13:46,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:13:47,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:47,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:13:47,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:47,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 12:13:47,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:47,596 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 12:13:47,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:47,611 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-16 12:13:47,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:47,629 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:13:47,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:47,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 12:13:47,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:47,652 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-16 12:13:47,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:47,667 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 12:13:47,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:47,683 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-16 12:13:47,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:47,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-16 12:13:47,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:13:47,714 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-16 12:13:47,714 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:13:47,714 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438881478] [2022-11-16 12:13:47,715 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438881478] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:13:47,715 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:13:47,715 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:13:47,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068117276] [2022-11-16 12:13:47,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:13:47,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:13:47,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:13:47,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:13:47,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:13:47,717 INFO L87 Difference]: Start difference. First operand 4564 states and 6183 transitions. Second operand has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 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-16 12:13:53,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:14:08,113 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-16 12:14:10,905 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:14:16,068 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-16 12:14:17,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:14:21,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:14:28,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:14:28,173 INFO L93 Difference]: Finished difference Result 4579 states and 6196 transitions. [2022-11-16 12:14:28,173 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:14:28,174 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 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 69 [2022-11-16 12:14:28,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:14:28,202 INFO L225 Difference]: With dead ends: 4579 [2022-11-16 12:14:28,202 INFO L226 Difference]: Without dead ends: 4577 [2022-11-16 12:14:28,205 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:14:28,206 INFO L413 NwaCegarLoop]: 1120 mSDtfsCounter, 6937 mSDsluCounter, 1946 mSDsCounter, 0 mSdLazyCounter, 7261 mSolverCounterSat, 3849 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7211 SdHoareTripleChecker+Valid, 3066 SdHoareTripleChecker+Invalid, 11113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3849 IncrementalHoareTripleChecker+Valid, 7261 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:14:28,207 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7211 Valid, 3066 Invalid, 11113 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3849 Valid, 7261 Invalid, 3 Unknown, 0 Unchecked, 39.6s Time] [2022-11-16 12:14:28,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4577 states. [2022-11-16 12:14:28,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4577 to 4562. [2022-11-16 12:14:28,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4562 states, 3064 states have (on average 1.2672976501305484) internal successors, (3883), 3234 states have internal predecessors, (3883), 1150 states have call successors, (1150), 328 states have call predecessors, (1150), 327 states have return successors, (1148), 1098 states have call predecessors, (1148), 1148 states have call successors, (1148) [2022-11-16 12:14:28,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4562 states to 4562 states and 6181 transitions. [2022-11-16 12:14:28,586 INFO L78 Accepts]: Start accepts. Automaton has 4562 states and 6181 transitions. Word has length 69 [2022-11-16 12:14:28,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:14:28,587 INFO L495 AbstractCegarLoop]: Abstraction has 4562 states and 6181 transitions. [2022-11-16 12:14:28,587 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.0) internal successors, (42), 4 states have internal predecessors, (42), 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-16 12:14:28,587 INFO L276 IsEmpty]: Start isEmpty. Operand 4562 states and 6181 transitions. [2022-11-16 12:14:28,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-11-16 12:14:28,588 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:14:28,589 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] [2022-11-16 12:14:28,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 12:14:28,589 INFO L420 AbstractCegarLoop]: === Iteration 8 === 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 24 more)] === [2022-11-16 12:14:28,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:14:28,590 INFO L85 PathProgramCache]: Analyzing trace with hash 864613272, now seen corresponding path program 1 times [2022-11-16 12:14:28,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:14:28,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008991163] [2022-11-16 12:14:28,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:14:28,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:14:28,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:14:29,158 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:14:29,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:14:29,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 12:14:29,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:14:29,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 12:14:29,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:14:29,268 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-16 12:14:29,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:14:29,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:14:29,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:14:29,302 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 12:14:29,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:14:29,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-16 12:14:29,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:14:29,337 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 12:14:29,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:14:29,354 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-16 12:14:29,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:14:29,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-16 12:14:29,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:14:29,388 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-16 12:14:29,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:14:29,405 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-16 12:14:29,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:14:29,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008991163] [2022-11-16 12:14:29,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008991163] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:14:29,406 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:14:29,406 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:14:29,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887373014] [2022-11-16 12:14:29,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:14:29,407 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:14:29,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:14:29,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:14:29,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:14:29,409 INFO L87 Difference]: Start difference. First operand 4562 states and 6181 transitions. Second operand has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 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-16 12:14:36,081 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-16 12:14:52,959 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-16 12:14:55,886 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:15:01,325 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-16 12:15:03,356 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-16 12:15:05,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:15:12,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:15:12,197 INFO L93 Difference]: Finished difference Result 4603 states and 6222 transitions. [2022-11-16 12:15:12,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:15:12,198 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 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 75 [2022-11-16 12:15:12,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:15:12,224 INFO L225 Difference]: With dead ends: 4603 [2022-11-16 12:15:12,224 INFO L226 Difference]: Without dead ends: 4601 [2022-11-16 12:15:12,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:15:12,229 INFO L413 NwaCegarLoop]: 1122 mSDtfsCounter, 6936 mSDsluCounter, 1949 mSDsCounter, 0 mSdLazyCounter, 7271 mSolverCounterSat, 3867 mSolverCounterUnsat, 6 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 39.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7211 SdHoareTripleChecker+Valid, 3071 SdHoareTripleChecker+Invalid, 11144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3867 IncrementalHoareTripleChecker+Valid, 7271 IncrementalHoareTripleChecker+Invalid, 6 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 41.8s IncrementalHoareTripleChecker+Time [2022-11-16 12:15:12,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7211 Valid, 3071 Invalid, 11144 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3867 Valid, 7271 Invalid, 6 Unknown, 0 Unchecked, 41.8s Time] [2022-11-16 12:15:12,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4601 states. [2022-11-16 12:15:12,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4601 to 4581. [2022-11-16 12:15:12,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4581 states, 3076 states have (on average 1.2662548764629389) internal successors, (3895), 3246 states have internal predecessors, (3895), 1154 states have call successors, (1154), 332 states have call predecessors, (1154), 331 states have return successors, (1152), 1101 states have call predecessors, (1152), 1152 states have call successors, (1152) [2022-11-16 12:15:12,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4581 states to 4581 states and 6201 transitions. [2022-11-16 12:15:12,652 INFO L78 Accepts]: Start accepts. Automaton has 4581 states and 6201 transitions. Word has length 75 [2022-11-16 12:15:12,654 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:15:12,654 INFO L495 AbstractCegarLoop]: Abstraction has 4581 states and 6201 transitions. [2022-11-16 12:15:12,654 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.666666666666667) internal successors, (46), 4 states have internal predecessors, (46), 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-16 12:15:12,655 INFO L276 IsEmpty]: Start isEmpty. Operand 4581 states and 6201 transitions. [2022-11-16 12:15:12,656 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-11-16 12:15:12,656 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:15:12,657 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] [2022-11-16 12:15:12,657 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-16 12:15:12,657 INFO L420 AbstractCegarLoop]: === Iteration 9 === 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 24 more)] === [2022-11-16 12:15:12,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:15:12,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1776570356, now seen corresponding path program 1 times [2022-11-16 12:15:12,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:15:12,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039698301] [2022-11-16 12:15:12,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:15:12,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:15:12,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:13,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:15:13,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:13,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 12:15:13,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:13,459 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 12:15:13,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:13,478 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-16 12:15:13,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:13,520 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:15:13,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:13,529 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 12:15:13,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:13,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-16 12:15:13,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:13,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 12:15:13,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:13,576 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-16 12:15:13,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:13,593 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-16 12:15:13,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:13,609 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-16 12:15:13,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:13,624 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-16 12:15:13,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:15:13,640 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-16 12:15:13,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:15:13,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039698301] [2022-11-16 12:15:13,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039698301] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:15:13,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:15:13,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:15:13,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [806323464] [2022-11-16 12:15:13,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:15:13,642 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:15:13,642 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:15:13,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:15:13,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:15:13,643 INFO L87 Difference]: Start difference. First operand 4581 states and 6201 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 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-16 12:15:20,448 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-16 12:15:40,184 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:15:45,658 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:15:47,669 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-16 12:15:49,011 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:15:51,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:15:56,798 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:15:59,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:15:59,056 INFO L93 Difference]: Finished difference Result 4597 states and 6216 transitions. [2022-11-16 12:15:59,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:15:59,057 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 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 81 [2022-11-16 12:15:59,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:15:59,175 INFO L225 Difference]: With dead ends: 4597 [2022-11-16 12:15:59,175 INFO L226 Difference]: Without dead ends: 4595 [2022-11-16 12:15:59,177 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:15:59,177 INFO L413 NwaCegarLoop]: 1120 mSDtfsCounter, 6946 mSDsluCounter, 1945 mSDsCounter, 0 mSdLazyCounter, 7265 mSolverCounterSat, 3863 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7220 SdHoareTripleChecker+Valid, 3065 SdHoareTripleChecker+Invalid, 11132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3863 IncrementalHoareTripleChecker+Valid, 7265 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.5s IncrementalHoareTripleChecker+Time [2022-11-16 12:15:59,178 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7220 Valid, 3065 Invalid, 11132 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3863 Valid, 7265 Invalid, 4 Unknown, 0 Unchecked, 44.5s Time] [2022-11-16 12:15:59,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4595 states. [2022-11-16 12:15:59,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4595 to 4579. [2022-11-16 12:15:59,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4579 states, 3075 states have (on average 1.2660162601626017) internal successors, (3893), 3244 states have internal predecessors, (3893), 1154 states have call successors, (1154), 332 states have call predecessors, (1154), 331 states have return successors, (1152), 1101 states have call predecessors, (1152), 1152 states have call successors, (1152) [2022-11-16 12:15:59,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4579 states to 4579 states and 6199 transitions. [2022-11-16 12:15:59,545 INFO L78 Accepts]: Start accepts. Automaton has 4579 states and 6199 transitions. Word has length 81 [2022-11-16 12:15:59,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:15:59,546 INFO L495 AbstractCegarLoop]: Abstraction has 4579 states and 6199 transitions. [2022-11-16 12:15:59,546 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 4 states have internal predecessors, (50), 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-16 12:15:59,546 INFO L276 IsEmpty]: Start isEmpty. Operand 4579 states and 6199 transitions. [2022-11-16 12:15:59,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-11-16 12:15:59,555 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:15:59,555 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] [2022-11-16 12:15:59,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-16 12:15:59,556 INFO L420 AbstractCegarLoop]: === Iteration 10 === 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 24 more)] === [2022-11-16 12:15:59,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:15:59,557 INFO L85 PathProgramCache]: Analyzing trace with hash 957334913, now seen corresponding path program 1 times [2022-11-16 12:15:59,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:15:59,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1861409449] [2022-11-16 12:15:59,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:15:59,557 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:15:59,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:16:00,064 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:16:00,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:16:00,106 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 12:16:00,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:16:00,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 12:16:00,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:16:00,174 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-16 12:16:00,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:16:00,195 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:16:00,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:16:00,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 12:16:00,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:16:00,233 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-16 12:16:00,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:16:00,249 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 12:16:00,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:16:00,265 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-16 12:16:00,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:16:00,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-16 12:16:00,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:16:00,296 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-16 12:16:00,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:16:00,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-16 12:16:00,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:16:00,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-16 12:16:00,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:16:00,344 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-16 12:16:00,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:16:00,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1861409449] [2022-11-16 12:16:00,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1861409449] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:16:00,345 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:16:00,345 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:16:00,345 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [13136918] [2022-11-16 12:16:00,345 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:16:00,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:16:00,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:16:00,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:16:00,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:16:00,348 INFO L87 Difference]: Start difference. First operand 4579 states and 6199 transitions. Second operand has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 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-16 12:16:06,846 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-16 12:16:23,577 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-16 12:16:26,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:16:31,799 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-16 12:16:35,298 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-16 12:16:37,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:16:43,084 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:16:44,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:16:44,512 INFO L93 Difference]: Finished difference Result 4597 states and 6216 transitions. [2022-11-16 12:16:44,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:16:44,513 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 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 87 [2022-11-16 12:16:44,513 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:16:44,533 INFO L225 Difference]: With dead ends: 4597 [2022-11-16 12:16:44,534 INFO L226 Difference]: Without dead ends: 4595 [2022-11-16 12:16:44,537 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:16:44,537 INFO L413 NwaCegarLoop]: 1121 mSDtfsCounter, 6928 mSDsluCounter, 1947 mSDsCounter, 0 mSdLazyCounter, 7266 mSolverCounterSat, 3865 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7201 SdHoareTripleChecker+Valid, 3068 SdHoareTripleChecker+Invalid, 11136 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3865 IncrementalHoareTripleChecker+Valid, 7266 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 43.2s IncrementalHoareTripleChecker+Time [2022-11-16 12:16:44,538 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7201 Valid, 3068 Invalid, 11136 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3865 Valid, 7266 Invalid, 5 Unknown, 0 Unchecked, 43.2s Time] [2022-11-16 12:16:44,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4595 states. [2022-11-16 12:16:44,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4595 to 4577. [2022-11-16 12:16:44,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4577 states, 3074 states have (on average 1.2657774886141835) internal successors, (3891), 3242 states have internal predecessors, (3891), 1154 states have call successors, (1154), 332 states have call predecessors, (1154), 331 states have return successors, (1152), 1101 states have call predecessors, (1152), 1152 states have call successors, (1152) [2022-11-16 12:16:44,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4577 states to 4577 states and 6197 transitions. [2022-11-16 12:16:44,887 INFO L78 Accepts]: Start accepts. Automaton has 4577 states and 6197 transitions. Word has length 87 [2022-11-16 12:16:44,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:16:44,888 INFO L495 AbstractCegarLoop]: Abstraction has 4577 states and 6197 transitions. [2022-11-16 12:16:44,888 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.0) internal successors, (54), 4 states have internal predecessors, (54), 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-16 12:16:44,888 INFO L276 IsEmpty]: Start isEmpty. Operand 4577 states and 6197 transitions. [2022-11-16 12:16:44,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-11-16 12:16:44,890 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:16:44,890 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:16:44,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 12:16:44,891 INFO L420 AbstractCegarLoop]: === Iteration 11 === 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 24 more)] === [2022-11-16 12:16:44,891 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:16:44,891 INFO L85 PathProgramCache]: Analyzing trace with hash -685234720, now seen corresponding path program 1 times [2022-11-16 12:16:44,891 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:16:44,892 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [141486510] [2022-11-16 12:16:44,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:16:44,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:16:44,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:16:45,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:16:45,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:16:45,441 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 12:16:45,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:16:45,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 12:16:45,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:16:45,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-16 12:16:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:16:45,523 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:16:45,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:16:45,531 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 12:16:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:16:45,545 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-16 12:16:45,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:16:45,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 12:16:45,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:16:45,572 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-16 12:16:45,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:16:45,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-16 12:16:45,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:16:45,600 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-16 12:16:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:16:45,613 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-16 12:16:45,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:16:45,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-16 12:16:45,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:16:45,640 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 12:16:45,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:16:45,656 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-16 12:16:45,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:16:45,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [141486510] [2022-11-16 12:16:45,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [141486510] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:16:45,656 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:16:45,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:16:45,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [316702115] [2022-11-16 12:16:45,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:16:45,657 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:16:45,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:16:45,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:16:45,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:16:45,659 INFO L87 Difference]: Start difference. First operand 4577 states and 6197 transitions. Second operand has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-16 12:16:53,415 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-16 12:17:12,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:17:18,428 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-16 12:17:20,467 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-16 12:17:22,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:17:29,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:17:29,266 INFO L93 Difference]: Finished difference Result 4594 states and 6212 transitions. [2022-11-16 12:17:29,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:17:29,267 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 93 [2022-11-16 12:17:29,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:17:29,286 INFO L225 Difference]: With dead ends: 4594 [2022-11-16 12:17:29,286 INFO L226 Difference]: Without dead ends: 4592 [2022-11-16 12:17:29,290 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:17:29,291 INFO L413 NwaCegarLoop]: 1121 mSDtfsCounter, 6913 mSDsluCounter, 1948 mSDsCounter, 0 mSdLazyCounter, 7237 mSolverCounterSat, 3851 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 40.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7183 SdHoareTripleChecker+Valid, 3069 SdHoareTripleChecker+Invalid, 11093 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3851 IncrementalHoareTripleChecker+Valid, 7237 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 42.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:17:29,292 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7183 Valid, 3069 Invalid, 11093 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3851 Valid, 7237 Invalid, 5 Unknown, 0 Unchecked, 42.6s Time] [2022-11-16 12:17:29,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4592 states. [2022-11-16 12:17:29,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4592 to 4575. [2022-11-16 12:17:29,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4575 states, 3073 states have (on average 1.2655385616661243) internal successors, (3889), 3240 states have internal predecessors, (3889), 1154 states have call successors, (1154), 332 states have call predecessors, (1154), 331 states have return successors, (1152), 1101 states have call predecessors, (1152), 1152 states have call successors, (1152) [2022-11-16 12:17:29,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4575 states to 4575 states and 6195 transitions. [2022-11-16 12:17:29,839 INFO L78 Accepts]: Start accepts. Automaton has 4575 states and 6195 transitions. Word has length 93 [2022-11-16 12:17:29,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:17:29,840 INFO L495 AbstractCegarLoop]: Abstraction has 4575 states and 6195 transitions. [2022-11-16 12:17:29,840 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.666666666666666) internal successors, (58), 4 states have internal predecessors, (58), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-16 12:17:29,841 INFO L276 IsEmpty]: Start isEmpty. Operand 4575 states and 6195 transitions. [2022-11-16 12:17:29,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-11-16 12:17:29,843 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:17:29,843 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] [2022-11-16 12:17:29,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-16 12:17:29,844 INFO L420 AbstractCegarLoop]: === Iteration 12 === 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 24 more)] === [2022-11-16 12:17:29,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:17:29,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1380400989, now seen corresponding path program 1 times [2022-11-16 12:17:29,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:17:29,846 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2037139615] [2022-11-16 12:17:29,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:17:29,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:17:29,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:30,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:17:30,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:30,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 12:17:30,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:30,492 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 12:17:30,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:30,506 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-16 12:17:30,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:30,524 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:17:30,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:30,533 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 12:17:30,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:30,548 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-16 12:17:30,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:30,564 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 12:17:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:30,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-16 12:17:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:30,595 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-16 12:17:30,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:30,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-16 12:17:30,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:30,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-16 12:17:30,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:30,643 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-16 12:17:30,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:30,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 12:17:30,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:17:30,688 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-16 12:17:30,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:17:30,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2037139615] [2022-11-16 12:17:30,689 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2037139615] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:17:30,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:17:30,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:17:30,690 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887067197] [2022-11-16 12:17:30,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:17:30,691 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:17:30,691 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:17:30,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:17:30,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:17:30,692 INFO L87 Difference]: Start difference. First operand 4575 states and 6195 transitions. Second operand has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 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-16 12:17:38,151 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-16 12:17:56,874 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:17:58,770 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-16 12:18:01,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:18:07,640 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-16 12:18:09,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:18:13,257 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:18:20,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:18:20,487 INFO L93 Difference]: Finished difference Result 4593 states and 6212 transitions. [2022-11-16 12:18:20,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:18:20,488 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 2 states have call successors, (15), 4 states have call predecessors, (15), 1 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 95 [2022-11-16 12:18:20,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:18:20,508 INFO L225 Difference]: With dead ends: 4593 [2022-11-16 12:18:20,508 INFO L226 Difference]: Without dead ends: 4591 [2022-11-16 12:18:20,511 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:18:20,512 INFO L413 NwaCegarLoop]: 1121 mSDtfsCounter, 6914 mSDsluCounter, 1947 mSDsCounter, 0 mSdLazyCounter, 7259 mSolverCounterSat, 3865 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 46.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7186 SdHoareTripleChecker+Valid, 3068 SdHoareTripleChecker+Invalid, 11128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3865 IncrementalHoareTripleChecker+Valid, 7259 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 48.7s IncrementalHoareTripleChecker+Time [2022-11-16 12:18:20,512 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7186 Valid, 3068 Invalid, 11128 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3865 Valid, 7259 Invalid, 4 Unknown, 0 Unchecked, 48.7s Time] [2022-11-16 12:18:20,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4591 states. [2022-11-16 12:18:20,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4591 to 4573. [2022-11-16 12:18:20,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4573 states, 3072 states have (on average 1.2652994791666667) internal successors, (3887), 3238 states have internal predecessors, (3887), 1154 states have call successors, (1154), 332 states have call predecessors, (1154), 331 states have return successors, (1152), 1101 states have call predecessors, (1152), 1152 states have call successors, (1152) [2022-11-16 12:18:20,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4573 states to 4573 states and 6193 transitions. [2022-11-16 12:18:20,935 INFO L78 Accepts]: Start accepts. Automaton has 4573 states and 6193 transitions. Word has length 95 [2022-11-16 12:18:20,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:18:20,936 INFO L495 AbstractCegarLoop]: Abstraction has 4573 states and 6193 transitions. [2022-11-16 12:18:20,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.0) internal successors, (60), 4 states have internal predecessors, (60), 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-16 12:18:20,936 INFO L276 IsEmpty]: Start isEmpty. Operand 4573 states and 6193 transitions. [2022-11-16 12:18:20,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-11-16 12:18:20,938 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:18:20,938 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 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] [2022-11-16 12:18:20,939 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 12:18:20,939 INFO L420 AbstractCegarLoop]: === Iteration 13 === 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 24 more)] === [2022-11-16 12:18:20,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:18:20,940 INFO L85 PathProgramCache]: Analyzing trace with hash -2029690768, now seen corresponding path program 1 times [2022-11-16 12:18:20,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:18:20,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [747611892] [2022-11-16 12:18:20,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:18:20,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:18:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:21,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:18:21,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:21,798 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:18:21,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:21,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:18:21,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:21,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-16 12:18:21,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:21,904 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:18:21,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:21,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-16 12:18:21,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:21,989 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 12:18:21,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:22,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:18:22,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:22,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-16 12:18:22,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:22,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2022-11-16 12:18:22,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:22,045 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-16 12:18:22,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:22,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-16 12:18:22,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:18:22,076 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2022-11-16 12:18:22,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:18:22,076 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [747611892] [2022-11-16 12:18:22,077 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [747611892] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:18:22,077 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:18:22,077 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:18:22,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248369346] [2022-11-16 12:18:22,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:18:22,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:18:22,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:18:22,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:18:22,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:18:22,079 INFO L87 Difference]: Start difference. First operand 4573 states and 6193 transitions. Second operand has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-16 12:18:30,179 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:19:04,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:19:04,665 INFO L93 Difference]: Finished difference Result 10476 states and 14955 transitions. [2022-11-16 12:19:04,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-16 12:19:04,666 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) Word has length 99 [2022-11-16 12:19:04,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:19:04,723 INFO L225 Difference]: With dead ends: 10476 [2022-11-16 12:19:04,723 INFO L226 Difference]: Without dead ends: 10474 [2022-11-16 12:19:04,729 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=56, Invalid=100, Unknown=0, NotChecked=0, Total=156 [2022-11-16 12:19:04,730 INFO L413 NwaCegarLoop]: 3593 mSDtfsCounter, 7170 mSDsluCounter, 9756 mSDsCounter, 0 mSdLazyCounter, 8775 mSolverCounterSat, 3973 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 38.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7816 SdHoareTripleChecker+Valid, 13349 SdHoareTripleChecker+Invalid, 12748 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 3973 IncrementalHoareTripleChecker+Valid, 8775 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 40.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:19:04,730 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7816 Valid, 13349 Invalid, 12748 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [3973 Valid, 8775 Invalid, 0 Unknown, 0 Unchecked, 40.6s Time] [2022-11-16 12:19:04,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10474 states. [2022-11-16 12:19:05,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10474 to 8703. [2022-11-16 12:19:05,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8703 states, 5858 states have (on average 1.2676681461249573) internal successors, (7426), 6167 states have internal predecessors, (7426), 2184 states have call successors, (2184), 650 states have call predecessors, (2184), 645 states have return successors, (2202), 2073 states have call predecessors, (2202), 2182 states have call successors, (2202) [2022-11-16 12:19:05,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8703 states to 8703 states and 11812 transitions. [2022-11-16 12:19:05,708 INFO L78 Accepts]: Start accepts. Automaton has 8703 states and 11812 transitions. Word has length 99 [2022-11-16 12:19:05,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:19:05,708 INFO L495 AbstractCegarLoop]: Abstraction has 8703 states and 11812 transitions. [2022-11-16 12:19:05,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.714285714285714) internal successors, (61), 4 states have internal predecessors, (61), 2 states have call successors, (15), 5 states have call predecessors, (15), 1 states have return successors, (12), 2 states have call predecessors, (12), 2 states have call successors, (12) [2022-11-16 12:19:05,709 INFO L276 IsEmpty]: Start isEmpty. Operand 8703 states and 11812 transitions. [2022-11-16 12:19:05,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 102 [2022-11-16 12:19:05,711 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:19:05,711 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] [2022-11-16 12:19:05,711 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-16 12:19:05,712 INFO L420 AbstractCegarLoop]: === Iteration 14 === 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 24 more)] === [2022-11-16 12:19:05,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:19:05,712 INFO L85 PathProgramCache]: Analyzing trace with hash 1980896279, now seen corresponding path program 1 times [2022-11-16 12:19:05,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:19:05,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124943444] [2022-11-16 12:19:05,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:19:05,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:19:05,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:06,317 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:19:06,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:06,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 12:19:06,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:06,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 12:19:06,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:06,425 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-16 12:19:06,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:06,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:19:06,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:06,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 12:19:06,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:06,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-16 12:19:06,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:06,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 12:19:06,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:06,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-16 12:19:06,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:06,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-16 12:19:06,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:06,509 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-16 12:19:06,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:06,521 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-16 12:19:06,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:06,534 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-16 12:19:06,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:06,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 12:19:06,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:06,559 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-16 12:19:06,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:06,574 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-11-16 12:19:06,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:19:06,575 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124943444] [2022-11-16 12:19:06,575 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124943444] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:19:06,575 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:19:06,575 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:19:06,575 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345140610] [2022-11-16 12:19:06,575 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:19:06,576 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:19:06,576 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:19:06,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:19:06,577 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:19:06,577 INFO L87 Difference]: Start difference. First operand 8703 states and 11812 transitions. Second operand has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 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-16 12:19:32,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:19:38,307 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-16 12:19:39,791 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:19:41,427 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:19:43,442 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-16 12:19:45,827 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:19:52,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:19:52,642 INFO L93 Difference]: Finished difference Result 8727 states and 11839 transitions. [2022-11-16 12:19:52,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:19:52,648 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 2 states have call successors, (16), 4 states have call predecessors, (16), 1 states have return successors, (15), 2 states have call predecessors, (15), 2 states have call successors, (15) Word has length 101 [2022-11-16 12:19:52,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:19:52,694 INFO L225 Difference]: With dead ends: 8727 [2022-11-16 12:19:52,694 INFO L226 Difference]: Without dead ends: 8725 [2022-11-16 12:19:52,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:19:52,701 INFO L413 NwaCegarLoop]: 1120 mSDtfsCounter, 6901 mSDsluCounter, 1946 mSDsCounter, 0 mSdLazyCounter, 7236 mSolverCounterSat, 3849 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 42.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7170 SdHoareTripleChecker+Valid, 3066 SdHoareTripleChecker+Invalid, 11089 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3849 IncrementalHoareTripleChecker+Valid, 7236 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 44.6s IncrementalHoareTripleChecker+Time [2022-11-16 12:19:52,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7170 Valid, 3066 Invalid, 11089 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3849 Valid, 7236 Invalid, 4 Unknown, 0 Unchecked, 44.6s Time] [2022-11-16 12:19:52,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8725 states. [2022-11-16 12:19:53,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8725 to 8701. [2022-11-16 12:19:53,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8701 states, 5857 states have (on average 1.267372374935974) internal successors, (7423), 6165 states have internal predecessors, (7423), 2184 states have call successors, (2184), 650 states have call predecessors, (2184), 645 states have return successors, (2202), 2073 states have call predecessors, (2202), 2182 states have call successors, (2202) [2022-11-16 12:19:53,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8701 states to 8701 states and 11809 transitions. [2022-11-16 12:19:53,610 INFO L78 Accepts]: Start accepts. Automaton has 8701 states and 11809 transitions. Word has length 101 [2022-11-16 12:19:53,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:19:53,610 INFO L495 AbstractCegarLoop]: Abstraction has 8701 states and 11809 transitions. [2022-11-16 12:19:53,611 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 10.666666666666666) internal successors, (64), 4 states have internal predecessors, (64), 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-16 12:19:53,611 INFO L276 IsEmpty]: Start isEmpty. Operand 8701 states and 11809 transitions. [2022-11-16 12:19:53,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-11-16 12:19:53,697 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:19:53,697 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] [2022-11-16 12:19:53,697 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-16 12:19:53,697 INFO L420 AbstractCegarLoop]: === Iteration 15 === 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 24 more)] === [2022-11-16 12:19:53,698 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:19:53,698 INFO L85 PathProgramCache]: Analyzing trace with hash -295816047, now seen corresponding path program 1 times [2022-11-16 12:19:53,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:19:53,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220134565] [2022-11-16 12:19:53,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:19:53,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:19:53,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:54,170 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:19:54,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:54,214 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 12:19:54,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:54,264 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 12:19:54,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:54,276 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-16 12:19:54,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:54,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:19:54,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:54,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 12:19:54,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:54,310 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-16 12:19:54,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:54,323 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 12:19:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:54,336 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-16 12:19:54,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:54,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-16 12:19:54,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:54,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-16 12:19:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:54,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-16 12:19:54,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:54,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-16 12:19:54,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:54,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 12:19:54,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:54,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-16 12:19:54,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:54,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-16 12:19:54,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:19:54,441 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-16 12:19:54,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:19:54,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220134565] [2022-11-16 12:19:54,442 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220134565] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:19:54,442 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:19:54,442 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:19:54,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1042434544] [2022-11-16 12:19:54,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:19:54,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:19:54,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:19:54,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:19:54,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:19:54,444 INFO L87 Difference]: Start difference. First operand 8701 states and 11809 transitions. Second operand has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 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-16 12:20:20,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:20:23,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:20:29,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:20:31,865 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-16 12:20:34,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:20:40,142 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:20:41,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:20:41,956 INFO L93 Difference]: Finished difference Result 8729 states and 11840 transitions. [2022-11-16 12:20:41,957 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:20:41,957 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 2 states have call successors, (17), 4 states have call predecessors, (17), 1 states have return successors, (16), 2 states have call predecessors, (16), 2 states have call successors, (16) Word has length 107 [2022-11-16 12:20:41,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:20:42,000 INFO L225 Difference]: With dead ends: 8729 [2022-11-16 12:20:42,000 INFO L226 Difference]: Without dead ends: 8727 [2022-11-16 12:20:42,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:20:42,007 INFO L413 NwaCegarLoop]: 1121 mSDtfsCounter, 6891 mSDsluCounter, 1948 mSDsCounter, 0 mSdLazyCounter, 7230 mSolverCounterSat, 3851 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 43.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7159 SdHoareTripleChecker+Valid, 3069 SdHoareTripleChecker+Invalid, 11085 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3851 IncrementalHoareTripleChecker+Valid, 7230 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 46.0s IncrementalHoareTripleChecker+Time [2022-11-16 12:20:42,007 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7159 Valid, 3069 Invalid, 11085 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3851 Valid, 7230 Invalid, 4 Unknown, 0 Unchecked, 46.0s Time] [2022-11-16 12:20:42,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8727 states. [2022-11-16 12:20:43,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8727 to 8699. [2022-11-16 12:20:43,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8699 states, 5856 states have (on average 1.2670765027322404) internal successors, (7420), 6163 states have internal predecessors, (7420), 2184 states have call successors, (2184), 650 states have call predecessors, (2184), 645 states have return successors, (2202), 2073 states have call predecessors, (2202), 2182 states have call successors, (2202) [2022-11-16 12:20:43,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8699 states to 8699 states and 11806 transitions. [2022-11-16 12:20:43,099 INFO L78 Accepts]: Start accepts. Automaton has 8699 states and 11806 transitions. Word has length 107 [2022-11-16 12:20:43,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:20:43,102 INFO L495 AbstractCegarLoop]: Abstraction has 8699 states and 11806 transitions. [2022-11-16 12:20:43,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.333333333333334) internal successors, (68), 4 states have internal predecessors, (68), 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-16 12:20:43,102 INFO L276 IsEmpty]: Start isEmpty. Operand 8699 states and 11806 transitions. [2022-11-16 12:20:43,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-11-16 12:20:43,105 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:20:43,105 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] [2022-11-16 12:20:43,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-16 12:20:43,106 INFO L420 AbstractCegarLoop]: === Iteration 16 === 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 24 more)] === [2022-11-16 12:20:43,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:20:43,106 INFO L85 PathProgramCache]: Analyzing trace with hash 466270462, now seen corresponding path program 1 times [2022-11-16 12:20:43,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:20:43,106 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [12896151] [2022-11-16 12:20:43,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:20:43,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:20:43,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:43,621 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:20:43,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:43,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 12:20:43,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:43,731 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-11-16 12:20:43,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:43,749 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-11-16 12:20:43,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:43,770 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:20:43,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:43,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2022-11-16 12:20:43,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:43,795 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2022-11-16 12:20:43,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:43,811 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-11-16 12:20:43,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:43,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2022-11-16 12:20:43,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:43,849 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2022-11-16 12:20:43,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:43,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-16 12:20:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:43,895 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2022-11-16 12:20:43,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:43,912 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-16 12:20:43,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:43,929 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-16 12:20:43,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:43,948 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-16 12:20:43,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:43,968 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-16 12:20:43,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:43,984 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2022-11-16 12:20:43,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:20:44,001 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-16 12:20:44,001 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:20:44,001 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [12896151] [2022-11-16 12:20:44,004 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [12896151] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:20:44,004 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:20:44,004 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:20:44,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1692252637] [2022-11-16 12:20:44,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:20:44,005 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:20:44,006 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:20:44,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:20:44,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:20:44,007 INFO L87 Difference]: Start difference. First operand 8699 states and 11806 transitions. Second operand has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 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-16 12:20:49,333 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:21:10,382 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:21:13,746 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:21:19,594 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-16 12:21:21,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:21:22,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:21:26,048 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:21:33,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:21:33,526 INFO L93 Difference]: Finished difference Result 8723 states and 11833 transitions. [2022-11-16 12:21:33,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 12:21:33,526 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 2 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (17), 2 states have call predecessors, (17), 2 states have call successors, (17) Word has length 113 [2022-11-16 12:21:33,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:21:33,571 INFO L225 Difference]: With dead ends: 8723 [2022-11-16 12:21:33,571 INFO L226 Difference]: Without dead ends: 8721 [2022-11-16 12:21:33,579 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-16 12:21:33,580 INFO L413 NwaCegarLoop]: 1120 mSDtfsCounter, 6889 mSDsluCounter, 1946 mSDsCounter, 0 mSdLazyCounter, 7229 mSolverCounterSat, 3849 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 45.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7156 SdHoareTripleChecker+Valid, 3066 SdHoareTripleChecker+Invalid, 11081 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 3849 IncrementalHoareTripleChecker+Valid, 7229 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 47.9s IncrementalHoareTripleChecker+Time [2022-11-16 12:21:33,580 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7156 Valid, 3066 Invalid, 11081 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [3849 Valid, 7229 Invalid, 3 Unknown, 0 Unchecked, 47.9s Time] [2022-11-16 12:21:33,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8721 states. [2022-11-16 12:21:34,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8721 to 8697. [2022-11-16 12:21:34,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8697 states, 5855 states have (on average 1.2667805294619983) internal successors, (7417), 6161 states have internal predecessors, (7417), 2184 states have call successors, (2184), 650 states have call predecessors, (2184), 645 states have return successors, (2202), 2073 states have call predecessors, (2202), 2182 states have call successors, (2202) [2022-11-16 12:21:34,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8697 states to 8697 states and 11803 transitions. [2022-11-16 12:21:34,694 INFO L78 Accepts]: Start accepts. Automaton has 8697 states and 11803 transitions. Word has length 113 [2022-11-16 12:21:34,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:21:34,695 INFO L495 AbstractCegarLoop]: Abstraction has 8697 states and 11803 transitions. [2022-11-16 12:21:34,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 12.0) internal successors, (72), 4 states have internal predecessors, (72), 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-16 12:21:34,695 INFO L276 IsEmpty]: Start isEmpty. Operand 8697 states and 11803 transitions. [2022-11-16 12:21:34,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-11-16 12:21:34,698 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:21:34,699 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 12:21:34,699 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-16 12:21:34,699 INFO L420 AbstractCegarLoop]: === Iteration 17 === 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 24 more)] === [2022-11-16 12:21:34,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:21:34,700 INFO L85 PathProgramCache]: Analyzing trace with hash 843882549, now seen corresponding path program 1 times [2022-11-16 12:21:34,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:21:34,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820451700] [2022-11-16 12:21:34,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:21:34,701 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:21:34,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:35,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:21:35,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:35,341 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:21:35,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:35,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:21:35,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:35,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-16 12:21:35,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:35,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:21:35,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:35,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-16 12:21:35,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:35,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2022-11-16 12:21:35,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:35,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2022-11-16 12:21:35,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:35,569 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-11-16 12:21:35,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:35,588 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:21:35,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:35,598 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:21:35,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:35,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:21:35,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:35,618 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-16 12:21:35,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:35,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-16 12:21:35,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:35,651 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:21:35,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:35,661 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:21:35,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:35,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-11-16 12:21:35,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:35,679 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 113 [2022-11-16 12:21:35,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:35,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 119 [2022-11-16 12:21:35,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:21:35,706 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2022-11-16 12:21:35,707 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:21:35,707 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820451700] [2022-11-16 12:21:35,707 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820451700] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:21:35,708 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:21:35,708 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:21:35,709 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826158750] [2022-11-16 12:21:35,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:21:35,710 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:21:35,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:21:35,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:21:35,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:21:35,711 INFO L87 Difference]: Start difference. First operand 8697 states and 11803 transitions. Second operand has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 3 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-11-16 12:21:44,057 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:21:49,717 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-16 12:22:04,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:22:08,978 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-16 12:22:10,055 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:22:12,207 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:22:16,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:22:16,582 INFO L93 Difference]: Finished difference Result 19042 states and 26621 transitions. [2022-11-16 12:22:16,583 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 12:22:16,583 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 3 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) Word has length 134 [2022-11-16 12:22:16,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:22:16,626 INFO L225 Difference]: With dead ends: 19042 [2022-11-16 12:22:16,626 INFO L226 Difference]: Without dead ends: 10523 [2022-11-16 12:22:16,664 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-16 12:22:16,665 INFO L413 NwaCegarLoop]: 3005 mSDtfsCounter, 4928 mSDsluCounter, 4906 mSDsCounter, 0 mSdLazyCounter, 5448 mSolverCounterSat, 1550 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 37.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5457 SdHoareTripleChecker+Valid, 7911 SdHoareTripleChecker+Invalid, 7002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.1s SdHoareTripleChecker+Time, 1550 IncrementalHoareTripleChecker+Valid, 5448 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 39.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:22:16,665 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5457 Valid, 7911 Invalid, 7002 Unknown, 0 Unchecked, 0.1s Time], IncrementalHoareTripleChecker [1550 Valid, 5448 Invalid, 4 Unknown, 0 Unchecked, 39.1s Time] [2022-11-16 12:22:16,675 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10523 states. [2022-11-16 12:22:17,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10523 to 8698. [2022-11-16 12:22:17,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8698 states, 5856 states have (on average 1.2665642076502732) internal successors, (7417), 6162 states have internal predecessors, (7417), 2184 states have call successors, (2184), 650 states have call predecessors, (2184), 645 states have return successors, (2202), 2073 states have call predecessors, (2202), 2182 states have call successors, (2202) [2022-11-16 12:22:17,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8698 states to 8698 states and 11803 transitions. [2022-11-16 12:22:17,471 INFO L78 Accepts]: Start accepts. Automaton has 8698 states and 11803 transitions. Word has length 134 [2022-11-16 12:22:17,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:22:17,472 INFO L495 AbstractCegarLoop]: Abstraction has 8698 states and 11803 transitions. [2022-11-16 12:22:17,472 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.5) internal successors, (69), 4 states have internal predecessors, (69), 3 states have call successors, (18), 4 states have call predecessors, (18), 1 states have return successors, (16), 3 states have call predecessors, (16), 3 states have call successors, (16) [2022-11-16 12:22:17,472 INFO L276 IsEmpty]: Start isEmpty. Operand 8698 states and 11803 transitions. [2022-11-16 12:22:17,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-11-16 12:22:17,475 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:22:17,475 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] [2022-11-16 12:22:17,475 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-16 12:22:17,475 INFO L420 AbstractCegarLoop]: === Iteration 18 === 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 24 more)] === [2022-11-16 12:22:17,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:22:17,476 INFO L85 PathProgramCache]: Analyzing trace with hash -1037159605, now seen corresponding path program 1 times [2022-11-16 12:22:17,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:22:17,476 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1932473779] [2022-11-16 12:22:17,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:22:17,477 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:22:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:18,038 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:22:18,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:18,084 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2022-11-16 12:22:18,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:18,135 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-11-16 12:22:18,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:18,146 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2022-11-16 12:22:18,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:18,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:22:18,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:18,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2022-11-16 12:22:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:18,177 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2022-11-16 12:22:18,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:18,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2022-11-16 12:22:18,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:18,202 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-11-16 12:22:18,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:18,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2022-11-16 12:22:18,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:18,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2022-11-16 12:22:18,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:18,236 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-16 12:22:18,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:18,247 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2022-11-16 12:22:18,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:18,259 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-16 12:22:18,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:18,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-16 12:22:18,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:18,288 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2022-11-16 12:22:18,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:18,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2022-11-16 12:22:18,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:18,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2022-11-16 12:22:18,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:22:18,326 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-16 12:22:18,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:22:18,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1932473779] [2022-11-16 12:22:18,327 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1932473779] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:22:18,327 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:22:18,327 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 12:22:18,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988052151] [2022-11-16 12:22:18,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:22:18,328 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 12:22:18,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:22:18,328 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 12:22:18,328 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-16 12:22:18,329 INFO L87 Difference]: Start difference. First operand 8698 states and 11803 transitions. Second operand has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (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-16 12:22:50,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:22:53,948 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-16 12:22:55,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:22:57,373 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-16 12:22:59,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:23:19,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 12:23:19,961 INFO L93 Difference]: Finished difference Result 13545 states and 18381 transitions. [2022-11-16 12:23:19,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 12:23:19,961 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (19), 4 states have call predecessors, (19), 1 states have return successors, (18), 2 states have call predecessors, (18), 2 states have call successors, (18) Word has length 121 [2022-11-16 12:23:19,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 12:23:20,000 INFO L225 Difference]: With dead ends: 13545 [2022-11-16 12:23:20,000 INFO L226 Difference]: Without dead ends: 13543 [2022-11-16 12:23:20,006 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-16 12:23:20,006 INFO L413 NwaCegarLoop]: 1224 mSDtfsCounter, 8704 mSDsluCounter, 2268 mSDsCounter, 0 mSdLazyCounter, 10017 mSolverCounterSat, 4991 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 55.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8961 SdHoareTripleChecker+Valid, 3492 SdHoareTripleChecker+Invalid, 15011 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.2s SdHoareTripleChecker+Time, 4991 IncrementalHoareTripleChecker+Valid, 10017 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 59.1s IncrementalHoareTripleChecker+Time [2022-11-16 12:23:20,006 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8961 Valid, 3492 Invalid, 15011 Unknown, 0 Unchecked, 0.2s Time], IncrementalHoareTripleChecker [4991 Valid, 10017 Invalid, 3 Unknown, 0 Unchecked, 59.1s Time] [2022-11-16 12:23:20,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13543 states. [2022-11-16 12:23:21,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13543 to 13334. [2022-11-16 12:23:21,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13334 states, 8986 states have (on average 1.2743156020476296) internal successors, (11451), 9473 states have internal predecessors, (11451), 3337 states have call successors, (3337), 1007 states have call predecessors, (3337), 998 states have return successors, (3369), 3155 states have call predecessors, (3369), 3335 states have call successors, (3369) [2022-11-16 12:23:21,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13334 states to 13334 states and 18157 transitions. [2022-11-16 12:23:21,279 INFO L78 Accepts]: Start accepts. Automaton has 13334 states and 18157 transitions. Word has length 121 [2022-11-16 12:23:21,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 12:23:21,279 INFO L495 AbstractCegarLoop]: Abstraction has 13334 states and 18157 transitions. [2022-11-16 12:23:21,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 13.0) internal successors, (78), 4 states have internal predecessors, (78), 2 states have call successors, (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-16 12:23:21,280 INFO L276 IsEmpty]: Start isEmpty. Operand 13334 states and 18157 transitions. [2022-11-16 12:23:21,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-11-16 12:23:21,282 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 12:23:21,282 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2022-11-16 12:23:21,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-16 12:23:21,283 INFO L420 AbstractCegarLoop]: === Iteration 19 === 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 24 more)] === [2022-11-16 12:23:21,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 12:23:21,283 INFO L85 PathProgramCache]: Analyzing trace with hash -1888750418, now seen corresponding path program 1 times [2022-11-16 12:23:21,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 12:23:21,284 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543659426] [2022-11-16 12:23:21,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 12:23:21,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 12:23:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:21,693 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-11-16 12:23:21,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:21,702 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-11-16 12:23:21,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:21,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:23:21,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:21,784 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-11-16 12:23:21,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:21,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:23:21,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:21,803 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-11-16 12:23:21,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:21,871 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-16 12:23:21,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:21,891 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:23:21,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:21,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2022-11-16 12:23:21,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:21,911 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 74 [2022-11-16 12:23:21,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:21,921 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 80 [2022-11-16 12:23:21,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:21,930 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 85 [2022-11-16 12:23:21,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:21,942 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 91 [2022-11-16 12:23:21,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:21,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2022-11-16 12:23:22,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:22,010 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-16 12:23:22,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:22,017 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-11-16 12:23:22,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:22,025 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2022-11-16 12:23:22,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 12:23:22,033 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-11-16 12:23:22,033 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 12:23:22,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543659426] [2022-11-16 12:23:22,033 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1543659426] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 12:23:22,034 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 12:23:22,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-16 12:23:22,034 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210683552] [2022-11-16 12:23:22,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 12:23:22,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 12:23:22,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 12:23:22,035 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 12:23:22,035 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-16 12:23:22,036 INFO L87 Difference]: Start difference. First operand 13334 states and 18157 transitions. Second operand has 7 states, 7 states have (on average 12.0) internal successors, (84), 4 states have internal predecessors, (84), 3 states have call successors, (21), 5 states have call predecessors, (21), 1 states have return successors, (17), 3 states have call predecessors, (17), 3 states have call successors, (17) [2022-11-16 12:23:29,825 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-16 12:23:31,599 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-16 12:23:34,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-11-16 12:23:43,338 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 []