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-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 01:48:56,893 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 01:48:56,896 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 01:48:56,911 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 01:48:56,911 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 01:48:56,913 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 01:48:56,914 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 01:48:56,916 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 01:48:56,918 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 01:48:56,919 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 01:48:56,920 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 01:48:56,921 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 01:48:56,921 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 01:48:56,922 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 01:48:56,923 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 01:48:56,924 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 01:48:56,925 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 01:48:56,926 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 01:48:56,928 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 01:48:56,930 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 01:48:56,931 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 01:48:56,932 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 01:48:56,933 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 01:48:56,934 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 01:48:56,937 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 01:48:56,938 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 01:48:56,938 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 01:48:56,939 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 01:48:56,939 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 01:48:56,941 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 01:48:56,942 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 01:48:56,944 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 01:48:56,945 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 01:48:56,946 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 01:48:56,947 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 01:48:56,947 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 01:48:56,948 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 01:48:56,948 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 01:48:56,950 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 01:48:56,951 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 01:48:56,952 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 01:48:56,955 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-10-03 01:48:56,979 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 01:48:56,980 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 01:48:56,981 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 01:48:56,981 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 01:48:56,982 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 01:48:56,982 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 01:48:56,982 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 01:48:56,982 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 01:48:56,982 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 01:48:56,983 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 01:48:56,985 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 01:48:56,985 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 01:48:56,986 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 01:48:56,986 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 01:48:56,986 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 01:48:56,986 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 01:48:56,987 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 01:48:56,987 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 01:48:56,987 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 01:48:56,987 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 01:48:56,988 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 01:48:56,988 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 01:48:56,988 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 01:48:56,988 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 01:48:56,989 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 01:48:56,989 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 01:48:56,989 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 01:48:56,989 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 01:48:56,989 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 01:48:56,990 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 01:48:57,046 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 01:48:57,065 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 01:48:57,070 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 01:48:57,072 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 01:48:57,073 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 01:48:57,074 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru.ko-entry_point.cil.out.i [2019-10-03 01:48:57,151 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24b6f60b9/69e5dbe4002d4448bd46afc988a2d047/FLAGc9a90f429 [2019-10-03 01:48:57,966 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 01:48:57,967 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru.ko-entry_point.cil.out.i [2019-10-03 01:48:58,005 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24b6f60b9/69e5dbe4002d4448bd46afc988a2d047/FLAGc9a90f429 [2019-10-03 01:48:58,508 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/24b6f60b9/69e5dbe4002d4448bd46afc988a2d047 [2019-10-03 01:48:58,518 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 01:48:58,519 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 01:48:58,520 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 01:48:58,521 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 01:48:58,524 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 01:48:58,526 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 01:48:58" (1/1) ... [2019-10-03 01:48:58,529 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1437ab1e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 01:48:58, skipping insertion in model container [2019-10-03 01:48:58,529 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 01:48:58" (1/1) ... [2019-10-03 01:48:58,537 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 01:48:58,674 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 01:49:00,410 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 01:49:00,464 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 01:49:00,823 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 01:49:01,380 INFO L192 MainTranslator]: Completed translation [2019-10-03 01:49:01,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 01:49:01 WrapperNode [2019-10-03 01:49:01,382 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 01:49:01,383 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 01:49:01,384 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 01:49:01,384 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 01:49:01,406 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 01:49:01" (1/1) ... [2019-10-03 01:49:01,408 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 01:49:01" (1/1) ... [2019-10-03 01:49:01,541 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 01:49:01" (1/1) ... [2019-10-03 01:49:01,542 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 01:49:01" (1/1) ... [2019-10-03 01:49:01,701 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 01:49:01" (1/1) ... [2019-10-03 01:49:01,733 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 01:49:01" (1/1) ... [2019-10-03 01:49:01,790 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 01:49:01" (1/1) ... [2019-10-03 01:49:01,839 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 01:49:01,840 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 01:49:01,840 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 01:49:01,841 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 01:49:01,842 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 01:49:01" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 01:49:01,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 01:49:01,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 01:49:01,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2019-10-03 01:49:01,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2019-10-03 01:49:01,932 INFO L138 BoogieDeclarations]: Found implementation of procedure kstrtoul [2019-10-03 01:49:01,933 INFO L138 BoogieDeclarations]: Found implementation of procedure get_current [2019-10-03 01:49:01,933 INFO L138 BoogieDeclarations]: Found implementation of procedure slow_down_io [2019-10-03 01:49:01,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-10-03 01:49:01,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-10-03 01:49:01,933 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2019-10-03 01:49:01,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2019-10-03 01:49:01,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2019-10-03 01:49:01,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ptr [2019-10-03 01:49:01,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2019-10-03 01:49:01,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-10-03 01:49:01,941 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-10-03 01:49:01,941 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2019-10-03 01:49:01,941 INFO L138 BoogieDeclarations]: Found implementation of procedure inb [2019-10-03 01:49:01,941 INFO L138 BoogieDeclarations]: Found implementation of procedure inb_p [2019-10-03 01:49:01,942 INFO L138 BoogieDeclarations]: Found implementation of procedure devm_kzalloc [2019-10-03 01:49:01,942 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2019-10-03 01:49:01,942 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2019-10-03 01:49:01,942 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2019-10-03 01:49:01,942 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_set_drvdata [2019-10-03 01:49:01,943 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_wait [2019-10-03 01:49:01,943 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_ready [2019-10-03 01:49:01,943 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_send_address [2019-10-03 01:49:01,944 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_read [2019-10-03 01:49:01,944 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_write [2019-10-03 01:49:01,944 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_detect_bank1_sensor_type [2019-10-03 01:49:01,944 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_detect_no_bank2_sensors [2019-10-03 01:49:01,944 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_detect_no_pwms [2019-10-03 01:49:01,944 INFO L138 BoogieDeclarations]: Found implementation of procedure show_bank1_value [2019-10-03 01:49:01,944 INFO L138 BoogieDeclarations]: Found implementation of procedure show_bank1_setting [2019-10-03 01:49:01,945 INFO L138 BoogieDeclarations]: Found implementation of procedure show_bank2_value [2019-10-03 01:49:01,945 INFO L138 BoogieDeclarations]: Found implementation of procedure show_bank2_setting [2019-10-03 01:49:01,945 INFO L138 BoogieDeclarations]: Found implementation of procedure store_bank1_setting [2019-10-03 01:49:01,946 INFO L138 BoogieDeclarations]: Found implementation of procedure store_bank2_setting [2019-10-03 01:49:01,946 INFO L138 BoogieDeclarations]: Found implementation of procedure show_bank1_alarm [2019-10-03 01:49:01,946 INFO L138 BoogieDeclarations]: Found implementation of procedure show_bank2_alarm [2019-10-03 01:49:01,946 INFO L138 BoogieDeclarations]: Found implementation of procedure show_bank1_mask [2019-10-03 01:49:01,946 INFO L138 BoogieDeclarations]: Found implementation of procedure show_bank2_mask [2019-10-03 01:49:01,947 INFO L138 BoogieDeclarations]: Found implementation of procedure store_bank1_mask [2019-10-03 01:49:01,947 INFO L138 BoogieDeclarations]: Found implementation of procedure store_bank2_mask [2019-10-03 01:49:01,947 INFO L138 BoogieDeclarations]: Found implementation of procedure show_pwm_setting [2019-10-03 01:49:01,947 INFO L138 BoogieDeclarations]: Found implementation of procedure store_pwm_setting [2019-10-03 01:49:01,947 INFO L138 BoogieDeclarations]: Found implementation of procedure show_pwm_sensor [2019-10-03 01:49:01,947 INFO L138 BoogieDeclarations]: Found implementation of procedure store_pwm_sensor [2019-10-03 01:49:01,948 INFO L138 BoogieDeclarations]: Found implementation of procedure show_pwm_enable [2019-10-03 01:49:01,948 INFO L138 BoogieDeclarations]: Found implementation of procedure store_pwm_enable [2019-10-03 01:49:01,948 INFO L138 BoogieDeclarations]: Found implementation of procedure show_name [2019-10-03 01:49:01,948 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_probe [2019-10-03 01:49:01,948 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_remove [2019-10-03 01:49:01,948 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_update_device [2019-10-03 01:49:01,949 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_suspend [2019-10-03 01:49:01,949 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_resume [2019-10-03 01:49:01,949 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_detect [2019-10-03 01:49:01,949 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_init [2019-10-03 01:49:01,949 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru_exit [2019-10-03 01:49:01,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_platform_probe_1 [2019-10-03 01:49:01,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_pm_ops_2 [2019-10-03 01:49:01,950 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_platform_driver_init_1 [2019-10-03 01:49:01,951 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 01:49:01,951 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2019-10-03 01:49:01,951 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2019-10-03 01:49:01,951 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_5 [2019-10-03 01:49:01,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_6 [2019-10-03 01:49:01,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_7 [2019-10-03 01:49:01,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_8 [2019-10-03 01:49:01,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_9 [2019-10-03 01:49:01,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_10 [2019-10-03 01:49:01,952 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_11 [2019-10-03 01:49:01,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_12 [2019-10-03 01:49:01,953 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_13 [2019-10-03 01:49:01,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_14 [2019-10-03 01:49:01,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_15 [2019-10-03 01:49:01,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_16 [2019-10-03 01:49:01,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_17 [2019-10-03 01:49:01,954 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_18 [2019-10-03 01:49:01,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_19 [2019-10-03 01:49:01,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_20 [2019-10-03 01:49:01,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_21 [2019-10-03 01:49:01,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_22 [2019-10-03 01:49:01,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_23 [2019-10-03 01:49:01,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_24 [2019-10-03 01:49:01,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_25 [2019-10-03 01:49:01,957 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_26 [2019-10-03 01:49:01,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_27 [2019-10-03 01:49:01,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv___platform_driver_register_28 [2019-10-03 01:49:01,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_platform_driver_unregister_29 [2019-10-03 01:49:01,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_platform_driver_unregister_30 [2019-10-03 01:49:01,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-10-03 01:49:01,958 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_negative [2019-10-03 01:49:01,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2019-10-03 01:49:01,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_err_ptr [2019-10-03 01:49:01,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_ptr_err [2019-10-03 01:49:01,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err_or_null [2019-10-03 01:49:01,959 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_lock [2019-10-03 01:49:01,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_lock [2019-10-03 01:49:01,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_lock [2019-10-03 01:49:01,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_lock [2019-10-03 01:49:01,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_lock [2019-10-03 01:49:01,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_lock [2019-10-03 01:49:01,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_lock [2019-10-03 01:49:01,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_lock [2019-10-03 01:49:01,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_trylock_device_lock [2019-10-03 01:49:01,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_for_reset_lock [2019-10-03 01:49:01,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_unlock_device_lock [2019-10-03 01:49:01,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_mutex_of_device [2019-10-03 01:49:01,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_mutex_of_device [2019-10-03 01:49:01,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mutex_of_device [2019-10-03 01:49:01,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_mutex_of_device [2019-10-03 01:49:01,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_mutex_of_device [2019-10-03 01:49:01,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_mutex_of_device [2019-10-03 01:49:01,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mutex_of_device [2019-10-03 01:49:01,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_mutex_of_device [2019-10-03 01:49:01,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_trylock_device_mutex_of_device [2019-10-03 01:49:01,963 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_for_reset_mutex_of_device [2019-10-03 01:49:01,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_unlock_device_mutex_of_device [2019-10-03 01:49:01,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_update_lock_of_abituguru_data [2019-10-03 01:49:01,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_update_lock_of_abituguru_data [2019-10-03 01:49:01,964 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_update_lock_of_abituguru_data [2019-10-03 01:49:01,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_update_lock_of_abituguru_data [2019-10-03 01:49:01,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_update_lock_of_abituguru_data [2019-10-03 01:49:01,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_update_lock_of_abituguru_data [2019-10-03 01:49:01,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_update_lock_of_abituguru_data [2019-10-03 01:49:01,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_update_lock_of_abituguru_data [2019-10-03 01:49:01,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_trylock_device_update_lock_of_abituguru_data [2019-10-03 01:49:01,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_for_reset_update_lock_of_abituguru_data [2019-10-03 01:49:01,966 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_unlock_device_update_lock_of_abituguru_data [2019-10-03 01:49:01,967 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-10-03 01:49:01,967 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_pr_debug [2019-10-03 01:49:01,967 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2019-10-03 01:49:01,967 INFO L138 BoogieDeclarations]: Found implementation of procedure __platform_driver_register [2019-10-03 01:49:01,967 INFO L138 BoogieDeclarations]: Found implementation of procedure device_create_file [2019-10-03 01:49:01,967 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2019-10-03 01:49:01,968 INFO L138 BoogieDeclarations]: Found implementation of procedure devm_kmalloc [2019-10-03 01:49:01,968 INFO L138 BoogieDeclarations]: Found implementation of procedure dmi_get_system_info [2019-10-03 01:49:01,969 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_register [2019-10-03 01:49:01,972 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_unregister [2019-10-03 01:49:01,973 INFO L138 BoogieDeclarations]: Found implementation of procedure kstrtoull [2019-10-03 01:49:01,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_complete_2 [2019-10-03 01:49:01,974 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_freeze_late_2 [2019-10-03 01:49:01,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_freeze_noirq_2 [2019-10-03 01:49:01,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-10-03 01:49:01,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_poweroff_late_2 [2019-10-03 01:49:01,981 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_poweroff_noirq_2 [2019-10-03 01:49:01,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_prepare_2 [2019-10-03 01:49:01,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_restore_early_2 [2019-10-03 01:49:01,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_restore_noirq_2 [2019-10-03 01:49:01,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_resume_early_2 [2019-10-03 01:49:01,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_resume_noirq_2 [2019-10-03 01:49:01,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_suspend_late_2 [2019-10-03 01:49:01,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_suspend_noirq_2 [2019-10-03 01:49:01,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_thaw_early_2 [2019-10-03 01:49:01,983 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_thaw_noirq_2 [2019-10-03 01:49:01,983 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2019-10-03 01:49:01,983 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2019-10-03 01:49:01,983 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_trylock [2019-10-03 01:49:01,984 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2019-10-03 01:49:01,984 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_device_add [2019-10-03 01:49:01,984 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_device_add_resources [2019-10-03 01:49:01,984 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_device_alloc [2019-10-03 01:49:01,984 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_device_put [2019-10-03 01:49:01,984 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_device_unregister [2019-10-03 01:49:01,984 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_driver_unregister [2019-10-03 01:49:01,984 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_resource [2019-10-03 01:49:01,985 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-10-03 01:49:01,985 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_timeout [2019-10-03 01:49:01,985 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-10-03 01:49:01,985 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-10-03 01:49:01,985 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-10-03 01:49:01,985 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-10-03 01:49:01,986 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 01:49:01,986 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 01:49:01,986 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-10-03 01:49:01,986 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-10-03 01:49:01,986 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_pr_debug [2019-10-03 01:49:01,986 INFO L130 BoogieDeclarations]: Found specification of procedure kstrtoull [2019-10-03 01:49:01,986 INFO L130 BoogieDeclarations]: Found specification of procedure kstrtoul [2019-10-03 01:49:01,987 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2019-10-03 01:49:01,987 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2019-10-03 01:49:01,987 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2019-10-03 01:49:01,987 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_ptr_err [2019-10-03 01:49:01,987 INFO L130 BoogieDeclarations]: Found specification of procedure __bad_percpu_size [2019-10-03 01:49:01,987 INFO L130 BoogieDeclarations]: Found specification of procedure get_current [2019-10-03 01:49:01,987 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-10-03 01:49:01,988 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2019-10-03 01:49:01,988 INFO L130 BoogieDeclarations]: Found specification of procedure slow_down_io [2019-10-03 01:49:01,988 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2019-10-03 01:49:01,988 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 01:49:01,988 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2019-10-03 01:49:01,988 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2019-10-03 01:49:01,988 INFO L130 BoogieDeclarations]: Found specification of procedure __xchg_wrong_size [2019-10-03 01:49:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2019-10-03 01:49:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_trylock [2019-10-03 01:49:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_8 [2019-10-03 01:49:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2019-10-03 01:49:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_6 [2019-10-03 01:49:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_9 [2019-10-03 01:49:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_11 [2019-10-03 01:49:01,989 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_13 [2019-10-03 01:49:01,990 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_15 [2019-10-03 01:49:01,990 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_17 [2019-10-03 01:49:01,990 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_19 [2019-10-03 01:49:01,990 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_21 [2019-10-03 01:49:01,990 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_23 [2019-10-03 01:49:01,990 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_25 [2019-10-03 01:49:01,990 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_27 [2019-10-03 01:49:01,991 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 01:49:01,991 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-03 01:49:01,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 01:49:01,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-10-03 01:49:01,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-03 01:49:01,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-03 01:49:01,991 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-10-03 01:49:01,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 01:49:01,992 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-10-03 01:49:01,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-10-03 01:49:01,992 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2019-10-03 01:49:01,992 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2019-10-03 01:49:01,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-10-03 01:49:01,992 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2019-10-03 01:49:01,993 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ptr [2019-10-03 01:49:01,993 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2019-10-03 01:49:01,993 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-10-03 01:49:01,993 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2019-10-03 01:49:01,993 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_5 [2019-10-03 01:49:01,993 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_7 [2019-10-03 01:49:01,994 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_10 [2019-10-03 01:49:01,994 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_12 [2019-10-03 01:49:01,994 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_14 [2019-10-03 01:49:01,994 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_16 [2019-10-03 01:49:01,994 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_18 [2019-10-03 01:49:01,994 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_20 [2019-10-03 01:49:01,995 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_22 [2019-10-03 01:49:01,995 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_24 [2019-10-03 01:49:01,995 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_26 [2019-10-03 01:49:01,995 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_lock [2019-10-03 01:49:01,995 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_lock [2019-10-03 01:49:01,995 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mutex_of_device [2019-10-03 01:49:01,996 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_mutex_of_device [2019-10-03 01:49:01,996 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mutex_of_device [2019-10-03 01:49:01,996 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_update_lock_of_abituguru_data [2019-10-03 01:49:01,996 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_update_lock_of_abituguru_data [2019-10-03 01:49:01,996 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2019-10-03 01:49:01,996 INFO L130 BoogieDeclarations]: Found specification of procedure inb [2019-10-03 01:49:01,997 INFO L130 BoogieDeclarations]: Found specification of procedure inb_p [2019-10-03 01:49:01,997 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_timeout [2019-10-03 01:49:01,997 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_platform_probe_1 [2019-10-03 01:49:01,997 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_pm_ops_2 [2019-10-03 01:49:01,997 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_platform_driver_init_1 [2019-10-03 01:49:01,997 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2019-10-03 01:49:01,998 INFO L130 BoogieDeclarations]: Found specification of procedure device_create_file [2019-10-03 01:49:01,998 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2019-10-03 01:49:01,998 INFO L130 BoogieDeclarations]: Found specification of procedure devm_kmalloc [2019-10-03 01:49:01,998 INFO L130 BoogieDeclarations]: Found specification of procedure devm_kzalloc [2019-10-03 01:49:01,998 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2019-10-03 01:49:01,999 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2019-10-03 01:49:01,999 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 01:49:01,999 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_unregister [2019-10-03 01:49:01,999 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_resource [2019-10-03 01:49:01,999 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_alloc [2019-10-03 01:49:01,999 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_add_resources [2019-10-03 01:49:02,000 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_add [2019-10-03 01:49:02,001 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_put [2019-10-03 01:49:02,005 INFO L130 BoogieDeclarations]: Found specification of procedure __platform_driver_register [2019-10-03 01:49:02,006 INFO L130 BoogieDeclarations]: Found specification of procedure ldv___platform_driver_register_28 [2019-10-03 01:49:02,006 INFO L130 BoogieDeclarations]: Found specification of procedure platform_driver_unregister [2019-10-03 01:49:02,006 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_platform_driver_unregister_29 [2019-10-03 01:49:02,006 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_platform_driver_unregister_30 [2019-10-03 01:49:02,010 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2019-10-03 01:49:02,010 INFO L130 BoogieDeclarations]: Found specification of procedure platform_set_drvdata [2019-10-03 01:49:02,010 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_register [2019-10-03 01:49:02,011 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_unregister [2019-10-03 01:49:02,011 INFO L130 BoogieDeclarations]: Found specification of procedure dmi_get_system_info [2019-10-03 01:49:02,011 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_wait [2019-10-03 01:49:02,012 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 01:49:02,012 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_ready [2019-10-03 01:49:02,012 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 01:49:02,012 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 01:49:02,012 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_send_address [2019-10-03 01:49:02,012 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_read [2019-10-03 01:49:02,013 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_write [2019-10-03 01:49:02,013 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_detect_bank1_sensor_type [2019-10-03 01:49:02,013 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_detect_no_bank2_sensors [2019-10-03 01:49:02,013 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_detect_no_pwms [2019-10-03 01:49:02,013 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_update_device [2019-10-03 01:49:02,013 INFO L130 BoogieDeclarations]: Found specification of procedure show_bank1_value [2019-10-03 01:49:02,014 INFO L130 BoogieDeclarations]: Found specification of procedure show_bank1_setting [2019-10-03 01:49:02,014 INFO L130 BoogieDeclarations]: Found specification of procedure show_bank2_value [2019-10-03 01:49:02,014 INFO L130 BoogieDeclarations]: Found specification of procedure show_bank2_setting [2019-10-03 01:49:02,014 INFO L130 BoogieDeclarations]: Found specification of procedure store_bank1_setting [2019-10-03 01:49:02,014 INFO L130 BoogieDeclarations]: Found specification of procedure store_bank2_setting [2019-10-03 01:49:02,014 INFO L130 BoogieDeclarations]: Found specification of procedure show_bank1_alarm [2019-10-03 01:49:02,015 INFO L130 BoogieDeclarations]: Found specification of procedure show_bank2_alarm [2019-10-03 01:49:02,015 INFO L130 BoogieDeclarations]: Found specification of procedure show_bank1_mask [2019-10-03 01:49:02,015 INFO L130 BoogieDeclarations]: Found specification of procedure show_bank2_mask [2019-10-03 01:49:02,015 INFO L130 BoogieDeclarations]: Found specification of procedure store_bank1_mask [2019-10-03 01:49:02,015 INFO L130 BoogieDeclarations]: Found specification of procedure store_bank2_mask [2019-10-03 01:49:02,015 INFO L130 BoogieDeclarations]: Found specification of procedure show_pwm_setting [2019-10-03 01:49:02,015 INFO L130 BoogieDeclarations]: Found specification of procedure store_pwm_setting [2019-10-03 01:49:02,016 INFO L130 BoogieDeclarations]: Found specification of procedure show_pwm_sensor [2019-10-03 01:49:02,016 INFO L130 BoogieDeclarations]: Found specification of procedure store_pwm_sensor [2019-10-03 01:49:02,016 INFO L130 BoogieDeclarations]: Found specification of procedure show_pwm_enable [2019-10-03 01:49:02,016 INFO L130 BoogieDeclarations]: Found specification of procedure store_pwm_enable [2019-10-03 01:49:02,016 INFO L130 BoogieDeclarations]: Found specification of procedure show_name [2019-10-03 01:49:02,016 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_probe [2019-10-03 01:49:02,016 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_remove [2019-10-03 01:49:02,017 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_suspend [2019-10-03 01:49:02,017 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_resume [2019-10-03 01:49:02,017 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_detect [2019-10-03 01:49:02,017 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_init [2019-10-03 01:49:02,017 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru_exit [2019-10-03 01:49:02,017 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_suspend_late_2 [2019-10-03 01:49:02,018 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_restore_noirq_2 [2019-10-03 01:49:02,018 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_freeze_late_2 [2019-10-03 01:49:02,018 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_complete_2 [2019-10-03 01:49:02,018 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-10-03 01:49:02,018 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_thaw_early_2 [2019-10-03 01:49:02,018 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_poweroff_noirq_2 [2019-10-03 01:49:02,018 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_resume_noirq_2 [2019-10-03 01:49:02,019 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_resume_early_2 [2019-10-03 01:49:02,019 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_prepare_2 [2019-10-03 01:49:02,019 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-10-03 01:49:02,019 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_restore_early_2 [2019-10-03 01:49:02,019 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_suspend_noirq_2 [2019-10-03 01:49:02,019 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_poweroff_late_2 [2019-10-03 01:49:02,020 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_thaw_noirq_2 [2019-10-03 01:49:02,020 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_freeze_noirq_2 [2019-10-03 01:49:02,020 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2019-10-03 01:49:02,020 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 01:49:02,020 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-10-03 01:49:02,020 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_negative [2019-10-03 01:49:02,020 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_err_ptr [2019-10-03 01:49:02,021 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err_or_null [2019-10-03 01:49:02,021 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_lock [2019-10-03 01:49:02,021 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_lock [2019-10-03 01:49:02,021 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_lock [2019-10-03 01:49:02,021 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_lock [2019-10-03 01:49:02,021 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_lock [2019-10-03 01:49:02,021 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_lock [2019-10-03 01:49:02,022 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_trylock_device_lock [2019-10-03 01:49:02,022 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_for_reset_lock [2019-10-03 01:49:02,022 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_unlock_device_lock [2019-10-03 01:49:02,022 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_mutex_of_device [2019-10-03 01:49:02,022 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_mutex_of_device [2019-10-03 01:49:02,022 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_mutex_of_device [2019-10-03 01:49:02,023 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_mutex_of_device [2019-10-03 01:49:02,023 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_mutex_of_device [2019-10-03 01:49:02,023 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_trylock_device_mutex_of_device [2019-10-03 01:49:02,023 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_for_reset_mutex_of_device [2019-10-03 01:49:02,023 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_unlock_device_mutex_of_device [2019-10-03 01:49:02,023 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_update_lock_of_abituguru_data [2019-10-03 01:49:02,023 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_update_lock_of_abituguru_data [2019-10-03 01:49:02,024 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_update_lock_of_abituguru_data [2019-10-03 01:49:02,024 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_update_lock_of_abituguru_data [2019-10-03 01:49:02,024 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_update_lock_of_abituguru_data [2019-10-03 01:49:02,024 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_update_lock_of_abituguru_data [2019-10-03 01:49:02,024 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_trylock_device_update_lock_of_abituguru_data [2019-10-03 01:49:02,024 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_for_reset_update_lock_of_abituguru_data [2019-10-03 01:49:02,024 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_unlock_device_update_lock_of_abituguru_data [2019-10-03 01:49:02,025 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-10-03 01:49:02,025 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-03 01:49:02,025 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 01:49:02,025 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-10-03 01:49:02,025 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 01:49:02,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 01:49:02,025 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-03 01:49:02,026 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 01:49:03,078 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-10-03 01:49:24,089 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 01:49:24,089 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-03 01:49:24,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 01:49:24 BoogieIcfgContainer [2019-10-03 01:49:24,092 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 01:49:24,093 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 01:49:24,093 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 01:49:24,097 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 01:49:24,097 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 01:48:58" (1/3) ... [2019-10-03 01:49:24,098 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b0ad09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 01:49:24, skipping insertion in model container [2019-10-03 01:49:24,098 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 01:49:01" (2/3) ... [2019-10-03 01:49:24,099 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@60b0ad09 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 01:49:24, skipping insertion in model container [2019-10-03 01:49:24,099 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 01:49:24" (3/3) ... [2019-10-03 01:49:24,101 INFO L109 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru.ko-entry_point.cil.out.i [2019-10-03 01:49:24,112 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 01:49:24,123 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 01:49:24,141 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 01:49:24,170 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 01:49:24,171 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 01:49:24,171 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 01:49:24,171 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 01:49:24,171 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 01:49:24,171 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 01:49:24,171 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 01:49:24,171 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 01:49:24,213 INFO L276 IsEmpty]: Start isEmpty. Operand 1402 states. [2019-10-03 01:49:24,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-10-03 01:49:24,230 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 01:49:24,231 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 01:49:24,233 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 01:49:24,239 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 01:49:24,240 INFO L82 PathProgramCache]: Analyzing trace with hash 1895281783, now seen corresponding path program 1 times [2019-10-03 01:49:24,242 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 01:49:24,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:49:24,336 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 01:49:24,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:49:24,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 01:49:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 01:49:25,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 01:49:25,535 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 01:49:25,536 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 01:49:25,536 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 01:49:25,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 01:49:25,564 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 01:49:25,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 01:49:25,569 INFO L87 Difference]: Start difference. First operand 1402 states. Second operand 3 states. [2019-10-03 01:49:29,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 01:49:29,919 INFO L93 Difference]: Finished difference Result 1643 states and 2313 transitions. [2019-10-03 01:49:29,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 01:49:29,922 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-10-03 01:49:29,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 01:49:29,974 INFO L225 Difference]: With dead ends: 1643 [2019-10-03 01:49:29,975 INFO L226 Difference]: Without dead ends: 1620 [2019-10-03 01:49:29,977 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 01:49:30,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1620 states. [2019-10-03 01:49:30,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1620 to 1610. [2019-10-03 01:49:30,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1610 states. [2019-10-03 01:49:30,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1610 states to 1610 states and 2272 transitions. [2019-10-03 01:49:30,211 INFO L78 Accepts]: Start accepts. Automaton has 1610 states and 2272 transitions. Word has length 35 [2019-10-03 01:49:30,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 01:49:30,212 INFO L475 AbstractCegarLoop]: Abstraction has 1610 states and 2272 transitions. [2019-10-03 01:49:30,212 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 01:49:30,212 INFO L276 IsEmpty]: Start isEmpty. Operand 1610 states and 2272 transitions. [2019-10-03 01:49:30,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-03 01:49:30,224 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 01:49:30,224 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 01:49:30,224 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 01:49:30,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 01:49:30,225 INFO L82 PathProgramCache]: Analyzing trace with hash 1053970649, now seen corresponding path program 1 times [2019-10-03 01:49:30,225 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 01:49:30,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:49:30,245 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 01:49:30,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:49:30,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 01:49:30,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 01:49:30,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 01:49:30,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 01:49:30,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 01:49:30,695 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 01:49:30,699 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 01:49:30,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 01:49:30,700 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 01:49:30,706 INFO L87 Difference]: Start difference. First operand 1610 states and 2272 transitions. Second operand 3 states. [2019-10-03 01:49:34,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 01:49:34,121 INFO L93 Difference]: Finished difference Result 2997 states and 4268 transitions. [2019-10-03 01:49:34,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 01:49:34,122 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-10-03 01:49:34,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 01:49:34,151 INFO L225 Difference]: With dead ends: 2997 [2019-10-03 01:49:34,152 INFO L226 Difference]: Without dead ends: 2997 [2019-10-03 01:49:34,153 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 01:49:34,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2997 states. [2019-10-03 01:49:34,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2997 to 2977. [2019-10-03 01:49:34,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2977 states. [2019-10-03 01:49:34,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2977 states to 2977 states and 4249 transitions. [2019-10-03 01:49:34,344 INFO L78 Accepts]: Start accepts. Automaton has 2977 states and 4249 transitions. Word has length 37 [2019-10-03 01:49:34,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 01:49:34,345 INFO L475 AbstractCegarLoop]: Abstraction has 2977 states and 4249 transitions. [2019-10-03 01:49:34,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 01:49:34,346 INFO L276 IsEmpty]: Start isEmpty. Operand 2977 states and 4249 transitions. [2019-10-03 01:49:34,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-10-03 01:49:34,349 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 01:49:34,350 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 01:49:34,350 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 01:49:34,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 01:49:34,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1444512091, now seen corresponding path program 1 times [2019-10-03 01:49:34,351 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 01:49:34,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:49:34,372 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 01:49:34,372 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:49:34,372 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 01:49:34,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 01:49:34,873 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 01:49:34,873 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 01:49:34,874 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 01:49:34,874 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 01:49:34,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 01:49:34,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 01:49:34,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 01:49:34,875 INFO L87 Difference]: Start difference. First operand 2977 states and 4249 transitions. Second operand 3 states. [2019-10-03 01:49:34,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 01:49:34,936 INFO L93 Difference]: Finished difference Result 2976 states and 4247 transitions. [2019-10-03 01:49:34,937 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 01:49:34,937 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-10-03 01:49:34,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 01:49:34,964 INFO L225 Difference]: With dead ends: 2976 [2019-10-03 01:49:34,964 INFO L226 Difference]: Without dead ends: 2976 [2019-10-03 01:49:34,965 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 01:49:34,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2976 states. [2019-10-03 01:49:35,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2976 to 2976. [2019-10-03 01:49:35,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2976 states. [2019-10-03 01:49:35,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2976 states to 2976 states and 4247 transitions. [2019-10-03 01:49:35,121 INFO L78 Accepts]: Start accepts. Automaton has 2976 states and 4247 transitions. Word has length 39 [2019-10-03 01:49:35,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 01:49:35,122 INFO L475 AbstractCegarLoop]: Abstraction has 2976 states and 4247 transitions. [2019-10-03 01:49:35,122 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 01:49:35,122 INFO L276 IsEmpty]: Start isEmpty. Operand 2976 states and 4247 transitions. [2019-10-03 01:49:35,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-10-03 01:49:35,123 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 01:49:35,124 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 01:49:35,124 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 01:49:35,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 01:49:35,124 INFO L82 PathProgramCache]: Analyzing trace with hash -1830681208, now seen corresponding path program 1 times [2019-10-03 01:49:35,125 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 01:49:35,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:49:35,139 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 01:49:35,139 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:49:35,140 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 01:49:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 01:49:35,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 01:49:35,555 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 01:49:35,556 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 01:49:35,556 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 01:49:35,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 01:49:35,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 01:49:35,558 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 01:49:35,558 INFO L87 Difference]: Start difference. First operand 2976 states and 4247 transitions. Second operand 3 states. [2019-10-03 01:49:35,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 01:49:35,608 INFO L93 Difference]: Finished difference Result 2975 states and 4245 transitions. [2019-10-03 01:49:35,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 01:49:35,609 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 40 [2019-10-03 01:49:35,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 01:49:35,636 INFO L225 Difference]: With dead ends: 2975 [2019-10-03 01:49:35,637 INFO L226 Difference]: Without dead ends: 2975 [2019-10-03 01:49:35,637 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 01:49:35,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2975 states. [2019-10-03 01:49:35,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2975 to 2975. [2019-10-03 01:49:35,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2975 states. [2019-10-03 01:49:35,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2975 states to 2975 states and 4245 transitions. [2019-10-03 01:49:35,776 INFO L78 Accepts]: Start accepts. Automaton has 2975 states and 4245 transitions. Word has length 40 [2019-10-03 01:49:35,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 01:49:35,780 INFO L475 AbstractCegarLoop]: Abstraction has 2975 states and 4245 transitions. [2019-10-03 01:49:35,780 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 01:49:35,780 INFO L276 IsEmpty]: Start isEmpty. Operand 2975 states and 4245 transitions. [2019-10-03 01:49:35,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-10-03 01:49:35,782 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 01:49:35,782 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 01:49:35,783 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 01:49:35,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 01:49:35,783 INFO L82 PathProgramCache]: Analyzing trace with hash -917017080, now seen corresponding path program 1 times [2019-10-03 01:49:35,784 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 01:49:35,801 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:49:35,801 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 01:49:35,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:49:35,802 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 01:49:36,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 01:49:36,336 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 01:49:36,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 01:49:36,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 01:49:36,339 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 01:49:36,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 01:49:36,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 01:49:36,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 01:49:36,340 INFO L87 Difference]: Start difference. First operand 2975 states and 4245 transitions. Second operand 3 states. [2019-10-03 01:49:36,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 01:49:36,461 INFO L93 Difference]: Finished difference Result 5866 states and 8391 transitions. [2019-10-03 01:49:36,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 01:49:36,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-10-03 01:49:36,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 01:49:36,513 INFO L225 Difference]: With dead ends: 5866 [2019-10-03 01:49:36,513 INFO L226 Difference]: Without dead ends: 5845 [2019-10-03 01:49:36,514 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 01:49:36,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5845 states. [2019-10-03 01:49:36,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5845 to 5835. [2019-10-03 01:49:36,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5835 states. [2019-10-03 01:49:36,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5835 states to 5835 states and 8357 transitions. [2019-10-03 01:49:36,780 INFO L78 Accepts]: Start accepts. Automaton has 5835 states and 8357 transitions. Word has length 41 [2019-10-03 01:49:36,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 01:49:36,781 INFO L475 AbstractCegarLoop]: Abstraction has 5835 states and 8357 transitions. [2019-10-03 01:49:36,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 01:49:36,781 INFO L276 IsEmpty]: Start isEmpty. Operand 5835 states and 8357 transitions. [2019-10-03 01:49:36,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-03 01:49:36,788 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 01:49:36,788 INFO L411 BasicCegarLoop]: trace histogram [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] [2019-10-03 01:49:36,789 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 01:49:36,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 01:49:36,789 INFO L82 PathProgramCache]: Analyzing trace with hash 796251370, now seen corresponding path program 1 times [2019-10-03 01:49:36,789 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 01:49:36,807 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:49:36,808 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 01:49:36,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:49:36,808 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 01:49:37,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 01:49:38,141 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-03 01:49:38,142 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 01:49:38,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 01:49:38,142 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 01:49:38,143 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 01:49:38,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 01:49:38,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 01:49:38,144 INFO L87 Difference]: Start difference. First operand 5835 states and 8357 transitions. Second operand 3 states. [2019-10-03 01:49:42,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 01:49:42,096 INFO L93 Difference]: Finished difference Result 8579 states and 12308 transitions. [2019-10-03 01:49:42,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 01:49:42,097 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 97 [2019-10-03 01:49:42,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 01:49:42,189 INFO L225 Difference]: With dead ends: 8579 [2019-10-03 01:49:42,190 INFO L226 Difference]: Without dead ends: 8579 [2019-10-03 01:49:42,190 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 01:49:42,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8579 states. [2019-10-03 01:49:42,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8579 to 8555. [2019-10-03 01:49:42,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8555 states. [2019-10-03 01:49:42,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8555 states to 8555 states and 12285 transitions. [2019-10-03 01:49:42,645 INFO L78 Accepts]: Start accepts. Automaton has 8555 states and 12285 transitions. Word has length 97 [2019-10-03 01:49:42,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 01:49:42,648 INFO L475 AbstractCegarLoop]: Abstraction has 8555 states and 12285 transitions. [2019-10-03 01:49:42,648 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 01:49:42,648 INFO L276 IsEmpty]: Start isEmpty. Operand 8555 states and 12285 transitions. [2019-10-03 01:49:42,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-03 01:49:42,660 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 01:49:42,660 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 01:49:42,661 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 01:49:42,662 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 01:49:42,662 INFO L82 PathProgramCache]: Analyzing trace with hash -1170847787, now seen corresponding path program 1 times [2019-10-03 01:49:42,663 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 01:49:42,677 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:49:42,678 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 01:49:42,678 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:49:42,678 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 01:49:42,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 01:49:43,205 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 01:49:43,206 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 01:49:43,206 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 01:49:43,206 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 01:49:43,207 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 01:49:43,207 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 01:49:43,208 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 01:49:43,208 INFO L87 Difference]: Start difference. First operand 8555 states and 12285 transitions. Second operand 3 states. [2019-10-03 01:49:47,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 01:49:47,053 INFO L93 Difference]: Finished difference Result 11299 states and 16236 transitions. [2019-10-03 01:49:47,053 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 01:49:47,053 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 122 [2019-10-03 01:49:47,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 01:49:47,136 INFO L225 Difference]: With dead ends: 11299 [2019-10-03 01:49:47,136 INFO L226 Difference]: Without dead ends: 11299 [2019-10-03 01:49:47,137 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 01:49:47,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11299 states. [2019-10-03 01:49:47,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11299 to 11275. [2019-10-03 01:49:47,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11275 states. [2019-10-03 01:49:47,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11275 states to 11275 states and 16213 transitions. [2019-10-03 01:49:47,556 INFO L78 Accepts]: Start accepts. Automaton has 11275 states and 16213 transitions. Word has length 122 [2019-10-03 01:49:47,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 01:49:47,557 INFO L475 AbstractCegarLoop]: Abstraction has 11275 states and 16213 transitions. [2019-10-03 01:49:47,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 01:49:47,557 INFO L276 IsEmpty]: Start isEmpty. Operand 11275 states and 16213 transitions. [2019-10-03 01:49:47,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-03 01:49:47,572 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 01:49:47,572 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 01:49:47,572 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 01:49:47,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 01:49:47,573 INFO L82 PathProgramCache]: Analyzing trace with hash -1845509776, now seen corresponding path program 1 times [2019-10-03 01:49:47,573 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 01:49:47,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:49:47,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 01:49:47,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:49:47,588 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 01:49:47,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 01:49:48,131 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-03 01:49:48,131 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 01:49:48,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 01:49:48,132 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 01:49:48,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 01:49:48,133 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 01:49:48,133 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 01:49:48,133 INFO L87 Difference]: Start difference. First operand 11275 states and 16213 transitions. Second operand 3 states. [2019-10-03 01:49:52,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 01:49:52,357 INFO L93 Difference]: Finished difference Result 14019 states and 20164 transitions. [2019-10-03 01:49:52,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 01:49:52,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 135 [2019-10-03 01:49:52,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 01:49:52,447 INFO L225 Difference]: With dead ends: 14019 [2019-10-03 01:49:52,447 INFO L226 Difference]: Without dead ends: 14019 [2019-10-03 01:49:52,448 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 01:49:52,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14019 states. [2019-10-03 01:49:53,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14019 to 13995. [2019-10-03 01:49:53,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13995 states. [2019-10-03 01:49:53,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13995 states to 13995 states and 20141 transitions. [2019-10-03 01:49:53,138 INFO L78 Accepts]: Start accepts. Automaton has 13995 states and 20141 transitions. Word has length 135 [2019-10-03 01:49:53,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 01:49:53,140 INFO L475 AbstractCegarLoop]: Abstraction has 13995 states and 20141 transitions. [2019-10-03 01:49:53,141 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 01:49:53,141 INFO L276 IsEmpty]: Start isEmpty. Operand 13995 states and 20141 transitions. [2019-10-03 01:49:53,149 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-03 01:49:53,149 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 01:49:53,150 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 01:49:53,150 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 01:49:53,151 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 01:49:53,151 INFO L82 PathProgramCache]: Analyzing trace with hash 813185770, now seen corresponding path program 1 times [2019-10-03 01:49:53,151 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 01:49:53,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:49:53,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 01:49:53,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:49:53,168 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 01:49:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 01:49:53,605 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-03 01:49:53,606 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 01:49:53,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 01:49:53,606 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 01:49:53,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 01:49:53,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 01:49:53,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 01:49:53,608 INFO L87 Difference]: Start difference. First operand 13995 states and 20141 transitions. Second operand 5 states. [2019-10-03 01:49:55,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 01:49:55,719 INFO L93 Difference]: Finished difference Result 13995 states and 20139 transitions. [2019-10-03 01:49:55,720 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 01:49:55,720 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-10-03 01:49:55,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 01:49:55,807 INFO L225 Difference]: With dead ends: 13995 [2019-10-03 01:49:55,808 INFO L226 Difference]: Without dead ends: 13995 [2019-10-03 01:49:55,808 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-03 01:49:55,839 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13995 states. [2019-10-03 01:49:56,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13995 to 13995. [2019-10-03 01:49:56,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13995 states. [2019-10-03 01:49:56,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13995 states to 13995 states and 20139 transitions. [2019-10-03 01:49:56,293 INFO L78 Accepts]: Start accepts. Automaton has 13995 states and 20139 transitions. Word has length 135 [2019-10-03 01:49:56,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 01:49:56,293 INFO L475 AbstractCegarLoop]: Abstraction has 13995 states and 20139 transitions. [2019-10-03 01:49:56,293 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 01:49:56,293 INFO L276 IsEmpty]: Start isEmpty. Operand 13995 states and 20139 transitions. [2019-10-03 01:49:56,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-03 01:49:56,302 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 01:49:56,302 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 01:49:56,303 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 01:49:56,303 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 01:49:56,303 INFO L82 PathProgramCache]: Analyzing trace with hash -1026669280, now seen corresponding path program 1 times [2019-10-03 01:49:56,303 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 01:49:56,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:49:56,317 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 01:49:56,317 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:49:56,317 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 01:49:56,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 01:49:56,706 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-03 01:49:56,707 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 01:49:56,707 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 01:49:56,707 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 01:49:56,708 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 01:49:56,708 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 01:49:56,709 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 01:49:56,709 INFO L87 Difference]: Start difference. First operand 13995 states and 20139 transitions. Second operand 3 states. [2019-10-03 01:50:00,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 01:50:00,892 INFO L93 Difference]: Finished difference Result 16739 states and 24090 transitions. [2019-10-03 01:50:00,892 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 01:50:00,893 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 136 [2019-10-03 01:50:00,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 01:50:01,003 INFO L225 Difference]: With dead ends: 16739 [2019-10-03 01:50:01,004 INFO L226 Difference]: Without dead ends: 16739 [2019-10-03 01:50:01,004 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 01:50:01,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16739 states. [2019-10-03 01:50:01,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16739 to 16715. [2019-10-03 01:50:01,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16715 states. [2019-10-03 01:50:01,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16715 states to 16715 states and 24067 transitions. [2019-10-03 01:50:01,526 INFO L78 Accepts]: Start accepts. Automaton has 16715 states and 24067 transitions. Word has length 136 [2019-10-03 01:50:01,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 01:50:01,527 INFO L475 AbstractCegarLoop]: Abstraction has 16715 states and 24067 transitions. [2019-10-03 01:50:01,527 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 01:50:01,527 INFO L276 IsEmpty]: Start isEmpty. Operand 16715 states and 24067 transitions. [2019-10-03 01:50:01,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-03 01:50:01,539 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 01:50:01,539 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 01:50:01,539 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 01:50:01,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 01:50:01,540 INFO L82 PathProgramCache]: Analyzing trace with hash -136849765, now seen corresponding path program 1 times [2019-10-03 01:50:01,540 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 01:50:01,551 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:50:01,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 01:50:01,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:50:01,552 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 01:50:01,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 01:50:03,034 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-03 01:50:03,035 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 01:50:03,035 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 01:50:03,035 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 01:50:03,036 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 01:50:03,036 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 01:50:03,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 01:50:03,037 INFO L87 Difference]: Start difference. First operand 16715 states and 24067 transitions. Second operand 3 states. [2019-10-03 01:50:07,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 01:50:07,312 INFO L93 Difference]: Finished difference Result 19459 states and 28018 transitions. [2019-10-03 01:50:07,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 01:50:07,313 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-10-03 01:50:07,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 01:50:07,413 INFO L225 Difference]: With dead ends: 19459 [2019-10-03 01:50:07,414 INFO L226 Difference]: Without dead ends: 19459 [2019-10-03 01:50:07,415 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 01:50:07,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19459 states. [2019-10-03 01:50:07,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19459 to 19435. [2019-10-03 01:50:07,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19435 states. [2019-10-03 01:50:08,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19435 states to 19435 states and 27995 transitions. [2019-10-03 01:50:08,004 INFO L78 Accepts]: Start accepts. Automaton has 19435 states and 27995 transitions. Word has length 137 [2019-10-03 01:50:08,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 01:50:08,004 INFO L475 AbstractCegarLoop]: Abstraction has 19435 states and 27995 transitions. [2019-10-03 01:50:08,005 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 01:50:08,005 INFO L276 IsEmpty]: Start isEmpty. Operand 19435 states and 27995 transitions. [2019-10-03 01:50:08,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-03 01:50:08,014 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 01:50:08,015 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 01:50:08,015 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 01:50:08,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 01:50:08,016 INFO L82 PathProgramCache]: Analyzing trace with hash -486724085, now seen corresponding path program 1 times [2019-10-03 01:50:08,016 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 01:50:08,030 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:50:08,031 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 01:50:08,031 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:50:08,031 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 01:50:08,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 01:50:08,508 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-03 01:50:08,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 01:50:08,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 01:50:08,509 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 01:50:08,510 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 01:50:08,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 01:50:08,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 01:50:08,512 INFO L87 Difference]: Start difference. First operand 19435 states and 27995 transitions. Second operand 5 states. [2019-10-03 01:50:10,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 01:50:10,645 INFO L93 Difference]: Finished difference Result 19435 states and 27993 transitions. [2019-10-03 01:50:10,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 01:50:10,646 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 136 [2019-10-03 01:50:10,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 01:50:10,739 INFO L225 Difference]: With dead ends: 19435 [2019-10-03 01:50:10,739 INFO L226 Difference]: Without dead ends: 19435 [2019-10-03 01:50:10,740 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-03 01:50:10,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19435 states. [2019-10-03 01:50:11,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19435 to 19435. [2019-10-03 01:50:11,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19435 states. [2019-10-03 01:50:11,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19435 states to 19435 states and 27993 transitions. [2019-10-03 01:50:11,256 INFO L78 Accepts]: Start accepts. Automaton has 19435 states and 27993 transitions. Word has length 136 [2019-10-03 01:50:11,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 01:50:11,256 INFO L475 AbstractCegarLoop]: Abstraction has 19435 states and 27993 transitions. [2019-10-03 01:50:11,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 01:50:11,257 INFO L276 IsEmpty]: Start isEmpty. Operand 19435 states and 27993 transitions. [2019-10-03 01:50:11,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-03 01:50:11,266 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 01:50:11,267 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 01:50:11,267 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 01:50:11,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 01:50:11,267 INFO L82 PathProgramCache]: Analyzing trace with hash -288920565, now seen corresponding path program 1 times [2019-10-03 01:50:11,268 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 01:50:11,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:50:11,280 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 01:50:11,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:50:11,280 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 01:50:11,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 01:50:11,667 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-03 01:50:11,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 01:50:11,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 01:50:11,668 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 01:50:11,668 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 01:50:11,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 01:50:11,670 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 01:50:11,670 INFO L87 Difference]: Start difference. First operand 19435 states and 27993 transitions. Second operand 5 states. [2019-10-03 01:50:13,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 01:50:13,651 INFO L93 Difference]: Finished difference Result 19435 states and 27991 transitions. [2019-10-03 01:50:13,651 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 01:50:13,652 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-10-03 01:50:13,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 01:50:13,723 INFO L225 Difference]: With dead ends: 19435 [2019-10-03 01:50:13,723 INFO L226 Difference]: Without dead ends: 19435 [2019-10-03 01:50:13,724 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-03 01:50:13,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19435 states. [2019-10-03 01:50:14,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19435 to 19435. [2019-10-03 01:50:14,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19435 states. [2019-10-03 01:50:14,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19435 states to 19435 states and 27991 transitions. [2019-10-03 01:50:14,302 INFO L78 Accepts]: Start accepts. Automaton has 19435 states and 27991 transitions. Word has length 138 [2019-10-03 01:50:14,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 01:50:14,303 INFO L475 AbstractCegarLoop]: Abstraction has 19435 states and 27991 transitions. [2019-10-03 01:50:14,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 01:50:14,303 INFO L276 IsEmpty]: Start isEmpty. Operand 19435 states and 27991 transitions. [2019-10-03 01:50:14,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-03 01:50:14,314 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 01:50:14,314 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-10-03 01:50:14,315 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 01:50:14,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 01:50:14,316 INFO L82 PathProgramCache]: Analyzing trace with hash -360711790, now seen corresponding path program 1 times [2019-10-03 01:50:14,316 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 01:50:14,327 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:50:14,328 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 01:50:14,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:50:14,328 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 01:50:14,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 01:50:15,110 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-03 01:50:15,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 01:50:15,111 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 01:50:15,111 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 01:50:15,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 01:50:15,112 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 01:50:15,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 01:50:15,113 INFO L87 Difference]: Start difference. First operand 19435 states and 27991 transitions. Second operand 5 states. [2019-10-03 01:50:18,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 01:50:18,856 INFO L93 Difference]: Finished difference Result 19498 states and 28046 transitions. [2019-10-03 01:50:18,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 01:50:18,856 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 142 [2019-10-03 01:50:18,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 01:50:18,944 INFO L225 Difference]: With dead ends: 19498 [2019-10-03 01:50:18,945 INFO L226 Difference]: Without dead ends: 19470 [2019-10-03 01:50:18,945 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 01:50:18,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19470 states. [2019-10-03 01:50:19,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19470 to 19451. [2019-10-03 01:50:19,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19451 states. [2019-10-03 01:50:19,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19451 states to 19451 states and 27993 transitions. [2019-10-03 01:50:19,455 INFO L78 Accepts]: Start accepts. Automaton has 19451 states and 27993 transitions. Word has length 142 [2019-10-03 01:50:19,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 01:50:19,456 INFO L475 AbstractCegarLoop]: Abstraction has 19451 states and 27993 transitions. [2019-10-03 01:50:19,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 01:50:19,456 INFO L276 IsEmpty]: Start isEmpty. Operand 19451 states and 27993 transitions. [2019-10-03 01:50:19,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2019-10-03 01:50:19,467 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 01:50:19,467 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-03 01:50:19,468 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 01:50:19,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 01:50:19,468 INFO L82 PathProgramCache]: Analyzing trace with hash -224642702, now seen corresponding path program 1 times [2019-10-03 01:50:19,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 01:50:19,480 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:50:19,481 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 01:50:19,481 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:50:19,481 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 01:50:19,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 01:50:20,051 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-03 01:50:20,051 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 01:50:20,051 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 01:50:20,052 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 01:50:20,052 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 01:50:20,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 01:50:20,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 01:50:20,053 INFO L87 Difference]: Start difference. First operand 19451 states and 27993 transitions. Second operand 8 states. [2019-10-03 01:50:24,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 01:50:24,006 INFO L93 Difference]: Finished difference Result 19745 states and 28427 transitions. [2019-10-03 01:50:24,007 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 01:50:24,008 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 185 [2019-10-03 01:50:24,008 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 01:50:24,094 INFO L225 Difference]: With dead ends: 19745 [2019-10-03 01:50:24,094 INFO L226 Difference]: Without dead ends: 19745 [2019-10-03 01:50:24,095 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 01:50:24,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19745 states. [2019-10-03 01:50:24,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19745 to 19507. [2019-10-03 01:50:24,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19507 states. [2019-10-03 01:50:24,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19507 states to 19507 states and 28049 transitions. [2019-10-03 01:50:24,776 INFO L78 Accepts]: Start accepts. Automaton has 19507 states and 28049 transitions. Word has length 185 [2019-10-03 01:50:24,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 01:50:24,776 INFO L475 AbstractCegarLoop]: Abstraction has 19507 states and 28049 transitions. [2019-10-03 01:50:24,776 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 01:50:24,776 INFO L276 IsEmpty]: Start isEmpty. Operand 19507 states and 28049 transitions. [2019-10-03 01:50:24,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2019-10-03 01:50:24,786 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 01:50:24,786 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-03 01:50:24,787 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 01:50:24,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 01:50:24,788 INFO L82 PathProgramCache]: Analyzing trace with hash 1997881809, now seen corresponding path program 1 times [2019-10-03 01:50:24,788 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 01:50:24,798 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:50:24,799 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 01:50:24,799 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:50:24,799 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 01:50:24,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 01:50:25,231 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-03 01:50:25,232 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 01:50:25,232 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 01:50:25,232 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 01:50:25,233 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 01:50:25,233 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 01:50:25,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 01:50:25,234 INFO L87 Difference]: Start difference. First operand 19507 states and 28049 transitions. Second operand 4 states. [2019-10-03 01:50:31,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 01:50:31,088 INFO L93 Difference]: Finished difference Result 19423 states and 27027 transitions. [2019-10-03 01:50:31,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 01:50:31,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 186 [2019-10-03 01:50:31,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 01:50:31,189 INFO L225 Difference]: With dead ends: 19423 [2019-10-03 01:50:31,189 INFO L226 Difference]: Without dead ends: 19423 [2019-10-03 01:50:31,190 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 01:50:31,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19423 states. [2019-10-03 01:50:31,646 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19423 to 19423. [2019-10-03 01:50:31,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19423 states. [2019-10-03 01:50:31,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19423 states to 19423 states and 27027 transitions. [2019-10-03 01:50:31,736 INFO L78 Accepts]: Start accepts. Automaton has 19423 states and 27027 transitions. Word has length 186 [2019-10-03 01:50:31,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 01:50:31,737 INFO L475 AbstractCegarLoop]: Abstraction has 19423 states and 27027 transitions. [2019-10-03 01:50:31,737 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 01:50:31,738 INFO L276 IsEmpty]: Start isEmpty. Operand 19423 states and 27027 transitions. [2019-10-03 01:50:31,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2019-10-03 01:50:31,748 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 01:50:31,748 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-03 01:50:31,749 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 01:50:31,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 01:50:31,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1272337719, now seen corresponding path program 1 times [2019-10-03 01:50:31,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 01:50:31,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:50:31,762 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 01:50:31,762 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:50:31,763 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 01:50:31,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 01:50:32,276 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-03 01:50:32,277 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 01:50:32,277 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 01:50:32,277 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 01:50:32,278 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 01:50:32,279 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 01:50:32,279 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 01:50:32,280 INFO L87 Difference]: Start difference. First operand 19423 states and 27027 transitions. Second operand 4 states. [2019-10-03 01:50:45,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 01:50:45,397 INFO L93 Difference]: Finished difference Result 39334 states and 54700 transitions. [2019-10-03 01:50:45,398 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 01:50:45,398 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 194 [2019-10-03 01:50:45,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 01:50:45,532 INFO L225 Difference]: With dead ends: 39334 [2019-10-03 01:50:45,532 INFO L226 Difference]: Without dead ends: 39334 [2019-10-03 01:50:45,533 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 01:50:45,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39334 states. [2019-10-03 01:50:46,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39334 to 39301. [2019-10-03 01:50:46,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39301 states. [2019-10-03 01:50:46,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39301 states to 39301 states and 54667 transitions. [2019-10-03 01:50:46,274 INFO L78 Accepts]: Start accepts. Automaton has 39301 states and 54667 transitions. Word has length 194 [2019-10-03 01:50:46,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 01:50:46,275 INFO L475 AbstractCegarLoop]: Abstraction has 39301 states and 54667 transitions. [2019-10-03 01:50:46,275 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 01:50:46,275 INFO L276 IsEmpty]: Start isEmpty. Operand 39301 states and 54667 transitions. [2019-10-03 01:50:46,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-03 01:50:46,290 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 01:50:46,291 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-03 01:50:46,291 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 01:50:46,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 01:50:46,292 INFO L82 PathProgramCache]: Analyzing trace with hash 1420651185, now seen corresponding path program 1 times [2019-10-03 01:50:46,292 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 01:50:46,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:50:46,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 01:50:46,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:50:46,304 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 01:50:46,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 01:50:46,939 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2019-10-03 01:50:46,939 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 01:50:46,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 01:50:46,940 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 01:50:46,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 01:50:46,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 01:50:46,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 01:50:46,943 INFO L87 Difference]: Start difference. First operand 39301 states and 54667 transitions. Second operand 8 states. [2019-10-03 01:50:52,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 01:50:52,223 INFO L93 Difference]: Finished difference Result 39364 states and 54709 transitions. [2019-10-03 01:50:52,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-03 01:50:52,223 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 196 [2019-10-03 01:50:52,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 01:50:52,385 INFO L225 Difference]: With dead ends: 39364 [2019-10-03 01:50:52,386 INFO L226 Difference]: Without dead ends: 39273 [2019-10-03 01:50:52,386 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-03 01:50:52,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39273 states. [2019-10-03 01:50:53,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39273 to 39238. [2019-10-03 01:50:53,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39238 states. [2019-10-03 01:50:53,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39238 states to 39238 states and 54569 transitions. [2019-10-03 01:50:53,687 INFO L78 Accepts]: Start accepts. Automaton has 39238 states and 54569 transitions. Word has length 196 [2019-10-03 01:50:53,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 01:50:53,687 INFO L475 AbstractCegarLoop]: Abstraction has 39238 states and 54569 transitions. [2019-10-03 01:50:53,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 01:50:53,687 INFO L276 IsEmpty]: Start isEmpty. Operand 39238 states and 54569 transitions. [2019-10-03 01:50:53,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-03 01:50:53,704 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 01:50:53,704 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-03 01:50:53,705 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 01:50:53,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 01:50:53,706 INFO L82 PathProgramCache]: Analyzing trace with hash -470397234, now seen corresponding path program 1 times [2019-10-03 01:50:53,706 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 01:50:53,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:50:53,718 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 01:50:53,718 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:50:53,718 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 01:50:53,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 01:50:54,171 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-03 01:50:54,171 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 01:50:54,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-03 01:50:54,172 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 01:50:54,174 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-03 01:50:54,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-03 01:50:54,175 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-03 01:50:54,175 INFO L87 Difference]: Start difference. First operand 39238 states and 54569 transitions. Second operand 6 states. [2019-10-03 01:50:58,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 01:50:58,276 INFO L93 Difference]: Finished difference Result 42629 states and 58200 transitions. [2019-10-03 01:50:58,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-03 01:50:58,276 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 212 [2019-10-03 01:50:58,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 01:50:58,442 INFO L225 Difference]: With dead ends: 42629 [2019-10-03 01:50:58,442 INFO L226 Difference]: Without dead ends: 42139 [2019-10-03 01:50:58,443 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-10-03 01:50:58,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42139 states. [2019-10-03 01:50:59,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42139 to 42024. [2019-10-03 01:50:59,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42024 states. [2019-10-03 01:50:59,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42024 states to 42024 states and 57495 transitions. [2019-10-03 01:50:59,152 INFO L78 Accepts]: Start accepts. Automaton has 42024 states and 57495 transitions. Word has length 212 [2019-10-03 01:50:59,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 01:50:59,153 INFO L475 AbstractCegarLoop]: Abstraction has 42024 states and 57495 transitions. [2019-10-03 01:50:59,153 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-03 01:50:59,153 INFO L276 IsEmpty]: Start isEmpty. Operand 42024 states and 57495 transitions. [2019-10-03 01:50:59,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 237 [2019-10-03 01:50:59,168 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 01:50:59,169 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 01:50:59,169 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 01:50:59,169 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 01:50:59,169 INFO L82 PathProgramCache]: Analyzing trace with hash 100329941, now seen corresponding path program 1 times [2019-10-03 01:50:59,170 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 01:50:59,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:50:59,180 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 01:50:59,180 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:50:59,180 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 01:50:59,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 01:50:59,782 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-03 01:50:59,782 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 01:50:59,783 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 01:50:59,784 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 237 with the following transitions: [2019-10-03 01:50:59,793 INFO L207 CegarAbsIntRunner]: [22], [23], [32], [34], [35], [43], [49], [50], [51], [52], [155], [157], [158], [197], [203], [205], [206], [223], [250], [252], [254], [255], [270], [271], [272], [273], [347], [348], [378], [379], [459], [462], [601], [602], [807], [809], [810], [850], [851], [875], [876], [877], [913], [915], [916], [929], [930], [958], [960], [961], [1003], [1005], [1018], [1021], [1025], [1027], [1032], [1034], [1039], [1041], [1046], [1048], [1053], [1059], [1226], [1227], [1229], [1230], [1271], [1272], [1274], [1276], [1277], [1725], [1727], [1728], [1731], [1733], [1735], [1807], [1810], [1813], [1816], [1819], [1821], [1825], [1828], [1831], [1833], [1838], [1841], [1864], [1867], [1870], [1889], [1908], [1927], [1946], [1949], [1952], [1954], [1957], [1965], [1984], [2003], [2022], [2041], [2060], [2079], [2098], [2101], [2104], [2106], [2109], [2649], [2651], [2653], [2654], [3069], [3070], [3101], [3103], [3105], [3108], [3128], [3134], [3141], [3145], [3195], [3196], [3237], [3238], [3263], [3264], [3265], [3266], [3323], [3324], [3325], [3326], [3401], [3402], [3429], [3430], [3441], [3442], [3451], [3452], [3453], [3454], [3455], [3456], [3457], [3458], [3459], [3460], [3461], [3462], [3497], [3498], [3499], [3500], [3501], [3502], [3515], [3516], [3517], [3518], [3605], [3606], [3607], [3608], [3617], [3618], [3619], [3620], [3621], [3622], [3633], [3634], [3649], [3650], [3669], [3733], [3734], [3735], [3736], [3841], [3842], [3843], [3844], [3851], [3853], [3854], [3855] [2019-10-03 01:50:59,894 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 01:50:59,894 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 01:51:02,211 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 01:51:02,214 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 566 root evaluator evaluations with a maximum evaluation depth of 0. Performed 566 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 1152 variables. [2019-10-03 01:51:02,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 01:51:02,221 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 01:51:02,368 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-03 01:51:02,369 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 01:51:02,379 INFO L420 sIntCurrentIteration]: We unified 235 AI predicates to 235 [2019-10-03 01:51:02,380 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 01:51:02,381 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 01:51:02,381 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2019-10-03 01:51:02,382 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 01:51:02,382 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 01:51:02,383 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 01:51:02,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 01:51:02,383 INFO L87 Difference]: Start difference. First operand 42024 states and 57495 transitions. Second operand 2 states. [2019-10-03 01:51:02,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 01:51:02,384 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-03 01:51:02,384 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 01:51:02,384 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 236 [2019-10-03 01:51:02,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 01:51:02,385 INFO L225 Difference]: With dead ends: 2 [2019-10-03 01:51:02,385 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 01:51:02,386 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 235 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-10-03 01:51:02,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 01:51:02,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 01:51:02,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 01:51:02,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 01:51:02,387 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 236 [2019-10-03 01:51:02,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 01:51:02,387 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 01:51:02,388 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 01:51:02,388 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 01:51:02,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 01:51:02,395 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 01:51:02 BoogieIcfgContainer [2019-10-03 01:51:02,395 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 01:51:02,401 INFO L168 Benchmark]: Toolchain (without parser) took 123877.92 ms. Allocated memory was 137.4 MB in the beginning and 1.8 GB in the end (delta: 1.6 GB). Free memory was 77.0 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). Peak memory consumption was 272.7 MB. Max. memory is 7.1 GB. [2019-10-03 01:51:02,407 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 137.4 MB. Free memory was 103.5 MB in the beginning and 103.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-10-03 01:51:02,408 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2862.48 ms. Allocated memory was 137.4 MB in the beginning and 280.5 MB in the end (delta: 143.1 MB). Free memory was 76.8 MB in the beginning and 150.5 MB in the end (delta: -73.7 MB). Peak memory consumption was 110.9 MB. Max. memory is 7.1 GB. [2019-10-03 01:51:02,409 INFO L168 Benchmark]: Boogie Preprocessor took 456.26 ms. Allocated memory is still 280.5 MB. Free memory was 150.5 MB in the beginning and 115.9 MB in the end (delta: 34.6 MB). Peak memory consumption was 34.6 MB. Max. memory is 7.1 GB. [2019-10-03 01:51:02,410 INFO L168 Benchmark]: RCFGBuilder took 22251.62 ms. Allocated memory was 280.5 MB in the beginning and 828.9 MB in the end (delta: 548.4 MB). Free memory was 115.9 MB in the beginning and 85.4 MB in the end (delta: 30.5 MB). Peak memory consumption was 634.9 MB. Max. memory is 7.1 GB. [2019-10-03 01:51:02,414 INFO L168 Benchmark]: TraceAbstraction took 98302.47 ms. Allocated memory was 828.9 MB in the beginning and 1.8 GB in the end (delta: 923.3 MB). Free memory was 85.4 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). There was no memory consumed. Max. memory is 7.1 GB. [2019-10-03 01:51:02,426 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 137.4 MB. Free memory was 103.5 MB in the beginning and 103.3 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2862.48 ms. Allocated memory was 137.4 MB in the beginning and 280.5 MB in the end (delta: 143.1 MB). Free memory was 76.8 MB in the beginning and 150.5 MB in the end (delta: -73.7 MB). Peak memory consumption was 110.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 456.26 ms. Allocated memory is still 280.5 MB. Free memory was 150.5 MB in the beginning and 115.9 MB in the end (delta: 34.6 MB). Peak memory consumption was 34.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 22251.62 ms. Allocated memory was 280.5 MB in the beginning and 828.9 MB in the end (delta: 548.4 MB). Free memory was 115.9 MB in the beginning and 85.4 MB in the end (delta: 30.5 MB). Peak memory consumption was 634.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 98302.47 ms. Allocated memory was 828.9 MB in the beginning and 1.8 GB in the end (delta: 923.3 MB). Free memory was 85.4 MB in the beginning and 1.4 GB in the end (delta: -1.3 GB). There was no memory consumed. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5707]: 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 173 procedures, 1575 locations, 1 error locations. SAFE Result, 98.2s OverallTime, 20 OverallIterations, 4 TraceHistogramMax, 72.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 33067 SDtfs, 20010 SDslu, 48818 SDs, 0 SdLazy, 1778 SolverSat, 178 SolverUnsat, 13 SolverUnknown, 0 SolverNotchecked, 60.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 328 GetRequests, 274 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=42024occurred in iteration=19, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 2.4s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 3.2851063829787233 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 9.7s AutomataMinimizationTime, 20 MinimizatonAttempts, 600 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 1.0s SsaConstructionTime, 3.7s SatisfiabilityAnalysisTime, 6.5s InterpolantComputationTime, 2579 NumberOfCodeBlocks, 2579 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 2559 ConstructedInterpolants, 0 QuantifiedInterpolants, 479644 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 19 PerfectInterpolantSequences, 591/612 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...