./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R --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 7325716246446e6137919cda7fc42ef01fc613ff512d250d81e88f25c6debe0a --- 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-38b53e6 [2022-11-25 18:24:14,019 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 18:24:14,021 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 18:24:14,040 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 18:24:14,040 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 18:24:14,042 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 18:24:14,043 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 18:24:14,045 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 18:24:14,047 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 18:24:14,048 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 18:24:14,049 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 18:24:14,050 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 18:24:14,051 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 18:24:14,052 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 18:24:14,060 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 18:24:14,061 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 18:24:14,062 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 18:24:14,063 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 18:24:14,064 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 18:24:14,069 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 18:24:14,070 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 18:24:14,074 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 18:24:14,082 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 18:24:14,083 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 18:24:14,086 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 18:24:14,087 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 18:24:14,087 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 18:24:14,088 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 18:24:14,095 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 18:24:14,096 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 18:24:14,096 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 18:24:14,097 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 18:24:14,098 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 18:24:14,099 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 18:24:14,100 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 18:24:14,103 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 18:24:14,104 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 18:24:14,104 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 18:24:14,104 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 18:24:14,105 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 18:24:14,107 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 18:24:14,108 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-25 18:24:14,141 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 18:24:14,142 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 18:24:14,143 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 18:24:14,143 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 18:24:14,144 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 18:24:14,144 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 18:24:14,145 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 18:24:14,145 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 18:24:14,145 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 18:24:14,145 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 18:24:14,146 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 18:24:14,146 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 18:24:14,146 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 18:24:14,146 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 18:24:14,146 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 18:24:14,147 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 18:24:14,147 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 18:24:14,147 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 18:24:14,147 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 18:24:14,147 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 18:24:14,147 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 18:24:14,148 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:24:14,148 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 18:24:14,148 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 18:24:14,148 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 18:24:14,148 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 18:24:14,149 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 18:24:14,149 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 18:24:14,149 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 18:24:14,149 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 18:24:14,149 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 18:24:14,150 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/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_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R 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 -> 7325716246446e6137919cda7fc42ef01fc613ff512d250d81e88f25c6debe0a [2022-11-25 18:24:14,383 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 18:24:14,421 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 18:24:14,424 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 18:24:14,425 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 18:24:14,426 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 18:24:14,427 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2022-11-25 18:24:17,531 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 18:24:18,042 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 18:24:18,043 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2022-11-25 18:24:18,093 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/data/0bec09f23/4e920e864f4343d2b2900d294f8e1ac2/FLAG3af357aab [2022-11-25 18:24:18,113 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/data/0bec09f23/4e920e864f4343d2b2900d294f8e1ac2 [2022-11-25 18:24:18,119 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 18:24:18,121 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 18:24:18,122 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 18:24:18,122 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 18:24:18,126 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 18:24:18,127 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:24:18" (1/1) ... [2022-11-25 18:24:18,128 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a243719 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:24:18, skipping insertion in model container [2022-11-25 18:24:18,129 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 06:24:18" (1/1) ... [2022-11-25 18:24:18,138 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 18:24:18,214 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 18:24:18,727 WARN L623 FunctionHandler]: Unknown extern function __kmalloc [2022-11-25 18:24:18,760 WARN L623 FunctionHandler]: Unknown extern function dev_get_drvdata [2022-11-25 18:24:18,768 WARN L623 FunctionHandler]: Unknown extern function dev_set_drvdata [2022-11-25 18:24:18,796 WARN L623 FunctionHandler]: Unknown extern function usb_register_driver [2022-11-25 18:24:18,863 WARN L623 FunctionHandler]: Unknown extern function dev_get_drvdata [2022-11-25 18:24:18,867 WARN L623 FunctionHandler]: Unknown extern function dev_set_drvdata [2022-11-25 18:24:18,879 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-11-25 18:24:18,883 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-11-25 18:24:18,887 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-11-25 18:24:18,945 WARN L623 FunctionHandler]: Unknown extern function usb_submit_urb [2022-11-25 18:24:18,946 WARN L623 FunctionHandler]: Unknown extern function printk [2022-11-25 18:24:18,955 WARN L623 FunctionHandler]: Unknown extern function usb_submit_urb [2022-11-25 18:24:18,961 WARN L623 FunctionHandler]: Unknown extern function usb_kill_urb [2022-11-25 18:24:18,972 WARN L623 FunctionHandler]: Unknown extern function strlcat [2022-11-25 18:24:18,980 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-11-25 18:24:18,981 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-11-25 18:24:18,982 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-11-25 18:24:18,992 WARN L623 FunctionHandler]: Unknown extern function input_register_device [2022-11-25 18:24:18,994 WARN L623 FunctionHandler]: Unknown extern function input_free_device [2022-11-25 18:24:18,995 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-11-25 18:24:19,005 WARN L623 FunctionHandler]: Unknown extern function input_unregister_device [2022-11-25 18:24:19,006 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-11-25 18:24:19,012 WARN L623 FunctionHandler]: Unknown extern function printk [2022-11-25 18:24:19,017 WARN L623 FunctionHandler]: Unknown extern function usb_deregister [2022-11-25 18:24:19,035 WARN L623 FunctionHandler]: Unknown extern function ldv_initialize [2022-11-25 18:24:19,040 WARN L623 FunctionHandler]: Unknown extern function ldv_check_return_value [2022-11-25 18:24:19,047 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i[115804,115817] [2022-11-25 18:24:19,058 WARN L623 FunctionHandler]: Unknown extern function ldv_undefined_pointer [2022-11-25 18:24:19,074 WARN L623 FunctionHandler]: Unknown extern function ldv_undefined_pointer [2022-11-25 18:24:19,101 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:24:19,149 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 18:24:19,297 WARN L623 FunctionHandler]: Unknown extern function __kmalloc [2022-11-25 18:24:19,300 WARN L623 FunctionHandler]: Unknown extern function dev_get_drvdata [2022-11-25 18:24:19,301 WARN L623 FunctionHandler]: Unknown extern function dev_set_drvdata [2022-11-25 18:24:19,311 WARN L623 FunctionHandler]: Unknown extern function usb_register_driver [2022-11-25 18:24:19,331 WARN L623 FunctionHandler]: Unknown extern function dev_get_drvdata [2022-11-25 18:24:19,334 WARN L623 FunctionHandler]: Unknown extern function dev_set_drvdata [2022-11-25 18:24:19,336 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-11-25 18:24:19,339 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-11-25 18:24:19,340 WARN L623 FunctionHandler]: Unknown extern function input_event [2022-11-25 18:24:19,358 WARN L623 FunctionHandler]: Unknown extern function usb_submit_urb [2022-11-25 18:24:19,360 WARN L623 FunctionHandler]: Unknown extern function printk [2022-11-25 18:24:19,362 WARN L623 FunctionHandler]: Unknown extern function usb_submit_urb [2022-11-25 18:24:19,363 WARN L623 FunctionHandler]: Unknown extern function usb_kill_urb [2022-11-25 18:24:19,368 WARN L623 FunctionHandler]: Unknown extern function strlcat [2022-11-25 18:24:19,380 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-11-25 18:24:19,381 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-11-25 18:24:19,381 WARN L623 FunctionHandler]: Unknown extern function input_set_abs_params [2022-11-25 18:24:19,386 WARN L623 FunctionHandler]: Unknown extern function input_register_device [2022-11-25 18:24:19,389 WARN L623 FunctionHandler]: Unknown extern function input_free_device [2022-11-25 18:24:19,389 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-11-25 18:24:19,392 WARN L623 FunctionHandler]: Unknown extern function input_unregister_device [2022-11-25 18:24:19,393 WARN L623 FunctionHandler]: Unknown extern function kfree [2022-11-25 18:24:19,397 WARN L623 FunctionHandler]: Unknown extern function printk [2022-11-25 18:24:19,398 WARN L623 FunctionHandler]: Unknown extern function usb_deregister [2022-11-25 18:24:19,400 WARN L623 FunctionHandler]: Unknown extern function ldv_initialize [2022-11-25 18:24:19,403 WARN L623 FunctionHandler]: Unknown extern function ldv_check_return_value [2022-11-25 18:24:19,406 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/sv-benchmarks/c/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i[115804,115817] [2022-11-25 18:24:19,408 WARN L623 FunctionHandler]: Unknown extern function ldv_undefined_pointer [2022-11-25 18:24:19,416 WARN L623 FunctionHandler]: Unknown extern function ldv_undefined_pointer [2022-11-25 18:24:19,422 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 18:24:19,468 INFO L208 MainTranslator]: Completed translation [2022-11-25 18:24:19,469 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:24:19 WrapperNode [2022-11-25 18:24:19,469 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 18:24:19,470 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 18:24:19,471 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 18:24:19,471 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 18:24:19,478 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:24:19" (1/1) ... [2022-11-25 18:24:19,519 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:24:19" (1/1) ... [2022-11-25 18:24:19,612 INFO L138 Inliner]: procedures = 77, calls = 264, calls flagged for inlining = 29, calls inlined = 26, statements flattened = 743 [2022-11-25 18:24:19,612 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 18:24:19,613 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 18:24:19,613 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 18:24:19,613 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 18:24:19,624 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:24:19" (1/1) ... [2022-11-25 18:24:19,625 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:24:19" (1/1) ... [2022-11-25 18:24:19,641 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:24:19" (1/1) ... [2022-11-25 18:24:19,642 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:24:19" (1/1) ... [2022-11-25 18:24:19,698 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:24:19" (1/1) ... [2022-11-25 18:24:19,722 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:24:19" (1/1) ... [2022-11-25 18:24:19,726 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:24:19" (1/1) ... [2022-11-25 18:24:19,739 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:24:19" (1/1) ... [2022-11-25 18:24:19,747 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 18:24:19,757 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 18:24:19,758 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 18:24:19,758 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 18:24:19,759 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:24:19" (1/1) ... [2022-11-25 18:24:19,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 18:24:19,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:24:19,793 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 18:24:19,818 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 18:24:19,842 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_init [2022-11-25 18:24:19,842 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_init [2022-11-25 18:24:19,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 18:24:19,843 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2022-11-25 18:24:19,843 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2022-11-25 18:24:19,843 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-25 18:24:19,843 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2022-11-25 18:24:19,844 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2022-11-25 18:24:19,844 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_exit [2022-11-25 18:24:19,844 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_exit [2022-11-25 18:24:19,844 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2022-11-25 18:24:19,844 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2022-11-25 18:24:19,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-25 18:24:19,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-25 18:24:19,845 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2022-11-25 18:24:19,845 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2022-11-25 18:24:19,845 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2022-11-25 18:24:19,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2022-11-25 18:24:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2022-11-25 18:24:19,846 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2022-11-25 18:24:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-25 18:24:19,846 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2022-11-25 18:24:19,846 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2022-11-25 18:24:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-11-25 18:24:19,847 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2022-11-25 18:24:19,848 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2022-11-25 18:24:19,848 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-25 18:24:19,848 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2022-11-25 18:24:19,849 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2022-11-25 18:24:19,849 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2022-11-25 18:24:19,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2022-11-25 18:24:19,850 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2022-11-25 18:24:19,850 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2022-11-25 18:24:19,850 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2022-11-25 18:24:19,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2022-11-25 18:24:19,852 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 18:24:19,852 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-25 18:24:19,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 18:24:19,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 18:24:20,202 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 18:24:20,206 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 18:24:20,447 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2022-11-25 18:24:20,466 WARN L816 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2022-11-25 18:24:21,373 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2022-11-25 18:24:21,374 INFO L769 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2022-11-25 18:24:21,394 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 18:24:21,408 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 18:24:21,408 INFO L300 CfgBuilder]: Removed 5 assume(true) statements. [2022-11-25 18:24:21,411 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:24:21 BoogieIcfgContainer [2022-11-25 18:24:21,411 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 18:24:21,415 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 18:24:21,416 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 18:24:21,419 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 18:24:21,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 06:24:18" (1/3) ... [2022-11-25 18:24:21,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc2ac9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:24:21, skipping insertion in model container [2022-11-25 18:24:21,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 06:24:19" (2/3) ... [2022-11-25 18:24:21,424 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7dc2ac9e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 06:24:21, skipping insertion in model container [2022-11-25 18:24:21,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:24:21" (3/3) ... [2022-11-25 18:24:21,425 INFO L112 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2022-11-25 18:24:21,446 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 18:24:21,447 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 18:24:21,528 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 18:24:21,538 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;@75e302c6, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 18:24:21,540 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 18:24:21,546 INFO L276 IsEmpty]: Start isEmpty. Operand has 164 states, 120 states have (on average 1.3333333333333333) internal successors, (160), 128 states have internal predecessors, (160), 29 states have call successors, (29), 14 states have call predecessors, (29), 13 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) [2022-11-25 18:24:21,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-25 18:24:21,556 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:21,557 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:24:21,559 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:24:21,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:21,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1435834942, now seen corresponding path program 1 times [2022-11-25 18:24:21,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:21,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226123758] [2022-11-25 18:24:21,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:21,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:21,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:22,171 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:24:22,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:22,222 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-25 18:24:22,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:22,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1226123758] [2022-11-25 18:24:22,224 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1226123758] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:22,224 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:22,225 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:24:22,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [967246861] [2022-11-25 18:24:22,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:22,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:24:22,233 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:22,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:24:22,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:24:22,305 INFO L87 Difference]: Start difference. First operand has 164 states, 120 states have (on average 1.3333333333333333) internal successors, (160), 128 states have internal predecessors, (160), 29 states have call successors, (29), 14 states have call predecessors, (29), 13 states have return successors, (27), 27 states have call predecessors, (27), 27 states have call successors, (27) Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 18:24:22,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:22,417 INFO L93 Difference]: Finished difference Result 450 states and 610 transitions. [2022-11-25 18:24:22,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:24:22,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-11-25 18:24:22,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:22,433 INFO L225 Difference]: With dead ends: 450 [2022-11-25 18:24:22,433 INFO L226 Difference]: Without dead ends: 289 [2022-11-25 18:24:22,438 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-25 18:24:22,442 INFO L413 NwaCegarLoop]: 241 mSDtfsCounter, 186 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:22,443 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 412 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:24:22,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-11-25 18:24:22,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 285. [2022-11-25 18:24:22,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 285 states, 212 states have (on average 1.2264150943396226) internal successors, (260), 216 states have internal predecessors, (260), 49 states have call successors, (49), 24 states have call predecessors, (49), 23 states have return successors, (45), 45 states have call predecessors, (45), 45 states have call successors, (45) [2022-11-25 18:24:22,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 285 states to 285 states and 354 transitions. [2022-11-25 18:24:22,584 INFO L78 Accepts]: Start accepts. Automaton has 285 states and 354 transitions. Word has length 17 [2022-11-25 18:24:22,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:22,585 INFO L495 AbstractCegarLoop]: Abstraction has 285 states and 354 transitions. [2022-11-25 18:24:22,585 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 18:24:22,586 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 354 transitions. [2022-11-25 18:24:22,587 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 18:24:22,587 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:22,588 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:24:22,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-25 18:24:22,588 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:24:22,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:22,590 INFO L85 PathProgramCache]: Analyzing trace with hash -1561331946, now seen corresponding path program 1 times [2022-11-25 18:24:22,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:22,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574586700] [2022-11-25 18:24:22,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:22,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:22,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:22,842 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:24:22,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:22,873 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-25 18:24:22,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:22,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574586700] [2022-11-25 18:24:22,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574586700] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:22,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:22,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 18:24:22,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913885948] [2022-11-25 18:24:22,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:22,877 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-25 18:24:22,878 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:22,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-25 18:24:22,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-25 18:24:22,883 INFO L87 Difference]: Start difference. First operand 285 states and 354 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 18:24:22,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:22,976 INFO L93 Difference]: Finished difference Result 826 states and 1033 transitions. [2022-11-25 18:24:22,976 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-25 18:24:22,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-11-25 18:24:22,977 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:22,986 INFO L225 Difference]: With dead ends: 826 [2022-11-25 18:24:22,986 INFO L226 Difference]: Without dead ends: 546 [2022-11-25 18:24:22,993 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-25 18:24:22,995 INFO L413 NwaCegarLoop]: 254 mSDtfsCounter, 176 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 423 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-25 18:24:22,995 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [176 Valid, 423 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:24:22,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2022-11-25 18:24:23,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 539. [2022-11-25 18:24:23,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 539 states, 402 states have (on average 1.2189054726368158) internal successors, (490), 405 states have internal predecessors, (490), 92 states have call successors, (92), 45 states have call predecessors, (92), 44 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2022-11-25 18:24:23,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 539 states to 539 states and 670 transitions. [2022-11-25 18:24:23,077 INFO L78 Accepts]: Start accepts. Automaton has 539 states and 670 transitions. Word has length 18 [2022-11-25 18:24:23,078 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:23,078 INFO L495 AbstractCegarLoop]: Abstraction has 539 states and 670 transitions. [2022-11-25 18:24:23,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-11-25 18:24:23,078 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 670 transitions. [2022-11-25 18:24:23,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-11-25 18:24:23,080 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:23,081 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, 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-25 18:24:23,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-25 18:24:23,081 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:24:23,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:23,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1930446545, now seen corresponding path program 1 times [2022-11-25 18:24:23,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:23,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1886147501] [2022-11-25 18:24:23,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:23,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:23,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:23,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:24:23,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:23,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 18:24:23,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:23,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:24:23,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:23,484 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-11-25 18:24:23,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:23,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:24:23,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:23,506 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-25 18:24:23,506 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:23,507 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1886147501] [2022-11-25 18:24:23,507 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1886147501] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:23,508 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:23,508 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:24:23,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1319092900] [2022-11-25 18:24:23,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:23,509 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:24:23,510 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:23,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:24:23,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:24:23,516 INFO L87 Difference]: Start difference. First operand 539 states and 670 transitions. Second operand has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 18:24:24,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:24,036 INFO L93 Difference]: Finished difference Result 1241 states and 1582 transitions. [2022-11-25 18:24:24,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:24:24,036 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 51 [2022-11-25 18:24:24,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:24,043 INFO L225 Difference]: With dead ends: 1241 [2022-11-25 18:24:24,043 INFO L226 Difference]: Without dead ends: 713 [2022-11-25 18:24:24,045 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-25 18:24:24,046 INFO L413 NwaCegarLoop]: 152 mSDtfsCounter, 146 mSDsluCounter, 351 mSDsCounter, 0 mSdLazyCounter, 292 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 292 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:24,047 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 503 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 292 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 18:24:24,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2022-11-25 18:24:24,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 610. [2022-11-25 18:24:24,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 473 states have (on average 1.2494714587737843) internal successors, (591), 476 states have internal predecessors, (591), 92 states have call successors, (92), 45 states have call predecessors, (92), 44 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2022-11-25 18:24:24,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 771 transitions. [2022-11-25 18:24:24,116 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 771 transitions. Word has length 51 [2022-11-25 18:24:24,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:24,117 INFO L495 AbstractCegarLoop]: Abstraction has 610 states and 771 transitions. [2022-11-25 18:24:24,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.5) internal successors, (39), 5 states have internal predecessors, (39), 2 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-11-25 18:24:24,117 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 771 transitions. [2022-11-25 18:24:24,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-25 18:24:24,128 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:24,128 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-11-25 18:24:24,129 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-25 18:24:24,129 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:24:24,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:24,130 INFO L85 PathProgramCache]: Analyzing trace with hash -1713485533, now seen corresponding path program 1 times [2022-11-25 18:24:24,130 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:24,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752803893] [2022-11-25 18:24:24,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:24,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:24,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:24,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:24:24,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:25,003 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 18:24:25,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:25,270 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:24:25,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:25,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 18:24:25,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:25,352 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:24:25,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:25,357 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 18:24:25,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:25,364 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 18:24:25,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:25,370 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 18:24:25,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:25,377 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 18:24:25,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:25,384 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-25 18:24:25,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:25,384 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752803893] [2022-11-25 18:24:25,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752803893] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:24:25,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1175957939] [2022-11-25 18:24:25,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:25,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:24:25,385 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:24:25,390 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:24:25,422 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 18:24:25,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:25,844 INFO L263 TraceCheckSpWp]: Trace formula consists of 1213 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-25 18:24:25,852 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:24:25,964 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-25 18:24:25,966 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:24:25,966 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1175957939] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:25,967 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:24:25,967 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2022-11-25 18:24:25,967 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437620110] [2022-11-25 18:24:25,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:25,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:24:25,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:25,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:24:25,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=157, Unknown=0, NotChecked=0, Total=182 [2022-11-25 18:24:25,974 INFO L87 Difference]: Start difference. First operand 610 states and 771 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-25 18:24:26,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:26,064 INFO L93 Difference]: Finished difference Result 1212 states and 1533 transitions. [2022-11-25 18:24:26,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:24:26,065 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 86 [2022-11-25 18:24:26,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:26,069 INFO L225 Difference]: With dead ends: 1212 [2022-11-25 18:24:26,069 INFO L226 Difference]: Without dead ends: 610 [2022-11-25 18:24:26,071 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2022-11-25 18:24:26,078 INFO L413 NwaCegarLoop]: 186 mSDtfsCounter, 2 mSDsluCounter, 736 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 922 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:26,080 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 922 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:24:26,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2022-11-25 18:24:26,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 610. [2022-11-25 18:24:26,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 610 states, 473 states have (on average 1.2473572938689217) internal successors, (590), 476 states have internal predecessors, (590), 92 states have call successors, (92), 45 states have call predecessors, (92), 44 states have return successors, (88), 88 states have call predecessors, (88), 88 states have call successors, (88) [2022-11-25 18:24:26,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 610 states to 610 states and 770 transitions. [2022-11-25 18:24:26,138 INFO L78 Accepts]: Start accepts. Automaton has 610 states and 770 transitions. Word has length 86 [2022-11-25 18:24:26,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:26,139 INFO L495 AbstractCegarLoop]: Abstraction has 610 states and 770 transitions. [2022-11-25 18:24:26,139 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 5 states have internal predecessors, (50), 2 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-11-25 18:24:26,139 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 770 transitions. [2022-11-25 18:24:26,143 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-25 18:24:26,144 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:26,144 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-11-25 18:24:26,157 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 18:24:26,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:24:26,352 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:24:26,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:26,353 INFO L85 PathProgramCache]: Analyzing trace with hash -1473245787, now seen corresponding path program 1 times [2022-11-25 18:24:26,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:26,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462954047] [2022-11-25 18:24:26,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:26,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:26,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:26,967 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:24:26,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:26,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 18:24:26,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:27,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:24:27,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:27,295 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 18:24:27,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:27,319 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:24:27,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:27,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 18:24:27,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:27,332 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 18:24:27,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:27,338 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 18:24:27,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:27,346 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 18:24:27,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:27,353 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-25 18:24:27,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:27,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462954047] [2022-11-25 18:24:27,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462954047] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:24:27,354 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109342520] [2022-11-25 18:24:27,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:27,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:24:27,355 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:24:27,356 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:24:27,382 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 18:24:27,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:27,817 INFO L263 TraceCheckSpWp]: Trace formula consists of 1214 conjuncts, 21 conjunts are in the unsatisfiable core [2022-11-25 18:24:27,822 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:24:27,890 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-25 18:24:27,891 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:24:27,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109342520] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:27,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:24:27,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2022-11-25 18:24:27,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202612702] [2022-11-25 18:24:27,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:27,893 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:24:27,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:27,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:24:27,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2022-11-25 18:24:27,894 INFO L87 Difference]: Start difference. First operand 610 states and 770 transitions. Second operand has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 18:24:27,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:27,980 INFO L93 Difference]: Finished difference Result 1195 states and 1536 transitions. [2022-11-25 18:24:27,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:24:27,981 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 86 [2022-11-25 18:24:27,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:27,987 INFO L225 Difference]: With dead ends: 1195 [2022-11-25 18:24:27,987 INFO L226 Difference]: Without dead ends: 598 [2022-11-25 18:24:27,989 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2022-11-25 18:24:27,989 INFO L413 NwaCegarLoop]: 246 mSDtfsCounter, 42 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 683 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:27,990 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 683 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:24:27,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2022-11-25 18:24:28,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 428. [2022-11-25 18:24:28,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 428 states, 333 states have (on average 1.2372372372372373) internal successors, (412), 336 states have internal predecessors, (412), 62 states have call successors, (62), 33 states have call predecessors, (62), 32 states have return successors, (58), 58 states have call predecessors, (58), 58 states have call successors, (58) [2022-11-25 18:24:28,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 428 states and 532 transitions. [2022-11-25 18:24:28,032 INFO L78 Accepts]: Start accepts. Automaton has 428 states and 532 transitions. Word has length 86 [2022-11-25 18:24:28,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:28,033 INFO L495 AbstractCegarLoop]: Abstraction has 428 states and 532 transitions. [2022-11-25 18:24:28,034 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 13.75) internal successors, (55), 4 states have internal predecessors, (55), 2 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 18:24:28,034 INFO L276 IsEmpty]: Start isEmpty. Operand 428 states and 532 transitions. [2022-11-25 18:24:28,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-25 18:24:28,035 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:28,035 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-11-25 18:24:28,050 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 18:24:28,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:24:28,244 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:24:28,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:28,244 INFO L85 PathProgramCache]: Analyzing trace with hash -656088645, now seen corresponding path program 1 times [2022-11-25 18:24:28,245 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:28,245 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297225858] [2022-11-25 18:24:28,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:28,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:28,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:28,719 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:24:28,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:28,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 18:24:28,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:28,898 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:24:28,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:28,943 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 18:24:28,947 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:28,957 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:24:28,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:28,961 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 18:24:28,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:28,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 18:24:28,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:28,982 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 18:24:28,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:28,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-25 18:24:28,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:28,992 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-25 18:24:28,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:28,992 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297225858] [2022-11-25 18:24:28,992 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297225858] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:24:28,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1468953183] [2022-11-25 18:24:28,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:28,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:24:28,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:24:28,994 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:24:28,999 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 18:24:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:29,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 1155 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-25 18:24:29,471 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:24:29,577 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 18:24:29,578 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 18:24:29,883 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-25 18:24:29,884 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1468953183] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 18:24:29,884 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-25 18:24:29,884 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 11 [2022-11-25 18:24:29,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723002365] [2022-11-25 18:24:29,885 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-25 18:24:29,885 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 18:24:29,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:29,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 18:24:29,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2022-11-25 18:24:29,887 INFO L87 Difference]: Start difference. First operand 428 states and 532 transitions. Second operand has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 7 states have internal predecessors, (72), 4 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-11-25 18:24:30,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:30,693 INFO L93 Difference]: Finished difference Result 1043 states and 1336 transitions. [2022-11-25 18:24:30,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 18:24:30,694 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 7 states have internal predecessors, (72), 4 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) Word has length 83 [2022-11-25 18:24:30,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:30,698 INFO L225 Difference]: With dead ends: 1043 [2022-11-25 18:24:30,699 INFO L226 Difference]: Without dead ends: 628 [2022-11-25 18:24:30,700 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 179 SyntacticMatches, 3 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-11-25 18:24:30,701 INFO L413 NwaCegarLoop]: 176 mSDtfsCounter, 137 mSDsluCounter, 1186 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 1362 SdHoareTripleChecker+Invalid, 617 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:30,701 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [146 Valid, 1362 Invalid, 617 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 558 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-25 18:24:30,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2022-11-25 18:24:30,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 464. [2022-11-25 18:24:30,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 464 states, 360 states have (on average 1.2194444444444446) internal successors, (439), 363 states have internal predecessors, (439), 65 states have call successors, (65), 33 states have call predecessors, (65), 38 states have return successors, (79), 67 states have call predecessors, (79), 61 states have call successors, (79) [2022-11-25 18:24:30,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 464 states to 464 states and 583 transitions. [2022-11-25 18:24:30,750 INFO L78 Accepts]: Start accepts. Automaton has 464 states and 583 transitions. Word has length 83 [2022-11-25 18:24:30,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:30,752 INFO L495 AbstractCegarLoop]: Abstraction has 464 states and 583 transitions. [2022-11-25 18:24:30,753 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.545454545454546) internal successors, (72), 7 states have internal predecessors, (72), 4 states have call successors, (19), 4 states have call predecessors, (19), 4 states have return successors, (14), 5 states have call predecessors, (14), 4 states have call successors, (14) [2022-11-25 18:24:30,753 INFO L276 IsEmpty]: Start isEmpty. Operand 464 states and 583 transitions. [2022-11-25 18:24:30,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-25 18:24:30,754 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:30,754 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2022-11-25 18:24:30,762 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 18:24:30,962 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:24:30,962 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:24:30,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:30,962 INFO L85 PathProgramCache]: Analyzing trace with hash -1559086053, now seen corresponding path program 1 times [2022-11-25 18:24:30,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:30,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746432108] [2022-11-25 18:24:30,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:30,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:31,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:31,365 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:24:31,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:31,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 18:24:31,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:31,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:24:31,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:31,392 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 18:24:31,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:31,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:24:31,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:31,409 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 18:24:31,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:31,497 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 18:24:31,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:31,555 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 18:24:31,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:31,560 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-25 18:24:31,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:31,564 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-25 18:24:31,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:31,565 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746432108] [2022-11-25 18:24:31,565 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746432108] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:31,565 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:31,565 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 18:24:31,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206152717] [2022-11-25 18:24:31,566 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:31,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 18:24:31,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:31,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 18:24:31,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-11-25 18:24:31,567 INFO L87 Difference]: Start difference. First operand 464 states and 583 transitions. Second operand has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-25 18:24:32,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:32,121 INFO L93 Difference]: Finished difference Result 1009 states and 1315 transitions. [2022-11-25 18:24:32,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 18:24:32,122 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 83 [2022-11-25 18:24:32,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:32,126 INFO L225 Difference]: With dead ends: 1009 [2022-11-25 18:24:32,126 INFO L226 Difference]: Without dead ends: 673 [2022-11-25 18:24:32,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-11-25 18:24:32,128 INFO L413 NwaCegarLoop]: 203 mSDtfsCounter, 94 mSDsluCounter, 1161 mSDsCounter, 0 mSdLazyCounter, 428 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 1364 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 428 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:32,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 1364 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 428 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 18:24:32,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 673 states. [2022-11-25 18:24:32,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 673 to 479. [2022-11-25 18:24:32,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 479 states, 372 states have (on average 1.2123655913978495) internal successors, (451), 372 states have internal predecessors, (451), 65 states have call successors, (65), 33 states have call predecessors, (65), 41 states have return successors, (84), 73 states have call predecessors, (84), 61 states have call successors, (84) [2022-11-25 18:24:32,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 479 states to 479 states and 600 transitions. [2022-11-25 18:24:32,219 INFO L78 Accepts]: Start accepts. Automaton has 479 states and 600 transitions. Word has length 83 [2022-11-25 18:24:32,220 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:32,220 INFO L495 AbstractCegarLoop]: Abstraction has 479 states and 600 transitions. [2022-11-25 18:24:32,220 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.111111111111111) internal successors, (55), 5 states have internal predecessors, (55), 3 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-11-25 18:24:32,220 INFO L276 IsEmpty]: Start isEmpty. Operand 479 states and 600 transitions. [2022-11-25 18:24:32,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-11-25 18:24:32,227 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:32,228 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 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] [2022-11-25 18:24:32,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-25 18:24:32,228 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:24:32,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:32,231 INFO L85 PathProgramCache]: Analyzing trace with hash -364422629, now seen corresponding path program 2 times [2022-11-25 18:24:32,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:32,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [149083245] [2022-11-25 18:24:32,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:32,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:32,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:32,745 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:24:32,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:32,759 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 18:24:32,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:32,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:24:32,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:32,773 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 18:24:32,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:32,925 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:24:32,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:32,985 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 18:24:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:32,991 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 18:24:32,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:33,008 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 18:24:33,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:33,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2022-11-25 18:24:33,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:33,016 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-11-25 18:24:33,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:33,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [149083245] [2022-11-25 18:24:33,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [149083245] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:24:33,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599889033] [2022-11-25 18:24:33,017 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 18:24:33,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:24:33,018 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:24:33,019 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:24:33,038 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 18:24:33,479 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-25 18:24:33,480 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 18:24:33,485 INFO L263 TraceCheckSpWp]: Trace formula consists of 1002 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-25 18:24:33,488 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:24:33,633 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-11-25 18:24:33,634 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:24:33,634 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1599889033] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:33,634 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:24:33,634 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [12] total 19 [2022-11-25 18:24:33,634 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [261590973] [2022-11-25 18:24:33,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:33,635 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 18:24:33,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:33,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 18:24:33,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=306, Unknown=0, NotChecked=0, Total=342 [2022-11-25 18:24:33,636 INFO L87 Difference]: Start difference. First operand 479 states and 600 transitions. Second operand has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 18:24:33,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:33,834 INFO L93 Difference]: Finished difference Result 1072 states and 1375 transitions. [2022-11-25 18:24:33,834 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-25 18:24:33,834 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) Word has length 83 [2022-11-25 18:24:33,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:33,839 INFO L225 Difference]: With dead ends: 1072 [2022-11-25 18:24:33,839 INFO L226 Difference]: Without dead ends: 606 [2022-11-25 18:24:33,841 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 94 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=374, Unknown=0, NotChecked=0, Total=420 [2022-11-25 18:24:33,842 INFO L413 NwaCegarLoop]: 244 mSDtfsCounter, 151 mSDsluCounter, 1510 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1754 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:33,843 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [151 Valid, 1754 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:24:33,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2022-11-25 18:24:33,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 477. [2022-11-25 18:24:33,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 477 states, 370 states have (on average 1.2) internal successors, (444), 371 states have internal predecessors, (444), 65 states have call successors, (65), 33 states have call predecessors, (65), 41 states have return successors, (84), 72 states have call predecessors, (84), 61 states have call successors, (84) [2022-11-25 18:24:33,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 477 states to 477 states and 593 transitions. [2022-11-25 18:24:33,897 INFO L78 Accepts]: Start accepts. Automaton has 477 states and 593 transitions. Word has length 83 [2022-11-25 18:24:33,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:33,897 INFO L495 AbstractCegarLoop]: Abstraction has 477 states and 593 transitions. [2022-11-25 18:24:33,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.222222222222222) internal successors, (56), 7 states have internal predecessors, (56), 2 states have call successors, (9), 2 states have call predecessors, (9), 4 states have return successors, (8), 4 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 18:24:33,898 INFO L276 IsEmpty]: Start isEmpty. Operand 477 states and 593 transitions. [2022-11-25 18:24:33,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-11-25 18:24:33,899 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:33,900 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:24:33,913 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 18:24:34,108 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-25 18:24:34,109 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:24:34,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:34,109 INFO L85 PathProgramCache]: Analyzing trace with hash -1107763325, now seen corresponding path program 1 times [2022-11-25 18:24:34,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:34,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873911792] [2022-11-25 18:24:34,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:34,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:34,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:34,605 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:24:34,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:34,619 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 18:24:34,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:34,627 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:24:34,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:34,633 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 18:24:34,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:34,816 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:24:34,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:34,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 18:24:34,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:34,874 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 18:24:34,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:34,880 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 18:24:34,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:34,886 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 18:24:34,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:34,891 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-11-25 18:24:34,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:34,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873911792] [2022-11-25 18:24:34,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873911792] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:24:34,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1305188798] [2022-11-25 18:24:34,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:34,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:24:34,892 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:24:34,893 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:24:34,914 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 18:24:35,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:35,421 INFO L263 TraceCheckSpWp]: Trace formula consists of 1231 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 18:24:35,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:24:35,598 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-25 18:24:35,599 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:24:35,599 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1305188798] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:35,599 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:24:35,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [11] total 13 [2022-11-25 18:24:35,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [541368311] [2022-11-25 18:24:35,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:35,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:24:35,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:35,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:24:35,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-11-25 18:24:35,602 INFO L87 Difference]: Start difference. First operand 477 states and 593 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 18:24:35,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:35,854 INFO L93 Difference]: Finished difference Result 746 states and 926 transitions. [2022-11-25 18:24:35,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:24:35,855 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) Word has length 86 [2022-11-25 18:24:35,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:35,859 INFO L225 Difference]: With dead ends: 746 [2022-11-25 18:24:35,859 INFO L226 Difference]: Without dead ends: 743 [2022-11-25 18:24:35,862 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 102 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=132, Unknown=0, NotChecked=0, Total=156 [2022-11-25 18:24:35,865 INFO L413 NwaCegarLoop]: 287 mSDtfsCounter, 274 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 72 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:35,865 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [274 Valid, 383 Invalid, 72 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:24:35,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 743 states. [2022-11-25 18:24:35,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 743 to 717. [2022-11-25 18:24:35,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 717 states, 558 states have (on average 1.2060931899641576) internal successors, (673), 557 states have internal predecessors, (673), 93 states have call successors, (93), 51 states have call predecessors, (93), 65 states have return successors, (130), 108 states have call predecessors, (130), 89 states have call successors, (130) [2022-11-25 18:24:35,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 717 states to 717 states and 896 transitions. [2022-11-25 18:24:35,948 INFO L78 Accepts]: Start accepts. Automaton has 717 states and 896 transitions. Word has length 86 [2022-11-25 18:24:35,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:35,949 INFO L495 AbstractCegarLoop]: Abstraction has 717 states and 896 transitions. [2022-11-25 18:24:35,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 3 states have internal predecessors, (56), 3 states have call successors, (10), 3 states have call predecessors, (10), 2 states have return successors, (8), 2 states have call predecessors, (8), 2 states have call successors, (8) [2022-11-25 18:24:35,950 INFO L276 IsEmpty]: Start isEmpty. Operand 717 states and 896 transitions. [2022-11-25 18:24:35,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2022-11-25 18:24:35,951 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:35,952 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 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] [2022-11-25 18:24:35,967 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-25 18:24:36,159 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-25 18:24:36,161 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:24:36,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:36,161 INFO L85 PathProgramCache]: Analyzing trace with hash -2015789822, now seen corresponding path program 1 times [2022-11-25 18:24:36,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:36,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759097042] [2022-11-25 18:24:36,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:36,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:36,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:36,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:24:36,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:36,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 18:24:36,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:36,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:24:36,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:36,406 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 18:24:36,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:36,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:24:36,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:36,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 18:24:36,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:36,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2022-11-25 18:24:36,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:36,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:24:36,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:36,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2022-11-25 18:24:36,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:36,456 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:24:36,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:36,461 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2022-11-25 18:24:36,461 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:36,461 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759097042] [2022-11-25 18:24:36,461 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759097042] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:36,461 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:36,462 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 18:24:36,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261622814] [2022-11-25 18:24:36,462 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:36,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:24:36,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:36,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:24:36,463 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:24:36,464 INFO L87 Difference]: Start difference. First operand 717 states and 896 transitions. Second operand has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-25 18:24:36,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:36,900 INFO L93 Difference]: Finished difference Result 1432 states and 1788 transitions. [2022-11-25 18:24:36,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:24:36,901 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 96 [2022-11-25 18:24:36,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:36,904 INFO L225 Difference]: With dead ends: 1432 [2022-11-25 18:24:36,905 INFO L226 Difference]: Without dead ends: 706 [2022-11-25 18:24:36,907 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-11-25 18:24:36,907 INFO L413 NwaCegarLoop]: 143 mSDtfsCounter, 116 mSDsluCounter, 530 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 673 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:36,908 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 673 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 18:24:36,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 706 states. [2022-11-25 18:24:36,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 706 to 667. [2022-11-25 18:24:36,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 667 states, 518 states have (on average 1.196911196911197) internal successors, (620), 519 states have internal predecessors, (620), 90 states have call successors, (90), 45 states have call predecessors, (90), 58 states have return successors, (124), 102 states have call predecessors, (124), 86 states have call successors, (124) [2022-11-25 18:24:37,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 667 states to 667 states and 834 transitions. [2022-11-25 18:24:37,011 INFO L78 Accepts]: Start accepts. Automaton has 667 states and 834 transitions. Word has length 96 [2022-11-25 18:24:37,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:37,012 INFO L495 AbstractCegarLoop]: Abstraction has 667 states and 834 transitions. [2022-11-25 18:24:37,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.0) internal successors, (63), 5 states have internal predecessors, (63), 3 states have call successors, (11), 4 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-11-25 18:24:37,012 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 834 transitions. [2022-11-25 18:24:37,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-11-25 18:24:37,014 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:37,014 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 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] [2022-11-25 18:24:37,014 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-25 18:24:37,014 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:24:37,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:37,015 INFO L85 PathProgramCache]: Analyzing trace with hash 1914487614, now seen corresponding path program 1 times [2022-11-25 18:24:37,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:37,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248847633] [2022-11-25 18:24:37,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:37,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:37,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:37,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:24:37,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:37,443 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 18:24:37,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:37,450 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:24:37,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:37,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 18:24:37,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:37,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:24:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:37,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 18:24:37,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:37,474 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 18:24:37,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:37,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 18:24:37,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:37,542 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 18:24:37,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:37,586 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-25 18:24:37,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:37,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-25 18:24:37,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:37,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-25 18:24:37,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:37,610 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-25 18:24:37,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:37,611 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248847633] [2022-11-25 18:24:37,611 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248847633] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:37,611 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:37,611 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 18:24:37,612 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500130056] [2022-11-25 18:24:37,612 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:37,612 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 18:24:37,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:37,613 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 18:24:37,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-11-25 18:24:37,614 INFO L87 Difference]: Start difference. First operand 667 states and 834 transitions. Second operand has 10 states, 10 states have (on average 6.8) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-25 18:24:38,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:38,544 INFO L93 Difference]: Finished difference Result 1187 states and 1524 transitions. [2022-11-25 18:24:38,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 18:24:38,544 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 105 [2022-11-25 18:24:38,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:38,549 INFO L225 Difference]: With dead ends: 1187 [2022-11-25 18:24:38,549 INFO L226 Difference]: Without dead ends: 875 [2022-11-25 18:24:38,550 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-11-25 18:24:38,551 INFO L413 NwaCegarLoop]: 181 mSDtfsCounter, 183 mSDsluCounter, 1007 mSDsCounter, 0 mSdLazyCounter, 741 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 204 SdHoareTripleChecker+Valid, 1188 SdHoareTripleChecker+Invalid, 826 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 741 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:38,551 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [204 Valid, 1188 Invalid, 826 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 741 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-11-25 18:24:38,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 875 states. [2022-11-25 18:24:38,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 875 to 675. [2022-11-25 18:24:38,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 675 states, 524 states have (on average 1.1946564885496183) internal successors, (626), 525 states have internal predecessors, (626), 90 states have call successors, (90), 45 states have call predecessors, (90), 60 states have return successors, (126), 104 states have call predecessors, (126), 86 states have call successors, (126) [2022-11-25 18:24:38,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 675 states to 675 states and 842 transitions. [2022-11-25 18:24:38,639 INFO L78 Accepts]: Start accepts. Automaton has 675 states and 842 transitions. Word has length 105 [2022-11-25 18:24:38,639 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:38,639 INFO L495 AbstractCegarLoop]: Abstraction has 675 states and 842 transitions. [2022-11-25 18:24:38,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.8) internal successors, (68), 5 states have internal predecessors, (68), 3 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-25 18:24:38,640 INFO L276 IsEmpty]: Start isEmpty. Operand 675 states and 842 transitions. [2022-11-25 18:24:38,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-11-25 18:24:38,641 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:38,642 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 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] [2022-11-25 18:24:38,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-25 18:24:38,642 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:24:38,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:38,643 INFO L85 PathProgramCache]: Analyzing trace with hash -747675683, now seen corresponding path program 1 times [2022-11-25 18:24:38,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:38,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068094338] [2022-11-25 18:24:38,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:38,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:38,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:39,251 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:24:39,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:39,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 18:24:39,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:39,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:24:39,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:39,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 18:24:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:39,293 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:24:39,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:39,299 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 18:24:39,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:39,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 18:24:39,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:39,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 18:24:39,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:39,361 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 18:24:39,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:39,404 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-25 18:24:39,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:39,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-25 18:24:39,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:39,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-25 18:24:39,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:39,439 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-11-25 18:24:39,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:39,439 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068094338] [2022-11-25 18:24:39,439 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068094338] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:39,440 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:39,440 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-25 18:24:39,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [57523718] [2022-11-25 18:24:39,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:39,441 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-25 18:24:39,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:39,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-25 18:24:39,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2022-11-25 18:24:39,443 INFO L87 Difference]: Start difference. First operand 675 states and 842 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-25 18:24:40,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:40,550 INFO L93 Difference]: Finished difference Result 913 states and 1165 transitions. [2022-11-25 18:24:40,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-11-25 18:24:40,550 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) Word has length 105 [2022-11-25 18:24:40,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:40,555 INFO L225 Difference]: With dead ends: 913 [2022-11-25 18:24:40,555 INFO L226 Difference]: Without dead ends: 871 [2022-11-25 18:24:40,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2022-11-25 18:24:40,557 INFO L413 NwaCegarLoop]: 213 mSDtfsCounter, 297 mSDsluCounter, 1463 mSDsCounter, 0 mSdLazyCounter, 946 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 320 SdHoareTripleChecker+Valid, 1676 SdHoareTripleChecker+Invalid, 1061 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 946 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:40,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [320 Valid, 1676 Invalid, 1061 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 946 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-25 18:24:40,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2022-11-25 18:24:40,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 677. [2022-11-25 18:24:40,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 677 states, 526 states have (on average 1.193916349809886) internal successors, (628), 527 states have internal predecessors, (628), 90 states have call successors, (90), 45 states have call predecessors, (90), 60 states have return successors, (126), 104 states have call predecessors, (126), 86 states have call successors, (126) [2022-11-25 18:24:40,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 677 states and 844 transitions. [2022-11-25 18:24:40,644 INFO L78 Accepts]: Start accepts. Automaton has 677 states and 844 transitions. Word has length 105 [2022-11-25 18:24:40,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:40,644 INFO L495 AbstractCegarLoop]: Abstraction has 677 states and 844 transitions. [2022-11-25 18:24:40,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 7 states have internal predecessors, (68), 3 states have call successors, (11), 5 states have call predecessors, (11), 3 states have return successors, (11), 4 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-25 18:24:40,645 INFO L276 IsEmpty]: Start isEmpty. Operand 677 states and 844 transitions. [2022-11-25 18:24:40,646 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2022-11-25 18:24:40,646 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:40,647 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 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] [2022-11-25 18:24:40,647 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-25 18:24:40,647 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:24:40,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:40,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1055307428, now seen corresponding path program 1 times [2022-11-25 18:24:40,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:40,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [760920952] [2022-11-25 18:24:40,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:40,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:40,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:40,950 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:24:40,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:40,962 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 18:24:40,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:40,971 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:24:40,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:40,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 18:24:40,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:40,987 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:24:40,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:40,993 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 18:24:40,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:41,006 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 18:24:41,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:41,013 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 18:24:41,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:41,018 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 18:24:41,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:41,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-25 18:24:41,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:41,087 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2022-11-25 18:24:41,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:41,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2022-11-25 18:24:41,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:41,106 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-25 18:24:41,107 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:41,107 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [760920952] [2022-11-25 18:24:41,107 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [760920952] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:41,107 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:41,107 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-25 18:24:41,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510996739] [2022-11-25 18:24:41,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:41,108 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-25 18:24:41,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:41,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-25 18:24:41,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:24:41,110 INFO L87 Difference]: Start difference. First operand 677 states and 844 transitions. Second operand has 6 states, 6 states have (on average 11.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-25 18:24:41,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:41,656 INFO L93 Difference]: Finished difference Result 1271 states and 1594 transitions. [2022-11-25 18:24:41,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-25 18:24:41,657 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) Word has length 106 [2022-11-25 18:24:41,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:41,660 INFO L225 Difference]: With dead ends: 1271 [2022-11-25 18:24:41,660 INFO L226 Difference]: Without dead ends: 647 [2022-11-25 18:24:41,662 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-25 18:24:41,663 INFO L413 NwaCegarLoop]: 128 mSDtfsCounter, 107 mSDsluCounter, 360 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 298 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:41,663 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 488 Invalid, 298 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 18:24:41,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 647 states. [2022-11-25 18:24:41,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 647 to 635. [2022-11-25 18:24:41,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 635 states, 492 states have (on average 1.1869918699186992) internal successors, (584), 495 states have internal predecessors, (584), 86 states have call successors, (86), 45 states have call predecessors, (86), 56 states have return successors, (114), 94 states have call predecessors, (114), 82 states have call successors, (114) [2022-11-25 18:24:41,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 784 transitions. [2022-11-25 18:24:41,745 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 784 transitions. Word has length 106 [2022-11-25 18:24:41,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:41,745 INFO L495 AbstractCegarLoop]: Abstraction has 635 states and 784 transitions. [2022-11-25 18:24:41,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 11.0) internal successors, (66), 3 states have internal predecessors, (66), 3 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 2 states have call predecessors, (10), 3 states have call successors, (10) [2022-11-25 18:24:41,746 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 784 transitions. [2022-11-25 18:24:41,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-11-25 18:24:41,747 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:41,748 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 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] [2022-11-25 18:24:41,748 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-25 18:24:41,748 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:24:41,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:41,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1982538561, now seen corresponding path program 1 times [2022-11-25 18:24:41,749 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:41,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1062089880] [2022-11-25 18:24:41,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:41,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:41,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:42,131 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:24:42,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:42,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 18:24:42,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:42,162 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:24:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:42,167 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 18:24:42,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:42,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:24:42,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:42,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 18:24:42,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:42,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 18:24:42,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:42,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 18:24:42,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:42,208 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 18:24:42,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:42,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2022-11-25 18:24:42,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:42,300 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2022-11-25 18:24:42,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:42,305 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2022-11-25 18:24:42,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:42,311 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2022-11-25 18:24:42,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:42,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1062089880] [2022-11-25 18:24:42,312 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1062089880] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:42,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:42,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-25 18:24:42,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1116377490] [2022-11-25 18:24:42,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:42,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-25 18:24:42,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:42,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-25 18:24:42,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-11-25 18:24:42,315 INFO L87 Difference]: Start difference. First operand 635 states and 784 transitions. Second operand has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 7 states have internal predecessors, (68), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-25 18:24:43,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:43,397 INFO L93 Difference]: Finished difference Result 1855 states and 2292 transitions. [2022-11-25 18:24:43,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-25 18:24:43,398 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 7 states have internal predecessors, (68), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) Word has length 108 [2022-11-25 18:24:43,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:43,404 INFO L225 Difference]: With dead ends: 1855 [2022-11-25 18:24:43,404 INFO L226 Difference]: Without dead ends: 1242 [2022-11-25 18:24:43,406 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=73, Invalid=199, Unknown=0, NotChecked=0, Total=272 [2022-11-25 18:24:43,407 INFO L413 NwaCegarLoop]: 179 mSDtfsCounter, 660 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 710 mSolverCounterSat, 284 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 683 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 994 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 284 IncrementalHoareTripleChecker+Valid, 710 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:43,407 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [683 Valid, 682 Invalid, 994 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [284 Valid, 710 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-11-25 18:24:43,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1242 states. [2022-11-25 18:24:43,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1242 to 1146. [2022-11-25 18:24:43,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1146 states, 888 states have (on average 1.1925675675675675) internal successors, (1059), 894 states have internal predecessors, (1059), 155 states have call successors, (155), 81 states have call predecessors, (155), 102 states have return successors, (208), 170 states have call predecessors, (208), 150 states have call successors, (208) [2022-11-25 18:24:43,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1422 transitions. [2022-11-25 18:24:43,561 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1422 transitions. Word has length 108 [2022-11-25 18:24:43,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:43,562 INFO L495 AbstractCegarLoop]: Abstraction has 1146 states and 1422 transitions. [2022-11-25 18:24:43,562 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.555555555555555) internal successors, (68), 7 states have internal predecessors, (68), 5 states have call successors, (11), 5 states have call predecessors, (11), 2 states have return successors, (10), 3 states have call predecessors, (10), 4 states have call successors, (10) [2022-11-25 18:24:43,562 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1422 transitions. [2022-11-25 18:24:43,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-11-25 18:24:43,566 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:43,566 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 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] [2022-11-25 18:24:43,566 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-25 18:24:43,567 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:24:43,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:43,567 INFO L85 PathProgramCache]: Analyzing trace with hash -858991793, now seen corresponding path program 1 times [2022-11-25 18:24:43,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:43,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694496214] [2022-11-25 18:24:43,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:43,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:43,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:44,400 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:24:44,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:44,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 18:24:44,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:44,419 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:24:44,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:44,426 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 18:24:44,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:44,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:24:44,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:44,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 18:24:44,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:44,446 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 18:24:44,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:44,451 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 18:24:44,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:44,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 18:24:44,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:44,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 18:24:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:44,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-25 18:24:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:44,469 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-25 18:24:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:44,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-25 18:24:44,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:44,477 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-25 18:24:44,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:44,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694496214] [2022-11-25 18:24:44,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [694496214] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:44,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:44,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:24:44,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392748041] [2022-11-25 18:24:44,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:44,479 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:24:44,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:44,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:24:44,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:24:44,480 INFO L87 Difference]: Start difference. First operand 1146 states and 1422 transitions. Second operand has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-25 18:24:44,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:44,808 INFO L93 Difference]: Finished difference Result 1780 states and 2207 transitions. [2022-11-25 18:24:44,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:24:44,809 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) Word has length 117 [2022-11-25 18:24:44,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:44,812 INFO L225 Difference]: With dead ends: 1780 [2022-11-25 18:24:44,812 INFO L226 Difference]: Without dead ends: 678 [2022-11-25 18:24:44,815 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:24:44,815 INFO L413 NwaCegarLoop]: 166 mSDtfsCounter, 64 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 561 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:44,816 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 561 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 18:24:44,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 678 states. [2022-11-25 18:24:44,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 678 to 643. [2022-11-25 18:24:44,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 643 states, 498 states have (on average 1.1827309236947792) internal successors, (589), 501 states have internal predecessors, (589), 87 states have call successors, (87), 46 states have call predecessors, (87), 57 states have return successors, (114), 95 states have call predecessors, (114), 82 states have call successors, (114) [2022-11-25 18:24:44,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 643 states to 643 states and 790 transitions. [2022-11-25 18:24:44,912 INFO L78 Accepts]: Start accepts. Automaton has 643 states and 790 transitions. Word has length 117 [2022-11-25 18:24:44,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:44,913 INFO L495 AbstractCegarLoop]: Abstraction has 643 states and 790 transitions. [2022-11-25 18:24:44,913 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 14.0) internal successors, (70), 4 states have internal predecessors, (70), 3 states have call successors, (13), 3 states have call predecessors, (13), 1 states have return successors, (11), 2 states have call predecessors, (11), 3 states have call successors, (11) [2022-11-25 18:24:44,913 INFO L276 IsEmpty]: Start isEmpty. Operand 643 states and 790 transitions. [2022-11-25 18:24:44,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-11-25 18:24:44,915 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:44,915 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 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] [2022-11-25 18:24:44,915 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-25 18:24:44,915 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:24:44,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:44,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1996925200, now seen corresponding path program 1 times [2022-11-25 18:24:44,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:44,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1766900745] [2022-11-25 18:24:44,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:44,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:45,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:45,383 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:24:45,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:45,397 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 18:24:45,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:45,408 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:24:45,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:45,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 18:24:45,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:45,429 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:24:45,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:45,434 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 18:24:45,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:45,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 18:24:45,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:45,449 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 18:24:45,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:45,458 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 18:24:45,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:45,462 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 18:24:45,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:45,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-25 18:24:45,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:45,473 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-25 18:24:45,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:45,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-25 18:24:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:45,484 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-25 18:24:45,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:45,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1766900745] [2022-11-25 18:24:45,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1766900745] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:45,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:45,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-25 18:24:45,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [46371906] [2022-11-25 18:24:45,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:45,486 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:24:45,486 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:45,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:24:45,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-25 18:24:45,487 INFO L87 Difference]: Start difference. First operand 643 states and 790 transitions. Second operand has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 5 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-25 18:24:46,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:46,062 INFO L93 Difference]: Finished difference Result 1241 states and 1534 transitions. [2022-11-25 18:24:46,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:24:46,063 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 5 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) Word has length 117 [2022-11-25 18:24:46,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:46,068 INFO L225 Difference]: With dead ends: 1241 [2022-11-25 18:24:46,069 INFO L226 Difference]: Without dead ends: 1236 [2022-11-25 18:24:46,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:24:46,070 INFO L413 NwaCegarLoop]: 206 mSDtfsCounter, 268 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 279 SdHoareTripleChecker+Valid, 563 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:46,071 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [279 Valid, 563 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 18:24:46,073 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1236 states. [2022-11-25 18:24:46,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1236 to 1175. [2022-11-25 18:24:46,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 911 states have (on average 1.1909989023051593) internal successors, (1085), 916 states have internal predecessors, (1085), 159 states have call successors, (159), 82 states have call predecessors, (159), 104 states have return successors, (222), 176 states have call predecessors, (222), 154 states have call successors, (222) [2022-11-25 18:24:46,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1466 transitions. [2022-11-25 18:24:46,253 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1466 transitions. Word has length 117 [2022-11-25 18:24:46,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:46,253 INFO L495 AbstractCegarLoop]: Abstraction has 1175 states and 1466 transitions. [2022-11-25 18:24:46,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 13.8) internal successors, (69), 4 states have internal predecessors, (69), 5 states have call successors, (13), 4 states have call predecessors, (13), 1 states have return successors, (11), 3 states have call predecessors, (11), 4 states have call successors, (11) [2022-11-25 18:24:46,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1466 transitions. [2022-11-25 18:24:46,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2022-11-25 18:24:46,255 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:46,256 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:24:46,256 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-25 18:24:46,256 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:24:46,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:46,257 INFO L85 PathProgramCache]: Analyzing trace with hash 365160195, now seen corresponding path program 1 times [2022-11-25 18:24:46,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:46,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187171740] [2022-11-25 18:24:46,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:46,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:46,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:46,975 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:24:46,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:46,988 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 18:24:46,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:46,995 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:24:46,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:46,999 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 18:24:47,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:47,129 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:24:47,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:47,173 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 18:24:47,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:47,180 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 18:24:47,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:47,185 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 18:24:47,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:47,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 18:24:47,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:47,199 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 18:24:47,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:47,205 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-25 18:24:47,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:47,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-25 18:24:47,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:47,220 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-25 18:24:47,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:47,225 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-25 18:24:47,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:47,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:24:47,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:47,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2022-11-25 18:24:47,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:47,251 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 7 proven. 4 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2022-11-25 18:24:47,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:47,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187171740] [2022-11-25 18:24:47,252 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187171740] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:24:47,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [454368258] [2022-11-25 18:24:47,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:47,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:24:47,252 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:24:47,255 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:24:47,282 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 18:24:48,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:48,101 INFO L263 TraceCheckSpWp]: Trace formula consists of 1885 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 18:24:48,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:24:48,166 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-25 18:24:48,166 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:24:48,166 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [454368258] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:48,167 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:24:48,167 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [11] total 13 [2022-11-25 18:24:48,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295898998] [2022-11-25 18:24:48,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:48,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:24:48,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:48,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:24:48,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=133, Unknown=0, NotChecked=0, Total=156 [2022-11-25 18:24:48,169 INFO L87 Difference]: Start difference. First operand 1175 states and 1466 transitions. Second operand has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-25 18:24:48,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:48,518 INFO L93 Difference]: Finished difference Result 1246 states and 1548 transitions. [2022-11-25 18:24:48,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:24:48,518 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) Word has length 130 [2022-11-25 18:24:48,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:48,525 INFO L225 Difference]: With dead ends: 1246 [2022-11-25 18:24:48,525 INFO L226 Difference]: Without dead ends: 1227 [2022-11-25 18:24:48,526 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=155, Unknown=0, NotChecked=0, Total=182 [2022-11-25 18:24:48,527 INFO L413 NwaCegarLoop]: 230 mSDtfsCounter, 217 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 444 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:48,527 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 444 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 18:24:48,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1227 states. [2022-11-25 18:24:48,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1227 to 1175. [2022-11-25 18:24:48,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1175 states, 911 states have (on average 1.1866081229418222) internal successors, (1081), 916 states have internal predecessors, (1081), 159 states have call successors, (159), 82 states have call predecessors, (159), 104 states have return successors, (222), 176 states have call predecessors, (222), 154 states have call successors, (222) [2022-11-25 18:24:48,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1175 states to 1175 states and 1462 transitions. [2022-11-25 18:24:48,716 INFO L78 Accepts]: Start accepts. Automaton has 1175 states and 1462 transitions. Word has length 130 [2022-11-25 18:24:48,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:48,717 INFO L495 AbstractCegarLoop]: Abstraction has 1175 states and 1462 transitions. [2022-11-25 18:24:48,717 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.0) internal successors, (76), 4 states have internal predecessors, (76), 2 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 2 states have call predecessors, (14), 2 states have call successors, (14) [2022-11-25 18:24:48,717 INFO L276 IsEmpty]: Start isEmpty. Operand 1175 states and 1462 transitions. [2022-11-25 18:24:48,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 135 [2022-11-25 18:24:48,719 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:48,719 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:24:48,736 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 18:24:48,937 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:24:48,937 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:24:48,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:48,938 INFO L85 PathProgramCache]: Analyzing trace with hash -556379909, now seen corresponding path program 1 times [2022-11-25 18:24:48,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:48,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262285516] [2022-11-25 18:24:48,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:48,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:49,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:49,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:24:49,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:49,339 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 18:24:49,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:49,351 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:24:49,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:49,356 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 18:24:49,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:49,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:24:49,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:49,374 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 18:24:49,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:49,384 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 18:24:49,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:49,389 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 18:24:49,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:49,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 18:24:49,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:49,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 18:24:49,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:49,411 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-25 18:24:49,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:49,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-25 18:24:49,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:49,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-25 18:24:49,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:49,430 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 108 [2022-11-25 18:24:49,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:49,439 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:24:49,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:49,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 125 [2022-11-25 18:24:49,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:49,449 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-25 18:24:49,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:49,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262285516] [2022-11-25 18:24:49,450 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [262285516] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:24:49,450 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1880029461] [2022-11-25 18:24:49,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:49,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:24:49,451 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:24:49,452 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:24:49,468 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 18:24:50,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:50,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 1906 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 18:24:50,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:24:50,616 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 47 trivial. 0 not checked. [2022-11-25 18:24:50,617 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:24:50,617 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1880029461] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:50,617 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:24:50,617 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5] total 6 [2022-11-25 18:24:50,618 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189528016] [2022-11-25 18:24:50,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:50,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 18:24:50,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:50,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 18:24:50,619 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:24:50,620 INFO L87 Difference]: Start difference. First operand 1175 states and 1462 transitions. Second operand has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-11-25 18:24:50,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:50,768 INFO L93 Difference]: Finished difference Result 1665 states and 2070 transitions. [2022-11-25 18:24:50,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 18:24:50,769 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 134 [2022-11-25 18:24:50,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:50,772 INFO L225 Difference]: With dead ends: 1665 [2022-11-25 18:24:50,773 INFO L226 Difference]: Without dead ends: 523 [2022-11-25 18:24:50,775 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-25 18:24:50,776 INFO L413 NwaCegarLoop]: 184 mSDtfsCounter, 44 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:50,777 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 417 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:24:50,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 523 states. [2022-11-25 18:24:50,853 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 523 to 523. [2022-11-25 18:24:50,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 398 states have (on average 1.1231155778894473) internal successors, (447), 401 states have internal predecessors, (447), 73 states have call successors, (73), 41 states have call predecessors, (73), 51 states have return successors, (94), 80 states have call predecessors, (94), 69 states have call successors, (94) [2022-11-25 18:24:50,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 614 transitions. [2022-11-25 18:24:50,858 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 614 transitions. Word has length 134 [2022-11-25 18:24:50,858 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:50,858 INFO L495 AbstractCegarLoop]: Abstraction has 523 states and 614 transitions. [2022-11-25 18:24:50,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 19.75) internal successors, (79), 4 states have internal predecessors, (79), 3 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-11-25 18:24:50,859 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 614 transitions. [2022-11-25 18:24:50,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-11-25 18:24:50,861 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:50,861 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:24:50,884 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 18:24:51,084 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-11-25 18:24:51,084 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:24:51,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:51,085 INFO L85 PathProgramCache]: Analyzing trace with hash -407074935, now seen corresponding path program 1 times [2022-11-25 18:24:51,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:51,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348982289] [2022-11-25 18:24:51,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:51,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:51,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:51,463 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:24:51,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:51,472 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 18:24:51,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:51,479 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:24:51,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:51,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 18:24:51,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:51,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:24:51,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:51,496 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 18:24:51,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:51,501 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 18:24:51,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:51,505 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 18:24:51,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:51,510 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 18:24:51,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:51,515 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 18:24:51,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:51,519 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-25 18:24:51,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:51,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-25 18:24:51,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:51,526 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-25 18:24:51,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:51,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-25 18:24:51,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:51,568 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 118 [2022-11-25 18:24:51,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:51,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 130 [2022-11-25 18:24:51,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:51,608 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2022-11-25 18:24:51,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:51,612 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-25 18:24:51,612 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:51,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348982289] [2022-11-25 18:24:51,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1348982289] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:51,613 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:51,613 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-11-25 18:24:51,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [84573514] [2022-11-25 18:24:51,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:51,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-25 18:24:51,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:51,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-25 18:24:51,614 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-11-25 18:24:51,615 INFO L87 Difference]: Start difference. First operand 523 states and 614 transitions. Second operand has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2022-11-25 18:24:52,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:52,083 INFO L93 Difference]: Finished difference Result 844 states and 998 transitions. [2022-11-25 18:24:52,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-25 18:24:52,084 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) Word has length 147 [2022-11-25 18:24:52,084 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:52,086 INFO L225 Difference]: With dead ends: 844 [2022-11-25 18:24:52,086 INFO L226 Difference]: Without dead ends: 390 [2022-11-25 18:24:52,087 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2022-11-25 18:24:52,088 INFO L413 NwaCegarLoop]: 127 mSDtfsCounter, 205 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 205 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:52,088 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [205 Valid, 477 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-25 18:24:52,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-11-25 18:24:52,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 379. [2022-11-25 18:24:52,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 379 states, 289 states have (on average 1.1176470588235294) internal successors, (323), 292 states have internal predecessors, (323), 54 states have call successors, (54), 31 states have call predecessors, (54), 35 states have return successors, (62), 55 states have call predecessors, (62), 50 states have call successors, (62) [2022-11-25 18:24:52,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 379 states to 379 states and 439 transitions. [2022-11-25 18:24:52,139 INFO L78 Accepts]: Start accepts. Automaton has 379 states and 439 transitions. Word has length 147 [2022-11-25 18:24:52,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:52,140 INFO L495 AbstractCegarLoop]: Abstraction has 379 states and 439 transitions. [2022-11-25 18:24:52,140 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 13.142857142857142) internal successors, (92), 3 states have internal predecessors, (92), 3 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (15), 2 states have call predecessors, (15), 3 states have call successors, (15) [2022-11-25 18:24:52,140 INFO L276 IsEmpty]: Start isEmpty. Operand 379 states and 439 transitions. [2022-11-25 18:24:52,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-11-25 18:24:52,143 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:52,143 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:24:52,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-25 18:24:52,143 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:24:52,144 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:52,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1779093938, now seen corresponding path program 1 times [2022-11-25 18:24:52,144 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:52,144 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663246953] [2022-11-25 18:24:52,144 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:52,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:52,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:53,181 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:24:53,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:53,198 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 18:24:53,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:53,210 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:24:53,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:53,215 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 18:24:53,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:53,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:24:53,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:53,234 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 18:24:53,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:53,242 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 18:24:53,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:53,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 18:24:53,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:53,257 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 18:24:53,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:53,262 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 18:24:53,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:53,269 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-25 18:24:53,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:53,277 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-25 18:24:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:53,284 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-25 18:24:53,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:53,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-25 18:24:53,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:53,380 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-25 18:24:53,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:53,399 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-25 18:24:53,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:53,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 140 [2022-11-25 18:24:53,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:53,411 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-25 18:24:53,411 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:53,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663246953] [2022-11-25 18:24:53,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663246953] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:53,412 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 18:24:53,412 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-11-25 18:24:53,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [971730112] [2022-11-25 18:24:53,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:53,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-25 18:24:53,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:53,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-25 18:24:53,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-11-25 18:24:53,415 INFO L87 Difference]: Start difference. First operand 379 states and 439 transitions. Second operand has 10 states, 10 states have (on average 9.4) internal successors, (94), 7 states have internal predecessors, (94), 5 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2022-11-25 18:24:54,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:54,104 INFO L93 Difference]: Finished difference Result 399 states and 457 transitions. [2022-11-25 18:24:54,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 18:24:54,104 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 7 states have internal predecessors, (94), 5 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) Word has length 149 [2022-11-25 18:24:54,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:54,106 INFO L225 Difference]: With dead ends: 399 [2022-11-25 18:24:54,107 INFO L226 Difference]: Without dead ends: 345 [2022-11-25 18:24:54,107 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 35 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=174, Unknown=0, NotChecked=0, Total=240 [2022-11-25 18:24:54,108 INFO L413 NwaCegarLoop]: 126 mSDtfsCounter, 404 mSDsluCounter, 548 mSDsCounter, 0 mSdLazyCounter, 476 mSolverCounterSat, 152 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 413 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 152 IncrementalHoareTripleChecker+Valid, 476 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:54,109 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [413 Valid, 674 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [152 Valid, 476 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-25 18:24:54,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 345 states. [2022-11-25 18:24:54,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 345 to 246. [2022-11-25 18:24:54,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 246 states, 187 states have (on average 1.0962566844919786) internal successors, (205), 190 states have internal predecessors, (205), 34 states have call successors, (34), 22 states have call predecessors, (34), 24 states have return successors, (37), 33 states have call predecessors, (37), 32 states have call successors, (37) [2022-11-25 18:24:54,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 246 states to 246 states and 276 transitions. [2022-11-25 18:24:54,153 INFO L78 Accepts]: Start accepts. Automaton has 246 states and 276 transitions. Word has length 149 [2022-11-25 18:24:54,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:54,154 INFO L495 AbstractCegarLoop]: Abstraction has 246 states and 276 transitions. [2022-11-25 18:24:54,154 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 9.4) internal successors, (94), 7 states have internal predecessors, (94), 5 states have call successors, (16), 6 states have call predecessors, (16), 2 states have return successors, (15), 3 states have call predecessors, (15), 4 states have call successors, (15) [2022-11-25 18:24:54,154 INFO L276 IsEmpty]: Start isEmpty. Operand 246 states and 276 transitions. [2022-11-25 18:24:54,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 179 [2022-11-25 18:24:54,157 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 18:24:54,157 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:24:54,157 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-11-25 18:24:54,157 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 18:24:54,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 18:24:54,158 INFO L85 PathProgramCache]: Analyzing trace with hash -148329902, now seen corresponding path program 1 times [2022-11-25 18:24:54,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 18:24:54,158 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716078972] [2022-11-25 18:24:54,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:54,158 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 18:24:54,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:55,037 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-11-25 18:24:55,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:55,051 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2022-11-25 18:24:55,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:55,060 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:24:55,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:55,075 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-11-25 18:24:55,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:55,246 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:24:55,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:55,290 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2022-11-25 18:24:55,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:55,298 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 18:24:55,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:55,304 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2022-11-25 18:24:55,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:55,312 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-11-25 18:24:55,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:55,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2022-11-25 18:24:55,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:55,324 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2022-11-25 18:24:55,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:55,329 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2022-11-25 18:24:55,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:55,335 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2022-11-25 18:24:55,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:55,353 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2022-11-25 18:24:55,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:55,373 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2022-11-25 18:24:55,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:55,395 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2022-11-25 18:24:55,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:55,401 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 147 [2022-11-25 18:24:55,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:55,412 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:24:55,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:55,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2022-11-25 18:24:55,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:55,423 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2022-11-25 18:24:55,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:55,429 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-11-25 18:24:55,430 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 18:24:55,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716078972] [2022-11-25 18:24:55,430 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716078972] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-25 18:24:55,430 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1827415017] [2022-11-25 18:24:55,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 18:24:55,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 18:24:55,431 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 18:24:55,432 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 18:24:55,454 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 18:24:56,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 18:24:56,487 INFO L263 TraceCheckSpWp]: Trace formula consists of 2081 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-25 18:24:56,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 18:24:56,598 INFO L134 CoverageAnalysis]: Checked inductivity of 73 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-11-25 18:24:56,598 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 18:24:56,598 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1827415017] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 18:24:56,598 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-25 18:24:56,599 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [14] total 17 [2022-11-25 18:24:56,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511830399] [2022-11-25 18:24:56,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 18:24:56,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-25 18:24:56,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 18:24:56,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-25 18:24:56,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=240, Unknown=0, NotChecked=0, Total=272 [2022-11-25 18:24:56,602 INFO L87 Difference]: Start difference. First operand 246 states and 276 transitions. Second operand has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-11-25 18:24:56,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 18:24:56,713 INFO L93 Difference]: Finished difference Result 252 states and 281 transitions. [2022-11-25 18:24:56,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-25 18:24:56,713 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) Word has length 178 [2022-11-25 18:24:56,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 18:24:56,714 INFO L225 Difference]: With dead ends: 252 [2022-11-25 18:24:56,714 INFO L226 Difference]: Without dead ends: 0 [2022-11-25 18:24:56,715 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 212 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=42, Invalid=300, Unknown=0, NotChecked=0, Total=342 [2022-11-25 18:24:56,716 INFO L413 NwaCegarLoop]: 159 mSDtfsCounter, 38 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 18:24:56,716 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 578 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 18:24:56,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-11-25 18:24:56,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-11-25 18:24:56,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-25 18:24:56,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-11-25 18:24:56,718 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 178 [2022-11-25 18:24:56,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 18:24:56,718 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-11-25 18:24:56,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 23.4) internal successors, (117), 5 states have internal predecessors, (117), 3 states have call successors, (20), 2 states have call predecessors, (20), 2 states have return successors, (18), 3 states have call predecessors, (18), 3 states have call successors, (18) [2022-11-25 18:24:56,719 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-11-25 18:24:56,719 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-11-25 18:24:56,722 INFO L805 garLoopResultBuilder]: Registering result SAFE for location ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-25 18:24:56,745 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 18:24:56,945 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-11-25 18:24:56,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-11-25 18:25:07,378 INFO L902 garLoopResultBuilder]: At program point L4257(lines 4256 4258) the Hoare annotation is: true [2022-11-25 18:25:07,378 INFO L899 garLoopResultBuilder]: For program point kbtab_initEXIT(lines 3909 3925) no Hoare annotation was computed. [2022-11-25 18:25:07,378 INFO L902 garLoopResultBuilder]: At program point L3922(lines 3911 3924) the Hoare annotation is: true [2022-11-25 18:25:07,378 INFO L902 garLoopResultBuilder]: At program point kbtab_initENTRY(lines 3909 3925) the Hoare annotation is: true [2022-11-25 18:25:07,378 INFO L902 garLoopResultBuilder]: At program point L3471(lines 3465 3473) the Hoare annotation is: true [2022-11-25 18:25:07,378 INFO L899 garLoopResultBuilder]: For program point L3915(lines 3915 3918) no Hoare annotation was computed. [2022-11-25 18:25:07,378 INFO L899 garLoopResultBuilder]: For program point kbtab_initFINAL(lines 3909 3925) no Hoare annotation was computed. [2022-11-25 18:25:07,379 INFO L899 garLoopResultBuilder]: For program point L4210-1(line 4210) no Hoare annotation was computed. [2022-11-25 18:25:07,379 INFO L899 garLoopResultBuilder]: For program point dev_get_drvdataFINAL(lines 4209 4211) no Hoare annotation was computed. [2022-11-25 18:25:07,379 INFO L895 garLoopResultBuilder]: At program point dev_get_drvdataENTRY(lines 4209 4211) the Hoare annotation is: (or (not (<= 1 ~ldv_urb_state~0)) (not (<= 1 ~ldv_coherent_state~0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= 0 ~res_kbtab_probe_3~0)) (not (<= ~ldv_urb_state~0 1)) (not (<= ~ldv_coherent_state~0 1))) [2022-11-25 18:25:07,379 INFO L895 garLoopResultBuilder]: At program point L4210(line 4210) the Hoare annotation is: (or (not (<= 1 ~ldv_urb_state~0)) (not (<= 1 ~ldv_coherent_state~0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|)) (not (= 0 ~res_kbtab_probe_3~0)) (not (<= ~ldv_urb_state~0 1)) (not (<= ~ldv_coherent_state~0 1))) [2022-11-25 18:25:07,379 INFO L899 garLoopResultBuilder]: For program point dev_get_drvdataEXIT(lines 4209 4211) no Hoare annotation was computed. [2022-11-25 18:25:07,379 INFO L899 garLoopResultBuilder]: For program point kfreeEXIT(lines 4264 4266) no Hoare annotation was computed. [2022-11-25 18:25:07,380 INFO L895 garLoopResultBuilder]: At program point kfreeENTRY(lines 4264 4266) the Hoare annotation is: (or (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0)) (= |old(#valid)| |#valid|)) [2022-11-25 18:25:07,380 INFO L899 garLoopResultBuilder]: For program point kfreeFINAL(lines 4264 4266) no Hoare annotation was computed. [2022-11-25 18:25:07,380 INFO L899 garLoopResultBuilder]: For program point L3437-1(line 3437) no Hoare annotation was computed. [2022-11-25 18:25:07,380 INFO L902 garLoopResultBuilder]: At program point L3437(line 3437) the Hoare annotation is: true [2022-11-25 18:25:07,380 INFO L902 garLoopResultBuilder]: At program point usb_set_intfdataENTRY(lines 3433 3441) the Hoare annotation is: true [2022-11-25 18:25:07,380 INFO L899 garLoopResultBuilder]: For program point usb_set_intfdataFINAL(lines 3433 3441) no Hoare annotation was computed. [2022-11-25 18:25:07,380 INFO L899 garLoopResultBuilder]: For program point usb_set_intfdataEXIT(lines 3433 3441) no Hoare annotation was computed. [2022-11-25 18:25:07,380 INFO L899 garLoopResultBuilder]: For program point L4239(line 4239) no Hoare annotation was computed. [2022-11-25 18:25:07,380 INFO L899 garLoopResultBuilder]: For program point ldv_undefined_pointerFINAL(lines 4238 4240) no Hoare annotation was computed. [2022-11-25 18:25:07,381 INFO L895 garLoopResultBuilder]: At program point ldv_undefined_pointerENTRY(lines 4238 4240) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_urb_state~0 0))) (.cse1 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse2 (not (= 0 ~res_kbtab_probe_3~0)))) (and (or .cse0 (not (<= 1 ~ldv_coherent_state~0)) .cse1 .cse2 (not (<= ~ldv_coherent_state~0 1))) (or (not (= ~ldv_coherent_state~0 0)) .cse0 .cse1 .cse2))) [2022-11-25 18:25:07,381 INFO L899 garLoopResultBuilder]: For program point ldv_undefined_pointerEXIT(lines 4238 4240) no Hoare annotation was computed. [2022-11-25 18:25:07,381 INFO L902 garLoopResultBuilder]: At program point L4158(line 4158) the Hoare annotation is: true [2022-11-25 18:25:07,381 INFO L899 garLoopResultBuilder]: For program point L4156(lines 4154 4173) no Hoare annotation was computed. [2022-11-25 18:25:07,381 INFO L895 garLoopResultBuilder]: At program point L4154loopEntry(lines 4154 4173) the Hoare annotation is: (or (not (<= |old(~ldv_urb_state~0)| 1)) (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|) (not (<= 1 |old(~ldv_urb_state~0)|)) (not (<= 1 ~ldv_coherent_state~0)) (not (= 0 ~res_kbtab_probe_3~0)) (not (<= ~ldv_coherent_state~0 1))) [2022-11-25 18:25:07,381 INFO L899 garLoopResultBuilder]: For program point usb_free_urbEXIT(lines 4150 4179) no Hoare annotation was computed. [2022-11-25 18:25:07,381 INFO L895 garLoopResultBuilder]: At program point usb_free_urbENTRY(lines 4150 4179) the Hoare annotation is: (or (not (<= |old(~ldv_urb_state~0)| 1)) (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|) (not (<= 1 |old(~ldv_urb_state~0)|)) (not (<= 1 ~ldv_coherent_state~0)) (not (= 0 ~res_kbtab_probe_3~0)) (not (<= ~ldv_coherent_state~0 1))) [2022-11-25 18:25:07,381 INFO L899 garLoopResultBuilder]: For program point L4163(lines 4163 4168) no Hoare annotation was computed. [2022-11-25 18:25:07,382 INFO L899 garLoopResultBuilder]: For program point L4155(lines 4154 4173) no Hoare annotation was computed. [2022-11-25 18:25:07,382 INFO L895 garLoopResultBuilder]: At program point L4174(lines 4150 4179) the Hoare annotation is: (or (not (<= |old(~ldv_urb_state~0)| 1)) (and (= ~ldv_urb_state~0 0) (let ((.cse0 (+ usb_free_urb_~urb.base usb_free_urb_~urb.offset))) (let ((.cse1 (div .cse0 18446744073709551616))) (or (not (<= .cse0 (* .cse1 18446744073709551616))) (<= (+ .cse1 1) 0))))) (not (<= 1 |old(~ldv_urb_state~0)|)) (not (<= 1 ~ldv_coherent_state~0)) (not (= 0 ~res_kbtab_probe_3~0)) (not (<= ~ldv_coherent_state~0 1))) [2022-11-25 18:25:07,382 INFO L895 garLoopResultBuilder]: At program point L4166(line 4166) the Hoare annotation is: (or (not (<= |old(~ldv_urb_state~0)| 1)) (not (<= 1 |old(~ldv_urb_state~0)|)) (not (<= 1 ~ldv_coherent_state~0)) (not (= 0 ~res_kbtab_probe_3~0)) (not (<= ~ldv_coherent_state~0 1))) [2022-11-25 18:25:07,382 INFO L899 garLoopResultBuilder]: For program point L4166-1(lines 4163 4168) no Hoare annotation was computed. [2022-11-25 18:25:07,382 INFO L899 garLoopResultBuilder]: For program point input_set_abs_paramsEXIT(lines 4226 4228) no Hoare annotation was computed. [2022-11-25 18:25:07,382 INFO L902 garLoopResultBuilder]: At program point input_set_abs_paramsENTRY(lines 4226 4228) the Hoare annotation is: true [2022-11-25 18:25:07,382 INFO L899 garLoopResultBuilder]: For program point input_set_abs_paramsFINAL(lines 4226 4228) no Hoare annotation was computed. [2022-11-25 18:25:07,382 INFO L899 garLoopResultBuilder]: For program point kbtab_exitFINAL(lines 3928 3936) no Hoare annotation was computed. [2022-11-25 18:25:07,383 INFO L902 garLoopResultBuilder]: At program point L4250(lines 4249 4251) the Hoare annotation is: true [2022-11-25 18:25:07,383 INFO L902 garLoopResultBuilder]: At program point kbtab_exitENTRY(lines 3928 3936) the Hoare annotation is: true [2022-11-25 18:25:07,383 INFO L899 garLoopResultBuilder]: For program point kbtab_exitEXIT(lines 3928 3936) no Hoare annotation was computed. [2022-11-25 18:25:07,383 INFO L895 garLoopResultBuilder]: At program point ldv_mallocENTRY(lines 4201 4205) the Hoare annotation is: (let ((.cse0 (not (= ~ldv_urb_state~0 0))) (.cse1 (not (<= 1 ~ldv_coherent_state~0))) (.cse2 (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) (.cse3 (not (= 0 ~res_kbtab_probe_3~0))) (.cse4 (not (<= ~ldv_coherent_state~0 1)))) (and (or .cse0 .cse1 .cse2 .cse3 .cse4) (or (not (= ~ldv_coherent_state~0 0)) .cse0 .cse2 .cse3) (or (not (<= 1 ~ldv_urb_state~0)) .cse1 .cse2 .cse3 (not (<= ~ldv_urb_state~0 1)) .cse4))) [2022-11-25 18:25:07,383 INFO L899 garLoopResultBuilder]: For program point L4203(line 4203) no Hoare annotation was computed. [2022-11-25 18:25:07,383 INFO L899 garLoopResultBuilder]: For program point ldv_mallocFINAL(lines 4201 4205) no Hoare annotation was computed. [2022-11-25 18:25:07,383 INFO L899 garLoopResultBuilder]: For program point ldv_mallocEXIT(lines 4201 4205) no Hoare annotation was computed. [2022-11-25 18:25:07,383 INFO L895 garLoopResultBuilder]: At program point L4207(line 4207) the Hoare annotation is: (or (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-11-25 18:25:07,383 INFO L899 garLoopResultBuilder]: For program point L4207-1(line 4207) no Hoare annotation was computed. [2022-11-25 18:25:07,384 INFO L902 garLoopResultBuilder]: At program point L4207-2(lines 4206 4208) the Hoare annotation is: true [2022-11-25 18:25:07,384 INFO L899 garLoopResultBuilder]: For program point kzallocEXIT(lines 3405 3413) no Hoare annotation was computed. [2022-11-25 18:25:07,384 INFO L902 garLoopResultBuilder]: At program point L3401(lines 3394 3403) the Hoare annotation is: true [2022-11-25 18:25:07,384 INFO L895 garLoopResultBuilder]: At program point kzallocENTRY(lines 3405 3413) the Hoare annotation is: (or (not (= ~ldv_coherent_state~0 0)) (not (= ~ldv_urb_state~0 0)) (and (= |old(#length)| |#length|) (= |old(#valid)| |#valid|))) [2022-11-25 18:25:07,384 INFO L899 garLoopResultBuilder]: For program point kzallocFINAL(lines 3405 3413) no Hoare annotation was computed. [2022-11-25 18:25:07,384 INFO L902 garLoopResultBuilder]: At program point ldv_assume_stopENTRY(lines 4055 4061) the Hoare annotation is: true [2022-11-25 18:25:07,384 INFO L899 garLoopResultBuilder]: For program point ldv_assume_stopEXIT(lines 4055 4061) no Hoare annotation was computed. [2022-11-25 18:25:07,384 INFO L895 garLoopResultBuilder]: At program point L4117(lines 4093 4122) the Hoare annotation is: (or (not (<= 1 |old(~ldv_coherent_state~0)|)) (not (<= |old(~ldv_coherent_state~0)| 1)) (not (= ~ldv_urb_state~0 0)) (and (= ~ldv_coherent_state~0 0) (let ((.cse0 (+ usb_free_coherent_~addr.base usb_free_coherent_~addr.offset))) (let ((.cse1 (div .cse0 18446744073709551616))) (or (not (<= .cse0 (* 18446744073709551616 .cse1))) (<= (+ .cse1 1) 0)))))) [2022-11-25 18:25:07,385 INFO L895 garLoopResultBuilder]: At program point usb_free_coherentENTRY(lines 4093 4122) the Hoare annotation is: (or (not (<= 1 |old(~ldv_coherent_state~0)|)) (not (<= |old(~ldv_coherent_state~0)| 1)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (not (= ~ldv_urb_state~0 0))) [2022-11-25 18:25:07,385 INFO L899 garLoopResultBuilder]: For program point L4109-1(lines 4106 4111) no Hoare annotation was computed. [2022-11-25 18:25:07,385 INFO L895 garLoopResultBuilder]: At program point L4109(line 4109) the Hoare annotation is: (or (not (<= 1 |old(~ldv_coherent_state~0)|)) (not (<= |old(~ldv_coherent_state~0)| 1)) (not (= ~ldv_urb_state~0 0))) [2022-11-25 18:25:07,385 INFO L899 garLoopResultBuilder]: For program point usb_free_coherentEXIT(lines 4093 4122) no Hoare annotation was computed. [2022-11-25 18:25:07,385 INFO L902 garLoopResultBuilder]: At program point L4101(line 4101) the Hoare annotation is: true [2022-11-25 18:25:07,385 INFO L899 garLoopResultBuilder]: For program point L4099(lines 4097 4116) no Hoare annotation was computed. [2022-11-25 18:25:07,385 INFO L895 garLoopResultBuilder]: At program point L4097loopEntry(lines 4097 4116) the Hoare annotation is: (or (not (<= 1 |old(~ldv_coherent_state~0)|)) (not (<= |old(~ldv_coherent_state~0)| 1)) (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (not (= ~ldv_urb_state~0 0))) [2022-11-25 18:25:07,385 INFO L899 garLoopResultBuilder]: For program point L4106(lines 4106 4111) no Hoare annotation was computed. [2022-11-25 18:25:07,385 INFO L899 garLoopResultBuilder]: For program point L4098(lines 4097 4116) no Hoare annotation was computed. [2022-11-25 18:25:07,386 INFO L895 garLoopResultBuilder]: At program point L4032(lines 3979 4033) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-25 18:25:07,386 INFO L899 garLoopResultBuilder]: For program point L3487(lines 3487 3494) no Hoare annotation was computed. [2022-11-25 18:25:07,386 INFO L895 garLoopResultBuilder]: At program point L3454-1(line 3454) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-25 18:25:07,386 INFO L895 garLoopResultBuilder]: At program point L3867(lines 3793 3873) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0))) (or (and .cse0 (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) .cse1 .cse2) (and .cse0 .cse1 .cse2 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)))) [2022-11-25 18:25:07,386 INFO L895 garLoopResultBuilder]: At program point L4247(lines 4246 4248) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-25 18:25:07,386 INFO L895 garLoopResultBuilder]: At program point L3884(line 3884) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_kbtab_probe_#res#1| 0)) [2022-11-25 18:25:07,386 INFO L899 garLoopResultBuilder]: For program point L3851(lines 3851 3854) no Hoare annotation was computed. [2022-11-25 18:25:07,386 INFO L899 garLoopResultBuilder]: For program point L3884-1(line 3884) no Hoare annotation was computed. [2022-11-25 18:25:07,387 INFO L899 garLoopResultBuilder]: For program point L4132(line 4132) no Hoare annotation was computed. [2022-11-25 18:25:07,387 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-11-25 18:25:07,387 INFO L899 garLoopResultBuilder]: For program point L3802(lines 3802 3808) no Hoare annotation was computed. [2022-11-25 18:25:07,387 INFO L895 garLoopResultBuilder]: At program point L3852(lines 3793 3873) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0))) [2022-11-25 18:25:07,387 INFO L899 garLoopResultBuilder]: For program point L3885-1(line 3885) no Hoare annotation was computed. [2022-11-25 18:25:07,389 INFO L895 garLoopResultBuilder]: At program point L3885(line 3885) the Hoare annotation is: (and (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_urb_state~0 0) (<= ~ldv_coherent_state~0 1) (= |ULTIMATE.start_kbtab_probe_#res#1| 0)) [2022-11-25 18:25:07,389 INFO L899 garLoopResultBuilder]: For program point L3456(lines 3456 3460) no Hoare annotation was computed. [2022-11-25 18:25:07,389 INFO L899 garLoopResultBuilder]: For program point L3456-2(lines 3456 3460) no Hoare annotation was computed. [2022-11-25 18:25:07,389 INFO L899 garLoopResultBuilder]: For program point L3985(lines 3985 3990) no Hoare annotation was computed. [2022-11-25 18:25:07,390 INFO L895 garLoopResultBuilder]: At program point L3886(line 3886) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_kbtab_probe_#res#1| 0)) [2022-11-25 18:25:07,390 INFO L899 garLoopResultBuilder]: For program point L3820(lines 3820 3823) no Hoare annotation was computed. [2022-11-25 18:25:07,390 INFO L895 garLoopResultBuilder]: At program point L3886-1(lines 3875 3890) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_kbtab_probe_#res#1| 0)) [2022-11-25 18:25:07,390 INFO L895 garLoopResultBuilder]: At program point L4233(lines 4232 4234) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse5 (= 0 ~res_kbtab_probe_3~0)) (.cse4 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (.cse3 (= |ULTIMATE.start_kbtab_probe_#res#1| 0))) (or (and .cse0 (<= (+ 12 ~res_kbtab_probe_3~0) 0) .cse1 (<= (+ |ULTIMATE.start_kbtab_probe_#res#1| 12) 0) .cse2 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) (and .cse0 (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) (not .cse3) .cse4 .cse1 .cse2 (not .cse5)) (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) .cse5 .cse4 (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) .cse2 .cse3))) [2022-11-25 18:25:07,390 INFO L899 garLoopResultBuilder]: For program point L3490(lines 3490 3494) no Hoare annotation was computed. [2022-11-25 18:25:07,391 INFO L899 garLoopResultBuilder]: For program point L3490-2(lines 3487 3494) no Hoare annotation was computed. [2022-11-25 18:25:07,391 INFO L895 garLoopResultBuilder]: At program point L3870(line 3870) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0))) (or (and .cse0 (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) .cse1 .cse2) (and .cse0 .cse1 .cse2 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)))) [2022-11-25 18:25:07,391 INFO L899 garLoopResultBuilder]: For program point L3870-1(line 3870) no Hoare annotation was computed. [2022-11-25 18:25:07,391 INFO L899 garLoopResultBuilder]: For program point L4184(lines 4184 4189) no Hoare annotation was computed. [2022-11-25 18:25:07,391 INFO L899 garLoopResultBuilder]: For program point L4135(lines 4135 4138) no Hoare annotation was computed. [2022-11-25 18:25:07,392 INFO L899 garLoopResultBuilder]: For program point L3805(lines 3805 3808) no Hoare annotation was computed. [2022-11-25 18:25:07,392 INFO L899 garLoopResultBuilder]: For program point L4086(lines 4071 4087) no Hoare annotation was computed. [2022-11-25 18:25:07,392 INFO L899 garLoopResultBuilder]: For program point L3987-1(lines 3985 3990) no Hoare annotation was computed. [2022-11-25 18:25:07,392 INFO L899 garLoopResultBuilder]: For program point L3987(lines 3987 3990) no Hoare annotation was computed. [2022-11-25 18:25:07,392 INFO L895 garLoopResultBuilder]: At program point L4037(lines 3968 4044) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= ~ldv_urb_state~0 0)) [2022-11-25 18:25:07,392 INFO L895 garLoopResultBuilder]: At program point L3426(line 3426) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_kbtab_probe_#res#1| 0)) [2022-11-25 18:25:07,393 INFO L895 garLoopResultBuilder]: At program point L3872(lines 3782 3874) the Hoare annotation is: (let ((.cse4 (= ~ldv_coherent_state~0 0)) (.cse0 (= 0 ~res_kbtab_probe_3~0)) (.cse3 (= |ULTIMATE.start_kbtab_probe_#res#1| 0)) (.cse1 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse5 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0))) (or (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) .cse0 .cse1 (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) .cse2 .cse3) (and .cse4 .cse5 (<= (+ |ULTIMATE.start_kbtab_probe_#res#1| 12) 0) .cse2 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) (and .cse4 (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) .cse0 (not .cse3) .cse1 .cse5 .cse2))) [2022-11-25 18:25:07,393 INFO L899 garLoopResultBuilder]: For program point L3426-1(line 3426) no Hoare annotation was computed. [2022-11-25 18:25:07,393 INFO L895 garLoopResultBuilder]: At program point L3839-1(line 3839) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-25 18:25:07,393 INFO L895 garLoopResultBuilder]: At program point L3839(line 3839) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-25 18:25:07,394 INFO L895 garLoopResultBuilder]: At program point L3509(lines 3506 3511) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-25 18:25:07,394 INFO L895 garLoopResultBuilder]: At program point L3856(line 3856) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0))) [2022-11-25 18:25:07,394 INFO L899 garLoopResultBuilder]: For program point L3856-1(line 3856) no Hoare annotation was computed. [2022-11-25 18:25:07,394 INFO L895 garLoopResultBuilder]: At program point L4236(lines 4235 4237) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0)) [2022-11-25 18:25:07,394 INFO L895 garLoopResultBuilder]: At program point L3972(line 3972) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0)) [2022-11-25 18:25:07,395 INFO L899 garLoopResultBuilder]: For program point L3972-1(line 3972) no Hoare annotation was computed. [2022-11-25 18:25:07,395 INFO L895 garLoopResultBuilder]: At program point L3840(line 3840) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-25 18:25:07,395 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-11-25 18:25:07,395 INFO L899 garLoopResultBuilder]: For program point L4187-1(lines 4183 4197) no Hoare annotation was computed. [2022-11-25 18:25:07,395 INFO L895 garLoopResultBuilder]: At program point L4220(lines 4219 4221) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0))) (or (and .cse0 (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) .cse1 .cse2) (and .cse0 .cse1 .cse2 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)))) [2022-11-25 18:25:07,396 INFO L895 garLoopResultBuilder]: At program point L4187(line 4187) the Hoare annotation is: false [2022-11-25 18:25:07,396 INFO L895 garLoopResultBuilder]: At program point L3576(lines 3569 3578) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-25 18:25:07,396 INFO L895 garLoopResultBuilder]: At program point L4072loopEntry(lines 4072 4085) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-25 18:25:07,396 INFO L895 garLoopResultBuilder]: At program point L3428(lines 3422 3430) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_kbtab_probe_#res#1| 0)) [2022-11-25 18:25:07,397 INFO L895 garLoopResultBuilder]: At program point L3461(lines 3449 3463) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-25 18:25:07,397 INFO L899 garLoopResultBuilder]: For program point L3841(line 3841) no Hoare annotation was computed. [2022-11-25 18:25:07,397 INFO L895 garLoopResultBuilder]: At program point L4089(lines 4066 4091) the Hoare annotation is: (let ((.cse0 (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse3 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (.cse2 (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (.cse4 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0))) (or (and (= ~ldv_coherent_state~0 0) (= |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.offset| 0) .cse0 .cse1 (= |ULTIMATE.start_usb_alloc_coherent_#res#1.offset| 0) .cse2 .cse3 .cse4) (and (not .cse0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) .cse1 (<= ~ldv_coherent_state~0 1) .cse3 (not .cse2) .cse4))) [2022-11-25 18:25:07,397 INFO L895 garLoopResultBuilder]: At program point L4073(line 4073) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-25 18:25:07,397 INFO L899 garLoopResultBuilder]: For program point L3974(lines 3974 3977) no Hoare annotation was computed. [2022-11-25 18:25:07,398 INFO L895 garLoopResultBuilder]: At program point L3446(lines 3442 3448) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) [2022-11-25 18:25:07,398 INFO L899 garLoopResultBuilder]: For program point L3529-1(line 3529) no Hoare annotation was computed. [2022-11-25 18:25:07,398 INFO L895 garLoopResultBuilder]: At program point L3496(lines 3475 3498) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-25 18:25:07,398 INFO L899 garLoopResultBuilder]: For program point L4008(lines 4008 4011) no Hoare annotation was computed. [2022-11-25 18:25:07,399 INFO L895 garLoopResultBuilder]: At program point L3529(line 3529) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-25 18:25:07,399 INFO L899 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-11-25 18:25:07,399 INFO L899 garLoopResultBuilder]: For program point L3513-1(line 3513) no Hoare annotation was computed. [2022-11-25 18:25:07,399 INFO L895 garLoopResultBuilder]: At program point L3513(line 3513) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (.cse3 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0))) (or (and .cse0 (= 0 ~res_kbtab_probe_3~0) .cse1 .cse2 .cse3) (and .cse0 (= |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base| 0) .cse1 .cse2 (= |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset| 0) .cse3))) [2022-11-25 18:25:07,399 INFO L895 garLoopResultBuilder]: At program point L3513-2(lines 3512 3514) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse1 (= ~ldv_urb_state~0 0)) (.cse2 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (.cse3 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0))) (or (and .cse0 (= 0 ~res_kbtab_probe_3~0) .cse1 .cse2 .cse3) (and .cse0 (= |ULTIMATE.start_kbtab_probe_~kbtab~3#1.base| 0) .cse1 .cse2 (= |ULTIMATE.start_kbtab_probe_~kbtab~3#1.offset| 0) .cse3))) [2022-11-25 18:25:07,400 INFO L899 garLoopResultBuilder]: For program point L4075(line 4075) no Hoare annotation was computed. [2022-11-25 18:25:07,400 INFO L895 garLoopResultBuilder]: At program point L4224(lines 4223 4225) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-25 18:25:07,400 INFO L899 garLoopResultBuilder]: For program point L3861-1(line 3861) no Hoare annotation was computed. [2022-11-25 18:25:07,400 INFO L895 garLoopResultBuilder]: At program point L3861(line 3861) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0))) [2022-11-25 18:25:07,400 INFO L895 garLoopResultBuilder]: At program point L3531(lines 3525 3533) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-25 18:25:07,401 INFO L895 garLoopResultBuilder]: At program point L4043(lines 3961 4045) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2022-11-25 18:25:07,401 INFO L899 garLoopResultBuilder]: For program point L3994(lines 3994 4030) no Hoare annotation was computed. [2022-11-25 18:25:07,401 INFO L899 garLoopResultBuilder]: For program point L4143(lines 4128 4144) no Hoare annotation was computed. [2022-11-25 18:25:07,401 INFO L899 garLoopResultBuilder]: For program point L3813(lines 3813 3816) no Hoare annotation was computed. [2022-11-25 18:25:07,401 INFO L895 garLoopResultBuilder]: At program point L4193-1(lines 4181 4198) the Hoare annotation is: (= ~ldv_urb_state~0 0) [2022-11-25 18:25:07,401 INFO L895 garLoopResultBuilder]: At program point L4193(line 4193) the Hoare annotation is: false [2022-11-25 18:25:07,402 INFO L895 garLoopResultBuilder]: At program point L4028(lines 3980 4031) the Hoare annotation is: (let ((.cse5 (not (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 1))) (.cse0 (<= 1 ~ldv_coherent_state~0)) (.cse2 (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|)) (.cse3 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse4 (<= ~ldv_coherent_state~0 1)) (.cse6 (= |ULTIMATE.start_kbtab_probe_#res#1| 0)) (.cse7 (= ~ldv_coherent_state~0 0)) (.cse1 (= 0 ~res_kbtab_probe_3~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse2 .cse3 .cse5) (and (<= 1 ~ldv_urb_state~0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~ldv_urb_state~0 1) .cse6) (and .cse7 .cse1 (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)))) [2022-11-25 18:25:07,402 INFO L895 garLoopResultBuilder]: At program point L3995(lines 3994 4030) the Hoare annotation is: (let ((.cse5 (not (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 1))) (.cse0 (<= 1 ~ldv_coherent_state~0)) (.cse2 (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|)) (.cse3 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse4 (<= ~ldv_coherent_state~0 1)) (.cse6 (= |ULTIMATE.start_kbtab_probe_#res#1| 0)) (.cse7 (= ~ldv_coherent_state~0 0)) (.cse1 (= 0 ~res_kbtab_probe_3~0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse7 .cse1 .cse2 .cse3 .cse5) (and (<= 1 ~ldv_urb_state~0) .cse0 .cse1 .cse2 .cse3 .cse4 (<= ~ldv_urb_state~0 1) .cse6) (and .cse7 .cse1 (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)))) [2022-11-25 18:25:07,402 INFO L895 garLoopResultBuilder]: At program point L3863(lines 3793 3873) the Hoare annotation is: (let ((.cse0 (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|))) (.cse1 (<= 1 ~ldv_coherent_state~0)) (.cse2 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse3 (= ~ldv_urb_state~0 0)) (.cse4 (<= ~ldv_coherent_state~0 1)) (.cse5 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (.cse6 (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)))) (or (and .cse0 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) (and .cse0 (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) .cse1 (= 0 ~res_kbtab_probe_3~0) .cse2 .cse3 .cse4 .cse5 .cse6))) [2022-11-25 18:25:07,403 INFO L899 garLoopResultBuilder]: For program point L4078(lines 4078 4081) no Hoare annotation was computed. [2022-11-25 18:25:07,403 INFO L899 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-11-25 18:25:07,403 INFO L895 garLoopResultBuilder]: At program point L3798(line 3798) the Hoare annotation is: (and (= ~ldv_coherent_state~0 0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-25 18:25:07,403 INFO L899 garLoopResultBuilder]: For program point L3798-1(line 3798) no Hoare annotation was computed. [2022-11-25 18:25:07,403 INFO L895 garLoopResultBuilder]: At program point L4129loopEntry(lines 4129 4142) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (<= ~ldv_coherent_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-25 18:25:07,404 INFO L899 garLoopResultBuilder]: For program point L3997(lines 3997 4030) no Hoare annotation was computed. [2022-11-25 18:25:07,404 INFO L899 garLoopResultBuilder]: For program point L3865-1(line 3865) no Hoare annotation was computed. [2022-11-25 18:25:07,404 INFO L895 garLoopResultBuilder]: At program point L3865(line 3865) the Hoare annotation is: (let ((.cse0 (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|))) (.cse1 (<= 1 ~ldv_coherent_state~0)) (.cse2 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse3 (= ~ldv_urb_state~0 0)) (.cse4 (<= ~ldv_coherent_state~0 1)) (.cse5 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (.cse6 (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)))) (or (and .cse0 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) (and .cse0 (not (= |ULTIMATE.start_kbtab_probe_~error~0#1| 0)) .cse1 (= 0 ~res_kbtab_probe_3~0) .cse2 .cse3 .cse4 .cse5 .cse6))) [2022-11-25 18:25:07,404 INFO L895 garLoopResultBuilder]: At program point L4146(lines 4124 4148) the Hoare annotation is: (let ((.cse4 (= ~ldv_urb_state~0 0)) (.cse9 (= 0 |ULTIMATE.start_usb_alloc_urb_#res#1.offset|)) (.cse0 (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|))) (.cse1 (<= 1 ~ldv_coherent_state~0)) (.cse10 (= 0 ~res_kbtab_probe_3~0)) (.cse2 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse5 (<= ~ldv_coherent_state~0 1)) (.cse6 (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (.cse7 (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0))) (.cse3 (= |ULTIMATE.start_usb_alloc_urb_#res#1.base| 0)) (.cse8 (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0))) (or (and .cse0 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.base| 0) .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 .cse1 .cse10 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse8 .cse9) (and .cse0 (<= 1 ~ldv_urb_state~0) .cse1 .cse10 .cse2 .cse5 (<= ~ldv_urb_state~0 1) .cse6 .cse7 (not .cse3) .cse8))) [2022-11-25 18:25:07,404 INFO L899 garLoopResultBuilder]: For program point L3981(line 3981) no Hoare annotation was computed. [2022-11-25 18:25:07,405 INFO L895 garLoopResultBuilder]: At program point L3882(line 3882) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_kbtab_probe_#res#1| 0)) [2022-11-25 18:25:07,405 INFO L899 garLoopResultBuilder]: For program point L3882-1(line 3882) no Hoare annotation was computed. [2022-11-25 18:25:07,405 INFO L895 garLoopResultBuilder]: At program point L4130(line 4130) the Hoare annotation is: (and (not (= 0 |ULTIMATE.start_usb_alloc_coherent_~arbitrary_memory~0#1.base|)) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (= ~ldv_urb_state~0 0) (<= ~ldv_coherent_state~0 1) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0) (not (= |ULTIMATE.start_usb_alloc_coherent_#res#1.base| 0)) (<= (+ |ULTIMATE.start_kbtab_probe_~error~0#1| 12) 0)) [2022-11-25 18:25:07,405 INFO L895 garLoopResultBuilder]: At program point L3998(lines 3997 4030) the Hoare annotation is: (let ((.cse0 (= ~ldv_coherent_state~0 0)) (.cse6 (<= 1 ~ldv_coherent_state~0)) (.cse1 (= 0 ~res_kbtab_probe_3~0)) (.cse2 (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|)) (.cse3 (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0)) (.cse4 (not (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| |ULTIMATE.start_main_~tmp___8~3#1|))) (.cse7 (<= ~ldv_coherent_state~0 1)) (.cse5 (not (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 1))) (.cse8 (= |ULTIMATE.start_kbtab_probe_#res#1| 0))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5) (and .cse0 .cse1 .cse4 (= ~ldv_urb_state~0 0) (= |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1| 0)) (and (<= 1 ~ldv_urb_state~0) .cse6 .cse1 .cse2 .cse3 .cse7 (<= ~ldv_urb_state~0 1) .cse8) (and .cse6 .cse1 .cse2 .cse3 .cse4 .cse7 .cse5 .cse8))) [2022-11-25 18:25:07,406 INFO L895 garLoopResultBuilder]: At program point L4230(lines 4229 4231) the Hoare annotation is: (and (<= 1 ~ldv_urb_state~0) (<= 1 ~ldv_coherent_state~0) (= 0 ~res_kbtab_probe_3~0) (<= 1 |ULTIMATE.start_main_~ldv_s_kbtab_driver_usb_driver~0#1|) (= |ULTIMATE.start_usb_alloc_urb_~arbitrary_memory~1#1.offset| 0) (<= ~ldv_coherent_state~0 1) (<= ~ldv_urb_state~0 1) (= |ULTIMATE.start_kbtab_probe_#res#1| 0)) [2022-11-25 18:25:07,406 INFO L902 garLoopResultBuilder]: At program point ldv_blast_assertENTRY(lines 4046 4051) the Hoare annotation is: true [2022-11-25 18:25:07,406 INFO L899 garLoopResultBuilder]: For program point ldv_blast_assertEXIT(lines 4046 4051) no Hoare annotation was computed. [2022-11-25 18:25:07,406 INFO L899 garLoopResultBuilder]: For program point ldv_blast_assertFINAL(lines 4046 4051) no Hoare annotation was computed. [2022-11-25 18:25:07,406 INFO L899 garLoopResultBuilder]: For program point ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4049) no Hoare annotation was computed. [2022-11-25 18:25:07,407 INFO L899 garLoopResultBuilder]: For program point dev_set_drvdataFINAL(lines 4213 4215) no Hoare annotation was computed. [2022-11-25 18:25:07,407 INFO L899 garLoopResultBuilder]: For program point dev_set_drvdataEXIT(lines 4213 4215) no Hoare annotation was computed. [2022-11-25 18:25:07,407 INFO L902 garLoopResultBuilder]: At program point dev_set_drvdataENTRY(lines 4213 4215) the Hoare annotation is: true [2022-11-25 18:25:07,411 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 18:25:07,413 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 18:25:07,474 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 06:25:07 BoogieIcfgContainer [2022-11-25 18:25:07,487 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 18:25:07,487 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 18:25:07,488 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 18:25:07,488 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 18:25:07,488 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 06:24:21" (3/4) ... [2022-11-25 18:25:07,491 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-11-25 18:25:07,498 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_init [2022-11-25 18:25:07,498 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_get_drvdata [2022-11-25 18:25:07,498 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kfree [2022-11-25 18:25:07,498 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_set_intfdata [2022-11-25 18:25:07,498 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_undefined_pointer [2022-11-25 18:25:07,499 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_urb [2022-11-25 18:25:07,499 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure input_set_abs_params [2022-11-25 18:25:07,499 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kbtab_exit [2022-11-25 18:25:07,499 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_malloc [2022-11-25 18:25:07,499 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure kzalloc [2022-11-25 18:25:07,499 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_assume_stop [2022-11-25 18:25:07,499 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure usb_free_coherent [2022-11-25 18:25:07,500 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ldv_blast_assert [2022-11-25 18:25:07,500 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure dev_set_drvdata [2022-11-25 18:25:07,521 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 77 nodes and edges [2022-11-25 18:25:07,522 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 30 nodes and edges [2022-11-25 18:25:07,524 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-11-25 18:25:07,525 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2022-11-25 18:25:07,526 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 18:25:07,527 INFO L915 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-11-25 18:25:07,566 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((1 <= ldv_coherent_state && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && !(ldv_s_kbtab_driver_usb_driver == 1)) && \result == 0) || ((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && !(ldv_s_kbtab_driver_usb_driver == 1))) || (((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && \result == 0)) || (((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) [2022-11-25 18:25:07,566 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\old(ldv_urb_state) <= 1) || (ldv_urb_state == 0 && (!(urb + urb <= (urb + urb) / 18446744073709551616 * 18446744073709551616) || (urb + urb) / 18446744073709551616 + 1 <= 0))) || !(1 <= \old(ldv_urb_state))) || !(1 <= ldv_coherent_state)) || !(0 == res_kbtab_probe_3)) || !(ldv_coherent_state <= 1) [2022-11-25 18:25:07,566 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(1 <= \old(ldv_coherent_state)) || !(\old(ldv_coherent_state) <= 1)) || !(ldv_urb_state == 0)) || (ldv_coherent_state == 0 && (!(addr + addr <= 18446744073709551616 * ((addr + addr) / 18446744073709551616)) || (addr + addr) / 18446744073709551616 + 1 <= 0)) [2022-11-25 18:25:07,566 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(0 == arbitrary_memory) && arbitrary_memory == 0) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_coherent_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0) || ((((((((!(0 == arbitrary_memory) && !(error == 0)) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_coherent_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) [2022-11-25 18:25:07,567 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((1 <= ldv_coherent_state && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && !(ldv_s_kbtab_driver_usb_driver == 1)) && \result == 0) || ((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && !(ldv_s_kbtab_driver_usb_driver == 1))) || (((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && \result == 0)) || (((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) [2022-11-25 18:25:07,567 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && !(ldv_s_kbtab_driver_usb_driver == 1)) || ((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0)) || (((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && \result == 0)) || (((((((1 <= ldv_coherent_state && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && ldv_coherent_state <= 1) && !(ldv_s_kbtab_driver_usb_driver == 1)) && \result == 0) [2022-11-25 18:25:07,567 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_urb_state == 0) && \result == 0 [2022-11-25 18:25:07,570 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((!(1 <= \old(ldv_coherent_state)) || !(\old(ldv_coherent_state) <= 1)) || \old(ldv_coherent_state) == ldv_coherent_state) || !(ldv_urb_state == 0) [2022-11-25 18:25:07,570 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) || ((((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0)) || ((((((ldv_coherent_state == 0 && !(error == 0)) && 0 == res_kbtab_probe_3) && !(\result == 0)) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) [2022-11-25 18:25:07,570 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((ldv_coherent_state == 0 && 12 + res_kbtab_probe_3 <= 0) && ldv_urb_state == 0) && \result + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) || ((((((ldv_coherent_state == 0 && !(error == 0)) && !(\result == 0)) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && !(0 == res_kbtab_probe_3))) || (((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) [2022-11-25 18:25:07,571 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && \result == 0 [2022-11-25 18:25:07,571 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && \result == 0 [2022-11-25 18:25:07,571 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((ldv_coherent_state == 0 && arbitrary_memory == 0) && 0 == arbitrary_memory) && ldv_urb_state == 0) && \result == 0) && \result == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) || (((((((!(0 == arbitrary_memory) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_coherent_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0) [2022-11-25 18:25:07,571 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((!(0 == arbitrary_memory) && arbitrary_memory == 0) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0) && ldv_coherent_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0) && 0 == \result) || ((((((((((!(0 == arbitrary_memory) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0) && ldv_coherent_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0) && 0 == \result)) || ((((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && !(\result == 0)) && error + 12 <= 0) [2022-11-25 18:25:07,571 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2022-11-25 18:25:07,572 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((!(\old(ldv_urb_state) <= 1) || ldv_urb_state == \old(ldv_urb_state)) || !(1 <= \old(ldv_urb_state))) || !(1 <= ldv_coherent_state)) || !(0 == res_kbtab_probe_3)) || !(ldv_coherent_state <= 1) [2022-11-25 18:25:07,572 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((!(0 == arbitrary_memory) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_coherent_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2022-11-25 18:25:07,572 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2022-11-25 18:25:07,572 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2022-11-25 18:25:07,573 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2022-11-25 18:25:07,573 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2022-11-25 18:25:07,573 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2022-11-25 18:25:07,573 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2022-11-25 18:25:07,574 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 [2022-11-25 18:25:07,574 WARN L220 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((!(0 == arbitrary_memory) && !(error == 0)) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0) [2022-11-25 18:25:07,729 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 18:25:07,729 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 18:25:07,729 INFO L158 Benchmark]: Toolchain (without parser) took 49609.12ms. Allocated memory was 188.7MB in the beginning and 880.8MB in the end (delta: 692.1MB). Free memory was 153.4MB in the beginning and 357.1MB in the end (delta: -203.7MB). Peak memory consumption was 490.6MB. Max. memory is 16.1GB. [2022-11-25 18:25:07,730 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 117.4MB. Free memory is still 60.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 18:25:07,730 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1347.50ms. Allocated memory is still 188.7MB. Free memory was 152.9MB in the beginning and 126.2MB in the end (delta: 26.7MB). Peak memory consumption was 60.5MB. Max. memory is 16.1GB. [2022-11-25 18:25:07,730 INFO L158 Benchmark]: Boogie Procedure Inliner took 141.94ms. Allocated memory is still 188.7MB. Free memory was 126.2MB in the beginning and 121.1MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-11-25 18:25:07,731 INFO L158 Benchmark]: Boogie Preprocessor took 143.82ms. Allocated memory is still 188.7MB. Free memory was 121.1MB in the beginning and 114.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-25 18:25:07,731 INFO L158 Benchmark]: RCFGBuilder took 1654.35ms. Allocated memory is still 188.7MB. Free memory was 114.8MB in the beginning and 114.7MB in the end (delta: 107.3kB). Peak memory consumption was 51.1MB. Max. memory is 16.1GB. [2022-11-25 18:25:07,731 INFO L158 Benchmark]: TraceAbstraction took 46071.45ms. Allocated memory was 188.7MB in the beginning and 880.8MB in the end (delta: 692.1MB). Free memory was 114.7MB in the beginning and 376.5MB in the end (delta: -261.8MB). Peak memory consumption was 513.2MB. Max. memory is 16.1GB. [2022-11-25 18:25:07,732 INFO L158 Benchmark]: Witness Printer took 241.49ms. Allocated memory is still 880.8MB. Free memory was 376.5MB in the beginning and 357.1MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-11-25 18:25:07,733 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.29ms. Allocated memory is still 117.4MB. Free memory is still 60.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1347.50ms. Allocated memory is still 188.7MB. Free memory was 152.9MB in the beginning and 126.2MB in the end (delta: 26.7MB). Peak memory consumption was 60.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 141.94ms. Allocated memory is still 188.7MB. Free memory was 126.2MB in the beginning and 121.1MB in the end (delta: 5.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 143.82ms. Allocated memory is still 188.7MB. Free memory was 121.1MB in the beginning and 114.8MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 1654.35ms. Allocated memory is still 188.7MB. Free memory was 114.8MB in the beginning and 114.7MB in the end (delta: 107.3kB). Peak memory consumption was 51.1MB. Max. memory is 16.1GB. * TraceAbstraction took 46071.45ms. Allocated memory was 188.7MB in the beginning and 880.8MB in the end (delta: 692.1MB). Free memory was 114.7MB in the beginning and 376.5MB in the end (delta: -261.8MB). Peak memory consumption was 513.2MB. Max. memory is 16.1GB. * Witness Printer took 241.49ms. Allocated memory is still 880.8MB. Free memory was 376.5MB in the beginning and 357.1MB in the end (delta: 19.4MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 4049]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 15 procedures, 165 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 45.9s, OverallIterations: 21, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.1s, AutomataDifference: 9.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 10.4s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3976 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3811 mSDsluCounter, 16227 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 12196 mSDsCounter, 1124 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5574 IncrementalHoareTripleChecker+Invalid, 6698 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1124 mSolverCounterUnsat, 4031 mSDtfsCounter, 5574 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1615 GetRequests, 1397 SyntacticMatches, 5 SemanticMatches, 213 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1175occurred in iteration=16, InterpolantAutomatonStates: 147, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.8s AutomataMinimizationTime, 21 MinimizatonAttempts, 1596 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 82 LocationsWithAnnotation, 2821 PreInvPairs, 2961 NumberOfFragments, 2188 HoareAnnotationTreeSize, 2821 FomulaSimplifications, 268149 FormulaSimplificationTreeSizeReduction, 5.3s HoareSimplificationTime, 82 FomulaSimplificationsInter, 33710 FormulaSimplificationTreeSizeReductionInter, 5.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.8s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 14.1s InterpolantComputationTime, 2951 NumberOfCodeBlocks, 2922 NumberOfCodeBlocksAsserted, 29 NumberOfCheckSat, 3004 ConstructedInterpolants, 0 QuantifiedInterpolants, 6227 SizeOfPredicates, 35 NumberOfNonLiveVariables, 11687 ConjunctsInSsa, 124 ConjunctsInUnsatCore, 30 InterpolantComputations, 20 PerfectInterpolantSequences, 938/1004 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 4055]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3782]: Loop Invariant Derived loop invariant: ((((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) || ((((ldv_coherent_state == 0 && ldv_urb_state == 0) && \result + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0)) || ((((((ldv_coherent_state == 0 && !(error == 0)) && 0 == res_kbtab_probe_3) && !(\result == 0)) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 4072]: Loop Invariant Derived loop invariant: (((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0 - InvariantResult [Line: 3512]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) || (((((ldv_coherent_state == 0 && kbtab == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && kbtab == 0) && error + 12 <= 0) - InvariantResult [Line: 3449]: Loop Invariant Derived loop invariant: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 3465]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4181]: Loop Invariant Derived loop invariant: ldv_urb_state == 0 - InvariantResult [Line: 4229]: Loop Invariant Derived loop invariant: ((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && \result == 0 - InvariantResult [Line: 3525]: Loop Invariant Derived loop invariant: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 4256]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3422]: Loop Invariant Derived loop invariant: ((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && \result == 0 - InvariantResult [Line: 3793]: Loop Invariant Derived loop invariant: ((((((((!(0 == arbitrary_memory) && !(error == 0)) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0) - InvariantResult [Line: 4097]: Loop Invariant Derived loop invariant: ((!(1 <= \old(ldv_coherent_state)) || !(\old(ldv_coherent_state) <= 1)) || \old(ldv_coherent_state) == ldv_coherent_state) || !(ldv_urb_state == 0) - InvariantResult [Line: 3442]: Loop Invariant Derived loop invariant: ((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0 - InvariantResult [Line: 3475]: Loop Invariant Derived loop invariant: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 3793]: Loop Invariant Derived loop invariant: ((((((((!(0 == arbitrary_memory) && arbitrary_memory == 0) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_coherent_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0) || ((((((((!(0 == arbitrary_memory) && !(error == 0)) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_coherent_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) - InvariantResult [Line: 4093]: Loop Invariant Derived loop invariant: ((!(1 <= \old(ldv_coherent_state)) || !(\old(ldv_coherent_state) <= 1)) || !(ldv_urb_state == 0)) || (ldv_coherent_state == 0 && (!(addr + addr <= 18446744073709551616 * ((addr + addr) / 18446744073709551616)) || (addr + addr) / 18446744073709551616 + 1 <= 0)) - InvariantResult [Line: 3875]: Loop Invariant Derived loop invariant: ((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_urb_state == 0) && \result == 0 - InvariantResult [Line: 3994]: Loop Invariant Derived loop invariant: ((((((((1 <= ldv_coherent_state && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && !(ldv_s_kbtab_driver_usb_driver == 1)) && \result == 0) || ((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && !(ldv_s_kbtab_driver_usb_driver == 1))) || (((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && \result == 0)) || (((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 4249]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3961]: Loop Invariant Derived loop invariant: ldv_urb_state == 0 - InvariantResult [Line: 3980]: Loop Invariant Derived loop invariant: ((((((((1 <= ldv_coherent_state && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && !(ldv_s_kbtab_driver_usb_driver == 1)) && \result == 0) || ((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && !(ldv_s_kbtab_driver_usb_driver == 1))) || (((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && \result == 0)) || (((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) - InvariantResult [Line: 4129]: Loop Invariant Derived loop invariant: ((((((!(0 == arbitrary_memory) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_coherent_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 4232]: Loop Invariant Derived loop invariant: ((((((ldv_coherent_state == 0 && 12 + res_kbtab_probe_3 <= 0) && ldv_urb_state == 0) && \result + 12 <= 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) || ((((((ldv_coherent_state == 0 && !(error == 0)) && !(\result == 0)) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && !(0 == res_kbtab_probe_3))) || (((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && \result == 0) - InvariantResult [Line: 4124]: Loop Invariant Derived loop invariant: (((((((((((!(0 == arbitrary_memory) && arbitrary_memory == 0) && 1 <= ldv_coherent_state) && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0) && ldv_coherent_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0) && 0 == \result) || ((((((((((!(0 == arbitrary_memory) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && \result == 0) && ldv_urb_state == 0) && ldv_coherent_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0) && 0 == \result)) || ((((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && !(\result == 0)) && error + 12 <= 0) - InvariantResult [Line: 4219]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state == 0 && !(error == 0)) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) || (((ldv_coherent_state == 0 && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) - InvariantResult [Line: 3968]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 4066]: Loop Invariant Derived loop invariant: (((((((ldv_coherent_state == 0 && arbitrary_memory == 0) && 0 == arbitrary_memory) && ldv_urb_state == 0) && \result == 0) && \result == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) || (((((((!(0 == arbitrary_memory) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && ldv_urb_state == 0) && ldv_coherent_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0) - InvariantResult [Line: 4150]: Loop Invariant Derived loop invariant: ((((!(\old(ldv_urb_state) <= 1) || (ldv_urb_state == 0 && (!(urb + urb <= (urb + urb) / 18446744073709551616 * 18446744073709551616) || (urb + urb) / 18446744073709551616 + 1 <= 0))) || !(1 <= \old(ldv_urb_state))) || !(1 <= ldv_coherent_state)) || !(0 == res_kbtab_probe_3)) || !(ldv_coherent_state <= 1) - InvariantResult [Line: 3793]: Loop Invariant Derived loop invariant: (((((ldv_coherent_state == 0 && !(error == 0)) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) || (((ldv_coherent_state == 0 && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0) && error + 12 <= 0) - InvariantResult [Line: 3394]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4246]: Loop Invariant Derived loop invariant: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 4154]: Loop Invariant Derived loop invariant: ((((!(\old(ldv_urb_state) <= 1) || ldv_urb_state == \old(ldv_urb_state)) || !(1 <= \old(ldv_urb_state))) || !(1 <= ldv_coherent_state)) || !(0 == res_kbtab_probe_3)) || !(ldv_coherent_state <= 1) - InvariantResult [Line: 4206]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4223]: Loop Invariant Derived loop invariant: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 3454]: Loop Invariant Derived loop invariant: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 4235]: Loop Invariant Derived loop invariant: (ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && ldv_urb_state == 0 - InvariantResult [Line: 3506]: Loop Invariant Derived loop invariant: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 3569]: Loop Invariant Derived loop invariant: ((((((((!(0 == arbitrary_memory) && 1 <= ldv_urb_state) && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && ldv_s_kbtab_driver_usb_driver == 0) && !(\result == 0)) && error + 12 <= 0 - InvariantResult [Line: 3979]: Loop Invariant Derived loop invariant: ldv_coherent_state == 0 && ldv_urb_state == 0 - InvariantResult [Line: 3911]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3997]: Loop Invariant Derived loop invariant: (((((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && !(ldv_s_kbtab_driver_usb_driver == 1)) || ((((ldv_coherent_state == 0 && 0 == res_kbtab_probe_3) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && ldv_urb_state == 0) && ldv_s_kbtab_driver_usb_driver == 0)) || (((((((1 <= ldv_urb_state && 1 <= ldv_coherent_state) && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && ldv_coherent_state <= 1) && ldv_urb_state <= 1) && \result == 0)) || (((((((1 <= ldv_coherent_state && 0 == res_kbtab_probe_3) && 1 <= ldv_s_kbtab_driver_usb_driver) && arbitrary_memory == 0) && !(ldv_s_kbtab_driver_usb_driver == tmp___8)) && ldv_coherent_state <= 1) && !(ldv_s_kbtab_driver_usb_driver == 1)) && \result == 0) RESULT: Ultimate proved your program to be correct! [2022-11-25 18:25:07,809 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_4fb0687a-8748-431a-8364-b535e6c0d9f1/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE