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/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.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-112bae1 [2019-09-10 09:11:17,786 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-10 09:11:17,788 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-10 09:11:17,799 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-10 09:11:17,799 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-10 09:11:17,800 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-10 09:11:17,802 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-10 09:11:17,803 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-10 09:11:17,805 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-10 09:11:17,806 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-10 09:11:17,807 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-10 09:11:17,808 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-10 09:11:17,808 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-10 09:11:17,809 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-10 09:11:17,810 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-10 09:11:17,811 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-10 09:11:17,812 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-10 09:11:17,813 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-10 09:11:17,814 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-10 09:11:17,817 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-10 09:11:17,818 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-10 09:11:17,819 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-10 09:11:17,820 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-10 09:11:17,821 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-10 09:11:17,823 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-10 09:11:17,824 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-10 09:11:17,824 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-10 09:11:17,825 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-10 09:11:17,825 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-10 09:11:17,826 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-10 09:11:17,826 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-10 09:11:17,827 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-10 09:11:17,828 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-10 09:11:17,829 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-10 09:11:17,830 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-10 09:11:17,830 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-10 09:11:17,831 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-10 09:11:17,831 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-10 09:11:17,831 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-10 09:11:17,832 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-10 09:11:17,833 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-10 09:11:17,834 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-10 09:11:17,855 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-10 09:11:17,856 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-10 09:11:17,856 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-10 09:11:17,856 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-10 09:11:17,857 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-10 09:11:17,857 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-10 09:11:17,857 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-10 09:11:17,857 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-10 09:11:17,858 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-10 09:11:17,858 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-10 09:11:17,858 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-10 09:11:17,859 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-10 09:11:17,859 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-10 09:11:17,859 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-10 09:11:17,859 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-10 09:11:17,859 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-10 09:11:17,860 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-10 09:11:17,860 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-10 09:11:17,860 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-10 09:11:17,860 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-10 09:11:17,860 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-10 09:11:17,861 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-10 09:11:17,861 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-10 09:11:17,861 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-10 09:11:17,861 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-10 09:11:17,861 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-10 09:11:17,862 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-10 09:11:17,862 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-10 09:11:17,862 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-10 09:11:17,862 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-10 09:11:17,892 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-10 09:11:17,904 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-10 09:11:17,907 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-10 09:11:17,908 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-10 09:11:17,909 INFO L275 PluginConnector]: CDTParser initialized [2019-09-10 09:11:17,910 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-09-10 09:11:17,964 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5de183134/f953256133bb4f5cb259c81471602170/FLAG2b518dda6 [2019-09-10 09:11:18,705 INFO L306 CDTParser]: Found 1 translation units. [2019-09-10 09:11:18,707 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-09-10 09:11:18,747 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5de183134/f953256133bb4f5cb259c81471602170/FLAG2b518dda6 [2019-09-10 09:11:18,986 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5de183134/f953256133bb4f5cb259c81471602170 [2019-09-10 09:11:18,996 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-10 09:11:18,998 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-10 09:11:18,999 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-10 09:11:18,999 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-10 09:11:19,003 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-10 09:11:19,004 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 09:11:18" (1/1) ... [2019-09-10 09:11:19,007 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@163f2cec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:11:19, skipping insertion in model container [2019-09-10 09:11:19,007 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.09 09:11:18" (1/1) ... [2019-09-10 09:11:19,015 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-10 09:11:19,105 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-10 09:11:20,129 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 09:11:20,187 INFO L188 MainTranslator]: Completed pre-run [2019-09-10 09:11:20,411 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-10 09:11:20,510 INFO L192 MainTranslator]: Completed translation [2019-09-10 09:11:20,510 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:11:20 WrapperNode [2019-09-10 09:11:20,511 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-10 09:11:20,512 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-10 09:11:20,512 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-10 09:11:20,512 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-10 09:11:20,532 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:11:20" (1/1) ... [2019-09-10 09:11:20,534 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:11:20" (1/1) ... [2019-09-10 09:11:20,602 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:11:20" (1/1) ... [2019-09-10 09:11:20,602 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:11:20" (1/1) ... [2019-09-10 09:11:20,694 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:11:20" (1/1) ... [2019-09-10 09:11:20,705 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:11:20" (1/1) ... [2019-09-10 09:11:20,714 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:11:20" (1/1) ... [2019-09-10 09:11:20,726 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-10 09:11:20,727 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-10 09:11:20,727 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-10 09:11:20,727 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-10 09:11:20,729 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:11:20" (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-09-10 09:11:20,850 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-10 09:11:20,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-10 09:11:20,851 INFO L138 BoogieDeclarations]: Found implementation of procedure __le16_to_cpup [2019-09-10 09:11:20,851 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2019-09-10 09:11:20,852 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2019-09-10 09:11:20,852 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2019-09-10 09:11:20,852 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2019-09-10 09:11:20,854 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2019-09-10 09:11:20,854 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_make_path [2019-09-10 09:11:20,854 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register [2019-09-10 09:11:20,855 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_int_urb [2019-09-10 09:11:20,855 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2019-09-10 09:11:20,855 INFO L138 BoogieDeclarations]: Found implementation of procedure input_allocate_device [2019-09-10 09:11:20,856 INFO L138 BoogieDeclarations]: Found implementation of procedure input_get_drvdata [2019-09-10 09:11:20,857 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_drvdata [2019-09-10 09:11:20,858 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_key [2019-09-10 09:11:20,858 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_abs [2019-09-10 09:11:20,859 INFO L138 BoogieDeclarations]: Found implementation of procedure input_sync [2019-09-10 09:11:20,859 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_to_input_id [2019-09-10 09:11:20,860 INFO L138 BoogieDeclarations]: Found implementation of procedure get_unaligned_le16 [2019-09-10 09:11:20,860 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_irq [2019-09-10 09:11:20,860 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_open [2019-09-10 09:11:20,860 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_close [2019-09-10 09:11:20,861 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_probe [2019-09-10 09:11:20,862 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_disconnect [2019-09-10 09:11:20,862 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_init [2019-09-10 09:11:20,863 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_exit [2019-09-10 09:11:20,863 INFO L138 BoogieDeclarations]: Found implementation of procedure init_module [2019-09-10 09:11:20,863 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup_module [2019-09-10 09:11:20,864 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-10 09:11:20,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2019-09-10 09:11:20,864 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2019-09-10 09:11:20,864 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2019-09-10 09:11:20,865 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2019-09-10 09:11:20,865 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2019-09-10 09:11:20,865 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2019-09-10 09:11:20,865 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-09-10 09:11:20,866 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2019-09-10 09:11:20,866 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2019-09-10 09:11:20,866 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2019-09-10 09:11:20,867 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event [2019-09-10 09:11:20,867 INFO L138 BoogieDeclarations]: Found implementation of procedure input_free_device [2019-09-10 09:11:20,867 INFO L138 BoogieDeclarations]: Found implementation of procedure input_register_device [2019-09-10 09:11:20,868 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2019-09-10 09:11:20,868 INFO L138 BoogieDeclarations]: Found implementation of procedure input_unregister_device [2019-09-10 09:11:20,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2019-09-10 09:11:20,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-09-10 09:11:20,869 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2019-09-10 09:11:20,870 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-09-10 09:11:20,870 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2019-09-10 09:11:20,870 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_deregister [2019-09-10 09:11:20,870 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2019-09-10 09:11:20,871 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register_driver [2019-09-10 09:11:20,871 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2019-09-10 09:11:20,871 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-09-10 09:11:20,872 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-09-10 09:11:20,872 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-10 09:11:20,872 INFO L130 BoogieDeclarations]: Found specification of procedure __le16_to_cpup [2019-09-10 09:11:20,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-10 09:11:20,873 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-09-10 09:11:20,873 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2019-09-10 09:11:20,873 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2019-09-10 09:11:20,873 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-09-10 09:11:20,874 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2019-09-10 09:11:20,874 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2019-09-10 09:11:20,875 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2019-09-10 09:11:20,875 INFO L130 BoogieDeclarations]: Found specification of procedure init_module [2019-09-10 09:11:20,875 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup_module [2019-09-10 09:11:20,876 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2019-09-10 09:11:20,876 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2019-09-10 09:11:20,876 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2019-09-10 09:11:20,876 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2019-09-10 09:11:20,877 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2019-09-10 09:11:20,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-10 09:11:20,877 INFO L130 BoogieDeclarations]: Found specification of procedure usb_make_path [2019-09-10 09:11:20,878 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-10 09:11:20,878 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register_driver [2019-09-10 09:11:20,878 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register [2019-09-10 09:11:20,878 INFO L130 BoogieDeclarations]: Found specification of procedure usb_deregister [2019-09-10 09:11:20,878 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_int_urb [2019-09-10 09:11:20,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-10 09:11:20,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-10 09:11:20,879 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2019-09-10 09:11:20,879 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2019-09-10 09:11:20,879 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2019-09-10 09:11:20,880 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2019-09-10 09:11:20,880 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2019-09-10 09:11:20,880 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2019-09-10 09:11:20,880 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2019-09-10 09:11:20,880 INFO L130 BoogieDeclarations]: Found specification of procedure input_allocate_device [2019-09-10 09:11:20,880 INFO L130 BoogieDeclarations]: Found specification of procedure input_free_device [2019-09-10 09:11:20,881 INFO L130 BoogieDeclarations]: Found specification of procedure input_get_drvdata [2019-09-10 09:11:20,881 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_drvdata [2019-09-10 09:11:20,881 INFO L130 BoogieDeclarations]: Found specification of procedure input_register_device [2019-09-10 09:11:20,881 INFO L130 BoogieDeclarations]: Found specification of procedure input_unregister_device [2019-09-10 09:11:20,882 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2019-09-10 09:11:20,882 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_key [2019-09-10 09:11:20,882 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_abs [2019-09-10 09:11:20,883 INFO L130 BoogieDeclarations]: Found specification of procedure input_sync [2019-09-10 09:11:20,883 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2019-09-10 09:11:20,883 INFO L130 BoogieDeclarations]: Found specification of procedure usb_to_input_id [2019-09-10 09:11:20,883 INFO L130 BoogieDeclarations]: Found specification of procedure get_unaligned_le16 [2019-09-10 09:11:20,884 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_irq [2019-09-10 09:11:20,884 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_open [2019-09-10 09:11:20,884 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_close [2019-09-10 09:11:20,885 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_probe [2019-09-10 09:11:20,885 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_disconnect [2019-09-10 09:11:20,885 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_init [2019-09-10 09:11:20,885 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_exit [2019-09-10 09:11:20,886 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-09-10 09:11:20,886 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2019-09-10 09:11:20,886 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-09-10 09:11:20,886 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-10 09:11:20,887 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-10 09:11:20,887 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2019-09-10 09:11:20,887 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2019-09-10 09:11:20,887 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2019-09-10 09:11:20,887 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-09-10 09:11:20,888 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-09-10 09:11:20,888 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-10 09:11:20,888 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-10 09:11:20,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-10 09:11:20,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-10 09:11:20,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-10 09:11:20,889 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-10 09:11:20,889 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-10 09:11:21,528 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-10 09:11:21,581 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-09-10 09:11:21,581 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-09-10 09:11:21,966 WARN L731 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-10 09:11:22,039 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-09-10 09:11:22,040 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-09-10 09:11:22,365 INFO L684 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2019-09-10 09:11:22,850 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-10 09:11:22,850 INFO L283 CfgBuilder]: Removed 7 assume(true) statements. [2019-09-10 09:11:22,852 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 09:11:22 BoogieIcfgContainer [2019-09-10 09:11:22,853 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-10 09:11:22,854 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-10 09:11:22,855 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-10 09:11:22,861 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-10 09:11:22,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.09 09:11:18" (1/3) ... [2019-09-10 09:11:22,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@595b3878 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 09:11:22, skipping insertion in model container [2019-09-10 09:11:22,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.09 09:11:20" (2/3) ... [2019-09-10 09:11:22,873 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@595b3878 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.09 09:11:22, skipping insertion in model container [2019-09-10 09:11:22,873 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.09 09:11:22" (3/3) ... [2019-09-10 09:11:22,875 INFO L109 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2019-09-10 09:11:22,887 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-10 09:11:22,900 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-10 09:11:22,919 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-10 09:11:22,946 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-10 09:11:22,947 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-10 09:11:22,947 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-10 09:11:22,947 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-10 09:11:22,947 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-10 09:11:22,947 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-10 09:11:22,947 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-10 09:11:22,948 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-10 09:11:22,970 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states. [2019-09-10 09:11:22,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-10 09:11:22,982 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:11:22,983 INFO L399 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-09-10 09:11:22,986 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:11:22,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:11:22,992 INFO L82 PathProgramCache]: Analyzing trace with hash -1845057656, now seen corresponding path program 1 times [2019-09-10 09:11:22,995 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:11:23,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:11:23,063 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:11:23,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:11:23,064 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:11:23,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:11:23,469 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:11:23,473 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:11:23,473 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:11:23,473 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:11:23,479 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:11:23,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:11:23,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:11:23,499 INFO L87 Difference]: Start difference. First operand 282 states. Second operand 3 states. [2019-09-10 09:11:23,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:11:23,605 INFO L93 Difference]: Finished difference Result 460 states and 531 transitions. [2019-09-10 09:11:23,606 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:11:23,607 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-10 09:11:23,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:11:23,625 INFO L225 Difference]: With dead ends: 460 [2019-09-10 09:11:23,626 INFO L226 Difference]: Without dead ends: 447 [2019-09-10 09:11:23,627 INFO L628 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-09-10 09:11:23,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-09-10 09:11:23,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 443. [2019-09-10 09:11:23,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-09-10 09:11:23,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 510 transitions. [2019-09-10 09:11:23,760 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 510 transitions. Word has length 31 [2019-09-10 09:11:23,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:11:23,761 INFO L475 AbstractCegarLoop]: Abstraction has 443 states and 510 transitions. [2019-09-10 09:11:23,761 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:11:23,761 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 510 transitions. [2019-09-10 09:11:23,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-10 09:11:23,763 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:11:23,763 INFO L399 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-09-10 09:11:23,764 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:11:23,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:11:23,764 INFO L82 PathProgramCache]: Analyzing trace with hash -1362410536, now seen corresponding path program 1 times [2019-09-10 09:11:23,764 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:11:23,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:11:23,773 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:11:23,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:11:23,774 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:11:23,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:11:23,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:11:23,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:11:23,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:11:23,919 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:11:23,921 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:11:23,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:11:23,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:11:23,922 INFO L87 Difference]: Start difference. First operand 443 states and 510 transitions. Second operand 3 states. [2019-09-10 09:11:24,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:11:24,000 INFO L93 Difference]: Finished difference Result 856 states and 990 transitions. [2019-09-10 09:11:24,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:11:24,001 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-09-10 09:11:24,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:11:24,013 INFO L225 Difference]: With dead ends: 856 [2019-09-10 09:11:24,014 INFO L226 Difference]: Without dead ends: 846 [2019-09-10 09:11:24,015 INFO L628 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-09-10 09:11:24,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2019-09-10 09:11:24,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 839. [2019-09-10 09:11:24,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2019-09-10 09:11:24,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 971 transitions. [2019-09-10 09:11:24,108 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 971 transitions. Word has length 32 [2019-09-10 09:11:24,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:11:24,109 INFO L475 AbstractCegarLoop]: Abstraction has 839 states and 971 transitions. [2019-09-10 09:11:24,109 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:11:24,109 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 971 transitions. [2019-09-10 09:11:24,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 09:11:24,115 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:11:24,115 INFO L399 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-09-10 09:11:24,115 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:11:24,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:11:24,116 INFO L82 PathProgramCache]: Analyzing trace with hash 318886314, now seen corresponding path program 1 times [2019-09-10 09:11:24,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:11:24,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:11:24,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:11:24,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:11:24,127 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:11:24,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:11:24,303 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:11:24,303 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:11:24,304 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 09:11:24,304 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:11:24,305 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 09:11:24,305 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 09:11:24,305 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 09:11:24,306 INFO L87 Difference]: Start difference. First operand 839 states and 971 transitions. Second operand 6 states. [2019-09-10 09:11:24,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:11:24,382 INFO L93 Difference]: Finished difference Result 844 states and 975 transitions. [2019-09-10 09:11:24,383 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 09:11:24,383 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2019-09-10 09:11:24,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:11:24,389 INFO L225 Difference]: With dead ends: 844 [2019-09-10 09:11:24,389 INFO L226 Difference]: Without dead ends: 839 [2019-09-10 09:11:24,389 INFO L628 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-09-10 09:11:24,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2019-09-10 09:11:24,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 839. [2019-09-10 09:11:24,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2019-09-10 09:11:24,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 970 transitions. [2019-09-10 09:11:24,430 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 970 transitions. Word has length 74 [2019-09-10 09:11:24,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:11:24,434 INFO L475 AbstractCegarLoop]: Abstraction has 839 states and 970 transitions. [2019-09-10 09:11:24,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 09:11:24,435 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 970 transitions. [2019-09-10 09:11:24,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-10 09:11:24,436 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:11:24,437 INFO L399 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-09-10 09:11:24,437 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:11:24,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:11:24,437 INFO L82 PathProgramCache]: Analyzing trace with hash 762786988, now seen corresponding path program 1 times [2019-09-10 09:11:24,438 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:11:24,440 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:11:24,440 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:11:24,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:11:24,441 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:11:24,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:11:24,588 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-10 09:11:24,588 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:11:24,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:11:24,589 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:11:24,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:11:24,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:11:24,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:11:24,590 INFO L87 Difference]: Start difference. First operand 839 states and 970 transitions. Second operand 3 states. [2019-09-10 09:11:24,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:11:24,629 INFO L93 Difference]: Finished difference Result 875 states and 1017 transitions. [2019-09-10 09:11:24,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:11:24,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-10 09:11:24,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:11:24,634 INFO L225 Difference]: With dead ends: 875 [2019-09-10 09:11:24,634 INFO L226 Difference]: Without dead ends: 874 [2019-09-10 09:11:24,635 INFO L628 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-09-10 09:11:24,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-09-10 09:11:24,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2019-09-10 09:11:24,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2019-09-10 09:11:24,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1016 transitions. [2019-09-10 09:11:24,661 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1016 transitions. Word has length 74 [2019-09-10 09:11:24,662 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:11:24,662 INFO L475 AbstractCegarLoop]: Abstraction has 874 states and 1016 transitions. [2019-09-10 09:11:24,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:11:24,662 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1016 transitions. [2019-09-10 09:11:24,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 09:11:24,665 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:11:24,666 INFO L399 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-09-10 09:11:24,666 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:11:24,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:11:24,666 INFO L82 PathProgramCache]: Analyzing trace with hash 1064835193, now seen corresponding path program 1 times [2019-09-10 09:11:24,667 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:11:24,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:11:24,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:11:24,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:11:24,669 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:11:24,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:11:24,857 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-10 09:11:24,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:11:24,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 09:11:24,858 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:11:24,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 09:11:24,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 09:11:24,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 09:11:24,860 INFO L87 Difference]: Start difference. First operand 874 states and 1016 transitions. Second operand 5 states. [2019-09-10 09:11:24,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:11:24,885 INFO L93 Difference]: Finished difference Result 602 states and 692 transitions. [2019-09-10 09:11:24,886 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 09:11:24,886 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2019-09-10 09:11:24,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:11:24,891 INFO L225 Difference]: With dead ends: 602 [2019-09-10 09:11:24,891 INFO L226 Difference]: Without dead ends: 602 [2019-09-10 09:11:24,891 INFO L628 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-09-10 09:11:24,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-09-10 09:11:24,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2019-09-10 09:11:24,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-09-10 09:11:24,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 692 transitions. [2019-09-10 09:11:24,911 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 692 transitions. Word has length 129 [2019-09-10 09:11:24,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:11:24,913 INFO L475 AbstractCegarLoop]: Abstraction has 602 states and 692 transitions. [2019-09-10 09:11:24,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 09:11:24,913 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 692 transitions. [2019-09-10 09:11:24,917 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-10 09:11:24,917 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:11:24,917 INFO L399 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-09-10 09:11:24,918 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:11:24,918 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:11:24,918 INFO L82 PathProgramCache]: Analyzing trace with hash 1415635130, now seen corresponding path program 1 times [2019-09-10 09:11:24,918 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:11:24,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:11:24,923 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:11:24,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:11:24,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:11:24,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:11:25,201 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-10 09:11:25,202 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:11:25,202 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 09:11:25,202 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:11:25,203 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 09:11:25,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 09:11:25,204 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 09:11:25,204 INFO L87 Difference]: Start difference. First operand 602 states and 692 transitions. Second operand 6 states. [2019-09-10 09:11:26,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:11:26,693 INFO L93 Difference]: Finished difference Result 1090 states and 1275 transitions. [2019-09-10 09:11:26,694 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 09:11:26,694 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2019-09-10 09:11:26,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:11:26,702 INFO L225 Difference]: With dead ends: 1090 [2019-09-10 09:11:26,702 INFO L226 Difference]: Without dead ends: 1090 [2019-09-10 09:11:26,702 INFO L628 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-09-10 09:11:26,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2019-09-10 09:11:26,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1051. [2019-09-10 09:11:26,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1051 states. [2019-09-10 09:11:26,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1236 transitions. [2019-09-10 09:11:26,745 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1236 transitions. Word has length 129 [2019-09-10 09:11:26,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:11:26,746 INFO L475 AbstractCegarLoop]: Abstraction has 1051 states and 1236 transitions. [2019-09-10 09:11:26,746 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 09:11:26,746 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1236 transitions. [2019-09-10 09:11:26,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-10 09:11:26,748 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:11:26,748 INFO L399 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-09-10 09:11:26,748 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:11:26,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:11:26,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1340956888, now seen corresponding path program 1 times [2019-09-10 09:11:26,749 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:11:26,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:11:26,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:11:26,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:11:26,752 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:11:26,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:11:26,962 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 09:11:26,963 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:11:26,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 09:11:26,963 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:11:26,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 09:11:26,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 09:11:26,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 09:11:26,965 INFO L87 Difference]: Start difference. First operand 1051 states and 1236 transitions. Second operand 5 states. [2019-09-10 09:11:26,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:11:26,996 INFO L93 Difference]: Finished difference Result 1048 states and 1227 transitions. [2019-09-10 09:11:26,997 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 09:11:26,997 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2019-09-10 09:11:26,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:11:27,004 INFO L225 Difference]: With dead ends: 1048 [2019-09-10 09:11:27,004 INFO L226 Difference]: Without dead ends: 1048 [2019-09-10 09:11:27,006 INFO L628 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-09-10 09:11:27,007 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2019-09-10 09:11:27,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 1048. [2019-09-10 09:11:27,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2019-09-10 09:11:27,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1227 transitions. [2019-09-10 09:11:27,081 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1227 transitions. Word has length 132 [2019-09-10 09:11:27,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:11:27,083 INFO L475 AbstractCegarLoop]: Abstraction has 1048 states and 1227 transitions. [2019-09-10 09:11:27,083 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 09:11:27,083 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1227 transitions. [2019-09-10 09:11:27,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-10 09:11:27,088 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:11:27,088 INFO L399 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-09-10 09:11:27,088 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:11:27,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:11:27,089 INFO L82 PathProgramCache]: Analyzing trace with hash -986593187, now seen corresponding path program 1 times [2019-09-10 09:11:27,089 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:11:27,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:11:27,094 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:11:27,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:11:27,094 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:11:27,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:11:27,266 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-09-10 09:11:27,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:11:27,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 09:11:27,267 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:11:27,268 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 09:11:27,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 09:11:27,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-10 09:11:27,269 INFO L87 Difference]: Start difference. First operand 1048 states and 1227 transitions. Second operand 6 states. [2019-09-10 09:11:27,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:11:27,361 INFO L93 Difference]: Finished difference Result 1070 states and 1264 transitions. [2019-09-10 09:11:27,362 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-10 09:11:27,362 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2019-09-10 09:11:27,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:11:27,368 INFO L225 Difference]: With dead ends: 1070 [2019-09-10 09:11:27,368 INFO L226 Difference]: Without dead ends: 1049 [2019-09-10 09:11:27,368 INFO L628 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-09-10 09:11:27,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2019-09-10 09:11:27,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 1014. [2019-09-10 09:11:27,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2019-09-10 09:11:27,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1206 transitions. [2019-09-10 09:11:27,405 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1206 transitions. Word has length 149 [2019-09-10 09:11:27,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:11:27,405 INFO L475 AbstractCegarLoop]: Abstraction has 1014 states and 1206 transitions. [2019-09-10 09:11:27,405 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 09:11:27,405 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1206 transitions. [2019-09-10 09:11:27,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-10 09:11:27,408 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:11:27,409 INFO L399 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-09-10 09:11:27,409 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:11:27,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:11:27,409 INFO L82 PathProgramCache]: Analyzing trace with hash -8974513, now seen corresponding path program 1 times [2019-09-10 09:11:27,409 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:11:27,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:11:27,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:11:27,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:11:27,412 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:11:27,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:11:27,548 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-10 09:11:27,549 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:11:27,549 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-10 09:11:27,549 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:11:27,550 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-10 09:11:27,550 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-10 09:11:27,550 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-10 09:11:27,550 INFO L87 Difference]: Start difference. First operand 1014 states and 1206 transitions. Second operand 3 states. [2019-09-10 09:11:27,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:11:27,563 INFO L93 Difference]: Finished difference Result 952 states and 1111 transitions. [2019-09-10 09:11:27,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-10 09:11:27,564 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-09-10 09:11:27,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:11:27,569 INFO L225 Difference]: With dead ends: 952 [2019-09-10 09:11:27,569 INFO L226 Difference]: Without dead ends: 952 [2019-09-10 09:11:27,570 INFO L628 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-09-10 09:11:27,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2019-09-10 09:11:27,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 952. [2019-09-10 09:11:27,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2019-09-10 09:11:27,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1111 transitions. [2019-09-10 09:11:27,603 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1111 transitions. Word has length 157 [2019-09-10 09:11:27,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:11:27,603 INFO L475 AbstractCegarLoop]: Abstraction has 952 states and 1111 transitions. [2019-09-10 09:11:27,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-10 09:11:27,603 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1111 transitions. [2019-09-10 09:11:27,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-10 09:11:27,605 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:11:27,606 INFO L399 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-09-10 09:11:27,606 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:11:27,606 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:11:27,607 INFO L82 PathProgramCache]: Analyzing trace with hash 474096884, now seen corresponding path program 1 times [2019-09-10 09:11:27,607 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:11:27,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:11:27,609 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:11:27,609 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:11:27,609 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:11:27,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:11:27,738 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-10 09:11:27,738 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:11:27,738 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 09:11:27,738 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:11:27,739 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 09:11:27,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 09:11:27,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 09:11:27,740 INFO L87 Difference]: Start difference. First operand 952 states and 1111 transitions. Second operand 5 states. [2019-09-10 09:11:27,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:11:27,768 INFO L93 Difference]: Finished difference Result 960 states and 1116 transitions. [2019-09-10 09:11:27,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 09:11:27,768 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 159 [2019-09-10 09:11:27,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:11:27,774 INFO L225 Difference]: With dead ends: 960 [2019-09-10 09:11:27,774 INFO L226 Difference]: Without dead ends: 960 [2019-09-10 09:11:27,774 INFO L628 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-09-10 09:11:27,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2019-09-10 09:11:27,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 960. [2019-09-10 09:11:27,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 960 states. [2019-09-10 09:11:27,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1116 transitions. [2019-09-10 09:11:27,864 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1116 transitions. Word has length 159 [2019-09-10 09:11:27,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:11:27,867 INFO L475 AbstractCegarLoop]: Abstraction has 960 states and 1116 transitions. [2019-09-10 09:11:27,867 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 09:11:27,867 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1116 transitions. [2019-09-10 09:11:27,869 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-10 09:11:27,869 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:11:27,869 INFO L399 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-09-10 09:11:27,869 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:11:27,870 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:11:27,870 INFO L82 PathProgramCache]: Analyzing trace with hash -782323349, now seen corresponding path program 1 times [2019-09-10 09:11:27,870 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:11:27,873 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:11:27,873 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:11:27,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:11:27,874 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:11:27,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:11:28,188 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-09-10 09:11:28,190 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:11:28,190 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-10 09:11:28,190 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:11:28,191 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-10 09:11:28,191 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-10 09:11:28,191 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-10 09:11:28,192 INFO L87 Difference]: Start difference. First operand 960 states and 1116 transitions. Second operand 8 states. [2019-09-10 09:11:29,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:11:29,718 INFO L93 Difference]: Finished difference Result 1421 states and 1749 transitions. [2019-09-10 09:11:29,718 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-10 09:11:29,718 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 160 [2019-09-10 09:11:29,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:11:29,731 INFO L225 Difference]: With dead ends: 1421 [2019-09-10 09:11:29,731 INFO L226 Difference]: Without dead ends: 1390 [2019-09-10 09:11:29,733 INFO L628 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-09-10 09:11:29,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2019-09-10 09:11:29,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1191. [2019-09-10 09:11:29,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1191 states. [2019-09-10 09:11:29,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1379 transitions. [2019-09-10 09:11:29,792 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 1379 transitions. Word has length 160 [2019-09-10 09:11:29,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:11:29,830 INFO L475 AbstractCegarLoop]: Abstraction has 1191 states and 1379 transitions. [2019-09-10 09:11:29,830 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-10 09:11:29,830 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 1379 transitions. [2019-09-10 09:11:29,834 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 09:11:29,835 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:11:29,835 INFO L399 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-09-10 09:11:29,835 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:11:29,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:11:29,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1069171554, now seen corresponding path program 1 times [2019-09-10 09:11:29,838 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:11:29,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:11:29,840 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:11:29,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:11:29,841 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:11:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:11:30,001 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-10 09:11:30,001 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:11:30,001 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 09:11:30,002 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:11:30,002 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 09:11:30,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 09:11:30,003 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 09:11:30,003 INFO L87 Difference]: Start difference. First operand 1191 states and 1379 transitions. Second operand 5 states. [2019-09-10 09:11:30,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:11:30,025 INFO L93 Difference]: Finished difference Result 707 states and 802 transitions. [2019-09-10 09:11:30,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 09:11:30,026 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 187 [2019-09-10 09:11:30,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:11:30,032 INFO L225 Difference]: With dead ends: 707 [2019-09-10 09:11:30,032 INFO L226 Difference]: Without dead ends: 681 [2019-09-10 09:11:30,032 INFO L628 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-09-10 09:11:30,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2019-09-10 09:11:30,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 681. [2019-09-10 09:11:30,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 681 states. [2019-09-10 09:11:30,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 776 transitions. [2019-09-10 09:11:30,065 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 776 transitions. Word has length 187 [2019-09-10 09:11:30,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:11:30,066 INFO L475 AbstractCegarLoop]: Abstraction has 681 states and 776 transitions. [2019-09-10 09:11:30,066 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 09:11:30,066 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 776 transitions. [2019-09-10 09:11:30,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-10 09:11:30,071 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:11:30,071 INFO L399 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-09-10 09:11:30,072 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:11:30,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:11:30,072 INFO L82 PathProgramCache]: Analyzing trace with hash -1039861695, now seen corresponding path program 1 times [2019-09-10 09:11:30,072 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:11:30,075 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:11:30,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:11:30,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:11:30,076 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:11:30,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:11:30,369 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 46 trivial. 0 not checked. [2019-09-10 09:11:30,370 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:11:30,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-10 09:11:30,370 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:11:30,372 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-10 09:11:30,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-10 09:11:30,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-10 09:11:30,373 INFO L87 Difference]: Start difference. First operand 681 states and 776 transitions. Second operand 6 states. [2019-09-10 09:11:31,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:11:31,698 INFO L93 Difference]: Finished difference Result 1089 states and 1249 transitions. [2019-09-10 09:11:31,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-10 09:11:31,703 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 187 [2019-09-10 09:11:31,703 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:11:31,708 INFO L225 Difference]: With dead ends: 1089 [2019-09-10 09:11:31,708 INFO L226 Difference]: Without dead ends: 1089 [2019-09-10 09:11:31,709 INFO L628 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-09-10 09:11:31,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2019-09-10 09:11:31,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1042. [2019-09-10 09:11:31,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1042 states. [2019-09-10 09:11:31,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1205 transitions. [2019-09-10 09:11:31,738 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1205 transitions. Word has length 187 [2019-09-10 09:11:31,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:11:31,739 INFO L475 AbstractCegarLoop]: Abstraction has 1042 states and 1205 transitions. [2019-09-10 09:11:31,739 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-10 09:11:31,739 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1205 transitions. [2019-09-10 09:11:31,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-10 09:11:31,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:11:31,742 INFO L399 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-09-10 09:11:31,742 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:11:31,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:11:31,743 INFO L82 PathProgramCache]: Analyzing trace with hash 1634987359, now seen corresponding path program 1 times [2019-09-10 09:11:31,743 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:11:31,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:11:31,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:11:31,745 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:11:31,745 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:11:31,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:11:31,910 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-10 09:11:31,911 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-10 09:11:31,911 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-10 09:11:31,911 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:11:31,912 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-10 09:11:31,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-10 09:11:31,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-10 09:11:31,913 INFO L87 Difference]: Start difference. First operand 1042 states and 1205 transitions. Second operand 5 states. [2019-09-10 09:11:31,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:11:31,977 INFO L93 Difference]: Finished difference Result 1077 states and 1239 transitions. [2019-09-10 09:11:31,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-10 09:11:31,978 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 207 [2019-09-10 09:11:31,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:11:31,985 INFO L225 Difference]: With dead ends: 1077 [2019-09-10 09:11:31,985 INFO L226 Difference]: Without dead ends: 1077 [2019-09-10 09:11:31,986 INFO L628 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-09-10 09:11:31,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-10 09:11:32,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 1054. [2019-09-10 09:11:32,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2019-09-10 09:11:32,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1216 transitions. [2019-09-10 09:11:32,023 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1216 transitions. Word has length 207 [2019-09-10 09:11:32,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:11:32,023 INFO L475 AbstractCegarLoop]: Abstraction has 1054 states and 1216 transitions. [2019-09-10 09:11:32,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-10 09:11:32,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1216 transitions. [2019-09-10 09:11:32,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-10 09:11:32,027 INFO L391 BasicCegarLoop]: Found error trace [2019-09-10 09:11:32,028 INFO L399 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-09-10 09:11:32,028 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-10 09:11:32,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:11:32,029 INFO L82 PathProgramCache]: Analyzing trace with hash 750070294, now seen corresponding path program 1 times [2019-09-10 09:11:32,029 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-10 09:11:32,032 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:11:32,033 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-10 09:11:32,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-10 09:11:32,033 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-10 09:11:32,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-10 09:11:32,252 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-10 09:11:32,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-10 09:11:32,253 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-10 09:11:32,257 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 212 with the following transitions: [2019-09-10 09:11:32,264 INFO L207 CegarAbsIntRunner]: [0], [2], [7], [9], [10], [28], [30], [31], [32], [35], [40], [49], [51], [54], [56], [61], [63], [66], [78], [80], [86], [119], [120], [124], [161], [162], [163], [164], [165], [166], [175], [178], [182], [186], [187], [188], [189], [191], [193], [195], [200], [205], [207], [212], [214], [219], [221], [223], [225], [227], [231], [233], [235], [237], [242], [244], [256], [257], [260], [264], [265], [302], [303], [305], [306], [307], [309], [310], [321], [324], [325], [412], [415], [424], [425], [442], [443], [444], [445], [446], [448], [449], [453], [455], [456], [470], [471], [472], [474], [475], [477], [478], [479], [481], [482], [486], [487], [488], [489], [490], [499], [502], [506], [510], [515], [536], [537], [538], [539], [554], [555], [556], [557], [558], [559], [560], [561], [562], [563], [566], [567], [568], [572], [573], [578], [579], [580], [581], [582], [583], [584], [585], [586], [587], [588], [589], [590], [591], [592], [593], [594], [595], [596], [597], [598], [599], [600], [601], [602], [603], [604], [605], [606], [607], [608], [609], [610], [611], [624], [625], [626], [627], [658], [659], [662], [663], [668], [669], [670], [671], [672], [673], [676], [677], [678], [682], [683], [684] [2019-09-10 09:11:32,355 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-10 09:11:32,356 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-10 09:11:32,446 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-10 09:11:32,448 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 60 root evaluator evaluations with a maximum evaluation depth of 0. Performed 60 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 128 variables. [2019-09-10 09:11:32,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-10 09:11:32,453 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-10 09:11:32,577 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-10 09:11:32,577 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-10 09:11:32,586 INFO L420 sIntCurrentIteration]: We unified 210 AI predicates to 210 [2019-09-10 09:11:32,587 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-10 09:11:32,587 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-10 09:11:32,588 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2019-09-10 09:11:32,588 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-10 09:11:32,589 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-10 09:11:32,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-10 09:11:32,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 09:11:32,589 INFO L87 Difference]: Start difference. First operand 1054 states and 1216 transitions. Second operand 2 states. [2019-09-10 09:11:32,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-10 09:11:32,590 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-10 09:11:32,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-10 09:11:32,590 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 211 [2019-09-10 09:11:32,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-10 09:11:32,591 INFO L225 Difference]: With dead ends: 2 [2019-09-10 09:11:32,591 INFO L226 Difference]: Without dead ends: 0 [2019-09-10 09:11:32,593 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 210 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-10 09:11:32,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-10 09:11:32,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-10 09:11:32,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-10 09:11:32,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-10 09:11:32,594 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 211 [2019-09-10 09:11:32,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-10 09:11:32,594 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-10 09:11:32,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-10 09:11:32,594 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-10 09:11:32,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-10 09:11:32,601 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.09 09:11:32 BoogieIcfgContainer [2019-09-10 09:11:32,601 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-10 09:11:32,605 INFO L168 Benchmark]: Toolchain (without parser) took 13605.12 ms. Allocated memory was 137.4 MB in the beginning and 457.2 MB in the end (delta: 319.8 MB). Free memory was 83.5 MB in the beginning and 131.6 MB in the end (delta: -48.1 MB). Peak memory consumption was 271.7 MB. Max. memory is 7.1 GB. [2019-09-10 09:11:32,607 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.4 MB. Free memory was 106.7 MB in the beginning and 106.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-09-10 09:11:32,609 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1512.35 ms. Allocated memory was 137.4 MB in the beginning and 203.9 MB in the end (delta: 66.6 MB). Free memory was 83.1 MB in the beginning and 116.7 MB in the end (delta: -33.6 MB). Peak memory consumption was 38.2 MB. Max. memory is 7.1 GB. [2019-09-10 09:11:32,615 INFO L168 Benchmark]: Boogie Preprocessor took 215.09 ms. Allocated memory is still 203.9 MB. Free memory was 116.7 MB in the beginning and 109.8 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 7.1 GB. [2019-09-10 09:11:32,616 INFO L168 Benchmark]: RCFGBuilder took 2125.70 ms. Allocated memory was 203.9 MB in the beginning and 267.9 MB in the end (delta: 64.0 MB). Free memory was 109.8 MB in the beginning and 207.4 MB in the end (delta: -97.6 MB). Peak memory consumption was 72.7 MB. Max. memory is 7.1 GB. [2019-09-10 09:11:32,617 INFO L168 Benchmark]: TraceAbstraction took 9747.03 ms. Allocated memory was 267.9 MB in the beginning and 457.2 MB in the end (delta: 189.3 MB). Free memory was 207.4 MB in the beginning and 131.6 MB in the end (delta: 75.8 MB). Peak memory consumption was 265.1 MB. Max. memory is 7.1 GB. [2019-09-10 09:11:32,630 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.22 ms. Allocated memory is still 137.4 MB. Free memory was 106.7 MB in the beginning and 106.5 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1512.35 ms. Allocated memory was 137.4 MB in the beginning and 203.9 MB in the end (delta: 66.6 MB). Free memory was 83.1 MB in the beginning and 116.7 MB in the end (delta: -33.6 MB). Peak memory consumption was 38.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 215.09 ms. Allocated memory is still 203.9 MB. Free memory was 116.7 MB in the beginning and 109.8 MB in the end (delta: 6.9 MB). Peak memory consumption was 6.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2125.70 ms. Allocated memory was 203.9 MB in the beginning and 267.9 MB in the end (delta: 64.0 MB). Free memory was 109.8 MB in the beginning and 207.4 MB in the end (delta: -97.6 MB). Peak memory consumption was 72.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9747.03 ms. Allocated memory was 267.9 MB in the beginning and 457.2 MB in the end (delta: 189.3 MB). Free memory was 207.4 MB in the beginning and 131.6 MB in the end (delta: 75.8 MB). Peak memory consumption was 265.1 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 - StatisticsResult: Ultimate Automizer benchmark data CFG has 56 procedures, 341 locations, 1 error locations. SAFE Result, 9.6s OverallTime, 15 OverallIterations, 4 TraceHistogramMax, 5.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4188 SDtfs, 2553 SDslu, 7835 SDs, 0 SdLazy, 2225 SolverSat, 793 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 307 GetRequests, 252 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.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.1s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 2.2666666666666666 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.7s AutomataMinimizationTime, 15 MinimizatonAttempts, 354 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 2018 NumberOfCodeBlocks, 2018 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2003 ConstructedInterpolants, 0 QuantifiedInterpolants, 449389 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 14 PerfectInterpolantSequences, 428/431 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...