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-fea9116 [2019-09-20 13:32:24,946 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:32:24,949 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:32:24,966 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:32:24,967 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:32:24,968 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:32:24,971 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:32:24,980 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:32:24,984 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:32:24,987 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:32:24,990 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:32:24,993 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:32:24,993 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:32:24,995 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:32:24,997 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:32:24,998 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:32:24,999 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:32:25,000 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:32:25,001 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:32:25,003 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:32:25,004 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:32:25,005 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:32:25,006 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:32:25,007 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:32:25,009 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:32:25,009 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:32:25,009 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:32:25,010 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:32:25,011 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:32:25,011 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:32:25,012 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:32:25,012 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:32:25,013 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:32:25,014 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:32:25,015 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:32:25,015 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:32:25,015 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:32:25,016 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:32:25,016 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:32:25,017 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:32:25,017 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:32:25,018 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-20 13:32:25,032 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:32:25,032 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:32:25,033 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:32:25,033 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:32:25,034 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:32:25,034 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:32:25,034 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:32:25,034 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:32:25,034 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:32:25,035 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:32:25,035 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:32:25,035 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:32:25,036 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:32:25,036 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:32:25,036 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:32:25,036 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:32:25,036 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:32:25,037 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:32:25,037 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:32:25,038 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:32:25,038 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:32:25,039 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:32:25,039 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:32:25,039 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:32:25,039 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:32:25,039 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:32:25,040 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:32:25,040 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:32:25,040 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:32:25,040 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:32:25,084 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:32:25,096 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:32:25,099 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:32:25,101 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:32:25,101 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:32:25,102 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-20 13:32:25,174 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19e11c733/92fc08bc51674d6e8972e11b0bd7bc49/FLAG7b22d5474 [2019-09-20 13:32:25,941 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:32:25,942 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-20 13:32:25,972 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19e11c733/92fc08bc51674d6e8972e11b0bd7bc49/FLAG7b22d5474 [2019-09-20 13:32:25,992 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/19e11c733/92fc08bc51674d6e8972e11b0bd7bc49 [2019-09-20 13:32:26,003 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:32:26,004 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:32:26,005 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:32:26,005 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:32:26,009 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:32:26,010 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:32:25" (1/1) ... [2019-09-20 13:32:26,013 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7addb51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:32:26, skipping insertion in model container [2019-09-20 13:32:26,013 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:32:25" (1/1) ... [2019-09-20 13:32:26,021 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:32:26,118 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:32:27,178 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:32:27,210 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:32:27,411 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:32:27,501 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:32:27,502 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:32:27 WrapperNode [2019-09-20 13:32:27,502 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:32:27,503 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:32:27,503 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:32:27,503 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:32:27,521 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:32:27" (1/1) ... [2019-09-20 13:32:27,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:32:27" (1/1) ... [2019-09-20 13:32:27,587 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:32:27" (1/1) ... [2019-09-20 13:32:27,588 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:32:27" (1/1) ... [2019-09-20 13:32:27,677 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:32:27" (1/1) ... [2019-09-20 13:32:27,703 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:32:27" (1/1) ... [2019-09-20 13:32:27,719 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:32:27" (1/1) ... [2019-09-20 13:32:27,751 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:32:27,752 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:32:27,752 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:32:27,753 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:32:27,754 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:32:27" (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-20 13:32:27,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:32:27,862 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:32:27,862 INFO L138 BoogieDeclarations]: Found implementation of procedure __le16_to_cpup [2019-09-20 13:32:27,863 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2019-09-20 13:32:27,863 INFO L138 BoogieDeclarations]: Found implementation of procedure kzalloc [2019-09-20 13:32:27,863 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_get_intfdata [2019-09-20 13:32:27,863 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_set_intfdata [2019-09-20 13:32:27,864 INFO L138 BoogieDeclarations]: Found implementation of procedure interface_to_usbdev [2019-09-20 13:32:27,864 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_make_path [2019-09-20 13:32:27,864 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register [2019-09-20 13:32:27,865 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_fill_int_urb [2019-09-20 13:32:27,865 INFO L138 BoogieDeclarations]: Found implementation of procedure __create_pipe [2019-09-20 13:32:27,866 INFO L138 BoogieDeclarations]: Found implementation of procedure input_allocate_device [2019-09-20 13:32:27,867 INFO L138 BoogieDeclarations]: Found implementation of procedure input_get_drvdata [2019-09-20 13:32:27,867 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_drvdata [2019-09-20 13:32:27,868 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_key [2019-09-20 13:32:27,868 INFO L138 BoogieDeclarations]: Found implementation of procedure input_report_abs [2019-09-20 13:32:27,869 INFO L138 BoogieDeclarations]: Found implementation of procedure input_sync [2019-09-20 13:32:27,869 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_to_input_id [2019-09-20 13:32:27,870 INFO L138 BoogieDeclarations]: Found implementation of procedure get_unaligned_le16 [2019-09-20 13:32:27,870 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_irq [2019-09-20 13:32:27,870 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_open [2019-09-20 13:32:27,870 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_close [2019-09-20 13:32:27,870 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_probe [2019-09-20 13:32:27,872 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_disconnect [2019-09-20 13:32:27,872 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_init [2019-09-20 13:32:27,872 INFO L138 BoogieDeclarations]: Found implementation of procedure kbtab_exit [2019-09-20 13:32:27,873 INFO L138 BoogieDeclarations]: Found implementation of procedure init_module [2019-09-20 13:32:27,873 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup_module [2019-09-20 13:32:27,873 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:32:27,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_blast_assert [2019-09-20 13:32:27,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_assume_stop [2019-09-20 13:32:27,874 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_coherent [2019-09-20 13:32:27,874 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_coherent [2019-09-20 13:32:27,877 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_alloc_urb [2019-09-20 13:32:27,877 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_free_urb [2019-09-20 13:32:27,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-09-20 13:32:27,878 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2019-09-20 13:32:27,878 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2019-09-20 13:32:27,878 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2019-09-20 13:32:27,878 INFO L138 BoogieDeclarations]: Found implementation of procedure input_event [2019-09-20 13:32:27,879 INFO L138 BoogieDeclarations]: Found implementation of procedure input_free_device [2019-09-20 13:32:27,879 INFO L138 BoogieDeclarations]: Found implementation of procedure input_register_device [2019-09-20 13:32:27,879 INFO L138 BoogieDeclarations]: Found implementation of procedure input_set_abs_params [2019-09-20 13:32:27,879 INFO L138 BoogieDeclarations]: Found implementation of procedure input_unregister_device [2019-09-20 13:32:27,880 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_return_value [2019-09-20 13:32:27,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-09-20 13:32:27,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undefined_pointer [2019-09-20 13:32:27,881 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-09-20 13:32:27,882 INFO L138 BoogieDeclarations]: Found implementation of procedure strlcat [2019-09-20 13:32:27,882 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_deregister [2019-09-20 13:32:27,882 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_kill_urb [2019-09-20 13:32:27,882 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_register_driver [2019-09-20 13:32:27,883 INFO L138 BoogieDeclarations]: Found implementation of procedure usb_submit_urb [2019-09-20 13:32:27,883 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-09-20 13:32:27,883 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-09-20 13:32:27,884 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:32:27,884 INFO L130 BoogieDeclarations]: Found specification of procedure __le16_to_cpup [2019-09-20 13:32:27,885 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:32:27,885 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-09-20 13:32:27,886 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2019-09-20 13:32:27,886 INFO L130 BoogieDeclarations]: Found specification of procedure strlcat [2019-09-20 13:32:27,886 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-09-20 13:32:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2019-09-20 13:32:27,887 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2019-09-20 13:32:27,888 INFO L130 BoogieDeclarations]: Found specification of procedure kzalloc [2019-09-20 13:32:27,888 INFO L130 BoogieDeclarations]: Found specification of procedure init_module [2019-09-20 13:32:27,888 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup_module [2019-09-20 13:32:27,888 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2019-09-20 13:32:27,889 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2019-09-20 13:32:27,889 INFO L130 BoogieDeclarations]: Found specification of procedure usb_get_intfdata [2019-09-20 13:32:27,889 INFO L130 BoogieDeclarations]: Found specification of procedure usb_set_intfdata [2019-09-20 13:32:27,889 INFO L130 BoogieDeclarations]: Found specification of procedure interface_to_usbdev [2019-09-20 13:32:27,890 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:32:27,891 INFO L130 BoogieDeclarations]: Found specification of procedure usb_make_path [2019-09-20 13:32:27,891 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-20 13:32:27,891 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register_driver [2019-09-20 13:32:27,891 INFO L130 BoogieDeclarations]: Found specification of procedure usb_register [2019-09-20 13:32:27,891 INFO L130 BoogieDeclarations]: Found specification of procedure usb_deregister [2019-09-20 13:32:27,892 INFO L130 BoogieDeclarations]: Found specification of procedure usb_fill_int_urb [2019-09-20 13:32:27,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:32:27,893 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:32:27,893 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_urb [2019-09-20 13:32:27,893 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_urb [2019-09-20 13:32:27,893 INFO L130 BoogieDeclarations]: Found specification of procedure usb_submit_urb [2019-09-20 13:32:27,895 INFO L130 BoogieDeclarations]: Found specification of procedure usb_kill_urb [2019-09-20 13:32:27,895 INFO L130 BoogieDeclarations]: Found specification of procedure usb_alloc_coherent [2019-09-20 13:32:27,897 INFO L130 BoogieDeclarations]: Found specification of procedure usb_free_coherent [2019-09-20 13:32:27,897 INFO L130 BoogieDeclarations]: Found specification of procedure __create_pipe [2019-09-20 13:32:27,897 INFO L130 BoogieDeclarations]: Found specification of procedure input_allocate_device [2019-09-20 13:32:27,897 INFO L130 BoogieDeclarations]: Found specification of procedure input_free_device [2019-09-20 13:32:27,898 INFO L130 BoogieDeclarations]: Found specification of procedure input_get_drvdata [2019-09-20 13:32:27,898 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_drvdata [2019-09-20 13:32:27,898 INFO L130 BoogieDeclarations]: Found specification of procedure input_register_device [2019-09-20 13:32:27,898 INFO L130 BoogieDeclarations]: Found specification of procedure input_unregister_device [2019-09-20 13:32:27,899 INFO L130 BoogieDeclarations]: Found specification of procedure input_event [2019-09-20 13:32:27,899 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_key [2019-09-20 13:32:27,899 INFO L130 BoogieDeclarations]: Found specification of procedure input_report_abs [2019-09-20 13:32:27,899 INFO L130 BoogieDeclarations]: Found specification of procedure input_sync [2019-09-20 13:32:27,899 INFO L130 BoogieDeclarations]: Found specification of procedure input_set_abs_params [2019-09-20 13:32:27,900 INFO L130 BoogieDeclarations]: Found specification of procedure usb_to_input_id [2019-09-20 13:32:27,900 INFO L130 BoogieDeclarations]: Found specification of procedure get_unaligned_le16 [2019-09-20 13:32:27,900 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_irq [2019-09-20 13:32:27,900 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_open [2019-09-20 13:32:27,901 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_close [2019-09-20 13:32:27,901 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_probe [2019-09-20 13:32:27,901 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_disconnect [2019-09-20 13:32:27,901 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_init [2019-09-20 13:32:27,902 INFO L130 BoogieDeclarations]: Found specification of procedure kbtab_exit [2019-09-20 13:32:27,902 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-09-20 13:32:27,902 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_return_value [2019-09-20 13:32:27,903 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-09-20 13:32:27,903 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:32:27,903 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:32:27,903 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_blast_assert [2019-09-20 13:32:27,904 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undefined_pointer [2019-09-20 13:32:27,906 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_assume_stop [2019-09-20 13:32:27,907 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-09-20 13:32:27,907 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-09-20 13:32:27,909 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-20 13:32:27,909 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-20 13:32:27,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:32:27,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:32:27,911 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-20 13:32:27,912 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-20 13:32:27,912 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:32:28,781 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:32:28,869 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##18: assume false; [2019-09-20 13:32:28,869 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##19: assume !false; [2019-09-20 13:32:29,156 WARN L730 $ProcedureCfgBuilder]: Label in the middle of a codeblock. [2019-09-20 13:32:29,219 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##9: assume false; [2019-09-20 13:32:29,220 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##10: assume !false; [2019-09-20 13:32:29,438 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_assume_stopFINAL: assume true; [2019-09-20 13:32:29,895 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:32:29,895 INFO L283 CfgBuilder]: Removed 7 assume(true) statements. [2019-09-20 13:32:29,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:32:29 BoogieIcfgContainer [2019-09-20 13:32:29,897 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:32:29,898 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:32:29,898 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:32:29,901 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:32:29,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:32:25" (1/3) ... [2019-09-20 13:32:29,902 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@553a7470 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:32:29, skipping insertion in model container [2019-09-20 13:32:29,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:32:27" (2/3) ... [2019-09-20 13:32:29,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@553a7470 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:32:29, skipping insertion in model container [2019-09-20 13:32:29,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:32:29" (3/3) ... [2019-09-20 13:32:29,905 INFO L109 eAbstractionObserver]: Analyzing ICFG usb_urb-drivers-input-tablet-kbtab.ko.cil.out.i [2019-09-20 13:32:29,915 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:32:29,924 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:32:29,941 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:32:29,968 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:32:29,969 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:32:29,969 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:32:29,969 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:32:29,969 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:32:29,969 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:32:29,969 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:32:29,970 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:32:29,992 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states. [2019-09-20 13:32:30,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-20 13:32:30,003 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:30,004 INFO L407 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-20 13:32:30,006 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:30,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:30,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1845057656, now seen corresponding path program 1 times [2019-09-20 13:32:30,014 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:30,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:30,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:30,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:30,089 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:30,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:30,483 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-20 13:32:30,486 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:30,486 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:32:30,487 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:30,493 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:32:30,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:32:30,511 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:32:30,513 INFO L87 Difference]: Start difference. First operand 282 states. Second operand 3 states. [2019-09-20 13:32:30,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:30,630 INFO L93 Difference]: Finished difference Result 460 states and 531 transitions. [2019-09-20 13:32:30,631 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:32:30,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 31 [2019-09-20 13:32:30,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:30,651 INFO L225 Difference]: With dead ends: 460 [2019-09-20 13:32:30,652 INFO L226 Difference]: Without dead ends: 447 [2019-09-20 13:32:30,654 INFO L636 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-20 13:32:30,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2019-09-20 13:32:30,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 443. [2019-09-20 13:32:30,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 443 states. [2019-09-20 13:32:30,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 510 transitions. [2019-09-20 13:32:30,748 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 510 transitions. Word has length 31 [2019-09-20 13:32:30,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:30,749 INFO L475 AbstractCegarLoop]: Abstraction has 443 states and 510 transitions. [2019-09-20 13:32:30,749 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:32:30,749 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 510 transitions. [2019-09-20 13:32:30,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-09-20 13:32:30,750 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:30,750 INFO L407 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-20 13:32:30,751 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:30,751 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:30,751 INFO L82 PathProgramCache]: Analyzing trace with hash -1362410536, now seen corresponding path program 1 times [2019-09-20 13:32:30,751 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:30,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:30,758 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:30,758 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:30,759 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:30,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:30,911 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-20 13:32:30,912 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:30,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:32:30,912 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:30,914 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:32:30,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:32:30,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:32:30,915 INFO L87 Difference]: Start difference. First operand 443 states and 510 transitions. Second operand 3 states. [2019-09-20 13:32:31,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:31,008 INFO L93 Difference]: Finished difference Result 856 states and 990 transitions. [2019-09-20 13:32:31,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:32:31,009 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-09-20 13:32:31,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:31,023 INFO L225 Difference]: With dead ends: 856 [2019-09-20 13:32:31,023 INFO L226 Difference]: Without dead ends: 846 [2019-09-20 13:32:31,024 INFO L636 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-20 13:32:31,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 846 states. [2019-09-20 13:32:31,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 846 to 839. [2019-09-20 13:32:31,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2019-09-20 13:32:31,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 971 transitions. [2019-09-20 13:32:31,109 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 971 transitions. Word has length 32 [2019-09-20 13:32:31,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:31,110 INFO L475 AbstractCegarLoop]: Abstraction has 839 states and 971 transitions. [2019-09-20 13:32:31,110 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:32:31,110 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 971 transitions. [2019-09-20 13:32:31,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-20 13:32:31,113 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:31,113 INFO L407 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-20 13:32:31,114 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:31,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:31,114 INFO L82 PathProgramCache]: Analyzing trace with hash 318886314, now seen corresponding path program 1 times [2019-09-20 13:32:31,114 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:31,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:31,120 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:31,120 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:31,121 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:31,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:31,309 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-20 13:32:31,310 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:31,310 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:32:31,310 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:31,311 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:32:31,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:32:31,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:32:31,312 INFO L87 Difference]: Start difference. First operand 839 states and 971 transitions. Second operand 6 states. [2019-09-20 13:32:31,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:31,394 INFO L93 Difference]: Finished difference Result 844 states and 975 transitions. [2019-09-20 13:32:31,394 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:32:31,394 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 74 [2019-09-20 13:32:31,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:31,401 INFO L225 Difference]: With dead ends: 844 [2019-09-20 13:32:31,401 INFO L226 Difference]: Without dead ends: 839 [2019-09-20 13:32:31,402 INFO L636 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-20 13:32:31,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 839 states. [2019-09-20 13:32:31,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 839 to 839. [2019-09-20 13:32:31,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 839 states. [2019-09-20 13:32:31,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 839 states to 839 states and 970 transitions. [2019-09-20 13:32:31,460 INFO L78 Accepts]: Start accepts. Automaton has 839 states and 970 transitions. Word has length 74 [2019-09-20 13:32:31,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:31,461 INFO L475 AbstractCegarLoop]: Abstraction has 839 states and 970 transitions. [2019-09-20 13:32:31,466 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:32:31,466 INFO L276 IsEmpty]: Start isEmpty. Operand 839 states and 970 transitions. [2019-09-20 13:32:31,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2019-09-20 13:32:31,479 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:31,479 INFO L407 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-20 13:32:31,479 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:31,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:31,480 INFO L82 PathProgramCache]: Analyzing trace with hash 762786988, now seen corresponding path program 1 times [2019-09-20 13:32:31,480 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:31,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:31,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:31,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:31,487 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:31,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:31,691 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-20 13:32:31,691 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:31,691 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:32:31,691 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:31,692 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:32:31,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:32:31,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:32:31,693 INFO L87 Difference]: Start difference. First operand 839 states and 970 transitions. Second operand 3 states. [2019-09-20 13:32:31,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:31,734 INFO L93 Difference]: Finished difference Result 875 states and 1017 transitions. [2019-09-20 13:32:31,734 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:32:31,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 74 [2019-09-20 13:32:31,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:31,739 INFO L225 Difference]: With dead ends: 875 [2019-09-20 13:32:31,740 INFO L226 Difference]: Without dead ends: 874 [2019-09-20 13:32:31,740 INFO L636 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-20 13:32:31,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 874 states. [2019-09-20 13:32:31,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 874 to 874. [2019-09-20 13:32:31,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 874 states. [2019-09-20 13:32:31,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 874 states to 874 states and 1016 transitions. [2019-09-20 13:32:31,773 INFO L78 Accepts]: Start accepts. Automaton has 874 states and 1016 transitions. Word has length 74 [2019-09-20 13:32:31,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:31,773 INFO L475 AbstractCegarLoop]: Abstraction has 874 states and 1016 transitions. [2019-09-20 13:32:31,773 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:32:31,774 INFO L276 IsEmpty]: Start isEmpty. Operand 874 states and 1016 transitions. [2019-09-20 13:32:31,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-20 13:32:31,776 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:31,777 INFO L407 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-20 13:32:31,777 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:31,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:31,777 INFO L82 PathProgramCache]: Analyzing trace with hash 1064835193, now seen corresponding path program 1 times [2019-09-20 13:32:31,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:31,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:31,783 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:31,783 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:31,783 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:31,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:31,961 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-20 13:32:31,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:31,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:32:31,962 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:31,963 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:32:31,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:32:31,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:32:31,964 INFO L87 Difference]: Start difference. First operand 874 states and 1016 transitions. Second operand 5 states. [2019-09-20 13:32:31,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:31,999 INFO L93 Difference]: Finished difference Result 602 states and 692 transitions. [2019-09-20 13:32:31,999 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:32:31,999 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 129 [2019-09-20 13:32:32,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:32,003 INFO L225 Difference]: With dead ends: 602 [2019-09-20 13:32:32,004 INFO L226 Difference]: Without dead ends: 602 [2019-09-20 13:32:32,004 INFO L636 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-20 13:32:32,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 602 states. [2019-09-20 13:32:32,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 602 to 602. [2019-09-20 13:32:32,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 602 states. [2019-09-20 13:32:32,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 692 transitions. [2019-09-20 13:32:32,024 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 692 transitions. Word has length 129 [2019-09-20 13:32:32,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:32,025 INFO L475 AbstractCegarLoop]: Abstraction has 602 states and 692 transitions. [2019-09-20 13:32:32,025 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:32:32,025 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 692 transitions. [2019-09-20 13:32:32,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2019-09-20 13:32:32,027 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:32,028 INFO L407 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-20 13:32:32,028 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:32,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:32,028 INFO L82 PathProgramCache]: Analyzing trace with hash 1415635130, now seen corresponding path program 1 times [2019-09-20 13:32:32,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:32,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:32,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:32,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:32,034 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:32,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:32,233 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-20 13:32:32,233 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:32,233 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:32:32,233 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:32,234 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:32:32,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:32:32,235 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:32:32,235 INFO L87 Difference]: Start difference. First operand 602 states and 692 transitions. Second operand 6 states. [2019-09-20 13:32:34,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:34,076 INFO L93 Difference]: Finished difference Result 1090 states and 1275 transitions. [2019-09-20 13:32:34,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:32:34,076 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 129 [2019-09-20 13:32:34,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:34,085 INFO L225 Difference]: With dead ends: 1090 [2019-09-20 13:32:34,086 INFO L226 Difference]: Without dead ends: 1090 [2019-09-20 13:32:34,086 INFO L636 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-20 13:32:34,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1090 states. [2019-09-20 13:32:34,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1090 to 1051. [2019-09-20 13:32:34,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1051 states. [2019-09-20 13:32:34,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1051 states to 1051 states and 1236 transitions. [2019-09-20 13:32:34,129 INFO L78 Accepts]: Start accepts. Automaton has 1051 states and 1236 transitions. Word has length 129 [2019-09-20 13:32:34,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:34,130 INFO L475 AbstractCegarLoop]: Abstraction has 1051 states and 1236 transitions. [2019-09-20 13:32:34,130 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:32:34,130 INFO L276 IsEmpty]: Start isEmpty. Operand 1051 states and 1236 transitions. [2019-09-20 13:32:34,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-09-20 13:32:34,132 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:34,133 INFO L407 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-20 13:32:34,133 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:34,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:34,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1340956888, now seen corresponding path program 1 times [2019-09-20 13:32:34,133 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:34,140 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:34,141 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:34,141 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:34,141 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:34,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:34,300 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-20 13:32:34,300 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:34,301 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:32:34,301 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:34,302 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:32:34,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:32:34,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:32:34,302 INFO L87 Difference]: Start difference. First operand 1051 states and 1236 transitions. Second operand 5 states. [2019-09-20 13:32:34,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:34,333 INFO L93 Difference]: Finished difference Result 1048 states and 1227 transitions. [2019-09-20 13:32:34,333 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:32:34,333 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 132 [2019-09-20 13:32:34,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:34,340 INFO L225 Difference]: With dead ends: 1048 [2019-09-20 13:32:34,340 INFO L226 Difference]: Without dead ends: 1048 [2019-09-20 13:32:34,341 INFO L636 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-20 13:32:34,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2019-09-20 13:32:34,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 1048. [2019-09-20 13:32:34,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1048 states. [2019-09-20 13:32:34,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1048 states to 1048 states and 1227 transitions. [2019-09-20 13:32:34,381 INFO L78 Accepts]: Start accepts. Automaton has 1048 states and 1227 transitions. Word has length 132 [2019-09-20 13:32:34,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:34,382 INFO L475 AbstractCegarLoop]: Abstraction has 1048 states and 1227 transitions. [2019-09-20 13:32:34,382 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:32:34,382 INFO L276 IsEmpty]: Start isEmpty. Operand 1048 states and 1227 transitions. [2019-09-20 13:32:34,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-09-20 13:32:34,386 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:34,386 INFO L407 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-20 13:32:34,386 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:34,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:34,387 INFO L82 PathProgramCache]: Analyzing trace with hash -986593187, now seen corresponding path program 1 times [2019-09-20 13:32:34,387 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:34,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:34,392 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:34,392 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:34,393 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:34,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:34,566 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-20 13:32:34,567 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:34,567 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:32:34,567 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:34,568 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:32:34,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:32:34,569 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:32:34,569 INFO L87 Difference]: Start difference. First operand 1048 states and 1227 transitions. Second operand 6 states. [2019-09-20 13:32:34,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:34,682 INFO L93 Difference]: Finished difference Result 1070 states and 1264 transitions. [2019-09-20 13:32:34,682 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:32:34,683 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 149 [2019-09-20 13:32:34,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:34,689 INFO L225 Difference]: With dead ends: 1070 [2019-09-20 13:32:34,689 INFO L226 Difference]: Without dead ends: 1049 [2019-09-20 13:32:34,690 INFO L636 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-20 13:32:34,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1049 states. [2019-09-20 13:32:34,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1049 to 1014. [2019-09-20 13:32:34,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1014 states. [2019-09-20 13:32:34,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1014 states to 1014 states and 1206 transitions. [2019-09-20 13:32:34,725 INFO L78 Accepts]: Start accepts. Automaton has 1014 states and 1206 transitions. Word has length 149 [2019-09-20 13:32:34,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:34,726 INFO L475 AbstractCegarLoop]: Abstraction has 1014 states and 1206 transitions. [2019-09-20 13:32:34,726 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:32:34,726 INFO L276 IsEmpty]: Start isEmpty. Operand 1014 states and 1206 transitions. [2019-09-20 13:32:34,730 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-09-20 13:32:34,730 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:34,731 INFO L407 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-20 13:32:34,732 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:34,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:34,733 INFO L82 PathProgramCache]: Analyzing trace with hash -8974513, now seen corresponding path program 1 times [2019-09-20 13:32:34,733 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:34,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:34,739 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:34,739 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:34,739 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:34,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:34,957 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-20 13:32:34,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:34,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:32:34,958 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:34,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:32:34,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:32:34,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:32:34,960 INFO L87 Difference]: Start difference. First operand 1014 states and 1206 transitions. Second operand 3 states. [2019-09-20 13:32:34,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:34,976 INFO L93 Difference]: Finished difference Result 952 states and 1111 transitions. [2019-09-20 13:32:34,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:32:34,977 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-09-20 13:32:34,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:34,985 INFO L225 Difference]: With dead ends: 952 [2019-09-20 13:32:34,985 INFO L226 Difference]: Without dead ends: 952 [2019-09-20 13:32:34,986 INFO L636 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-20 13:32:34,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2019-09-20 13:32:35,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 952. [2019-09-20 13:32:35,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 952 states. [2019-09-20 13:32:35,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 952 states to 952 states and 1111 transitions. [2019-09-20 13:32:35,035 INFO L78 Accepts]: Start accepts. Automaton has 952 states and 1111 transitions. Word has length 157 [2019-09-20 13:32:35,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:35,036 INFO L475 AbstractCegarLoop]: Abstraction has 952 states and 1111 transitions. [2019-09-20 13:32:35,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:32:35,036 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1111 transitions. [2019-09-20 13:32:35,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-09-20 13:32:35,040 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:35,040 INFO L407 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-20 13:32:35,041 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:35,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:35,041 INFO L82 PathProgramCache]: Analyzing trace with hash 474096884, now seen corresponding path program 1 times [2019-09-20 13:32:35,041 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:35,046 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:35,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:35,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:35,047 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:35,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:35,273 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-20 13:32:35,274 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:35,274 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:32:35,274 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:35,275 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:32:35,276 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:32:35,276 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:32:35,277 INFO L87 Difference]: Start difference. First operand 952 states and 1111 transitions. Second operand 5 states. [2019-09-20 13:32:35,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:35,322 INFO L93 Difference]: Finished difference Result 960 states and 1116 transitions. [2019-09-20 13:32:35,323 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:32:35,323 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 159 [2019-09-20 13:32:35,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:35,329 INFO L225 Difference]: With dead ends: 960 [2019-09-20 13:32:35,329 INFO L226 Difference]: Without dead ends: 960 [2019-09-20 13:32:35,330 INFO L636 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-20 13:32:35,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 960 states. [2019-09-20 13:32:35,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 960 to 960. [2019-09-20 13:32:35,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 960 states. [2019-09-20 13:32:35,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 960 states to 960 states and 1116 transitions. [2019-09-20 13:32:35,373 INFO L78 Accepts]: Start accepts. Automaton has 960 states and 1116 transitions. Word has length 159 [2019-09-20 13:32:35,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:35,376 INFO L475 AbstractCegarLoop]: Abstraction has 960 states and 1116 transitions. [2019-09-20 13:32:35,376 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:32:35,378 INFO L276 IsEmpty]: Start isEmpty. Operand 960 states and 1116 transitions. [2019-09-20 13:32:35,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2019-09-20 13:32:35,381 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:35,381 INFO L407 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-20 13:32:35,381 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:35,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:35,382 INFO L82 PathProgramCache]: Analyzing trace with hash -782323349, now seen corresponding path program 1 times [2019-09-20 13:32:35,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:35,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:35,387 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:35,387 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:35,388 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:35,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:35,808 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-20 13:32:35,809 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:35,809 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-09-20 13:32:35,809 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:35,810 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-09-20 13:32:35,810 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-09-20 13:32:35,810 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:32:35,811 INFO L87 Difference]: Start difference. First operand 960 states and 1116 transitions. Second operand 8 states. [2019-09-20 13:32:37,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:37,610 INFO L93 Difference]: Finished difference Result 1421 states and 1749 transitions. [2019-09-20 13:32:37,611 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 13:32:37,611 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 160 [2019-09-20 13:32:37,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:37,624 INFO L225 Difference]: With dead ends: 1421 [2019-09-20 13:32:37,625 INFO L226 Difference]: Without dead ends: 1390 [2019-09-20 13:32:37,628 INFO L636 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-20 13:32:37,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1390 states. [2019-09-20 13:32:37,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1390 to 1191. [2019-09-20 13:32:37,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1191 states. [2019-09-20 13:32:37,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1191 states to 1191 states and 1379 transitions. [2019-09-20 13:32:37,687 INFO L78 Accepts]: Start accepts. Automaton has 1191 states and 1379 transitions. Word has length 160 [2019-09-20 13:32:37,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:37,687 INFO L475 AbstractCegarLoop]: Abstraction has 1191 states and 1379 transitions. [2019-09-20 13:32:37,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-09-20 13:32:37,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1191 states and 1379 transitions. [2019-09-20 13:32:37,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-20 13:32:37,691 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:37,691 INFO L407 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-20 13:32:37,691 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:37,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:37,692 INFO L82 PathProgramCache]: Analyzing trace with hash 1069171554, now seen corresponding path program 1 times [2019-09-20 13:32:37,692 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:37,697 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:37,698 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:37,698 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:37,698 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:37,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:37,957 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-20 13:32:37,958 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:37,958 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:32:37,958 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:37,959 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:32:37,959 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:32:37,959 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:32:37,960 INFO L87 Difference]: Start difference. First operand 1191 states and 1379 transitions. Second operand 5 states. [2019-09-20 13:32:37,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:37,982 INFO L93 Difference]: Finished difference Result 707 states and 802 transitions. [2019-09-20 13:32:37,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:32:37,983 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 187 [2019-09-20 13:32:37,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:37,987 INFO L225 Difference]: With dead ends: 707 [2019-09-20 13:32:37,987 INFO L226 Difference]: Without dead ends: 681 [2019-09-20 13:32:37,988 INFO L636 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-20 13:32:37,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 681 states. [2019-09-20 13:32:38,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 681 to 681. [2019-09-20 13:32:38,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 681 states. [2019-09-20 13:32:38,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 776 transitions. [2019-09-20 13:32:38,014 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 776 transitions. Word has length 187 [2019-09-20 13:32:38,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:38,015 INFO L475 AbstractCegarLoop]: Abstraction has 681 states and 776 transitions. [2019-09-20 13:32:38,015 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:32:38,015 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 776 transitions. [2019-09-20 13:32:38,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2019-09-20 13:32:38,021 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:38,021 INFO L407 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-20 13:32:38,022 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:38,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:38,022 INFO L82 PathProgramCache]: Analyzing trace with hash -1039861695, now seen corresponding path program 1 times [2019-09-20 13:32:38,022 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:38,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:38,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:38,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:38,029 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:38,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:38,352 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-20 13:32:38,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:38,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:32:38,353 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:38,354 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:32:38,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:32:38,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:32:38,355 INFO L87 Difference]: Start difference. First operand 681 states and 776 transitions. Second operand 6 states. [2019-09-20 13:32:39,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:39,892 INFO L93 Difference]: Finished difference Result 1089 states and 1249 transitions. [2019-09-20 13:32:39,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-20 13:32:39,893 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 187 [2019-09-20 13:32:39,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:39,899 INFO L225 Difference]: With dead ends: 1089 [2019-09-20 13:32:39,899 INFO L226 Difference]: Without dead ends: 1089 [2019-09-20 13:32:39,899 INFO L636 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-20 13:32:39,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1089 states. [2019-09-20 13:32:39,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1089 to 1042. [2019-09-20 13:32:39,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1042 states. [2019-09-20 13:32:39,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1042 states to 1042 states and 1205 transitions. [2019-09-20 13:32:39,938 INFO L78 Accepts]: Start accepts. Automaton has 1042 states and 1205 transitions. Word has length 187 [2019-09-20 13:32:39,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:39,939 INFO L475 AbstractCegarLoop]: Abstraction has 1042 states and 1205 transitions. [2019-09-20 13:32:39,939 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:32:39,939 INFO L276 IsEmpty]: Start isEmpty. Operand 1042 states and 1205 transitions. [2019-09-20 13:32:39,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2019-09-20 13:32:39,942 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:39,942 INFO L407 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-20 13:32:39,943 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:39,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:39,943 INFO L82 PathProgramCache]: Analyzing trace with hash 1634987359, now seen corresponding path program 1 times [2019-09-20 13:32:39,944 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:39,947 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:39,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:39,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:39,948 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:40,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:40,158 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-20 13:32:40,158 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:32:40,158 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:32:40,158 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:40,159 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:32:40,159 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:32:40,160 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:32:40,160 INFO L87 Difference]: Start difference. First operand 1042 states and 1205 transitions. Second operand 5 states. [2019-09-20 13:32:40,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:40,210 INFO L93 Difference]: Finished difference Result 1077 states and 1239 transitions. [2019-09-20 13:32:40,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:32:40,210 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 207 [2019-09-20 13:32:40,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:40,216 INFO L225 Difference]: With dead ends: 1077 [2019-09-20 13:32:40,217 INFO L226 Difference]: Without dead ends: 1077 [2019-09-20 13:32:40,217 INFO L636 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-20 13:32:40,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1077 states. [2019-09-20 13:32:40,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1077 to 1054. [2019-09-20 13:32:40,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1054 states. [2019-09-20 13:32:40,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1054 states to 1054 states and 1216 transitions. [2019-09-20 13:32:40,252 INFO L78 Accepts]: Start accepts. Automaton has 1054 states and 1216 transitions. Word has length 207 [2019-09-20 13:32:40,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:40,252 INFO L475 AbstractCegarLoop]: Abstraction has 1054 states and 1216 transitions. [2019-09-20 13:32:40,252 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:32:40,253 INFO L276 IsEmpty]: Start isEmpty. Operand 1054 states and 1216 transitions. [2019-09-20 13:32:40,256 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 212 [2019-09-20 13:32:40,256 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:32:40,256 INFO L407 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-20 13:32:40,257 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ldv_blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:32:40,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:40,257 INFO L82 PathProgramCache]: Analyzing trace with hash 750070294, now seen corresponding path program 1 times [2019-09-20 13:32:40,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:32:40,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:40,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:32:40,262 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:32:40,262 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:32:40,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:32:40,436 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-20 13:32:40,436 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:32:40,437 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:32:40,438 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 212 with the following transitions: [2019-09-20 13:32:40,440 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-20 13:32:40,514 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-20 13:32:40,514 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-20 13:32:40,599 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-20 13:32:40,602 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-20 13:32:40,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:32:40,608 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-20 13:32:40,701 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-20 13:32:40,702 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-20 13:32:40,713 INFO L420 sIntCurrentIteration]: We unified 210 AI predicates to 210 [2019-09-20 13:32:40,714 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-20 13:32:40,715 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 13:32:40,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2019-09-20 13:32:40,717 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:32:40,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-20 13:32:40,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-20 13:32:40,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 13:32:40,718 INFO L87 Difference]: Start difference. First operand 1054 states and 1216 transitions. Second operand 2 states. [2019-09-20 13:32:40,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:32:40,719 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-20 13:32:40,719 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-20 13:32:40,719 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 211 [2019-09-20 13:32:40,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:32:40,720 INFO L225 Difference]: With dead ends: 2 [2019-09-20 13:32:40,720 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 13:32:40,721 INFO L636 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-20 13:32:40,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 13:32:40,722 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 13:32:40,722 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 13:32:40,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 13:32:40,725 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 211 [2019-09-20 13:32:40,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:32:40,725 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 13:32:40,725 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-20 13:32:40,725 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 13:32:40,725 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 13:32:40,732 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:32:40 BoogieIcfgContainer [2019-09-20 13:32:40,732 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 13:32:40,735 INFO L168 Benchmark]: Toolchain (without parser) took 14729.73 ms. Allocated memory was 132.1 MB in the beginning and 474.0 MB in the end (delta: 341.8 MB). Free memory was 82.6 MB in the beginning and 187.9 MB in the end (delta: -105.3 MB). Peak memory consumption was 236.5 MB. Max. memory is 7.1 GB. [2019-09-20 13:32:40,737 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 132.1 MB. Free memory was 106.1 MB in the beginning and 105.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-09-20 13:32:40,739 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1497.72 ms. Allocated memory was 132.1 MB in the beginning and 202.4 MB in the end (delta: 70.3 MB). Free memory was 82.2 MB in the beginning and 115.0 MB in the end (delta: -32.8 MB). Peak memory consumption was 42.7 MB. Max. memory is 7.1 GB. [2019-09-20 13:32:40,743 INFO L168 Benchmark]: Boogie Preprocessor took 248.47 ms. Allocated memory is still 202.4 MB. Free memory was 115.0 MB in the beginning and 108.0 MB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 7.1 GB. [2019-09-20 13:32:40,744 INFO L168 Benchmark]: RCFGBuilder took 2144.82 ms. Allocated memory was 202.4 MB in the beginning and 273.7 MB in the end (delta: 71.3 MB). Free memory was 108.0 MB in the beginning and 214.1 MB in the end (delta: -106.2 MB). Peak memory consumption was 72.6 MB. Max. memory is 7.1 GB. [2019-09-20 13:32:40,746 INFO L168 Benchmark]: TraceAbstraction took 10834.20 ms. Allocated memory was 273.7 MB in the beginning and 474.0 MB in the end (delta: 200.3 MB). Free memory was 214.1 MB in the beginning and 187.9 MB in the end (delta: 26.2 MB). Peak memory consumption was 226.5 MB. Max. memory is 7.1 GB. [2019-09-20 13:32:40,756 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.23 ms. Allocated memory is still 132.1 MB. Free memory was 106.1 MB in the beginning and 105.9 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1497.72 ms. Allocated memory was 132.1 MB in the beginning and 202.4 MB in the end (delta: 70.3 MB). Free memory was 82.2 MB in the beginning and 115.0 MB in the end (delta: -32.8 MB). Peak memory consumption was 42.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 248.47 ms. Allocated memory is still 202.4 MB. Free memory was 115.0 MB in the beginning and 108.0 MB in the end (delta: 7.1 MB). Peak memory consumption was 7.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2144.82 ms. Allocated memory was 202.4 MB in the beginning and 273.7 MB in the end (delta: 71.3 MB). Free memory was 108.0 MB in the beginning and 214.1 MB in the end (delta: -106.2 MB). Peak memory consumption was 72.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 10834.20 ms. Allocated memory was 273.7 MB in the beginning and 474.0 MB in the end (delta: 200.3 MB). Free memory was 214.1 MB in the beginning and 187.9 MB in the end (delta: 26.2 MB). Peak memory consumption was 226.5 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, 10.7s OverallTime, 15 OverallIterations, 4 TraceHistogramMax, 5.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 4188 SDtfs, 2553 SDslu, 7835 SDs, 0 SdLazy, 2225 SolverSat, 793 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 307 GetRequests, 252 SyntacticMatches, 1 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.7s 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.6s AutomataMinimizationTime, 15 MinimizatonAttempts, 354 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 2.0s InterpolantComputationTime, 2018 NumberOfCodeBlocks, 2018 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 2003 ConstructedInterpolants, 0 QuantifiedInterpolants, 449077 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...