java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 04:20:18,419 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 04:20:18,422 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 04:20:18,435 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 04:20:18,435 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 04:20:18,436 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 04:20:18,438 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 04:20:18,440 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 04:20:18,442 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 04:20:18,443 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 04:20:18,444 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 04:20:18,445 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 04:20:18,445 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 04:20:18,447 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 04:20:18,448 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 04:20:18,449 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 04:20:18,450 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 04:20:18,451 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 04:20:18,453 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 04:20:18,455 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 04:20:18,457 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 04:20:18,458 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 04:20:18,459 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 04:20:18,460 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 04:20:18,466 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 04:20:18,467 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 04:20:18,467 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 04:20:18,468 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 04:20:18,468 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 04:20:18,469 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 04:20:18,469 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 04:20:18,470 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 04:20:18,471 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 04:20:18,471 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 04:20:18,472 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 04:20:18,473 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 04:20:18,473 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 04:20:18,473 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 04:20:18,474 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 04:20:18,475 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 04:20:18,475 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 04:20:18,476 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 04:20:18,491 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 04:20:18,492 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 04:20:18,493 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 04:20:18,493 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 04:20:18,494 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 04:20:18,494 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 04:20:18,494 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 04:20:18,494 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 04:20:18,494 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 04:20:18,495 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 04:20:18,495 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 04:20:18,495 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 04:20:18,495 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 04:20:18,495 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 04:20:18,496 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 04:20:18,496 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 04:20:18,496 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 04:20:18,496 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 04:20:18,497 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 04:20:18,497 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 04:20:18,497 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 04:20:18,497 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 04:20:18,497 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 04:20:18,498 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 04:20:18,498 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 04:20:18,498 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 04:20:18,498 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 04:20:18,498 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 04:20:18,499 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 04:20:18,530 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 04:20:18,542 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 04:20:18,549 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 04:20:18,550 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 04:20:18,551 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 04:20:18,552 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2019-10-02 04:20:18,622 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fffb779f/cfd5367f229e4b49a24350c1a4a5970e/FLAG971f0ed12 [2019-10-02 04:20:19,436 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 04:20:19,437 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-3.0/usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2019-10-02 04:20:19,474 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fffb779f/cfd5367f229e4b49a24350c1a4a5970e/FLAG971f0ed12 [2019-10-02 04:20:19,969 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3fffb779f/cfd5367f229e4b49a24350c1a4a5970e [2019-10-02 04:20:19,979 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 04:20:19,981 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 04:20:19,982 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 04:20:19,982 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 04:20:19,986 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 04:20:19,987 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 04:20:19" (1/1) ... [2019-10-02 04:20:19,991 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1770f31d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:20:19, skipping insertion in model container [2019-10-02 04:20:19,991 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 04:20:19" (1/1) ... [2019-10-02 04:20:19,998 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 04:20:20,089 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 04:20:21,360 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 04:20:21,451 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 04:20:21,760 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 04:20:21,862 INFO L192 MainTranslator]: Completed translation [2019-10-02 04:20:21,863 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:20:21 WrapperNode [2019-10-02 04:20:21,864 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 04:20:21,865 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 04:20:21,865 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 04:20:21,865 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 04:20:21,885 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:20:21" (1/1) ... [2019-10-02 04:20:21,886 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:20:21" (1/1) ... [2019-10-02 04:20:21,929 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:20:21" (1/1) ... [2019-10-02 04:20:21,929 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:20:21" (1/1) ... [2019-10-02 04:20:22,018 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:20:21" (1/1) ... [2019-10-02 04:20:22,045 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:20:21" (1/1) ... [2019-10-02 04:20:22,062 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:20:21" (1/1) ... [2019-10-02 04:20:22,081 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 04:20:22,082 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 04:20:22,082 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 04:20:22,082 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 04:20:22,084 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:20:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 04:20:22,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 04:20:22,182 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 04:20:22,182 INFO L138 BoogieDeclarations]: Found implementation of procedure __le16_to_cpup [2019-10-02 04:20:22,183 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2019-10-02 04:20:22,184 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2019-10-02 04:20:22,184 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2019-10-02 04:20:22,185 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2019-10-02 04:20:22,185 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2019-10-02 04:20:22,186 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_make_path [2019-10-02 04:20:22,186 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register [2019-10-02 04:20:22,187 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_int_urb [2019-10-02 04:20:22,187 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2019-10-02 04:20:22,188 INFO L138 BoogieDeclarations]: Found implementation of procedure input_allocate_device [2019-10-02 04:20:22,188 INFO L138 BoogieDeclarations]: Found implementation of procedure input_get_drvdata [2019-10-02 04:20:22,189 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_drvdata [2019-10-02 04:20:22,190 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_key [2019-10-02 04:20:22,192 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_abs [2019-10-02 04:20:22,193 INFO L138 BoogieDeclarations]: Found implementation of procedure input_sync [2019-10-02 04:20:22,193 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_to_input_id [2019-10-02 04:20:22,193 INFO L138 BoogieDeclarations]: Found implementation of procedure get_unaligned_le16 [2019-10-02 04:20:22,194 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_irq [2019-10-02 04:20:22,194 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_open [2019-10-02 04:20:22,194 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_close [2019-10-02 04:20:22,194 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_probe [2019-10-02 04:20:22,194 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_disconnect [2019-10-02 04:20:22,195 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_init [2019-10-02 04:20:22,195 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_exit [2019-10-02 04:20:22,195 INFO L138 BoogieDeclarations]: Found implementation of procedure init_module [2019-10-02 04:20:22,195 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup_module [2019-10-02 04:20:22,195 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 04:20:22,195 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2019-10-02 04:20:22,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2019-10-02 04:20:22,196 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2019-10-02 04:20:22,196 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2019-10-02 04:20:22,196 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2019-10-02 04:20:22,197 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2019-10-02 04:20:22,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-10-02 04:20:22,197 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2019-10-02 04:20:22,198 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2019-10-02 04:20:22,198 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2019-10-02 04:20:22,198 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event [2019-10-02 04:20:22,198 INFO L138 BoogieDeclarations]: Found implementation of procedure input_free_device [2019-10-02 04:20:22,198 INFO L138 BoogieDeclarations]: Found implementation of procedure input_register_device [2019-10-02 04:20:22,199 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2019-10-02 04:20:22,199 INFO L138 BoogieDeclarations]: Found implementation of procedure input_unregister_device [2019-10-02 04:20:22,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2019-10-02 04:20:22,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-10-02 04:20:22,199 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2019-10-02 04:20:22,200 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-10-02 04:20:22,200 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2019-10-02 04:20:22,200 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_deregister [2019-10-02 04:20:22,200 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2019-10-02 04:20:22,200 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register_driver [2019-10-02 04:20:22,201 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2019-10-02 04:20:22,201 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-10-02 04:20:22,201 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-10-02 04:20:22,201 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 04:20:22,202 INFO L130 BoogieDeclarations]: Found specification of procedure __le16_to_cpup [2019-10-02 04:20:22,202 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 04:20:22,203 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-10-02 04:20:22,203 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2019-10-02 04:20:22,203 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2019-10-02 04:20:22,203 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-10-02 04:20:22,203 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2019-10-02 04:20:22,204 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2019-10-02 04:20:22,204 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2019-10-02 04:20:22,205 INFO L130 BoogieDeclarations]: Found specification of procedure init_module [2019-10-02 04:20:22,205 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup_module [2019-10-02 04:20:22,205 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2019-10-02 04:20:22,206 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2019-10-02 04:20:22,206 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2019-10-02 04:20:22,206 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2019-10-02 04:20:22,206 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2019-10-02 04:20:22,207 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 04:20:22,208 INFO L130 BoogieDeclarations]: Found specification of procedure usb_make_path [2019-10-02 04:20:22,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 04:20:22,208 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register_driver [2019-10-02 04:20:22,209 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register [2019-10-02 04:20:22,209 INFO L130 BoogieDeclarations]: Found specification of procedure usb_deregister [2019-10-02 04:20:22,209 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_int_urb [2019-10-02 04:20:22,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 04:20:22,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 04:20:22,211 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2019-10-02 04:20:22,211 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2019-10-02 04:20:22,211 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2019-10-02 04:20:22,211 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2019-10-02 04:20:22,211 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2019-10-02 04:20:22,213 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2019-10-02 04:20:22,213 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2019-10-02 04:20:22,213 INFO L130 BoogieDeclarations]: Found specification of procedure input_allocate_device [2019-10-02 04:20:22,213 INFO L130 BoogieDeclarations]: Found specification of procedure input_free_device [2019-10-02 04:20:22,214 INFO L130 BoogieDeclarations]: Found specification of procedure input_get_drvdata [2019-10-02 04:20:22,215 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_drvdata [2019-10-02 04:20:22,215 INFO L130 BoogieDeclarations]: Found specification of procedure input_register_device [2019-10-02 04:20:22,215 INFO L130 BoogieDeclarations]: Found specification of procedure input_unregister_device [2019-10-02 04:20:22,215 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2019-10-02 04:20:22,215 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_key [2019-10-02 04:20:22,216 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_abs [2019-10-02 04:20:22,216 INFO L130 BoogieDeclarations]: Found specification of procedure input_sync [2019-10-02 04:20:22,216 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2019-10-02 04:20:22,216 INFO L130 BoogieDeclarations]: Found specification of procedure usb_to_input_id [2019-10-02 04:20:22,216 INFO L130 BoogieDeclarations]: Found specification of procedure get_unaligned_le16 [2019-10-02 04:20:22,217 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_irq [2019-10-02 04:20:22,217 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_open [2019-10-02 04:20:22,217 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_close [2019-10-02 04:20:22,217 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_probe [2019-10-02 04:20:22,218 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_disconnect [2019-10-02 04:20:22,218 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_init [2019-10-02 04:20:22,218 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_exit [2019-10-02 04:20:22,218 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-10-02 04:20:22,218 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2019-10-02 04:20:22,218 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-10-02 04:20:22,219 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 04:20:22,219 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 04:20:22,219 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2019-10-02 04:20:22,219 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2019-10-02 04:20:22,220 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2019-10-02 04:20:22,220 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-10-02 04:20:22,221 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-10-02 04:20:22,221 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-02 04:20:22,222 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 04:20:22,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 04:20:22,222 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 04:20:22,222 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 04:20:22,224 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-02 04:20:22,224 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 04:20:22,905 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 04:20:23,015 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-10-02 04:20:23,015 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-10-02 04:20:23,487 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-10-02 04:20:23,567 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-10-02 04:20:23,567 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-10-02 04:20:23,857 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2019-10-02 04:20:24,415 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 04:20:24,415 INFO L283 CfgBuilder]: Removed 7 assume(true) statements. [2019-10-02 04:20:24,417 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 04:20:24 BoogieIcfgContainer [2019-10-02 04:20:24,417 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 04:20:24,419 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 04:20:24,419 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 04:20:24,423 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 04:20:24,424 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 04:20:19" (1/3) ... [2019-10-02 04:20:24,425 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1954ef6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 04:20:24, skipping insertion in model container [2019-10-02 04:20:24,425 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 04:20:21" (2/3) ... [2019-10-02 04:20:24,426 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1954ef6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 04:20:24, skipping insertion in model container [2019-10-02 04:20:24,426 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 04:20:24" (3/3) ... [2019-10-02 04:20:24,428 INFO L109 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2019-10-02 04:20:24,441 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 04:20:24,457 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 04:20:24,479 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 04:20:24,530 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 04:20:24,531 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 04:20:24,532 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 04:20:24,532 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 04:20:24,532 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 04:20:24,533 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 04:20:24,533 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 04:20:24,533 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 04:20:24,533 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 04:20:24,577 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states. [2019-10-02 04:20:24,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-02 04:20:24,590 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:20:24,592 INFO L411 BasicCegarLoop]: 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] [2019-10-02 04:20:24,595 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:20:24,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:20:24,606 INFO L82 PathProgramCache]: Analyzing trace with hash -1845057656, now seen corresponding path program 1 times [2019-10-02 04:20:24,609 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:20:24,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:20:24,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:24,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:20:24,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:25,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:20:25,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 04:20:25,286 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:20:25,287 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 04:20:25,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 04:20:25,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 04:20:25,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 04:20:25,306 INFO L87 Difference]: Start difference. First operand 282 states. Second operand 3 states. [2019-10-02 04:20:25,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:20:25,535 INFO L93 Difference]: Finished difference Result 686 states and 853 transitions. [2019-10-02 04:20:25,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 04:20:25,540 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-10-02 04:20:25,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:20:25,592 INFO L225 Difference]: With dead ends: 686 [2019-10-02 04:20:25,593 INFO L226 Difference]: Without dead ends: 447 [2019-10-02 04:20:25,614 INFO L640 BasicCegarLoop]: 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 [2019-10-02 04:20:25,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-10-02 04:20:25,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 443. [2019-10-02 04:20:25,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-10-02 04:20:25,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 510 transitions. [2019-10-02 04:20:25,740 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 510 transitions. Word has length 31 [2019-10-02 04:20:25,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:20:25,741 INFO L475 AbstractCegarLoop]: Abstraction has 443 states and 510 transitions. [2019-10-02 04:20:25,741 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 04:20:25,741 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 510 transitions. [2019-10-02 04:20:25,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-02 04:20:25,743 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:20:25,743 INFO L411 BasicCegarLoop]: 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] [2019-10-02 04:20:25,743 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:20:25,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:20:25,744 INFO L82 PathProgramCache]: Analyzing trace with hash -1362410536, now seen corresponding path program 1 times [2019-10-02 04:20:25,744 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:20:25,745 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:20:25,753 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:25,753 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:20:25,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:25,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:20:26,022 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 04:20:26,022 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:20:26,023 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 04:20:26,025 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 04:20:26,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 04:20:26,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 04:20:26,027 INFO L87 Difference]: Start difference. First operand 443 states and 510 transitions. Second operand 3 states. [2019-10-02 04:20:26,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:20:26,133 INFO L93 Difference]: Finished difference Result 1272 states and 1483 transitions. [2019-10-02 04:20:26,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 04:20:26,135 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-02 04:20:26,135 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:20:26,143 INFO L225 Difference]: With dead ends: 1272 [2019-10-02 04:20:26,143 INFO L226 Difference]: Without dead ends: 846 [2019-10-02 04:20:26,146 INFO L640 BasicCegarLoop]: 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 [2019-10-02 04:20:26,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2019-10-02 04:20:26,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 839. [2019-10-02 04:20:26,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2019-10-02 04:20:26,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 971 transitions. [2019-10-02 04:20:26,265 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 971 transitions. Word has length 32 [2019-10-02 04:20:26,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:20:26,265 INFO L475 AbstractCegarLoop]: Abstraction has 839 states and 971 transitions. [2019-10-02 04:20:26,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 04:20:26,266 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 971 transitions. [2019-10-02 04:20:26,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-02 04:20:26,269 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:20:26,269 INFO L411 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 04:20:26,269 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:20:26,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:20:26,270 INFO L82 PathProgramCache]: Analyzing trace with hash 318886314, now seen corresponding path program 1 times [2019-10-02 04:20:26,270 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:20:26,270 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:20:26,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:26,277 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:20:26,277 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:26,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:20:26,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 04:20:26,438 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:20:26,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 04:20:26,440 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 04:20:26,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 04:20:26,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 04:20:26,441 INFO L87 Difference]: Start difference. First operand 839 states and 971 transitions. Second operand 6 states. [2019-10-02 04:20:26,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:20:26,539 INFO L93 Difference]: Finished difference Result 1656 states and 1919 transitions. [2019-10-02 04:20:26,541 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 04:20:26,542 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2019-10-02 04:20:26,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:20:26,552 INFO L225 Difference]: With dead ends: 1656 [2019-10-02 04:20:26,553 INFO L226 Difference]: Without dead ends: 839 [2019-10-02 04:20:26,556 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 04:20:26,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2019-10-02 04:20:26,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 839. [2019-10-02 04:20:26,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2019-10-02 04:20:26,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 970 transitions. [2019-10-02 04:20:26,610 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 970 transitions. Word has length 74 [2019-10-02 04:20:26,611 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:20:26,611 INFO L475 AbstractCegarLoop]: Abstraction has 839 states and 970 transitions. [2019-10-02 04:20:26,611 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 04:20:26,611 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 970 transitions. [2019-10-02 04:20:26,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-10-02 04:20:26,615 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:20:26,615 INFO L411 BasicCegarLoop]: 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 04:20:26,615 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:20:26,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:20:26,616 INFO L82 PathProgramCache]: Analyzing trace with hash 762786988, now seen corresponding path program 1 times [2019-10-02 04:20:26,616 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:20:26,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:20:26,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:26,622 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:20:26,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:26,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:20:26,735 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 04:20:26,736 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:20:26,736 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 04:20:26,737 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 04:20:26,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 04:20:26,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 04:20:26,738 INFO L87 Difference]: Start difference. First operand 839 states and 970 transitions. Second operand 3 states. [2019-10-02 04:20:26,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:20:26,832 INFO L93 Difference]: Finished difference Result 1687 states and 1972 transitions. [2019-10-02 04:20:26,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 04:20:26,833 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-10-02 04:20:26,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:20:26,843 INFO L225 Difference]: With dead ends: 1687 [2019-10-02 04:20:26,843 INFO L226 Difference]: Without dead ends: 874 [2019-10-02 04:20:26,847 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 04:20:26,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-10-02 04:20:26,894 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2019-10-02 04:20:26,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2019-10-02 04:20:26,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1016 transitions. [2019-10-02 04:20:26,901 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1016 transitions. Word has length 74 [2019-10-02 04:20:26,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:20:26,902 INFO L475 AbstractCegarLoop]: Abstraction has 874 states and 1016 transitions. [2019-10-02 04:20:26,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 04:20:26,903 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1016 transitions. [2019-10-02 04:20:26,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-02 04:20:26,919 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:20:26,920 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-10-02 04:20:26,921 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:20:26,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:20:26,921 INFO L82 PathProgramCache]: Analyzing trace with hash 1064835193, now seen corresponding path program 1 times [2019-10-02 04:20:26,921 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:20:26,921 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:20:26,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:26,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:20:26,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:27,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:20:27,176 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-02 04:20:27,177 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:20:27,177 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 04:20:27,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 04:20:27,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 04:20:27,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 04:20:27,180 INFO L87 Difference]: Start difference. First operand 874 states and 1016 transitions. Second operand 5 states. [2019-10-02 04:20:27,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:20:27,298 INFO L93 Difference]: Finished difference Result 1449 states and 1689 transitions. [2019-10-02 04:20:27,299 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 04:20:27,299 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2019-10-02 04:20:27,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:20:27,307 INFO L225 Difference]: With dead ends: 1449 [2019-10-02 04:20:27,308 INFO L226 Difference]: Without dead ends: 602 [2019-10-02 04:20:27,312 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 04:20:27,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-10-02 04:20:27,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2019-10-02 04:20:27,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-10-02 04:20:27,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 692 transitions. [2019-10-02 04:20:27,352 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 692 transitions. Word has length 129 [2019-10-02 04:20:27,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:20:27,356 INFO L475 AbstractCegarLoop]: Abstraction has 602 states and 692 transitions. [2019-10-02 04:20:27,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 04:20:27,357 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 692 transitions. [2019-10-02 04:20:27,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-10-02 04:20:27,359 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:20:27,360 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-10-02 04:20:27,360 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:20:27,360 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:20:27,361 INFO L82 PathProgramCache]: Analyzing trace with hash 1415635130, now seen corresponding path program 1 times [2019-10-02 04:20:27,361 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:20:27,361 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:20:27,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:27,369 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:20:27,369 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:27,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:20:27,693 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-02 04:20:27,694 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:20:27,694 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 04:20:27,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 04:20:27,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 04:20:27,695 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 04:20:27,696 INFO L87 Difference]: Start difference. First operand 602 states and 692 transitions. Second operand 6 states. [2019-10-02 04:20:29,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:20:29,940 INFO L93 Difference]: Finished difference Result 1093 states and 1279 transitions. [2019-10-02 04:20:29,945 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 04:20:29,946 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2019-10-02 04:20:29,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:20:29,955 INFO L225 Difference]: With dead ends: 1093 [2019-10-02 04:20:29,955 INFO L226 Difference]: Without dead ends: 1090 [2019-10-02 04:20:29,957 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-02 04:20:29,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2019-10-02 04:20:30,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1051. [2019-10-02 04:20:30,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1051 states. [2019-10-02 04:20:30,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1236 transitions. [2019-10-02 04:20:30,054 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1236 transitions. Word has length 129 [2019-10-02 04:20:30,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:20:30,055 INFO L475 AbstractCegarLoop]: Abstraction has 1051 states and 1236 transitions. [2019-10-02 04:20:30,055 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 04:20:30,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1236 transitions. [2019-10-02 04:20:30,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-10-02 04:20:30,059 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:20:30,059 INFO L411 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 04:20:30,060 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:20:30,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:20:30,060 INFO L82 PathProgramCache]: Analyzing trace with hash 1340956888, now seen corresponding path program 1 times [2019-10-02 04:20:30,060 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:20:30,061 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:20:30,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:30,070 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:20:30,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:30,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:20:30,470 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 04:20:30,471 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:20:30,471 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 04:20:30,471 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 04:20:30,472 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 04:20:30,472 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 04:20:30,473 INFO L87 Difference]: Start difference. First operand 1051 states and 1236 transitions. Second operand 5 states. [2019-10-02 04:20:30,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:20:30,561 INFO L93 Difference]: Finished difference Result 1939 states and 2291 transitions. [2019-10-02 04:20:30,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 04:20:30,566 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2019-10-02 04:20:30,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:20:30,578 INFO L225 Difference]: With dead ends: 1939 [2019-10-02 04:20:30,585 INFO L226 Difference]: Without dead ends: 1048 [2019-10-02 04:20:30,591 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 04:20:30,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2019-10-02 04:20:30,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 1048. [2019-10-02 04:20:30,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2019-10-02 04:20:30,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1227 transitions. [2019-10-02 04:20:30,672 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1227 transitions. Word has length 132 [2019-10-02 04:20:30,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:20:30,674 INFO L475 AbstractCegarLoop]: Abstraction has 1048 states and 1227 transitions. [2019-10-02 04:20:30,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 04:20:30,675 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1227 transitions. [2019-10-02 04:20:30,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-02 04:20:30,681 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:20:30,681 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-10-02 04:20:30,682 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:20:30,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:20:30,683 INFO L82 PathProgramCache]: Analyzing trace with hash -986593187, now seen corresponding path program 1 times [2019-10-02 04:20:30,683 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:20:30,685 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:20:30,691 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:30,692 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:20:30,692 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:30,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:20:30,929 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-02 04:20:30,930 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:20:30,930 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 04:20:30,931 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 04:20:30,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 04:20:30,931 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 04:20:30,932 INFO L87 Difference]: Start difference. First operand 1048 states and 1227 transitions. Second operand 6 states. [2019-10-02 04:20:31,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:20:31,099 INFO L93 Difference]: Finished difference Result 2091 states and 2469 transitions. [2019-10-02 04:20:31,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 04:20:31,100 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2019-10-02 04:20:31,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:20:31,107 INFO L225 Difference]: With dead ends: 2091 [2019-10-02 04:20:31,107 INFO L226 Difference]: Without dead ends: 1049 [2019-10-02 04:20:31,112 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 04:20:31,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2019-10-02 04:20:31,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 1014. [2019-10-02 04:20:31,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2019-10-02 04:20:31,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1206 transitions. [2019-10-02 04:20:31,175 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1206 transitions. Word has length 149 [2019-10-02 04:20:31,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:20:31,175 INFO L475 AbstractCegarLoop]: Abstraction has 1014 states and 1206 transitions. [2019-10-02 04:20:31,175 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 04:20:31,175 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1206 transitions. [2019-10-02 04:20:31,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-02 04:20:31,179 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:20:31,179 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-10-02 04:20:31,179 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:20:31,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:20:31,180 INFO L82 PathProgramCache]: Analyzing trace with hash -8974513, now seen corresponding path program 1 times [2019-10-02 04:20:31,180 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:20:31,180 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:20:31,186 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:31,186 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:20:31,187 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:31,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:20:31,381 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-02 04:20:31,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:20:31,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 04:20:31,383 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 04:20:31,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 04:20:31,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 04:20:31,383 INFO L87 Difference]: Start difference. First operand 1014 states and 1206 transitions. Second operand 3 states. [2019-10-02 04:20:31,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:20:31,438 INFO L93 Difference]: Finished difference Result 1886 states and 2260 transitions. [2019-10-02 04:20:31,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 04:20:31,438 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-10-02 04:20:31,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:20:31,445 INFO L225 Difference]: With dead ends: 1886 [2019-10-02 04:20:31,446 INFO L226 Difference]: Without dead ends: 952 [2019-10-02 04:20:31,450 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 04:20:31,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2019-10-02 04:20:31,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 952. [2019-10-02 04:20:31,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2019-10-02 04:20:31,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1111 transitions. [2019-10-02 04:20:31,511 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1111 transitions. Word has length 157 [2019-10-02 04:20:31,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:20:31,512 INFO L475 AbstractCegarLoop]: Abstraction has 952 states and 1111 transitions. [2019-10-02 04:20:31,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 04:20:31,512 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1111 transitions. [2019-10-02 04:20:31,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-02 04:20:31,515 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:20:31,515 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-10-02 04:20:31,516 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:20:31,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:20:31,516 INFO L82 PathProgramCache]: Analyzing trace with hash 474096884, now seen corresponding path program 1 times [2019-10-02 04:20:31,516 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:20:31,517 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:20:31,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:31,521 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:20:31,522 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:31,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:20:31,687 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-02 04:20:31,687 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:20:31,688 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 04:20:31,688 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 04:20:31,689 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 04:20:31,689 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 04:20:31,690 INFO L87 Difference]: Start difference. First operand 952 states and 1111 transitions. Second operand 5 states. [2019-10-02 04:20:31,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:20:31,764 INFO L93 Difference]: Finished difference Result 1010 states and 1174 transitions. [2019-10-02 04:20:31,765 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 04:20:31,765 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 159 [2019-10-02 04:20:31,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:20:31,773 INFO L225 Difference]: With dead ends: 1010 [2019-10-02 04:20:31,774 INFO L226 Difference]: Without dead ends: 960 [2019-10-02 04:20:31,775 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 04:20:31,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2019-10-02 04:20:31,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 960. [2019-10-02 04:20:31,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 960 states. [2019-10-02 04:20:31,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1116 transitions. [2019-10-02 04:20:31,845 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1116 transitions. Word has length 159 [2019-10-02 04:20:31,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:20:31,846 INFO L475 AbstractCegarLoop]: Abstraction has 960 states and 1116 transitions. [2019-10-02 04:20:31,846 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 04:20:31,846 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1116 transitions. [2019-10-02 04:20:31,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-10-02 04:20:31,850 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:20:31,851 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-10-02 04:20:31,851 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:20:31,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:20:31,852 INFO L82 PathProgramCache]: Analyzing trace with hash -782323349, now seen corresponding path program 1 times [2019-10-02 04:20:31,852 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:20:31,853 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:20:31,858 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:31,858 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:20:31,859 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:31,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:20:32,360 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-02 04:20:32,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:20:32,360 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 04:20:32,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 04:20:32,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 04:20:32,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 04:20:32,362 INFO L87 Difference]: Start difference. First operand 960 states and 1116 transitions. Second operand 8 states. [2019-10-02 04:20:34,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:20:34,508 INFO L93 Difference]: Finished difference Result 1909 states and 2322 transitions. [2019-10-02 04:20:34,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 04:20:34,509 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 160 [2019-10-02 04:20:34,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:20:34,525 INFO L225 Difference]: With dead ends: 1909 [2019-10-02 04:20:34,525 INFO L226 Difference]: Without dead ends: 1390 [2019-10-02 04:20:34,529 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-10-02 04:20:34,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2019-10-02 04:20:34,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1191. [2019-10-02 04:20:34,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1191 states. [2019-10-02 04:20:34,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1379 transitions. [2019-10-02 04:20:34,622 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 1379 transitions. Word has length 160 [2019-10-02 04:20:34,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:20:34,623 INFO L475 AbstractCegarLoop]: Abstraction has 1191 states and 1379 transitions. [2019-10-02 04:20:34,624 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 04:20:34,624 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 1379 transitions. [2019-10-02 04:20:34,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-02 04:20:34,627 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:20:34,627 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 04:20:34,628 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:20:34,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:20:34,628 INFO L82 PathProgramCache]: Analyzing trace with hash 1069171554, now seen corresponding path program 1 times [2019-10-02 04:20:34,628 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:20:34,628 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:20:34,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:34,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:20:34,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:34,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:20:34,890 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-02 04:20:34,891 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:20:34,891 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 04:20:34,891 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 04:20:34,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 04:20:34,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 04:20:34,892 INFO L87 Difference]: Start difference. First operand 1191 states and 1379 transitions. Second operand 5 states. [2019-10-02 04:20:34,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:20:34,953 INFO L93 Difference]: Finished difference Result 1818 states and 2103 transitions. [2019-10-02 04:20:34,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 04:20:34,954 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 187 [2019-10-02 04:20:34,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:20:34,961 INFO L225 Difference]: With dead ends: 1818 [2019-10-02 04:20:34,962 INFO L226 Difference]: Without dead ends: 681 [2019-10-02 04:20:34,966 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 04:20:34,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2019-10-02 04:20:35,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 681. [2019-10-02 04:20:35,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 681 states. [2019-10-02 04:20:35,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 776 transitions. [2019-10-02 04:20:35,010 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 776 transitions. Word has length 187 [2019-10-02 04:20:35,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:20:35,011 INFO L475 AbstractCegarLoop]: Abstraction has 681 states and 776 transitions. [2019-10-02 04:20:35,011 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 04:20:35,012 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 776 transitions. [2019-10-02 04:20:35,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-10-02 04:20:35,017 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:20:35,017 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 04:20:35,018 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:20:35,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:20:35,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1039861695, now seen corresponding path program 1 times [2019-10-02 04:20:35,019 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:20:35,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:20:35,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:35,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:20:35,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:35,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:20:35,405 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-02 04:20:35,406 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:20:35,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 04:20:35,407 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 04:20:35,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 04:20:35,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-02 04:20:35,408 INFO L87 Difference]: Start difference. First operand 681 states and 776 transitions. Second operand 6 states. [2019-10-02 04:20:36,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:20:36,848 INFO L93 Difference]: Finished difference Result 1094 states and 1257 transitions. [2019-10-02 04:20:36,849 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 04:20:36,850 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 187 [2019-10-02 04:20:36,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:20:36,857 INFO L225 Difference]: With dead ends: 1094 [2019-10-02 04:20:36,857 INFO L226 Difference]: Without dead ends: 1089 [2019-10-02 04:20:36,858 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2019-10-02 04:20:36,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2019-10-02 04:20:36,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1042. [2019-10-02 04:20:36,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1042 states. [2019-10-02 04:20:36,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1205 transitions. [2019-10-02 04:20:36,913 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1205 transitions. Word has length 187 [2019-10-02 04:20:36,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:20:36,914 INFO L475 AbstractCegarLoop]: Abstraction has 1042 states and 1205 transitions. [2019-10-02 04:20:36,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 04:20:36,914 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1205 transitions. [2019-10-02 04:20:36,916 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-10-02 04:20:36,916 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:20:36,917 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 04:20:36,917 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:20:36,917 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:20:36,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1634987359, now seen corresponding path program 1 times [2019-10-02 04:20:36,918 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:20:36,918 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:20:36,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:36,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:20:36,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:36,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:20:37,078 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-02 04:20:37,079 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:20:37,079 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 04:20:37,080 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 04:20:37,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 04:20:37,080 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 04:20:37,081 INFO L87 Difference]: Start difference. First operand 1042 states and 1205 transitions. Second operand 5 states. [2019-10-02 04:20:37,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:20:37,164 INFO L93 Difference]: Finished difference Result 1100 states and 1265 transitions. [2019-10-02 04:20:37,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 04:20:37,164 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 207 [2019-10-02 04:20:37,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:20:37,171 INFO L225 Difference]: With dead ends: 1100 [2019-10-02 04:20:37,171 INFO L226 Difference]: Without dead ends: 1077 [2019-10-02 04:20:37,172 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 04:20:37,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-10-02 04:20:37,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 1054. [2019-10-02 04:20:37,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2019-10-02 04:20:37,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1216 transitions. [2019-10-02 04:20:37,227 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1216 transitions. Word has length 207 [2019-10-02 04:20:37,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:20:37,228 INFO L475 AbstractCegarLoop]: Abstraction has 1054 states and 1216 transitions. [2019-10-02 04:20:37,228 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 04:20:37,228 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1216 transitions. [2019-10-02 04:20:37,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-10-02 04:20:37,231 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:20:37,231 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 04:20:37,231 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:20:37,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:20:37,232 INFO L82 PathProgramCache]: Analyzing trace with hash 750070294, now seen corresponding path program 1 times [2019-10-02 04:20:37,232 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:20:37,232 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:20:37,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:37,236 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:20:37,236 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:37,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:20:37,383 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-02 04:20:37,383 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 04:20:37,383 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 04:20:37,560 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:20:37,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:20:37,808 INFO L256 TraceCheckSpWp]: Trace formula consists of 1544 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 04:20:37,825 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 04:20:37,902 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-02 04:20:37,917 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 04:20:37,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2019-10-02 04:20:37,919 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 04:20:37,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 04:20:37,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 04:20:37,920 INFO L87 Difference]: Start difference. First operand 1054 states and 1216 transitions. Second operand 5 states. [2019-10-02 04:20:38,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:20:38,007 INFO L93 Difference]: Finished difference Result 1824 states and 2105 transitions. [2019-10-02 04:20:38,008 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 04:20:38,008 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 211 [2019-10-02 04:20:38,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:20:38,014 INFO L225 Difference]: With dead ends: 1824 [2019-10-02 04:20:38,014 INFO L226 Difference]: Without dead ends: 867 [2019-10-02 04:20:38,018 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 214 GetRequests, 211 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-02 04:20:38,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 867 states. [2019-10-02 04:20:38,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 867 to 857. [2019-10-02 04:20:38,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 857 states. [2019-10-02 04:20:38,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 857 states to 857 states and 970 transitions. [2019-10-02 04:20:38,074 INFO L78 Accepts]: Start accepts. Automaton has 857 states and 970 transitions. Word has length 211 [2019-10-02 04:20:38,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:20:38,075 INFO L475 AbstractCegarLoop]: Abstraction has 857 states and 970 transitions. [2019-10-02 04:20:38,075 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 04:20:38,075 INFO L276 IsEmpty]: Start isEmpty. Operand 857 states and 970 transitions. [2019-10-02 04:20:38,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-10-02 04:20:38,078 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:20:38,078 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 04:20:38,079 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:20:38,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:20:38,079 INFO L82 PathProgramCache]: Analyzing trace with hash 295396920, now seen corresponding path program 1 times [2019-10-02 04:20:38,080 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:20:38,080 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:20:38,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:38,085 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:20:38,085 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:38,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:20:38,271 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-02 04:20:38,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:20:38,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 04:20:38,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 04:20:38,275 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 04:20:38,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 04:20:38,276 INFO L87 Difference]: Start difference. First operand 857 states and 970 transitions. Second operand 3 states. [2019-10-02 04:20:38,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:20:38,310 INFO L93 Difference]: Finished difference Result 1127 states and 1276 transitions. [2019-10-02 04:20:38,310 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 04:20:38,310 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 226 [2019-10-02 04:20:38,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:20:38,315 INFO L225 Difference]: With dead ends: 1127 [2019-10-02 04:20:38,315 INFO L226 Difference]: Without dead ends: 546 [2019-10-02 04:20:38,317 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 04:20:38,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 546 states. [2019-10-02 04:20:38,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 546 to 546. [2019-10-02 04:20:38,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 546 states. [2019-10-02 04:20:38,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 546 states to 546 states and 605 transitions. [2019-10-02 04:20:38,350 INFO L78 Accepts]: Start accepts. Automaton has 546 states and 605 transitions. Word has length 226 [2019-10-02 04:20:38,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:20:38,351 INFO L475 AbstractCegarLoop]: Abstraction has 546 states and 605 transitions. [2019-10-02 04:20:38,351 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 04:20:38,351 INFO L276 IsEmpty]: Start isEmpty. Operand 546 states and 605 transitions. [2019-10-02 04:20:38,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-10-02 04:20:38,355 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:20:38,355 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 04:20:38,355 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:20:38,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:20:38,356 INFO L82 PathProgramCache]: Analyzing trace with hash 1147926355, now seen corresponding path program 1 times [2019-10-02 04:20:38,356 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:20:38,356 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:20:38,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:38,361 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:20:38,361 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:38,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:20:39,242 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-10-02 04:20:39,242 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:20:39,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 04:20:39,243 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 04:20:39,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 04:20:39,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-02 04:20:39,244 INFO L87 Difference]: Start difference. First operand 546 states and 605 transitions. Second operand 8 states. [2019-10-02 04:20:40,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:20:40,596 INFO L93 Difference]: Finished difference Result 599 states and 675 transitions. [2019-10-02 04:20:40,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 04:20:40,597 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 228 [2019-10-02 04:20:40,598 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:20:40,601 INFO L225 Difference]: With dead ends: 599 [2019-10-02 04:20:40,601 INFO L226 Difference]: Without dead ends: 576 [2019-10-02 04:20:40,602 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=106, Unknown=0, NotChecked=0, Total=156 [2019-10-02 04:20:40,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-10-02 04:20:40,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 527. [2019-10-02 04:20:40,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 527 states. [2019-10-02 04:20:40,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 584 transitions. [2019-10-02 04:20:40,630 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 584 transitions. Word has length 228 [2019-10-02 04:20:40,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:20:40,631 INFO L475 AbstractCegarLoop]: Abstraction has 527 states and 584 transitions. [2019-10-02 04:20:40,631 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 04:20:40,631 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 584 transitions. [2019-10-02 04:20:40,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 265 [2019-10-02 04:20:40,635 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:20:40,635 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 04:20:40,636 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:20:40,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:20:40,636 INFO L82 PathProgramCache]: Analyzing trace with hash -95746008, now seen corresponding path program 1 times [2019-10-02 04:20:40,636 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:20:40,636 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:20:40,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:40,641 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:20:40,641 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:40,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:20:40,836 INFO L134 CoverageAnalysis]: Checked inductivity of 71 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2019-10-02 04:20:40,836 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 04:20:40,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 04:20:40,837 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 04:20:40,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 04:20:40,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 04:20:40,838 INFO L87 Difference]: Start difference. First operand 527 states and 584 transitions. Second operand 6 states. [2019-10-02 04:20:40,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:20:40,937 INFO L93 Difference]: Finished difference Result 792 states and 881 transitions. [2019-10-02 04:20:40,938 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 04:20:40,938 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 264 [2019-10-02 04:20:40,939 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:20:40,942 INFO L225 Difference]: With dead ends: 792 [2019-10-02 04:20:40,942 INFO L226 Difference]: Without dead ends: 483 [2019-10-02 04:20:40,944 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-10-02 04:20:40,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 483 states. [2019-10-02 04:20:40,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 483 to 455. [2019-10-02 04:20:40,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 455 states. [2019-10-02 04:20:40,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 455 states to 455 states and 500 transitions. [2019-10-02 04:20:40,971 INFO L78 Accepts]: Start accepts. Automaton has 455 states and 500 transitions. Word has length 264 [2019-10-02 04:20:40,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:20:40,971 INFO L475 AbstractCegarLoop]: Abstraction has 455 states and 500 transitions. [2019-10-02 04:20:40,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 04:20:40,972 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 500 transitions. [2019-10-02 04:20:40,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-10-02 04:20:40,977 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:20:40,977 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 04:20:40,978 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:20:40,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:20:40,978 INFO L82 PathProgramCache]: Analyzing trace with hash -546720643, now seen corresponding path program 1 times [2019-10-02 04:20:40,978 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:20:40,978 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:20:40,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:40,983 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:20:40,983 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:41,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:20:41,424 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-02 04:20:41,424 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 04:20:41,425 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 04:20:41,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:20:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:20:41,842 INFO L256 TraceCheckSpWp]: Trace formula consists of 1790 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 04:20:41,854 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 04:20:42,198 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [MP z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (3)] Exception during sending of exit command (exit): Stream closed [2019-10-02 04:20:42,208 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 04:20:42,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2019-10-02 04:20:42,212 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 04:20:42,213 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 04:20:42,213 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-10-02 04:20:42,214 INFO L87 Difference]: Start difference. First operand 455 states and 500 transitions. Second operand 15 states. [2019-10-02 04:20:43,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:20:43,645 INFO L93 Difference]: Finished difference Result 468 states and 514 transitions. [2019-10-02 04:20:43,645 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 04:20:43,646 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 277 [2019-10-02 04:20:43,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:20:43,651 INFO L225 Difference]: With dead ends: 468 [2019-10-02 04:20:43,652 INFO L226 Difference]: Without dead ends: 464 [2019-10-02 04:20:43,653 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 277 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2019-10-02 04:20:43,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 464 states. [2019-10-02 04:20:43,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 464 to 456. [2019-10-02 04:20:43,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 456 states. [2019-10-02 04:20:43,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 456 states to 456 states and 498 transitions. [2019-10-02 04:20:43,686 INFO L78 Accepts]: Start accepts. Automaton has 456 states and 498 transitions. Word has length 277 [2019-10-02 04:20:43,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:20:43,687 INFO L475 AbstractCegarLoop]: Abstraction has 456 states and 498 transitions. [2019-10-02 04:20:43,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 04:20:43,687 INFO L276 IsEmpty]: Start isEmpty. Operand 456 states and 498 transitions. [2019-10-02 04:20:43,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-10-02 04:20:43,691 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 04:20:43,692 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 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, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 04:20:43,692 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 04:20:43,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 04:20:43,693 INFO L82 PathProgramCache]: Analyzing trace with hash 231331203, now seen corresponding path program 1 times [2019-10-02 04:20:43,693 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 04:20:43,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 04:20:43,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:43,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:20:43,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 04:20:43,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:20:44,198 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-10-02 04:20:44,198 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 04:20:44,199 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 04:20:44,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 04:20:44,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 04:20:44,578 INFO L256 TraceCheckSpWp]: Trace formula consists of 1792 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-02 04:20:44,591 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 04:20:44,814 INFO L134 CoverageAnalysis]: Checked inductivity of 83 backedges. 6 proven. 5 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-02 04:20:44,832 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-10-02 04:20:44,833 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10] total 15 [2019-10-02 04:20:44,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-10-02 04:20:44,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-10-02 04:20:44,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=161, Unknown=0, NotChecked=0, Total=210 [2019-10-02 04:20:44,835 INFO L87 Difference]: Start difference. First operand 456 states and 498 transitions. Second operand 15 states. [2019-10-02 04:20:46,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 04:20:46,558 INFO L93 Difference]: Finished difference Result 468 states and 511 transitions. [2019-10-02 04:20:46,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 04:20:46,559 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 278 [2019-10-02 04:20:46,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 04:20:46,560 INFO L225 Difference]: With dead ends: 468 [2019-10-02 04:20:46,560 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 04:20:46,563 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 298 GetRequests, 278 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=103, Invalid=277, Unknown=0, NotChecked=0, Total=380 [2019-10-02 04:20:46,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 04:20:46,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 04:20:46,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 04:20:46,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 04:20:46,564 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 278 [2019-10-02 04:20:46,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 04:20:46,564 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 04:20:46,564 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-10-02 04:20:46,565 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 04:20:46,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 04:20:46,570 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-02 04:20:49,080 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 33 [2019-10-02 04:20:50,335 INFO L446 ceAbstractionStarter]: At program point kbtab_initENTRY(lines 3897 3913) the Hoare annotation is: true [2019-10-02 04:20:50,335 INFO L443 ceAbstractionStarter]: For program point L3903(lines 3903 3906) no Hoare annotation was computed. [2019-10-02 04:20:50,335 INFO L443 ceAbstractionStarter]: For program point L3901-1(line 3901) no Hoare annotation was computed. [2019-10-02 04:20:50,335 INFO L446 ceAbstractionStarter]: At program point L3901(line 3901) the Hoare annotation is: true [2019-10-02 04:20:50,335 INFO L443 ceAbstractionStarter]: For program point kbtab_initFINAL(lines 3897 3913) no Hoare annotation was computed. [2019-10-02 04:20:50,335 INFO L446 ceAbstractionStarter]: At program point L3910(lines 3899 3912) the Hoare annotation is: true [2019-10-02 04:20:50,336 INFO L443 ceAbstractionStarter]: For program point kbtab_initEXIT(lines 3897 3913) no Hoare annotation was computed. [2019-10-02 04:20:50,336 INFO L443 ceAbstractionStarter]: For program point L4193-1(line 4193) no Hoare annotation was computed. [2019-10-02 04:20:50,336 INFO L446 ceAbstractionStarter]: At program point L4193(line 4193) the Hoare annotation is: true [2019-10-02 04:20:50,336 INFO L443 ceAbstractionStarter]: For program point dev_get_drvdataFINAL(lines 4192 4194) no Hoare annotation was computed. [2019-10-02 04:20:50,336 INFO L446 ceAbstractionStarter]: At program point dev_get_drvdataENTRY(lines 4192 4194) the Hoare annotation is: true [2019-10-02 04:20:50,336 INFO L443 ceAbstractionStarter]: For program point dev_get_drvdataEXIT(lines 4192 4194) no Hoare annotation was computed. [2019-10-02 04:20:50,336 INFO L439 ceAbstractionStarter]: At program point L3872(line 3872) the Hoare annotation is: (or (not (<= |old(~ldv_coherent_state~0)| 1)) (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|)) (not (<= |old(~ldv_urb_state~0)| 1)) (not (<= 1 |old(~ldv_coherent_state~0)|)) (not (= ~res_kbtab_probe_3~0 0)) (not (<= 1 |old(~ldv_urb_state~0)|))) [2019-10-02 04:20:50,336 INFO L443 ceAbstractionStarter]: For program point L3873-1(line 3873) no Hoare annotation was computed. [2019-10-02 04:20:50,337 INFO L439 ceAbstractionStarter]: At program point L3873(line 3873) the Hoare annotation is: (or (not (<= |old(~ldv_coherent_state~0)| 1)) (not (<= |old(~ldv_urb_state~0)| 1)) (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) (not (<= 1 |old(~ldv_coherent_state~0)|)) (not (= ~res_kbtab_probe_3~0 0)) (not (<= 1 |old(~ldv_urb_state~0)|))) [2019-10-02 04:20:50,337 INFO L439 ceAbstractionStarter]: At program point L3870(line 3870) the Hoare annotation is: (or (not (<= |old(~ldv_coherent_state~0)| 1)) (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|)) (not (<= |old(~ldv_urb_state~0)| 1)) (not (<= 1 |old(~ldv_coherent_state~0)|)) (not (= ~res_kbtab_probe_3~0 0)) (not (<= 1 |old(~ldv_urb_state~0)|))) [2019-10-02 04:20:50,337 INFO L443 ceAbstractionStarter]: For program point L3871-1(line 3871) no Hoare annotation was computed. [2019-10-02 04:20:50,337 INFO L439 ceAbstractionStarter]: At program point L3871(line 3871) the Hoare annotation is: (or (not (<= |old(~ldv_coherent_state~0)| 1)) (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|)) (not (<= |old(~ldv_urb_state~0)| 1)) (not (<= 1 |old(~ldv_coherent_state~0)|)) (not (= ~res_kbtab_probe_3~0 0)) (not (<= 1 |old(~ldv_urb_state~0)|))) [2019-10-02 04:20:50,337 INFO L443 ceAbstractionStarter]: For program point L3872-1(line 3872) no Hoare annotation was computed. [2019-10-02 04:20:50,337 INFO L439 ceAbstractionStarter]: At program point L3868(line 3868) the Hoare annotation is: (or (not (<= |old(~ldv_coherent_state~0)| 1)) (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|)) (not (<= |old(~ldv_urb_state~0)| 1)) (not (<= 1 |old(~ldv_coherent_state~0)|)) (not (= ~res_kbtab_probe_3~0 0)) (not (<= 1 |old(~ldv_urb_state~0)|))) [2019-10-02 04:20:50,338 INFO L443 ceAbstractionStarter]: For program point L3870-1(line 3870) no Hoare annotation was computed. [2019-10-02 04:20:50,338 INFO L443 ceAbstractionStarter]: For program point L3868-1(line 3868) no Hoare annotation was computed. [2019-10-02 04:20:50,338 INFO L439 ceAbstractionStarter]: At program point kbtab_disconnectENTRY(lines 3863 3878) the Hoare annotation is: (or (not (<= |old(~ldv_coherent_state~0)| 1)) (and (<= ~ldv_coherent_state~0 1) (<= 1 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|)) (not (<= |old(~ldv_urb_state~0)| 1)) (not (<= 1 |old(~ldv_coherent_state~0)|)) (not (= ~res_kbtab_probe_3~0 0)) (not (<= 1 |old(~ldv_urb_state~0)|))) [2019-10-02 04:20:50,338 INFO L443 ceAbstractionStarter]: For program point kbtab_disconnectEXIT(lines 3863 3878) no Hoare annotation was computed. [2019-10-02 04:20:50,338 INFO L443 ceAbstractionStarter]: For program point kbtab_disconnectFINAL(lines 3863 3878) no Hoare annotation was computed. [2019-10-02 04:20:50,338 INFO L439 ceAbstractionStarter]: At program point L3874(line 3874) the Hoare annotation is: (or (not (<= |old(~ldv_coherent_state~0)| 1)) (not (<= |old(~ldv_urb_state~0)| 1)) (not (<= 1 |old(~ldv_coherent_state~0)|)) (not (= ~res_kbtab_probe_3~0 0)) (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) (not (<= 1 |old(~ldv_urb_state~0)|))) [2019-10-02 04:20:50,338 INFO L443 ceAbstractionStarter]: For program point L4189-1(line 4189) no Hoare annotation was computed. [2019-10-02 04:20:50,338 INFO L446 ceAbstractionStarter]: At program point L4189(line 4189) the Hoare annotation is: true [2019-10-02 04:20:50,338 INFO L446 ceAbstractionStarter]: At program point __kmallocENTRY(lines 4188 4190) the Hoare annotation is: true [2019-10-02 04:20:50,338 INFO L443 ceAbstractionStarter]: For program point __kmallocFINAL(lines 4188 4190) no Hoare annotation was computed. [2019-10-02 04:20:50,339 INFO L443 ceAbstractionStarter]: For program point __kmallocEXIT(lines 4188 4190) no Hoare annotation was computed. [2019-10-02 04:20:50,339 INFO L443 ceAbstractionStarter]: For program point L3962(lines 3962 3965) no Hoare annotation was computed. [2019-10-02 04:20:50,339 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 3949 4033) no Hoare annotation was computed. [2019-10-02 04:20:50,339 INFO L439 ceAbstractionStarter]: At program point L4020(lines 3967 4021) the Hoare annotation is: (or (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) (not (= |old(~res_kbtab_probe_3~0)| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2019-10-02 04:20:50,339 INFO L439 ceAbstractionStarter]: At program point L4016(lines 3968 4019) the Hoare annotation is: (let ((.cse0 (= 0 ~res_kbtab_probe_3~0))) (or (not (= |old(~res_kbtab_probe_3~0)| 0)) (and (= 0 ~ldv_coherent_state~0) (and (<= ~ldv_urb_state~0 0) (< 0 (+ ~ldv_urb_state~0 1))) .cse0 (= main_~ldv_s_kbtab_driver_usb_driver~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (and (<= 1 ~ldv_coherent_state~0) (<= 1 main_~ldv_s_kbtab_driver_usb_driver~0) .cse0 (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= 0 |old(~ldv_coherent_state~0)|)))) [2019-10-02 04:20:50,339 INFO L439 ceAbstractionStarter]: At program point L3983(lines 3982 4018) the Hoare annotation is: (let ((.cse0 (= 0 ~res_kbtab_probe_3~0))) (or (not (= |old(~res_kbtab_probe_3~0)| 0)) (and (= 0 ~ldv_coherent_state~0) (and (<= ~ldv_urb_state~0 0) (< 0 (+ ~ldv_urb_state~0 1))) .cse0 (= main_~ldv_s_kbtab_driver_usb_driver~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (and (<= 1 ~ldv_coherent_state~0) (<= 1 main_~ldv_s_kbtab_driver_usb_driver~0) .cse0 (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= 0 |old(~ldv_coherent_state~0)|)))) [2019-10-02 04:20:50,339 INFO L443 ceAbstractionStarter]: For program point L3975-1(lines 3973 3978) no Hoare annotation was computed. [2019-10-02 04:20:50,339 INFO L443 ceAbstractionStarter]: For program point L3975(lines 3975 3978) no Hoare annotation was computed. [2019-10-02 04:20:50,339 INFO L443 ceAbstractionStarter]: For program point L4029(line 4029) no Hoare annotation was computed. [2019-10-02 04:20:50,339 INFO L439 ceAbstractionStarter]: At program point L4025(lines 3956 4032) the Hoare annotation is: (or (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0)) (not (= |old(~res_kbtab_probe_3~0)| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2019-10-02 04:20:50,340 INFO L439 ceAbstractionStarter]: At program point L3959-1(line 3959) the Hoare annotation is: (or (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|) (= 0 ~res_kbtab_probe_3~0)) (not (= |old(~res_kbtab_probe_3~0)| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2019-10-02 04:20:50,340 INFO L439 ceAbstractionStarter]: At program point L3959(line 3959) the Hoare annotation is: (or (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|) (= 0 ~res_kbtab_probe_3~0)) (not (= |old(~res_kbtab_probe_3~0)| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2019-10-02 04:20:50,340 INFO L443 ceAbstractionStarter]: For program point L3960(line 3960) no Hoare annotation was computed. [2019-10-02 04:20:50,340 INFO L443 ceAbstractionStarter]: For program point L3993-1(line 3993) no Hoare annotation was computed. [2019-10-02 04:20:50,340 INFO L439 ceAbstractionStarter]: At program point L3993(line 3993) the Hoare annotation is: (or (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|) (= 0 ~res_kbtab_probe_3~0) (= main_~ldv_s_kbtab_driver_usb_driver~0 0)) (not (= |old(~res_kbtab_probe_3~0)| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2019-10-02 04:20:50,340 INFO L443 ceAbstractionStarter]: For program point L3985(lines 3985 4018) no Hoare annotation was computed. [2019-10-02 04:20:50,340 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 3949 4033) no Hoare annotation was computed. [2019-10-02 04:20:50,341 INFO L443 ceAbstractionStarter]: For program point L3973(lines 3973 3978) no Hoare annotation was computed. [2019-10-02 04:20:50,341 INFO L443 ceAbstractionStarter]: For program point L3969(line 3969) no Hoare annotation was computed. [2019-10-02 04:20:50,341 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 3949 4033) the Hoare annotation is: (or (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|) (= 0 ~res_kbtab_probe_3~0)) (not (= |old(~res_kbtab_probe_3~0)| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2019-10-02 04:20:50,341 INFO L439 ceAbstractionStarter]: At program point L3994(line 3994) the Hoare annotation is: (let ((.cse0 (= 0 ~res_kbtab_probe_3~0)) (.cse1 (= main_~ldv_s_kbtab_driver_usb_driver~0 0))) (or (and (not .cse0) (= 0 ~ldv_coherent_state~0) (and (<= ~ldv_urb_state~0 0) (< 0 (+ ~ldv_urb_state~0 1))) .cse1) (and (<= 1 ~ldv_coherent_state~0) .cse0 .cse1 (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= |old(~res_kbtab_probe_3~0)| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|)))) [2019-10-02 04:20:50,341 INFO L443 ceAbstractionStarter]: For program point L3994-1(lines 3991 4001) no Hoare annotation was computed. [2019-10-02 04:20:50,341 INFO L439 ceAbstractionStarter]: At program point L3986(lines 3985 4018) the Hoare annotation is: (let ((.cse0 (= 0 ~res_kbtab_probe_3~0))) (or (not (= |old(~res_kbtab_probe_3~0)| 0)) (and (= 0 ~ldv_coherent_state~0) (and (<= ~ldv_urb_state~0 0) (< 0 (+ ~ldv_urb_state~0 1))) .cse0 (= main_~ldv_s_kbtab_driver_usb_driver~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (and (<= 1 ~ldv_coherent_state~0) (<= 1 main_~ldv_s_kbtab_driver_usb_driver~0) .cse0 (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= 0 |old(~ldv_coherent_state~0)|)))) [2019-10-02 04:20:50,341 INFO L443 ceAbstractionStarter]: For program point L3982(lines 3982 4018) no Hoare annotation was computed. [2019-10-02 04:20:50,341 INFO L443 ceAbstractionStarter]: For program point L4007-1(line 4007) no Hoare annotation was computed. [2019-10-02 04:20:50,341 INFO L439 ceAbstractionStarter]: At program point L4007(line 4007) the Hoare annotation is: (or (not (= |old(~res_kbtab_probe_3~0)| 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (and (<= 1 ~ldv_coherent_state~0) (<= 1 main_~ldv_s_kbtab_driver_usb_driver~0) (= 0 ~res_kbtab_probe_3~0) (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= 0 |old(~ldv_coherent_state~0)|))) [2019-10-02 04:20:50,342 INFO L443 ceAbstractionStarter]: For program point usb_get_intfdataEXIT(lines 3410 3418) no Hoare annotation was computed. [2019-10-02 04:20:50,342 INFO L446 ceAbstractionStarter]: At program point usb_get_intfdataENTRY(lines 3410 3418) the Hoare annotation is: true [2019-10-02 04:20:50,342 INFO L443 ceAbstractionStarter]: For program point usb_get_intfdataFINAL(lines 3410 3418) no Hoare annotation was computed. [2019-10-02 04:20:50,342 INFO L446 ceAbstractionStarter]: At program point L3414(line 3414) the Hoare annotation is: true [2019-10-02 04:20:50,342 INFO L443 ceAbstractionStarter]: For program point L3414-1(line 3414) no Hoare annotation was computed. [2019-10-02 04:20:50,342 INFO L443 ceAbstractionStarter]: For program point usb_submit_urbFINAL(lines 4244 4246) no Hoare annotation was computed. [2019-10-02 04:20:50,342 INFO L443 ceAbstractionStarter]: For program point usb_submit_urbEXIT(lines 4244 4246) no Hoare annotation was computed. [2019-10-02 04:20:50,342 INFO L443 ceAbstractionStarter]: For program point usb_submit_urbENTRY(lines 4244 4246) no Hoare annotation was computed. [2019-10-02 04:20:50,342 INFO L443 ceAbstractionStarter]: For program point input_eventEXIT(lines 4199 4201) no Hoare annotation was computed. [2019-10-02 04:20:50,342 INFO L443 ceAbstractionStarter]: For program point input_eventFINAL(lines 4199 4201) no Hoare annotation was computed. [2019-10-02 04:20:50,342 INFO L443 ceAbstractionStarter]: For program point input_eventENTRY(lines 4199 4201) no Hoare annotation was computed. [2019-10-02 04:20:50,343 INFO L443 ceAbstractionStarter]: For program point input_set_abs_paramsEXIT(lines 4209 4211) no Hoare annotation was computed. [2019-10-02 04:20:50,343 INFO L446 ceAbstractionStarter]: At program point input_set_abs_paramsENTRY(lines 4209 4211) the Hoare annotation is: true [2019-10-02 04:20:50,343 INFO L443 ceAbstractionStarter]: For program point input_set_abs_paramsFINAL(lines 4209 4211) no Hoare annotation was computed. [2019-10-02 04:20:50,343 INFO L446 ceAbstractionStarter]: At program point input_free_deviceENTRY(lines 4202 4204) the Hoare annotation is: true [2019-10-02 04:20:50,343 INFO L443 ceAbstractionStarter]: For program point input_free_deviceEXIT(lines 4202 4204) no Hoare annotation was computed. [2019-10-02 04:20:50,343 INFO L443 ceAbstractionStarter]: For program point input_free_deviceFINAL(lines 4202 4204) no Hoare annotation was computed. [2019-10-02 04:20:50,343 INFO L443 ceAbstractionStarter]: For program point kbtab_exitFINAL(lines 3916 3924) no Hoare annotation was computed. [2019-10-02 04:20:50,343 INFO L446 ceAbstractionStarter]: At program point kbtab_exitENTRY(lines 3916 3924) the Hoare annotation is: true [2019-10-02 04:20:50,344 INFO L443 ceAbstractionStarter]: For program point kbtab_exitEXIT(lines 3916 3924) no Hoare annotation was computed. [2019-10-02 04:20:50,344 INFO L443 ceAbstractionStarter]: For program point L4094(lines 4094 4099) no Hoare annotation was computed. [2019-10-02 04:20:50,344 INFO L443 ceAbstractionStarter]: For program point L4086(lines 4085 4104) no Hoare annotation was computed. [2019-10-02 04:20:50,344 INFO L439 ceAbstractionStarter]: At program point usb_free_coherentENTRY(lines 4081 4110) the Hoare annotation is: (let ((.cse0 (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0)) (.cse1 (not (<= 1 |old(~ldv_coherent_state~0)|)))) (and (or .cse0 .cse1 (not (= 0 ~ldv_urb_state~0))) (or .cse0 .cse1 (not (= ~res_kbtab_probe_3~0 0))))) [2019-10-02 04:20:50,344 INFO L439 ceAbstractionStarter]: At program point L4105(lines 4081 4110) the Hoare annotation is: (let ((.cse0 (not (<= 1 |old(~ldv_coherent_state~0)|))) (.cse1 (let ((.cse4 (+ ~ldv_coherent_state~0 1))) (and (let ((.cse3 (+ usb_free_coherent_~addr.base usb_free_coherent_~addr.offset))) (let ((.cse2 (div .cse3 4294967296))) (or (< (* 4294967296 .cse2) .cse3) (<= (+ .cse2 1) 0)))) (or (<= .cse4 |old(~ldv_coherent_state~0)|) (<= ~ldv_coherent_state~0 0)) (or (< 0 .cse4) (<= |old(~ldv_coherent_state~0)| .cse4)))))) (and (or .cse0 (not (= 0 ~ldv_urb_state~0)) .cse1) (or .cse0 (not (= ~res_kbtab_probe_3~0 0)) .cse1))) [2019-10-02 04:20:50,344 INFO L443 ceAbstractionStarter]: For program point usb_free_coherentEXIT(lines 4081 4110) no Hoare annotation was computed. [2019-10-02 04:20:50,344 INFO L443 ceAbstractionStarter]: For program point L4097-1(lines 4094 4099) no Hoare annotation was computed. [2019-10-02 04:20:50,345 INFO L439 ceAbstractionStarter]: At program point L4097(line 4097) the Hoare annotation is: (let ((.cse0 (not (<= 1 |old(~ldv_coherent_state~0)|)))) (and (or .cse0 (not (= ~res_kbtab_probe_3~0 0))) (or .cse0 (not (= 0 ~ldv_urb_state~0))))) [2019-10-02 04:20:50,345 INFO L446 ceAbstractionStarter]: At program point L4089(line 4089) the Hoare annotation is: true [2019-10-02 04:20:50,345 INFO L443 ceAbstractionStarter]: For program point L4087(lines 4085 4104) no Hoare annotation was computed. [2019-10-02 04:20:50,345 INFO L439 ceAbstractionStarter]: At program point L4085loopEntry(lines 4085 4104) the Hoare annotation is: (let ((.cse0 (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0)) (.cse1 (not (<= 1 |old(~ldv_coherent_state~0)|)))) (and (or .cse0 .cse1 (not (= 0 ~ldv_urb_state~0))) (or .cse0 .cse1 (not (= ~res_kbtab_probe_3~0 0))))) [2019-10-02 04:20:50,345 INFO L446 ceAbstractionStarter]: At program point ldv_initializeFINAL(lines 4218 4220) the Hoare annotation is: true [2019-10-02 04:20:50,345 INFO L443 ceAbstractionStarter]: For program point ldv_initializeEXIT(lines 4218 4220) no Hoare annotation was computed. [2019-10-02 04:20:50,345 INFO L443 ceAbstractionStarter]: For program point usb_deregisterEXIT(lines 4233 4235) no Hoare annotation was computed. [2019-10-02 04:20:50,345 INFO L443 ceAbstractionStarter]: For program point usb_deregisterFINAL(lines 4233 4235) no Hoare annotation was computed. [2019-10-02 04:20:50,346 INFO L446 ceAbstractionStarter]: At program point usb_deregisterENTRY(lines 4233 4235) the Hoare annotation is: true [2019-10-02 04:20:50,346 INFO L443 ceAbstractionStarter]: For program point external_allocFINAL(lines 4248 4250) no Hoare annotation was computed. [2019-10-02 04:20:50,346 INFO L443 ceAbstractionStarter]: For program point external_allocEXIT(lines 4248 4250) no Hoare annotation was computed. [2019-10-02 04:20:50,346 INFO L446 ceAbstractionStarter]: At program point external_allocENTRY(lines 4248 4250) the Hoare annotation is: true [2019-10-02 04:20:50,346 INFO L443 ceAbstractionStarter]: For program point usb_alloc_coherentFINAL(lines 4054 4079) no Hoare annotation was computed. [2019-10-02 04:20:50,346 INFO L443 ceAbstractionStarter]: For program point L4063(line 4063) no Hoare annotation was computed. [2019-10-02 04:20:50,346 INFO L439 ceAbstractionStarter]: At program point L4060loopEntry(lines 4060 4073) the Hoare annotation is: (or (= 0 ~ldv_coherent_state~0) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 ~ldv_urb_state~0)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2019-10-02 04:20:50,346 INFO L439 ceAbstractionStarter]: At program point L4061(line 4061) the Hoare annotation is: (or (= 0 ~ldv_coherent_state~0) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 ~ldv_urb_state~0)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2019-10-02 04:20:50,347 INFO L439 ceAbstractionStarter]: At program point usb_alloc_coherentENTRY(lines 4054 4079) the Hoare annotation is: (or (= 0 ~ldv_coherent_state~0) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 ~ldv_urb_state~0)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2019-10-02 04:20:50,347 INFO L443 ceAbstractionStarter]: For program point usb_alloc_coherentEXIT(lines 4054 4079) no Hoare annotation was computed. [2019-10-02 04:20:50,347 INFO L443 ceAbstractionStarter]: For program point L4074(lines 4059 4075) no Hoare annotation was computed. [2019-10-02 04:20:50,347 INFO L443 ceAbstractionStarter]: For program point L4066(lines 4066 4069) no Hoare annotation was computed. [2019-10-02 04:20:50,347 INFO L446 ceAbstractionStarter]: At program point usb_register_driverENTRY(lines 4240 4242) the Hoare annotation is: true [2019-10-02 04:20:50,347 INFO L443 ceAbstractionStarter]: For program point usb_register_driverFINAL(lines 4240 4242) no Hoare annotation was computed. [2019-10-02 04:20:50,347 INFO L443 ceAbstractionStarter]: For program point usb_register_driverEXIT(lines 4240 4242) no Hoare annotation was computed. [2019-10-02 04:20:50,347 INFO L443 ceAbstractionStarter]: For program point L3801(lines 3801 3804) no Hoare annotation was computed. [2019-10-02 04:20:50,348 INFO L443 ceAbstractionStarter]: For program point L3793(lines 3793 3796) no Hoare annotation was computed. [2019-10-02 04:20:50,348 INFO L439 ceAbstractionStarter]: At program point L3855(lines 3781 3861) the Hoare annotation is: (or (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (and (and (<= ~ldv_urb_state~0 0) (< 0 (+ ~ldv_urb_state~0 1))) (not (= 0 kbtab_probe_~error~0)) (and (< 0 (+ ~ldv_coherent_state~0 1)) (<= ~ldv_coherent_state~0 0))) (not (= 0 |old(~ldv_coherent_state~0)|))) [2019-10-02 04:20:50,348 INFO L439 ceAbstractionStarter]: At program point L3851(lines 3781 3861) the Hoare annotation is: (or (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (and (<= 1 ~ldv_coherent_state~0) (<= ~ldv_coherent_state~0 1) (and (<= ~ldv_urb_state~0 0) (< 0 (+ ~ldv_urb_state~0 1))) (not (= 0 kbtab_probe_~error~0))) (not (= 0 |old(~ldv_coherent_state~0)|))) [2019-10-02 04:20:50,348 INFO L439 ceAbstractionStarter]: At program point L3806(line 3806) the Hoare annotation is: (or (not (= ~res_kbtab_probe_3~0 0)) (and (<= 1 ~ldv_coherent_state~0) (<= (+ kbtab_probe_~error~0 12) 0) (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2019-10-02 04:20:50,348 INFO L443 ceAbstractionStarter]: For program point L3839(lines 3839 3842) no Hoare annotation was computed. [2019-10-02 04:20:50,348 INFO L443 ceAbstractionStarter]: For program point L3806-1(line 3806) no Hoare annotation was computed. [2019-10-02 04:20:50,349 INFO L439 ceAbstractionStarter]: At program point L3798(line 3798) the Hoare annotation is: (or (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|)) (and (<= (+ kbtab_probe_~error~0 12) 0) (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|))) [2019-10-02 04:20:50,349 INFO L443 ceAbstractionStarter]: For program point L3831-1(line 3831) no Hoare annotation was computed. [2019-10-02 04:20:50,349 INFO L439 ceAbstractionStarter]: At program point L3831(line 3831) the Hoare annotation is: (or (and (<= 1 ~ldv_coherent_state~0) (<= (+ kbtab_probe_~error~0 12) 0) (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2019-10-02 04:20:50,349 INFO L443 ceAbstractionStarter]: For program point L3798-1(line 3798) no Hoare annotation was computed. [2019-10-02 04:20:50,349 INFO L439 ceAbstractionStarter]: At program point L3827-1(line 3827) the Hoare annotation is: (or (and (<= 1 ~ldv_coherent_state~0) (<= (+ kbtab_probe_~error~0 12) 0) (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2019-10-02 04:20:50,349 INFO L439 ceAbstractionStarter]: At program point L3827(line 3827) the Hoare annotation is: (or (and (<= 1 ~ldv_coherent_state~0) (<= (+ kbtab_probe_~error~0 12) 0) (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2019-10-02 04:20:50,350 INFO L443 ceAbstractionStarter]: For program point L3790(lines 3790 3796) no Hoare annotation was computed. [2019-10-02 04:20:50,350 INFO L439 ceAbstractionStarter]: At program point L3786(line 3786) the Hoare annotation is: (or (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|)) (and (<= (+ kbtab_probe_~error~0 12) 0) (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|))) [2019-10-02 04:20:50,350 INFO L443 ceAbstractionStarter]: For program point L3819-1(line 3819) no Hoare annotation was computed. [2019-10-02 04:20:50,350 INFO L439 ceAbstractionStarter]: At program point L3819(line 3819) the Hoare annotation is: (or (and (<= 1 ~ldv_coherent_state~0) (<= (+ kbtab_probe_~error~0 12) 0) (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2019-10-02 04:20:50,350 INFO L443 ceAbstractionStarter]: For program point L3786-1(line 3786) no Hoare annotation was computed. [2019-10-02 04:20:50,350 INFO L443 ceAbstractionStarter]: For program point L3815-1(line 3815) no Hoare annotation was computed. [2019-10-02 04:20:50,351 INFO L439 ceAbstractionStarter]: At program point L3815(line 3815) the Hoare annotation is: (or (and (<= 1 ~ldv_coherent_state~0) (<= (+ kbtab_probe_~error~0 12) 0) (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2019-10-02 04:20:50,351 INFO L439 ceAbstractionStarter]: At program point L3844(line 3844) the Hoare annotation is: (or (and (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2019-10-02 04:20:50,351 INFO L443 ceAbstractionStarter]: For program point L3844-1(line 3844) no Hoare annotation was computed. [2019-10-02 04:20:50,351 INFO L439 ceAbstractionStarter]: At program point L3840(lines 3781 3861) the Hoare annotation is: (or (and (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (not (= 0 kbtab_probe_~error~0)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2019-10-02 04:20:50,351 INFO L439 ceAbstractionStarter]: At program point L3836(line 3836) the Hoare annotation is: (or (and (<= 1 ~ldv_coherent_state~0) (<= (+ kbtab_probe_~error~0 12) 0) (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2019-10-02 04:20:50,351 INFO L443 ceAbstractionStarter]: For program point L3836-1(line 3836) no Hoare annotation was computed. [2019-10-02 04:20:50,352 INFO L439 ceAbstractionStarter]: At program point L3832(lines 3832 3833) the Hoare annotation is: (or (and (<= 1 ~ldv_coherent_state~0) (<= (+ kbtab_probe_~error~0 12) 0) (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2019-10-02 04:20:50,352 INFO L439 ceAbstractionStarter]: At program point kbtab_probeENTRY(lines 3770 3862) the Hoare annotation is: (or (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|)) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2019-10-02 04:20:50,352 INFO L443 ceAbstractionStarter]: For program point L3832-1(lines 3832 3833) no Hoare annotation was computed. [2019-10-02 04:20:50,352 INFO L439 ceAbstractionStarter]: At program point L3828(line 3828) the Hoare annotation is: (or (and (<= 1 ~ldv_coherent_state~0) (<= (+ kbtab_probe_~error~0 12) 0) (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2019-10-02 04:20:50,352 INFO L439 ceAbstractionStarter]: At program point L3857(line 3857) the Hoare annotation is: (or (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (and (and (<= ~ldv_urb_state~0 0) (< 0 (+ ~ldv_urb_state~0 1))) (not (= 0 kbtab_probe_~error~0)) (and (< 0 (+ ~ldv_coherent_state~0 1)) (<= ~ldv_coherent_state~0 0))) (not (= 0 |old(~ldv_coherent_state~0)|))) [2019-10-02 04:20:50,352 INFO L443 ceAbstractionStarter]: For program point kbtab_probeFINAL(lines 3770 3862) no Hoare annotation was computed. [2019-10-02 04:20:50,352 INFO L443 ceAbstractionStarter]: For program point L3853-1(line 3853) no Hoare annotation was computed. [2019-10-02 04:20:50,353 INFO L439 ceAbstractionStarter]: At program point L3853(line 3853) the Hoare annotation is: (or (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (and (<= 1 ~ldv_coherent_state~0) (<= ~ldv_coherent_state~0 1) (and (<= ~ldv_urb_state~0 0) (< 0 (+ ~ldv_urb_state~0 1))) (not (= 0 kbtab_probe_~error~0))) (not (= 0 |old(~ldv_coherent_state~0)|))) [2019-10-02 04:20:50,353 INFO L439 ceAbstractionStarter]: At program point L3816(line 3816) the Hoare annotation is: (or (and (<= 1 ~ldv_coherent_state~0) (<= (+ kbtab_probe_~error~0 12) 0) (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2019-10-02 04:20:50,353 INFO L443 ceAbstractionStarter]: For program point L3849-1(line 3849) no Hoare annotation was computed. [2019-10-02 04:20:50,353 INFO L439 ceAbstractionStarter]: At program point L3849(line 3849) the Hoare annotation is: (or (and (<= 1 ~ldv_coherent_state~0) (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (not (= 0 kbtab_probe_~error~0)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2019-10-02 04:20:50,353 INFO L443 ceAbstractionStarter]: For program point L3783-1(line 3783) no Hoare annotation was computed. [2019-10-02 04:20:50,353 INFO L439 ceAbstractionStarter]: At program point L3783(line 3783) the Hoare annotation is: (or (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|)) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2019-10-02 04:20:50,354 INFO L443 ceAbstractionStarter]: For program point L3816-1(line 3816) no Hoare annotation was computed. [2019-10-02 04:20:50,354 INFO L443 ceAbstractionStarter]: For program point L3808(lines 3808 3811) no Hoare annotation was computed. [2019-10-02 04:20:50,354 INFO L443 ceAbstractionStarter]: For program point L3829(line 3829) no Hoare annotation was computed. [2019-10-02 04:20:50,354 INFO L443 ceAbstractionStarter]: For program point L3858(line 3858) no Hoare annotation was computed. [2019-10-02 04:20:50,354 INFO L443 ceAbstractionStarter]: For program point kbtab_probeEXIT(lines 3770 3862) no Hoare annotation was computed. [2019-10-02 04:20:50,354 INFO L439 ceAbstractionStarter]: At program point L3788(line 3788) the Hoare annotation is: (or (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|)) (and (<= (+ kbtab_probe_~error~0 12) 0) (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|))) [2019-10-02 04:20:50,354 INFO L443 ceAbstractionStarter]: For program point L3821-1(line 3821) no Hoare annotation was computed. [2019-10-02 04:20:50,355 INFO L439 ceAbstractionStarter]: At program point L3821(line 3821) the Hoare annotation is: (or (and (<= 1 ~ldv_coherent_state~0) (<= (+ kbtab_probe_~error~0 12) 0) (<= ~ldv_urb_state~0 (+ |old(~ldv_urb_state~0)| 1)) (<= 1 ~ldv_urb_state~0) (<= ~ldv_coherent_state~0 (+ |old(~ldv_coherent_state~0)| 1))) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (not (= 0 |old(~ldv_coherent_state~0)|))) [2019-10-02 04:20:50,355 INFO L443 ceAbstractionStarter]: For program point L3788-1(line 3788) no Hoare annotation was computed. [2019-10-02 04:20:50,355 INFO L443 ceAbstractionStarter]: For program point usb_make_pathEXIT(lines 3437 3451) no Hoare annotation was computed. [2019-10-02 04:20:50,355 INFO L446 ceAbstractionStarter]: At program point usb_make_pathENTRY(lines 3437 3451) the Hoare annotation is: true [2019-10-02 04:20:50,355 INFO L443 ceAbstractionStarter]: For program point L3444(lines 3444 3448) no Hoare annotation was computed. [2019-10-02 04:20:50,355 INFO L443 ceAbstractionStarter]: For program point usb_make_pathFINAL(lines 3437 3451) no Hoare annotation was computed. [2019-10-02 04:20:50,355 INFO L443 ceAbstractionStarter]: For program point L3444-2(lines 3444 3448) no Hoare annotation was computed. [2019-10-02 04:20:50,355 INFO L439 ceAbstractionStarter]: At program point L4154(line 4154) the Hoare annotation is: (or (not (<= 1 ~ldv_coherent_state~0)) (not (= ~res_kbtab_probe_3~0 0)) (not (<= 1 |old(~ldv_urb_state~0)|))) [2019-10-02 04:20:50,356 INFO L443 ceAbstractionStarter]: For program point L4154-1(lines 4151 4156) no Hoare annotation was computed. [2019-10-02 04:20:50,356 INFO L446 ceAbstractionStarter]: At program point L4146(line 4146) the Hoare annotation is: true [2019-10-02 04:20:50,356 INFO L443 ceAbstractionStarter]: For program point L4144(lines 4142 4161) no Hoare annotation was computed. [2019-10-02 04:20:50,356 INFO L439 ceAbstractionStarter]: At program point L4142loopEntry(lines 4142 4161) the Hoare annotation is: (or (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|) (not (<= 1 ~ldv_coherent_state~0)) (not (= ~res_kbtab_probe_3~0 0)) (not (<= 1 |old(~ldv_urb_state~0)|))) [2019-10-02 04:20:50,356 INFO L443 ceAbstractionStarter]: For program point usb_free_urbEXIT(lines 4138 4167) no Hoare annotation was computed. [2019-10-02 04:20:50,356 INFO L439 ceAbstractionStarter]: At program point usb_free_urbENTRY(lines 4138 4167) the Hoare annotation is: (or (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|) (not (<= 1 ~ldv_coherent_state~0)) (not (= ~res_kbtab_probe_3~0 0)) (not (<= 1 |old(~ldv_urb_state~0)|))) [2019-10-02 04:20:50,357 INFO L443 ceAbstractionStarter]: For program point L4151(lines 4151 4156) no Hoare annotation was computed. [2019-10-02 04:20:50,357 INFO L443 ceAbstractionStarter]: For program point L4143(lines 4142 4161) no Hoare annotation was computed. [2019-10-02 04:20:50,357 INFO L439 ceAbstractionStarter]: At program point L4162(lines 4138 4167) the Hoare annotation is: (or (not (<= 1 ~ldv_coherent_state~0)) (not (= ~res_kbtab_probe_3~0 0)) (let ((.cse2 (+ ~ldv_urb_state~0 1))) (and (let ((.cse1 (+ usb_free_urb_~urb.offset usb_free_urb_~urb.base))) (let ((.cse0 (div .cse1 4294967296))) (or (<= (+ .cse0 1) 0) (< (* 4294967296 .cse0) .cse1)))) (< 0 .cse2) (<= .cse2 |old(~ldv_urb_state~0)|))) (not (<= 1 |old(~ldv_urb_state~0)|))) [2019-10-02 04:20:50,357 INFO L446 ceAbstractionStarter]: At program point __create_pipeENTRY(lines 3494 3499) the Hoare annotation is: true [2019-10-02 04:20:50,357 INFO L443 ceAbstractionStarter]: For program point __create_pipeFINAL(lines 3494 3499) no Hoare annotation was computed. [2019-10-02 04:20:50,357 INFO L443 ceAbstractionStarter]: For program point __create_pipeEXIT(lines 3494 3499) no Hoare annotation was computed. [2019-10-02 04:20:50,357 INFO L443 ceAbstractionStarter]: For program point input_allocate_deviceFINAL(lines 3500 3502) no Hoare annotation was computed. [2019-10-02 04:20:50,358 INFO L446 ceAbstractionStarter]: At program point input_allocate_deviceENTRY(lines 3500 3502) the Hoare annotation is: true [2019-10-02 04:20:50,358 INFO L443 ceAbstractionStarter]: For program point L3501(line 3501) no Hoare annotation was computed. [2019-10-02 04:20:50,358 INFO L443 ceAbstractionStarter]: For program point input_allocate_deviceEXIT(lines 3500 3502) no Hoare annotation was computed. [2019-10-02 04:20:50,358 INFO L443 ceAbstractionStarter]: For program point L3457-1(line 3457) no Hoare annotation was computed. [2019-10-02 04:20:50,358 INFO L446 ceAbstractionStarter]: At program point L3457(line 3457) the Hoare annotation is: true [2019-10-02 04:20:50,358 INFO L446 ceAbstractionStarter]: At program point usb_registerENTRY(lines 3453 3461) the Hoare annotation is: true [2019-10-02 04:20:50,358 INFO L443 ceAbstractionStarter]: For program point usb_registerEXIT(lines 3453 3461) no Hoare annotation was computed. [2019-10-02 04:20:50,358 INFO L443 ceAbstractionStarter]: For program point usb_registerFINAL(lines 3453 3461) no Hoare annotation was computed. [2019-10-02 04:20:50,359 INFO L443 ceAbstractionStarter]: For program point cleanup_moduleENTRY(lines 3934 3942) no Hoare annotation was computed. [2019-10-02 04:20:50,359 INFO L443 ceAbstractionStarter]: For program point cleanup_moduleEXIT(lines 3934 3942) no Hoare annotation was computed. [2019-10-02 04:20:50,359 INFO L443 ceAbstractionStarter]: For program point cleanup_moduleFINAL(lines 3934 3942) no Hoare annotation was computed. [2019-10-02 04:20:50,359 INFO L443 ceAbstractionStarter]: For program point usb_kill_urbEXIT(lines 4236 4238) no Hoare annotation was computed. [2019-10-02 04:20:50,359 INFO L443 ceAbstractionStarter]: For program point usb_kill_urbENTRY(lines 4236 4238) no Hoare annotation was computed. [2019-10-02 04:20:50,359 INFO L443 ceAbstractionStarter]: For program point usb_kill_urbFINAL(lines 4236 4238) no Hoare annotation was computed. [2019-10-02 04:20:50,359 INFO L443 ceAbstractionStarter]: For program point kbtab_closeEXIT(lines 3758 3769) no Hoare annotation was computed. [2019-10-02 04:20:50,359 INFO L443 ceAbstractionStarter]: For program point kbtab_closeENTRY(lines 3758 3769) no Hoare annotation was computed. [2019-10-02 04:20:50,359 INFO L443 ceAbstractionStarter]: For program point kbtab_closeFINAL(lines 3758 3769) no Hoare annotation was computed. [2019-10-02 04:20:50,360 INFO L443 ceAbstractionStarter]: For program point L3765-1(line 3765) no Hoare annotation was computed. [2019-10-02 04:20:50,360 INFO L443 ceAbstractionStarter]: For program point L3765(line 3765) no Hoare annotation was computed. [2019-10-02 04:20:50,360 INFO L443 ceAbstractionStarter]: For program point L3763-1(line 3763) no Hoare annotation was computed. [2019-10-02 04:20:50,360 INFO L443 ceAbstractionStarter]: For program point L3763(line 3763) no Hoare annotation was computed. [2019-10-02 04:20:50,360 INFO L446 ceAbstractionStarter]: At program point ldv_blast_assertENTRY(lines 4034 4039) the Hoare annotation is: true [2019-10-02 04:20:50,360 INFO L443 ceAbstractionStarter]: For program point ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 4037) no Hoare annotation was computed. [2019-10-02 04:20:50,361 INFO L443 ceAbstractionStarter]: For program point ldv_blast_assertEXIT(lines 4034 4039) no Hoare annotation was computed. [2019-10-02 04:20:50,361 INFO L443 ceAbstractionStarter]: For program point ldv_blast_assertFINAL(lines 4034 4039) no Hoare annotation was computed. [2019-10-02 04:20:50,361 INFO L443 ceAbstractionStarter]: For program point dev_set_drvdataFINAL(lines 4196 4198) no Hoare annotation was computed. [2019-10-02 04:20:50,361 INFO L443 ceAbstractionStarter]: For program point dev_set_drvdataEXIT(lines 4196 4198) no Hoare annotation was computed. [2019-10-02 04:20:50,361 INFO L446 ceAbstractionStarter]: At program point dev_set_drvdataENTRY(lines 4196 4198) the Hoare annotation is: true [2019-10-02 04:20:50,361 INFO L443 ceAbstractionStarter]: For program point L3710(lines 3710 3714) no Hoare annotation was computed. [2019-10-02 04:20:50,361 INFO L443 ceAbstractionStarter]: For program point L3710-2(lines 3710 3714) no Hoare annotation was computed. [2019-10-02 04:20:50,361 INFO L443 ceAbstractionStarter]: For program point L3702(line 3702) no Hoare annotation was computed. [2019-10-02 04:20:50,361 INFO L443 ceAbstractionStarter]: For program point L3702-1(line 3702) no Hoare annotation was computed. [2019-10-02 04:20:50,362 INFO L443 ceAbstractionStarter]: For program point L3698(line 3698) no Hoare annotation was computed. [2019-10-02 04:20:50,362 INFO L443 ceAbstractionStarter]: For program point L3665(lines 3665 3695) no Hoare annotation was computed. [2019-10-02 04:20:50,362 INFO L443 ceAbstractionStarter]: For program point L3707(line 3707) no Hoare annotation was computed. [2019-10-02 04:20:50,362 INFO L443 ceAbstractionStarter]: For program point kbtab_irqENTRY(lines 3643 3734) no Hoare annotation was computed. [2019-10-02 04:20:50,362 INFO L443 ceAbstractionStarter]: For program point L3666(lines 3659 3695) no Hoare annotation was computed. [2019-10-02 04:20:50,362 INFO L443 ceAbstractionStarter]: For program point L3699-1(line 3699) no Hoare annotation was computed. [2019-10-02 04:20:50,362 INFO L443 ceAbstractionStarter]: For program point L3699(line 3699) no Hoare annotation was computed. [2019-10-02 04:20:50,362 INFO L443 ceAbstractionStarter]: For program point L3662(lines 3662 3695) no Hoare annotation was computed. [2019-10-02 04:20:50,362 INFO L443 ceAbstractionStarter]: For program point L3724(line 3724) no Hoare annotation was computed. [2019-10-02 04:20:50,363 INFO L443 ceAbstractionStarter]: For program point L3720(lines 3652 3733) no Hoare annotation was computed. [2019-10-02 04:20:50,363 INFO L443 ceAbstractionStarter]: For program point L3716(lines 3705 3718) no Hoare annotation was computed. [2019-10-02 04:20:50,363 INFO L443 ceAbstractionStarter]: For program point kbtab_irqEXIT(lines 3643 3734) no Hoare annotation was computed. [2019-10-02 04:20:50,363 INFO L443 ceAbstractionStarter]: For program point L3700(line 3700) no Hoare annotation was computed. [2019-10-02 04:20:50,363 INFO L443 ceAbstractionStarter]: For program point L3659(lines 3659 3695) no Hoare annotation was computed. [2019-10-02 04:20:50,363 INFO L443 ceAbstractionStarter]: For program point L3705(lines 3705 3718) no Hoare annotation was computed. [2019-10-02 04:20:50,363 INFO L443 ceAbstractionStarter]: For program point L3668(lines 3667 3695) no Hoare annotation was computed. [2019-10-02 04:20:50,363 INFO L443 ceAbstractionStarter]: For program point L3701-1(line 3701) no Hoare annotation was computed. [2019-10-02 04:20:50,363 INFO L443 ceAbstractionStarter]: For program point L3701(line 3701) no Hoare annotation was computed. [2019-10-02 04:20:50,364 INFO L443 ceAbstractionStarter]: For program point L3697(line 3697) no Hoare annotation was computed. [2019-10-02 04:20:50,364 INFO L443 ceAbstractionStarter]: For program point L3726(lines 3726 3731) no Hoare annotation was computed. [2019-10-02 04:20:50,364 INFO L443 ceAbstractionStarter]: For program point L3726-2(lines 3643 3734) no Hoare annotation was computed. [2019-10-02 04:20:50,364 INFO L443 ceAbstractionStarter]: For program point L3693(lines 3656 3695) no Hoare annotation was computed. [2019-10-02 04:20:50,364 INFO L443 ceAbstractionStarter]: For program point L3656(lines 3656 3695) no Hoare annotation was computed. [2019-10-02 04:20:50,364 INFO L443 ceAbstractionStarter]: For program point L3478(lines 3478 3482) no Hoare annotation was computed. [2019-10-02 04:20:50,364 INFO L443 ceAbstractionStarter]: For program point L3478-2(lines 3475 3482) no Hoare annotation was computed. [2019-10-02 04:20:50,365 INFO L443 ceAbstractionStarter]: For program point L3475(lines 3475 3482) no Hoare annotation was computed. [2019-10-02 04:20:50,365 INFO L443 ceAbstractionStarter]: For program point usb_fill_int_urbFINAL(lines 3463 3486) no Hoare annotation was computed. [2019-10-02 04:20:50,365 INFO L443 ceAbstractionStarter]: For program point usb_fill_int_urbEXIT(lines 3463 3486) no Hoare annotation was computed. [2019-10-02 04:20:50,365 INFO L446 ceAbstractionStarter]: At program point usb_fill_int_urbENTRY(lines 3463 3486) the Hoare annotation is: true [2019-10-02 04:20:50,365 INFO L443 ceAbstractionStarter]: For program point input_get_drvdataEXIT(lines 3504 3512) no Hoare annotation was computed. [2019-10-02 04:20:50,365 INFO L443 ceAbstractionStarter]: For program point L3508(line 3508) no Hoare annotation was computed. [2019-10-02 04:20:50,365 INFO L443 ceAbstractionStarter]: For program point input_get_drvdataENTRY(lines 3504 3512) no Hoare annotation was computed. [2019-10-02 04:20:50,365 INFO L443 ceAbstractionStarter]: For program point input_get_drvdataFINAL(lines 3504 3512) no Hoare annotation was computed. [2019-10-02 04:20:50,366 INFO L443 ceAbstractionStarter]: For program point L3508-1(line 3508) no Hoare annotation was computed. [2019-10-02 04:20:50,366 INFO L443 ceAbstractionStarter]: For program point input_unregister_deviceEXIT(lines 4212 4214) no Hoare annotation was computed. [2019-10-02 04:20:50,366 INFO L446 ceAbstractionStarter]: At program point input_unregister_deviceENTRY(lines 4212 4214) the Hoare annotation is: true [2019-10-02 04:20:50,366 INFO L443 ceAbstractionStarter]: For program point input_unregister_deviceFINAL(lines 4212 4214) no Hoare annotation was computed. [2019-10-02 04:20:50,366 INFO L443 ceAbstractionStarter]: For program point kfreeEXIT(lines 4252 4254) no Hoare annotation was computed. [2019-10-02 04:20:50,366 INFO L446 ceAbstractionStarter]: At program point kfreeENTRY(lines 4252 4254) the Hoare annotation is: true [2019-10-02 04:20:50,366 INFO L443 ceAbstractionStarter]: For program point kfreeFINAL(lines 4252 4254) no Hoare annotation was computed. [2019-10-02 04:20:50,366 INFO L443 ceAbstractionStarter]: For program point __le16_to_cpupFINAL(lines 3372 3377) no Hoare annotation was computed. [2019-10-02 04:20:50,366 INFO L443 ceAbstractionStarter]: For program point __le16_to_cpupEXIT(lines 3372 3377) no Hoare annotation was computed. [2019-10-02 04:20:50,367 INFO L443 ceAbstractionStarter]: For program point __le16_to_cpupENTRY(lines 3372 3377) no Hoare annotation was computed. [2019-10-02 04:20:50,367 INFO L443 ceAbstractionStarter]: For program point printkFINAL(lines 4226 4228) no Hoare annotation was computed. [2019-10-02 04:20:50,367 INFO L443 ceAbstractionStarter]: For program point printkENTRY(lines 4226 4228) no Hoare annotation was computed. [2019-10-02 04:20:50,367 INFO L443 ceAbstractionStarter]: For program point printkEXIT(lines 4226 4228) no Hoare annotation was computed. [2019-10-02 04:20:50,367 INFO L443 ceAbstractionStarter]: For program point init_moduleFINAL(lines 3925 3933) no Hoare annotation was computed. [2019-10-02 04:20:50,367 INFO L443 ceAbstractionStarter]: For program point init_moduleENTRY(lines 3925 3933) no Hoare annotation was computed. [2019-10-02 04:20:50,367 INFO L443 ceAbstractionStarter]: For program point L3929-1(line 3929) no Hoare annotation was computed. [2019-10-02 04:20:50,367 INFO L443 ceAbstractionStarter]: For program point init_moduleEXIT(lines 3925 3933) no Hoare annotation was computed. [2019-10-02 04:20:50,367 INFO L443 ceAbstractionStarter]: For program point L3929(line 3929) no Hoare annotation was computed. [2019-10-02 04:20:50,368 INFO L443 ceAbstractionStarter]: For program point strlcatFINAL(lines 4230 4232) no Hoare annotation was computed. [2019-10-02 04:20:50,368 INFO L443 ceAbstractionStarter]: For program point strlcatEXIT(lines 4230 4232) no Hoare annotation was computed. [2019-10-02 04:20:50,368 INFO L446 ceAbstractionStarter]: At program point strlcatENTRY(lines 4230 4232) the Hoare annotation is: true [2019-10-02 04:20:50,368 INFO L446 ceAbstractionStarter]: At program point usb_to_input_idENTRY(lines 3557 3566) the Hoare annotation is: true [2019-10-02 04:20:50,368 INFO L443 ceAbstractionStarter]: For program point usb_to_input_idFINAL(lines 3557 3566) no Hoare annotation was computed. [2019-10-02 04:20:50,368 INFO L443 ceAbstractionStarter]: For program point usb_to_input_idEXIT(lines 3557 3566) no Hoare annotation was computed. [2019-10-02 04:20:50,368 INFO L443 ceAbstractionStarter]: For program point kzallocEXIT(lines 3393 3401) no Hoare annotation was computed. [2019-10-02 04:20:50,368 INFO L446 ceAbstractionStarter]: At program point kzallocENTRY(lines 3393 3401) the Hoare annotation is: true [2019-10-02 04:20:50,369 INFO L443 ceAbstractionStarter]: For program point L3397-1(line 3397) no Hoare annotation was computed. [2019-10-02 04:20:50,369 INFO L443 ceAbstractionStarter]: For program point kzallocFINAL(lines 3393 3401) no Hoare annotation was computed. [2019-10-02 04:20:50,369 INFO L446 ceAbstractionStarter]: At program point L3397(line 3397) the Hoare annotation is: true [2019-10-02 04:20:50,369 INFO L443 ceAbstractionStarter]: For program point input_syncENTRY(lines 3546 3554) no Hoare annotation was computed. [2019-10-02 04:20:50,369 INFO L443 ceAbstractionStarter]: For program point L3550(line 3550) no Hoare annotation was computed. [2019-10-02 04:20:50,369 INFO L443 ceAbstractionStarter]: For program point input_syncFINAL(lines 3546 3554) no Hoare annotation was computed. [2019-10-02 04:20:50,369 INFO L443 ceAbstractionStarter]: For program point input_syncEXIT(lines 3546 3554) no Hoare annotation was computed. [2019-10-02 04:20:50,369 INFO L446 ceAbstractionStarter]: At program point kmallocENTRY(lines 3383 3392) the Hoare annotation is: true [2019-10-02 04:20:50,369 INFO L446 ceAbstractionStarter]: At program point L3388(line 3388) the Hoare annotation is: true [2019-10-02 04:20:50,370 INFO L443 ceAbstractionStarter]: For program point L3388-1(line 3388) no Hoare annotation was computed. [2019-10-02 04:20:50,370 INFO L443 ceAbstractionStarter]: For program point kmallocFINAL(lines 3383 3392) no Hoare annotation was computed. [2019-10-02 04:20:50,370 INFO L443 ceAbstractionStarter]: For program point kmallocEXIT(lines 3383 3392) no Hoare annotation was computed. [2019-10-02 04:20:50,370 INFO L446 ceAbstractionStarter]: At program point ldv_assume_stopENTRY(lines 4043 4049) the Hoare annotation is: true [2019-10-02 04:20:50,370 INFO L443 ceAbstractionStarter]: For program point ldv_assume_stopEXIT(lines 4043 4049) no Hoare annotation was computed. [2019-10-02 04:20:50,370 INFO L443 ceAbstractionStarter]: For program point kbtab_openENTRY(lines 3740 3757) no Hoare annotation was computed. [2019-10-02 04:20:50,370 INFO L443 ceAbstractionStarter]: For program point L3746-1(line 3746) no Hoare annotation was computed. [2019-10-02 04:20:50,371 INFO L443 ceAbstractionStarter]: For program point kbtab_openFINAL(lines 3740 3757) no Hoare annotation was computed. [2019-10-02 04:20:50,371 INFO L443 ceAbstractionStarter]: For program point L3751(lines 3751 3754) no Hoare annotation was computed. [2019-10-02 04:20:50,371 INFO L443 ceAbstractionStarter]: For program point L3749-1(line 3749) no Hoare annotation was computed. [2019-10-02 04:20:50,371 INFO L443 ceAbstractionStarter]: For program point kbtab_openEXIT(lines 3740 3757) no Hoare annotation was computed. [2019-10-02 04:20:50,371 INFO L443 ceAbstractionStarter]: For program point L3749(line 3749) no Hoare annotation was computed. [2019-10-02 04:20:50,371 INFO L443 ceAbstractionStarter]: For program point L3746(line 3746) no Hoare annotation was computed. [2019-10-02 04:20:50,371 INFO L443 ceAbstractionStarter]: For program point ldv_check_return_valueFINAL(lines 4215 4217) no Hoare annotation was computed. [2019-10-02 04:20:50,371 INFO L443 ceAbstractionStarter]: For program point ldv_check_return_valueEXIT(lines 4215 4217) no Hoare annotation was computed. [2019-10-02 04:20:50,371 INFO L446 ceAbstractionStarter]: At program point ldv_check_return_valueENTRY(lines 4215 4217) the Hoare annotation is: true [2019-10-02 04:20:50,372 INFO L443 ceAbstractionStarter]: For program point L3425-1(line 3425) no Hoare annotation was computed. [2019-10-02 04:20:50,372 INFO L446 ceAbstractionStarter]: At program point L3425(line 3425) the Hoare annotation is: true [2019-10-02 04:20:50,372 INFO L446 ceAbstractionStarter]: At program point usb_set_intfdataENTRY(lines 3421 3429) the Hoare annotation is: true [2019-10-02 04:20:50,372 INFO L443 ceAbstractionStarter]: For program point usb_set_intfdataFINAL(lines 3421 3429) no Hoare annotation was computed. [2019-10-02 04:20:50,372 INFO L443 ceAbstractionStarter]: For program point usb_set_intfdataEXIT(lines 3421 3429) no Hoare annotation was computed. [2019-10-02 04:20:50,372 INFO L443 ceAbstractionStarter]: For program point L4223(line 4223) no Hoare annotation was computed. [2019-10-02 04:20:50,372 INFO L443 ceAbstractionStarter]: For program point ldv_undefined_pointerFINAL(lines 4222 4224) no Hoare annotation was computed. [2019-10-02 04:20:50,372 INFO L446 ceAbstractionStarter]: At program point ldv_undefined_pointerENTRY(lines 4222 4224) the Hoare annotation is: true [2019-10-02 04:20:50,372 INFO L443 ceAbstractionStarter]: For program point ldv_undefined_pointerEXIT(lines 4222 4224) no Hoare annotation was computed. [2019-10-02 04:20:50,373 INFO L443 ceAbstractionStarter]: For program point L3517-1(line 3517) no Hoare annotation was computed. [2019-10-02 04:20:50,373 INFO L446 ceAbstractionStarter]: At program point input_set_drvdataENTRY(lines 3513 3521) the Hoare annotation is: true [2019-10-02 04:20:50,373 INFO L446 ceAbstractionStarter]: At program point L3517(line 3517) the Hoare annotation is: true [2019-10-02 04:20:50,373 INFO L443 ceAbstractionStarter]: For program point input_set_drvdataFINAL(lines 3513 3521) no Hoare annotation was computed. [2019-10-02 04:20:50,373 INFO L443 ceAbstractionStarter]: For program point input_set_drvdataEXIT(lines 3513 3521) no Hoare annotation was computed. [2019-10-02 04:20:50,373 INFO L443 ceAbstractionStarter]: For program point input_report_keyENTRY(lines 3526 3535) no Hoare annotation was computed. [2019-10-02 04:20:50,373 INFO L443 ceAbstractionStarter]: For program point L3531(line 3531) no Hoare annotation was computed. [2019-10-02 04:20:50,373 INFO L443 ceAbstractionStarter]: For program point input_report_keyFINAL(lines 3526 3535) no Hoare annotation was computed. [2019-10-02 04:20:50,373 INFO L443 ceAbstractionStarter]: For program point input_report_keyEXIT(lines 3526 3535) no Hoare annotation was computed. [2019-10-02 04:20:50,374 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-02 04:20:50,374 INFO L439 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(~ldv_coherent_state~0)| ~ldv_coherent_state~0) (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|)) [2019-10-02 04:20:50,374 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-02 04:20:50,374 INFO L443 ceAbstractionStarter]: For program point interface_to_usbdevFINAL(lines 3430 3436) no Hoare annotation was computed. [2019-10-02 04:20:50,374 INFO L446 ceAbstractionStarter]: At program point interface_to_usbdevENTRY(lines 3430 3436) the Hoare annotation is: true [2019-10-02 04:20:50,374 INFO L443 ceAbstractionStarter]: For program point interface_to_usbdevEXIT(lines 3430 3436) no Hoare annotation was computed. [2019-10-02 04:20:50,374 INFO L439 ceAbstractionStarter]: At program point usb_alloc_urbENTRY(lines 4112 4136) the Hoare annotation is: (or (not (<= ~ldv_coherent_state~0 1)) (not (<= 1 ~ldv_coherent_state~0)) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|)) [2019-10-02 04:20:50,374 INFO L443 ceAbstractionStarter]: For program point L4123(lines 4123 4126) no Hoare annotation was computed. [2019-10-02 04:20:50,375 INFO L443 ceAbstractionStarter]: For program point L4120(line 4120) no Hoare annotation was computed. [2019-10-02 04:20:50,375 INFO L439 ceAbstractionStarter]: At program point L4118(line 4118) the Hoare annotation is: (or (not (<= ~ldv_coherent_state~0 1)) (not (<= 1 ~ldv_coherent_state~0)) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|)) [2019-10-02 04:20:50,375 INFO L443 ceAbstractionStarter]: For program point usb_alloc_urbFINAL(lines 4112 4136) no Hoare annotation was computed. [2019-10-02 04:20:50,375 INFO L439 ceAbstractionStarter]: At program point L4117loopEntry(lines 4117 4130) the Hoare annotation is: (or (not (<= ~ldv_coherent_state~0 1)) (not (<= 1 ~ldv_coherent_state~0)) (not (= ~res_kbtab_probe_3~0 0)) (not (= 0 |old(~ldv_urb_state~0)|)) (= ~ldv_urb_state~0 |old(~ldv_urb_state~0)|)) [2019-10-02 04:20:50,375 INFO L443 ceAbstractionStarter]: For program point L4131(lines 4116 4132) no Hoare annotation was computed. [2019-10-02 04:20:50,375 INFO L443 ceAbstractionStarter]: For program point usb_alloc_urbEXIT(lines 4112 4136) no Hoare annotation was computed. [2019-10-02 04:20:50,375 INFO L446 ceAbstractionStarter]: At program point ldv_check_final_stateENTRY(lines 4169 4186) the Hoare annotation is: true [2019-10-02 04:20:50,375 INFO L443 ceAbstractionStarter]: For program point L4181-1(lines 4169 4186) no Hoare annotation was computed. [2019-10-02 04:20:50,376 INFO L439 ceAbstractionStarter]: At program point L4181(line 4181) the Hoare annotation is: (or (not (= 0 ~ldv_urb_state~0)) (not (= 0 ~ldv_coherent_state~0))) [2019-10-02 04:20:50,376 INFO L443 ceAbstractionStarter]: For program point L4175-1(lines 4171 4185) no Hoare annotation was computed. [2019-10-02 04:20:50,376 INFO L439 ceAbstractionStarter]: At program point L4175(line 4175) the Hoare annotation is: (or (not (= 0 ~ldv_urb_state~0)) (not (= 0 ~ldv_coherent_state~0))) [2019-10-02 04:20:50,376 INFO L443 ceAbstractionStarter]: For program point ldv_check_final_stateEXIT(lines 4169 4186) no Hoare annotation was computed. [2019-10-02 04:20:50,376 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-02 04:20:50,376 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (= 0 ~ldv_coherent_state~0) (= ~ldv_urb_state~0 0) (= 0 ~res_kbtab_probe_3~0)) [2019-10-02 04:20:50,376 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-02 04:20:50,376 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-02 04:20:50,376 INFO L443 ceAbstractionStarter]: For program point input_report_absENTRY(lines 3536 3545) no Hoare annotation was computed. [2019-10-02 04:20:50,377 INFO L443 ceAbstractionStarter]: For program point input_report_absEXIT(lines 3536 3545) no Hoare annotation was computed. [2019-10-02 04:20:50,377 INFO L443 ceAbstractionStarter]: For program point input_report_absFINAL(lines 3536 3545) no Hoare annotation was computed. [2019-10-02 04:20:50,377 INFO L443 ceAbstractionStarter]: For program point L3541(line 3541) no Hoare annotation was computed. [2019-10-02 04:20:50,377 INFO L443 ceAbstractionStarter]: For program point get_unaligned_le16EXIT(lines 3567 3575) no Hoare annotation was computed. [2019-10-02 04:20:50,377 INFO L443 ceAbstractionStarter]: For program point get_unaligned_le16ENTRY(lines 3567 3575) no Hoare annotation was computed. [2019-10-02 04:20:50,377 INFO L443 ceAbstractionStarter]: For program point L3571-1(line 3571) no Hoare annotation was computed. [2019-10-02 04:20:50,377 INFO L443 ceAbstractionStarter]: For program point get_unaligned_le16FINAL(lines 3567 3575) no Hoare annotation was computed. [2019-10-02 04:20:50,377 INFO L443 ceAbstractionStarter]: For program point L3571(line 3571) no Hoare annotation was computed. [2019-10-02 04:20:50,377 INFO L443 ceAbstractionStarter]: For program point input_register_deviceFINAL(lines 4206 4208) no Hoare annotation was computed. [2019-10-02 04:20:50,378 INFO L446 ceAbstractionStarter]: At program point input_register_deviceENTRY(lines 4206 4208) the Hoare annotation is: true [2019-10-02 04:20:50,378 INFO L443 ceAbstractionStarter]: For program point input_register_deviceEXIT(lines 4206 4208) no Hoare annotation was computed. [2019-10-02 04:20:50,402 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 04:20:50 BoogieIcfgContainer [2019-10-02 04:20:50,403 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 04:20:50,405 INFO L168 Benchmark]: Toolchain (without parser) took 30423.51 ms. Allocated memory was 133.2 MB in the beginning and 893.9 MB in the end (delta: 760.7 MB). Free memory was 83.4 MB in the beginning and 114.4 MB in the end (delta: -31.0 MB). Peak memory consumption was 729.7 MB. Max. memory is 7.1 GB. [2019-10-02 04:20:50,406 INFO L168 Benchmark]: CDTParser took 0.25 ms. Allocated memory is still 133.2 MB. Free memory was 107.3 MB in the beginning and 107.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. [2019-10-02 04:20:50,407 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1882.04 ms. Allocated memory was 133.2 MB in the beginning and 208.1 MB in the end (delta: 75.0 MB). Free memory was 83.2 MB in the beginning and 128.5 MB in the end (delta: -45.3 MB). Peak memory consumption was 37.0 MB. Max. memory is 7.1 GB. [2019-10-02 04:20:50,408 INFO L168 Benchmark]: Boogie Preprocessor took 216.33 ms. Allocated memory is still 208.1 MB. Free memory was 128.5 MB in the beginning and 121.4 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 7.1 GB. [2019-10-02 04:20:50,408 INFO L168 Benchmark]: RCFGBuilder took 2335.90 ms. Allocated memory was 208.1 MB in the beginning and 276.8 MB in the end (delta: 68.7 MB). Free memory was 121.4 MB in the beginning and 122.3 MB in the end (delta: -873.2 kB). Peak memory consumption was 71.7 MB. Max. memory is 7.1 GB. [2019-10-02 04:20:50,410 INFO L168 Benchmark]: TraceAbstraction took 25984.12 ms. Allocated memory was 276.8 MB in the beginning and 893.9 MB in the end (delta: 617.1 MB). Free memory was 122.3 MB in the beginning and 114.4 MB in the end (delta: 7.9 MB). Peak memory consumption was 625.0 MB. Max. memory is 7.1 GB. [2019-10-02 04:20:50,414 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.25 ms. Allocated memory is still 133.2 MB. Free memory was 107.3 MB in the beginning and 107.1 MB in the end (delta: 212.8 kB). Peak memory consumption was 212.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1882.04 ms. Allocated memory was 133.2 MB in the beginning and 208.1 MB in the end (delta: 75.0 MB). Free memory was 83.2 MB in the beginning and 128.5 MB in the end (delta: -45.3 MB). Peak memory consumption was 37.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 216.33 ms. Allocated memory is still 208.1 MB. Free memory was 128.5 MB in the beginning and 121.4 MB in the end (delta: 7.0 MB). Peak memory consumption was 7.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2335.90 ms. Allocated memory was 208.1 MB in the beginning and 276.8 MB in the end (delta: 68.7 MB). Free memory was 121.4 MB in the beginning and 122.3 MB in the end (delta: -873.2 kB). Peak memory consumption was 71.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 25984.12 ms. Allocated memory was 276.8 MB in the beginning and 893.9 MB in the end (delta: 617.1 MB). Free memory was 122.3 MB in the beginning and 114.4 MB in the end (delta: 7.9 MB). Peak memory consumption was 625.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4037]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 3967]: Loop Invariant Derived loop invariant: (((0 == ldv_coherent_state && ldv_urb_state == 0) || !(\old(res_kbtab_probe_3) == 0)) || !(0 == \old(ldv_urb_state))) || !(0 == \old(ldv_coherent_state)) - InvariantResult [Line: 3781]: Loop Invariant Derived loop invariant: ((!(res_kbtab_probe_3 == 0) || !(0 == \old(ldv_urb_state))) || (((1 <= ldv_coherent_state && ldv_coherent_state <= 1) && ldv_urb_state <= 0 && 0 < ldv_urb_state + 1) && !(0 == error))) || !(0 == \old(ldv_coherent_state)) - InvariantResult [Line: 3781]: Loop Invariant Derived loop invariant: ((((((1 <= ldv_coherent_state && ldv_urb_state <= \old(ldv_urb_state) + 1) && !(0 == error)) && 1 <= ldv_urb_state) && ldv_coherent_state <= \old(ldv_coherent_state) + 1) || !(res_kbtab_probe_3 == 0)) || !(0 == \old(ldv_urb_state))) || !(0 == \old(ldv_coherent_state)) - InvariantResult [Line: 4138]: Loop Invariant Derived loop invariant: ((!(1 <= ldv_coherent_state) || !(res_kbtab_probe_3 == 0)) || ((((urb + urb) / 4294967296 + 1 <= 0 || 4294967296 * ((urb + urb) / 4294967296) < urb + urb) && 0 < ldv_urb_state + 1) && ldv_urb_state + 1 <= \old(ldv_urb_state))) || !(1 <= \old(ldv_urb_state)) - InvariantResult [Line: 3781]: Loop Invariant Derived loop invariant: ((!(res_kbtab_probe_3 == 0) || !(0 == \old(ldv_urb_state))) || (((ldv_urb_state <= 0 && 0 < ldv_urb_state + 1) && !(0 == error)) && 0 < ldv_coherent_state + 1 && ldv_coherent_state <= 0)) || !(0 == \old(ldv_coherent_state)) - InvariantResult [Line: 4117]: Loop Invariant Derived loop invariant: (((!(ldv_coherent_state <= 1) || !(1 <= ldv_coherent_state)) || !(res_kbtab_probe_3 == 0)) || !(0 == \old(ldv_urb_state))) || ldv_urb_state == \old(ldv_urb_state) - InvariantResult [Line: 4142]: Loop Invariant Derived loop invariant: ((ldv_urb_state == \old(ldv_urb_state) || !(1 <= ldv_coherent_state)) || !(res_kbtab_probe_3 == 0)) || !(1 <= \old(ldv_urb_state)) - InvariantResult [Line: 3985]: Loop Invariant Derived loop invariant: (((!(\old(res_kbtab_probe_3) == 0) || (((0 == ldv_coherent_state && ldv_urb_state <= 0 && 0 < ldv_urb_state + 1) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0)) || !(0 == \old(ldv_urb_state))) || (((((1 <= ldv_coherent_state && 1 <= ldv_s_kbtab_driver_usb_driver) && 0 == res_kbtab_probe_3) && ldv_urb_state <= \old(ldv_urb_state) + 1) && 1 <= ldv_urb_state) && ldv_coherent_state <= \old(ldv_coherent_state) + 1)) || !(0 == \old(ldv_coherent_state)) - InvariantResult [Line: 3956]: Loop Invariant Derived loop invariant: (((0 == ldv_coherent_state && ldv_urb_state == 0) || !(\old(res_kbtab_probe_3) == 0)) || !(0 == \old(ldv_urb_state))) || !(0 == \old(ldv_coherent_state)) - InvariantResult [Line: 4081]: Loop Invariant Derived loop invariant: ((!(1 <= \old(ldv_coherent_state)) || !(0 == ldv_urb_state)) || (((4294967296 * ((addr + addr) / 4294967296) < addr + addr || (addr + addr) / 4294967296 + 1 <= 0) && (ldv_coherent_state + 1 <= \old(ldv_coherent_state) || ldv_coherent_state <= 0)) && (0 < ldv_coherent_state + 1 || \old(ldv_coherent_state) <= ldv_coherent_state + 1))) && ((!(1 <= \old(ldv_coherent_state)) || !(res_kbtab_probe_3 == 0)) || (((4294967296 * ((addr + addr) / 4294967296) < addr + addr || (addr + addr) / 4294967296 + 1 <= 0) && (ldv_coherent_state + 1 <= \old(ldv_coherent_state) || ldv_coherent_state <= 0)) && (0 < ldv_coherent_state + 1 || \old(ldv_coherent_state) <= ldv_coherent_state + 1))) - InvariantResult [Line: 3968]: Loop Invariant Derived loop invariant: (((!(\old(res_kbtab_probe_3) == 0) || (((0 == ldv_coherent_state && ldv_urb_state <= 0 && 0 < ldv_urb_state + 1) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0)) || !(0 == \old(ldv_urb_state))) || (((((1 <= ldv_coherent_state && 1 <= ldv_s_kbtab_driver_usb_driver) && 0 == res_kbtab_probe_3) && ldv_urb_state <= \old(ldv_urb_state) + 1) && 1 <= ldv_urb_state) && ldv_coherent_state <= \old(ldv_coherent_state) + 1)) || !(0 == \old(ldv_coherent_state)) - InvariantResult [Line: 3982]: Loop Invariant Derived loop invariant: (((!(\old(res_kbtab_probe_3) == 0) || (((0 == ldv_coherent_state && ldv_urb_state <= 0 && 0 < ldv_urb_state + 1) && 0 == res_kbtab_probe_3) && ldv_s_kbtab_driver_usb_driver == 0)) || !(0 == \old(ldv_urb_state))) || (((((1 <= ldv_coherent_state && 1 <= ldv_s_kbtab_driver_usb_driver) && 0 == res_kbtab_probe_3) && ldv_urb_state <= \old(ldv_urb_state) + 1) && 1 <= ldv_urb_state) && ldv_coherent_state <= \old(ldv_coherent_state) + 1)) || !(0 == \old(ldv_coherent_state)) - InvariantResult [Line: 4060]: Loop Invariant Derived loop invariant: ((0 == ldv_coherent_state || !(res_kbtab_probe_3 == 0)) || !(0 == ldv_urb_state)) || !(0 == \old(ldv_coherent_state)) - InvariantResult [Line: 4043]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 3899]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 4085]: Loop Invariant Derived loop invariant: ((\old(ldv_coherent_state) == ldv_coherent_state || !(1 <= \old(ldv_coherent_state))) || !(0 == ldv_urb_state)) && ((\old(ldv_coherent_state) == ldv_coherent_state || !(1 <= \old(ldv_coherent_state))) || !(res_kbtab_probe_3 == 0)) - StatisticsResult: Ultimate Automizer benchmark data CFG has 56 procedures, 341 locations, 1 error locations. SAFE Result, 25.8s OverallTime, 20 OverallIterations, 5 TraceHistogramMax, 12.0s AutomataDifference, 0.0s DeadEndRemovalTime, 3.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 5755 SDtfs, 4952 SDslu, 10922 SDs, 0 SdLazy, 4366 SolverSat, 2156 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 934 GetRequests, 818 SyntacticMatches, 6 SemanticMatches, 110 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 165 ImplicationChecksByTransitivity, 1.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1191occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 449 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 104 LocationsWithAnnotation, 4852 PreInvPairs, 4944 NumberOfFragments, 1787 HoareAnnotationTreeSize, 4852 FomulaSimplifications, 8902 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 104 FomulaSimplificationsInter, 4866 FormulaSimplificationTreeSizeReductionInter, 2.6s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 3.9s InterpolantComputationTime, 4057 NumberOfCodeBlocks, 4057 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 4034 ConstructedInterpolants, 0 QuantifiedInterpolants, 1679646 SizeOfPredicates, 3 NumberOfNonLiveVariables, 5126 ConjunctsInSsa, 35 ConjunctsInUnsatCore, 23 InterpolantComputations, 18 PerfectInterpolantSequences, 949/978 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...