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--abituguru3.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-03 01:49:40,935 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-03 01:49:40,937 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-03 01:49:40,950 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-03 01:49:40,951 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-03 01:49:40,952 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-03 01:49:40,953 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-03 01:49:40,955 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-03 01:49:40,957 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-03 01:49:40,958 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-03 01:49:40,959 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-03 01:49:40,960 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-03 01:49:40,961 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-03 01:49:40,962 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-03 01:49:40,963 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-03 01:49:40,964 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-03 01:49:40,965 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-03 01:49:40,966 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-03 01:49:40,967 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-03 01:49:40,969 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-03 01:49:40,971 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-03 01:49:40,972 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-03 01:49:40,973 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-03 01:49:40,974 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-03 01:49:40,977 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-03 01:49:40,977 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-03 01:49:40,977 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-03 01:49:40,978 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-03 01:49:40,979 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-03 01:49:40,980 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-03 01:49:40,980 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-03 01:49:40,981 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-03 01:49:40,982 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-03 01:49:40,982 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-03 01:49:40,984 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-03 01:49:40,984 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-03 01:49:40,985 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-03 01:49:40,985 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-03 01:49:40,985 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-03 01:49:40,986 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-03 01:49:40,987 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-03 01:49:40,988 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:49:41,004 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-03 01:49:41,004 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-03 01:49:41,004 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-03 01:49:41,005 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-03 01:49:41,005 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-03 01:49:41,005 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-03 01:49:41,006 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-03 01:49:41,006 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-03 01:49:41,006 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-03 01:49:41,006 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-03 01:49:41,007 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-03 01:49:41,007 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-03 01:49:41,007 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-03 01:49:41,008 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-03 01:49:41,008 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-03 01:49:41,008 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-03 01:49:41,008 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-03 01:49:41,008 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-03 01:49:41,009 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-03 01:49:41,009 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-03 01:49:41,009 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-03 01:49:41,009 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-03 01:49:41,009 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-03 01:49:41,010 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-03 01:49:41,010 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-03 01:49:41,010 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-03 01:49:41,010 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-03 01:49:41,011 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-03 01:49:41,011 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-03 01:49:41,011 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-03 01:49:41,041 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-03 01:49:41,055 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-03 01:49:41,059 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-03 01:49:41,061 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-03 01:49:41,061 INFO L275 PluginConnector]: CDTParser initialized [2019-10-03 01:49:41,062 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--abituguru3.ko-entry_point.cil.out.i [2019-10-03 01:49:41,134 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f685a449/30b70bde088b4d9490fd22c4205fc6f0/FLAGd368f2299 [2019-10-03 01:49:41,904 INFO L306 CDTParser]: Found 1 translation units. [2019-10-03 01:49:41,905 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--abituguru3.ko-entry_point.cil.out.i [2019-10-03 01:49:41,940 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f685a449/30b70bde088b4d9490fd22c4205fc6f0/FLAGd368f2299 [2019-10-03 01:49:41,982 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f685a449/30b70bde088b4d9490fd22c4205fc6f0 [2019-10-03 01:49:41,996 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-03 01:49:41,998 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-03 01:49:42,003 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-03 01:49:42,004 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-03 01:49:42,007 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-03 01:49:42,008 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 01:49:41" (1/1) ... [2019-10-03 01:49:42,012 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@764470cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 01:49:42, skipping insertion in model container [2019-10-03 01:49:42,012 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.10 01:49:41" (1/1) ... [2019-10-03 01:49:42,020 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-03 01:49:42,184 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-03 01:49:43,566 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 01:49:43,705 INFO L188 MainTranslator]: Completed pre-run [2019-10-03 01:49:43,995 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-03 01:49:44,405 INFO L192 MainTranslator]: Completed translation [2019-10-03 01:49:44,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 01:49:44 WrapperNode [2019-10-03 01:49:44,406 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-03 01:49:44,407 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-03 01:49:44,407 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-03 01:49:44,407 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-03 01:49:44,428 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:44" (1/1) ... [2019-10-03 01:49:44,431 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:44" (1/1) ... [2019-10-03 01:49:44,578 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:44" (1/1) ... [2019-10-03 01:49:44,582 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:44" (1/1) ... [2019-10-03 01:49:44,806 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:44" (1/1) ... [2019-10-03 01:49:44,848 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:44" (1/1) ... [2019-10-03 01:49:44,907 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:44" (1/1) ... [2019-10-03 01:49:44,952 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-03 01:49:44,953 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-03 01:49:44,953 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-03 01:49:44,953 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-03 01:49:44,955 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 01:49:44" (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:45,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-03 01:49:45,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-03 01:49:45,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2019-10-03 01:49:45,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2019-10-03 01:49:45,038 INFO L138 BoogieDeclarations]: Found implementation of procedure slow_down_io [2019-10-03 01:49:45,038 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-10-03 01:49:45,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-10-03 01:49:45,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2019-10-03 01:49:45,039 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2019-10-03 01:49:45,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2019-10-03 01:49:45,040 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ptr [2019-10-03 01:49:45,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2019-10-03 01:49:45,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-10-03 01:49:45,042 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-10-03 01:49:45,042 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2019-10-03 01:49:45,043 INFO L138 BoogieDeclarations]: Found implementation of procedure inb [2019-10-03 01:49:45,044 INFO L138 BoogieDeclarations]: Found implementation of procedure inb_p [2019-10-03 01:49:45,044 INFO L138 BoogieDeclarations]: Found implementation of procedure devm_kzalloc [2019-10-03 01:49:45,044 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2019-10-03 01:49:45,044 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2019-10-03 01:49:45,045 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2019-10-03 01:49:45,045 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_set_drvdata [2019-10-03 01:49:45,045 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_wait_while_busy [2019-10-03 01:49:45,045 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_wait_for_read [2019-10-03 01:49:45,046 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_synchronize [2019-10-03 01:49:45,047 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_read [2019-10-03 01:49:45,047 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_read_increment_offset [2019-10-03 01:49:45,047 INFO L138 BoogieDeclarations]: Found implementation of procedure show_value [2019-10-03 01:49:45,047 INFO L138 BoogieDeclarations]: Found implementation of procedure show_alarm [2019-10-03 01:49:45,048 INFO L138 BoogieDeclarations]: Found implementation of procedure show_mask [2019-10-03 01:49:45,048 INFO L138 BoogieDeclarations]: Found implementation of procedure show_label [2019-10-03 01:49:45,048 INFO L138 BoogieDeclarations]: Found implementation of procedure show_name [2019-10-03 01:49:45,048 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_probe [2019-10-03 01:49:45,049 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_remove [2019-10-03 01:49:45,049 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_update_device [2019-10-03 01:49:45,049 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_suspend [2019-10-03 01:49:45,049 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_resume [2019-10-03 01:49:45,049 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_dmi_detect [2019-10-03 01:49:45,050 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_detect [2019-10-03 01:49:45,050 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_init [2019-10-03 01:49:45,050 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_exit [2019-10-03 01:49:45,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_platform_probe_1 [2019-10-03 01:49:45,050 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_pm_ops_2 [2019-10-03 01:49:45,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_platform_driver_init_1 [2019-10-03 01:49:45,051 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-03 01:49:45,051 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2019-10-03 01:49:45,051 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2019-10-03 01:49:45,051 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_5 [2019-10-03 01:49:45,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_6 [2019-10-03 01:49:45,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_7 [2019-10-03 01:49:45,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_8 [2019-10-03 01:49:45,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_9 [2019-10-03 01:49:45,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_10 [2019-10-03 01:49:45,052 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_11 [2019-10-03 01:49:45,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_12 [2019-10-03 01:49:45,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_13 [2019-10-03 01:49:45,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv___platform_driver_register_14 [2019-10-03 01:49:45,053 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_platform_driver_unregister_15 [2019-10-03 01:49:45,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_platform_driver_unregister_16 [2019-10-03 01:49:45,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-10-03 01:49:45,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_negative [2019-10-03 01:49:45,054 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2019-10-03 01:49:45,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_err_ptr [2019-10-03 01:49:45,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_ptr_err [2019-10-03 01:49:45,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err_or_null [2019-10-03 01:49:45,055 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_lock [2019-10-03 01:49:45,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_lock [2019-10-03 01:49:45,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_lock [2019-10-03 01:49:45,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_lock [2019-10-03 01:49:45,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_lock [2019-10-03 01:49:45,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_lock [2019-10-03 01:49:45,056 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_lock [2019-10-03 01:49:45,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_lock [2019-10-03 01:49:45,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_trylock_device_lock [2019-10-03 01:49:45,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_for_reset_lock [2019-10-03 01:49:45,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_unlock_device_lock [2019-10-03 01:49:45,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_mutex_of_device [2019-10-03 01:49:45,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_mutex_of_device [2019-10-03 01:49:45,058 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mutex_of_device [2019-10-03 01:49:45,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_mutex_of_device [2019-10-03 01:49:45,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_mutex_of_device [2019-10-03 01:49:45,059 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_mutex_of_device [2019-10-03 01:49:45,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mutex_of_device [2019-10-03 01:49:45,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_mutex_of_device [2019-10-03 01:49:45,060 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_trylock_device_mutex_of_device [2019-10-03 01:49:45,061 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_for_reset_mutex_of_device [2019-10-03 01:49:45,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_unlock_device_mutex_of_device [2019-10-03 01:49:45,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_update_lock_of_abituguru3_data [2019-10-03 01:49:45,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_update_lock_of_abituguru3_data [2019-10-03 01:49:45,062 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_update_lock_of_abituguru3_data [2019-10-03 01:49:45,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_update_lock_of_abituguru3_data [2019-10-03 01:49:45,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_update_lock_of_abituguru3_data [2019-10-03 01:49:45,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_update_lock_of_abituguru3_data [2019-10-03 01:49:45,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_update_lock_of_abituguru3_data [2019-10-03 01:49:45,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_update_lock_of_abituguru3_data [2019-10-03 01:49:45,063 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_trylock_device_update_lock_of_abituguru3_data [2019-10-03 01:49:45,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_for_reset_update_lock_of_abituguru3_data [2019-10-03 01:49:45,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_unlock_device_update_lock_of_abituguru3_data [2019-10-03 01:49:45,064 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-10-03 01:49:45,064 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_pr_debug [2019-10-03 01:49:45,064 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2019-10-03 01:49:45,064 INFO L138 BoogieDeclarations]: Found implementation of procedure __platform_driver_register [2019-10-03 01:49:45,065 INFO L138 BoogieDeclarations]: Found implementation of procedure device_create_file [2019-10-03 01:49:45,065 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2019-10-03 01:49:45,065 INFO L138 BoogieDeclarations]: Found implementation of procedure devm_kmalloc [2019-10-03 01:49:45,065 INFO L138 BoogieDeclarations]: Found implementation of procedure dmi_get_system_info [2019-10-03 01:49:45,065 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_register [2019-10-03 01:49:45,066 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_unregister [2019-10-03 01:49:45,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_complete_2 [2019-10-03 01:49:45,066 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_freeze_late_2 [2019-10-03 01:49:45,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_freeze_noirq_2 [2019-10-03 01:49:45,067 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-10-03 01:49:45,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_poweroff_late_2 [2019-10-03 01:49:45,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_poweroff_noirq_2 [2019-10-03 01:49:45,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_prepare_2 [2019-10-03 01:49:45,068 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_restore_early_2 [2019-10-03 01:49:45,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_restore_noirq_2 [2019-10-03 01:49:45,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_resume_early_2 [2019-10-03 01:49:45,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_resume_noirq_2 [2019-10-03 01:49:45,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_suspend_late_2 [2019-10-03 01:49:45,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_suspend_noirq_2 [2019-10-03 01:49:45,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_thaw_early_2 [2019-10-03 01:49:45,071 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_thaw_noirq_2 [2019-10-03 01:49:45,072 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2019-10-03 01:49:45,072 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2019-10-03 01:49:45,072 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_trylock [2019-10-03 01:49:45,072 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2019-10-03 01:49:45,073 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_device_add [2019-10-03 01:49:45,073 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_device_add_resources [2019-10-03 01:49:45,073 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_device_alloc [2019-10-03 01:49:45,074 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_device_put [2019-10-03 01:49:45,074 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_device_unregister [2019-10-03 01:49:45,074 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_driver_unregister [2019-10-03 01:49:45,074 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_resource [2019-10-03 01:49:45,074 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-10-03 01:49:45,075 INFO L138 BoogieDeclarations]: Found implementation of procedure strncasecmp [2019-10-03 01:49:45,075 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-10-03 01:49:45,075 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-10-03 01:49:45,076 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-10-03 01:49:45,080 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-10-03 01:49:45,080 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-03 01:49:45,081 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-03 01:49:45,081 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-10-03 01:49:45,087 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-10-03 01:49:45,087 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_pr_debug [2019-10-03 01:49:45,088 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2019-10-03 01:49:45,088 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2019-10-03 01:49:45,088 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2019-10-03 01:49:45,088 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_ptr_err [2019-10-03 01:49:45,088 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-10-03 01:49:45,088 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2019-10-03 01:49:45,089 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2019-10-03 01:49:45,089 INFO L130 BoogieDeclarations]: Found specification of procedure strncasecmp [2019-10-03 01:49:45,089 INFO L130 BoogieDeclarations]: Found specification of procedure strcspn [2019-10-03 01:49:45,091 INFO L130 BoogieDeclarations]: Found specification of procedure slow_down_io [2019-10-03 01:49:45,091 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2019-10-03 01:49:45,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-03 01:49:45,091 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2019-10-03 01:49:45,091 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2019-10-03 01:49:45,092 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2019-10-03 01:49:45,092 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_trylock [2019-10-03 01:49:45,092 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_8 [2019-10-03 01:49:45,092 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2019-10-03 01:49:45,092 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_6 [2019-10-03 01:49:45,093 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_9 [2019-10-03 01:49:45,093 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_11 [2019-10-03 01:49:45,093 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_13 [2019-10-03 01:49:45,093 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-03 01:49:45,093 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-03 01:49:45,094 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-03 01:49:45,094 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-10-03 01:49:45,094 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-03 01:49:45,094 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-03 01:49:45,094 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-10-03 01:49:45,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-03 01:49:45,095 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-10-03 01:49:45,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-10-03 01:49:45,095 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2019-10-03 01:49:45,095 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2019-10-03 01:49:45,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-10-03 01:49:45,096 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2019-10-03 01:49:45,096 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ptr [2019-10-03 01:49:45,096 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2019-10-03 01:49:45,096 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-10-03 01:49:45,096 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2019-10-03 01:49:45,097 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_5 [2019-10-03 01:49:45,097 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_7 [2019-10-03 01:49:45,097 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_10 [2019-10-03 01:49:45,097 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_12 [2019-10-03 01:49:45,097 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_lock [2019-10-03 01:49:45,098 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_lock [2019-10-03 01:49:45,098 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mutex_of_device [2019-10-03 01:49:45,098 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_mutex_of_device [2019-10-03 01:49:45,098 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mutex_of_device [2019-10-03 01:49:45,098 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_update_lock_of_abituguru3_data [2019-10-03 01:49:45,099 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_update_lock_of_abituguru3_data [2019-10-03 01:49:45,099 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2019-10-03 01:49:45,099 INFO L130 BoogieDeclarations]: Found specification of procedure inb [2019-10-03 01:49:45,099 INFO L130 BoogieDeclarations]: Found specification of procedure inb_p [2019-10-03 01:49:45,099 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_platform_probe_1 [2019-10-03 01:49:45,099 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_pm_ops_2 [2019-10-03 01:49:45,100 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_platform_driver_init_1 [2019-10-03 01:49:45,100 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2019-10-03 01:49:45,100 INFO L130 BoogieDeclarations]: Found specification of procedure device_create_file [2019-10-03 01:49:45,100 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2019-10-03 01:49:45,100 INFO L130 BoogieDeclarations]: Found specification of procedure devm_kmalloc [2019-10-03 01:49:45,101 INFO L130 BoogieDeclarations]: Found specification of procedure devm_kzalloc [2019-10-03 01:49:45,101 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2019-10-03 01:49:45,101 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2019-10-03 01:49:45,101 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-03 01:49:45,101 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_unregister [2019-10-03 01:49:45,101 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_resource [2019-10-03 01:49:45,102 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_alloc [2019-10-03 01:49:45,102 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_add_resources [2019-10-03 01:49:45,102 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_add [2019-10-03 01:49:45,102 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_put [2019-10-03 01:49:45,102 INFO L130 BoogieDeclarations]: Found specification of procedure __platform_driver_register [2019-10-03 01:49:45,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv___platform_driver_register_14 [2019-10-03 01:49:45,103 INFO L130 BoogieDeclarations]: Found specification of procedure platform_driver_unregister [2019-10-03 01:49:45,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_platform_driver_unregister_15 [2019-10-03 01:49:45,103 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_platform_driver_unregister_16 [2019-10-03 01:49:45,103 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2019-10-03 01:49:45,103 INFO L130 BoogieDeclarations]: Found specification of procedure platform_set_drvdata [2019-10-03 01:49:45,104 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_register [2019-10-03 01:49:45,104 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_unregister [2019-10-03 01:49:45,104 INFO L130 BoogieDeclarations]: Found specification of procedure dmi_get_system_info [2019-10-03 01:49:45,104 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_wait_while_busy [2019-10-03 01:49:45,104 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-03 01:49:45,104 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_wait_for_read [2019-10-03 01:49:45,105 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_synchronize [2019-10-03 01:49:45,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-03 01:49:45,105 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-03 01:49:45,105 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_read [2019-10-03 01:49:45,105 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_read_increment_offset [2019-10-03 01:49:45,106 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_update_device [2019-10-03 01:49:45,106 INFO L130 BoogieDeclarations]: Found specification of procedure show_value [2019-10-03 01:49:45,106 INFO L130 BoogieDeclarations]: Found specification of procedure show_alarm [2019-10-03 01:49:45,106 INFO L130 BoogieDeclarations]: Found specification of procedure show_mask [2019-10-03 01:49:45,106 INFO L130 BoogieDeclarations]: Found specification of procedure show_label [2019-10-03 01:49:45,106 INFO L130 BoogieDeclarations]: Found specification of procedure show_name [2019-10-03 01:49:45,107 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_probe [2019-10-03 01:49:45,107 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_remove [2019-10-03 01:49:45,107 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_suspend [2019-10-03 01:49:45,107 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_resume [2019-10-03 01:49:45,107 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_dmi_detect [2019-10-03 01:49:45,107 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_detect [2019-10-03 01:49:45,108 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_init [2019-10-03 01:49:45,108 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_exit [2019-10-03 01:49:45,108 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_suspend_late_2 [2019-10-03 01:49:45,108 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_restore_noirq_2 [2019-10-03 01:49:45,108 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_freeze_late_2 [2019-10-03 01:49:45,109 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_complete_2 [2019-10-03 01:49:45,109 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-10-03 01:49:45,109 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_thaw_early_2 [2019-10-03 01:49:45,109 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_poweroff_noirq_2 [2019-10-03 01:49:45,109 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_resume_noirq_2 [2019-10-03 01:49:45,109 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_resume_early_2 [2019-10-03 01:49:45,110 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_prepare_2 [2019-10-03 01:49:45,110 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-10-03 01:49:45,110 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_restore_early_2 [2019-10-03 01:49:45,110 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_suspend_noirq_2 [2019-10-03 01:49:45,110 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_poweroff_late_2 [2019-10-03 01:49:45,111 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_thaw_noirq_2 [2019-10-03 01:49:45,111 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_freeze_noirq_2 [2019-10-03 01:49:45,111 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2019-10-03 01:49:45,112 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-03 01:49:45,116 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-10-03 01:49:45,116 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_negative [2019-10-03 01:49:45,117 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_err_ptr [2019-10-03 01:49:45,117 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err_or_null [2019-10-03 01:49:45,117 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_lock [2019-10-03 01:49:45,120 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_lock [2019-10-03 01:49:45,120 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_lock [2019-10-03 01:49:45,120 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_lock [2019-10-03 01:49:45,120 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_lock [2019-10-03 01:49:45,121 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_lock [2019-10-03 01:49:45,121 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_trylock_device_lock [2019-10-03 01:49:45,121 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_for_reset_lock [2019-10-03 01:49:45,121 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_unlock_device_lock [2019-10-03 01:49:45,121 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_mutex_of_device [2019-10-03 01:49:45,121 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_mutex_of_device [2019-10-03 01:49:45,122 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_mutex_of_device [2019-10-03 01:49:45,122 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_mutex_of_device [2019-10-03 01:49:45,122 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_mutex_of_device [2019-10-03 01:49:45,122 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_trylock_device_mutex_of_device [2019-10-03 01:49:45,122 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_for_reset_mutex_of_device [2019-10-03 01:49:45,123 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_unlock_device_mutex_of_device [2019-10-03 01:49:45,123 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_update_lock_of_abituguru3_data [2019-10-03 01:49:45,123 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_update_lock_of_abituguru3_data [2019-10-03 01:49:45,123 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_update_lock_of_abituguru3_data [2019-10-03 01:49:45,123 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_update_lock_of_abituguru3_data [2019-10-03 01:49:45,123 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_update_lock_of_abituguru3_data [2019-10-03 01:49:45,124 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_update_lock_of_abituguru3_data [2019-10-03 01:49:45,124 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_trylock_device_update_lock_of_abituguru3_data [2019-10-03 01:49:45,124 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_for_reset_update_lock_of_abituguru3_data [2019-10-03 01:49:45,124 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_unlock_device_update_lock_of_abituguru3_data [2019-10-03 01:49:45,124 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-10-03 01:49:45,124 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-03 01:49:45,125 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-10-03 01:49:45,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-03 01:49:45,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-03 01:49:45,125 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-03 01:49:45,125 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-03 01:49:46,597 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-10-03 01:50:44,049 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-03 01:50:44,050 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-03 01:50:44,051 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 01:50:44 BoogieIcfgContainer [2019-10-03 01:50:44,052 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-03 01:50:44,053 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-03 01:50:44,053 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-03 01:50:44,057 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-03 01:50:44,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.10 01:49:41" (1/3) ... [2019-10-03 01:50:44,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aa19a7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 01:50:44, skipping insertion in model container [2019-10-03 01:50:44,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.10 01:49:44" (2/3) ... [2019-10-03 01:50:44,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4aa19a7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.10 01:50:44, skipping insertion in model container [2019-10-03 01:50:44,059 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.10 01:50:44" (3/3) ... [2019-10-03 01:50:44,062 INFO L109 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru3.ko-entry_point.cil.out.i [2019-10-03 01:50:44,072 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-03 01:50:44,086 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-03 01:50:44,103 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-03 01:50:44,132 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-03 01:50:44,132 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-03 01:50:44,132 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-03 01:50:44,132 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-03 01:50:44,132 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-03 01:50:44,132 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-03 01:50:44,133 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-03 01:50:44,133 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-03 01:50:44,175 INFO L276 IsEmpty]: Start isEmpty. Operand 940 states. [2019-10-03 01:50:44,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-03 01:50:44,190 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 01:50:44,191 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 01:50:44,193 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 01:50:44,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 01:50:44,199 INFO L82 PathProgramCache]: Analyzing trace with hash -197574510, now seen corresponding path program 1 times [2019-10-03 01:50:44,202 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 01:50:44,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:50:44,284 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 01:50:44,284 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:50:44,285 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 01:50:45,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 01:50:46,304 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:50:46,308 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 01:50:46,308 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 01:50:46,308 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 01:50:46,315 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 01:50:46,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 01:50:46,332 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 01:50:46,334 INFO L87 Difference]: Start difference. First operand 940 states. Second operand 3 states. [2019-10-03 01:52:39,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 01:52:39,881 INFO L93 Difference]: Finished difference Result 1286 states and 1698 transitions. [2019-10-03 01:52:39,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 01:52:39,883 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-03 01:52:39,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 01:52:39,918 INFO L225 Difference]: With dead ends: 1286 [2019-10-03 01:52:39,919 INFO L226 Difference]: Without dead ends: 1263 [2019-10-03 01:52:39,923 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:52:39,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1263 states. [2019-10-03 01:52:40,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1263 to 1251. [2019-10-03 01:52:40,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1251 states. [2019-10-03 01:52:40,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1251 states to 1251 states and 1655 transitions. [2019-10-03 01:52:40,063 INFO L78 Accepts]: Start accepts. Automaton has 1251 states and 1655 transitions. Word has length 32 [2019-10-03 01:52:40,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 01:52:40,063 INFO L475 AbstractCegarLoop]: Abstraction has 1251 states and 1655 transitions. [2019-10-03 01:52:40,063 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 01:52:40,064 INFO L276 IsEmpty]: Start isEmpty. Operand 1251 states and 1655 transitions. [2019-10-03 01:52:40,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-03 01:52:40,073 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 01:52:40,074 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:52:40,074 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 01:52:40,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 01:52:40,074 INFO L82 PathProgramCache]: Analyzing trace with hash 486359008, now seen corresponding path program 1 times [2019-10-03 01:52:40,074 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 01:52:40,089 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:52:40,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 01:52:40,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:52:40,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 01:52:40,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 01:52:41,168 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:52:41,169 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 01:52:41,169 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 01:52:41,169 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 01:52:41,171 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 01:52:41,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 01:52:41,172 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 01:52:41,172 INFO L87 Difference]: Start difference. First operand 1251 states and 1655 transitions. Second operand 3 states. [2019-10-03 01:52:45,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 01:52:45,587 INFO L93 Difference]: Finished difference Result 2221 states and 2956 transitions. [2019-10-03 01:52:45,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 01:52:45,588 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-10-03 01:52:45,588 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 01:52:45,605 INFO L225 Difference]: With dead ends: 2221 [2019-10-03 01:52:45,605 INFO L226 Difference]: Without dead ends: 2221 [2019-10-03 01:52:45,606 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:52:45,610 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2221 states. [2019-10-03 01:52:45,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2221 to 2201. [2019-10-03 01:52:45,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2201 states. [2019-10-03 01:52:45,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2201 states to 2201 states and 2937 transitions. [2019-10-03 01:52:45,711 INFO L78 Accepts]: Start accepts. Automaton has 2201 states and 2937 transitions. Word has length 37 [2019-10-03 01:52:45,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 01:52:45,712 INFO L475 AbstractCegarLoop]: Abstraction has 2201 states and 2937 transitions. [2019-10-03 01:52:45,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 01:52:45,712 INFO L276 IsEmpty]: Start isEmpty. Operand 2201 states and 2937 transitions. [2019-10-03 01:52:45,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-03 01:52:45,714 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 01:52:45,714 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 01:52:45,714 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 01:52:45,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 01:52:45,716 INFO L82 PathProgramCache]: Analyzing trace with hash -776380069, now seen corresponding path program 1 times [2019-10-03 01:52:45,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 01:52:45,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:52:45,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 01:52:45,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:52:45,734 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 01:52:46,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 01:52:46,900 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:52:46,900 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 01:52:46,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-03 01:52:46,900 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 01:52:46,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-03 01:52:46,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-03 01:52:46,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-03 01:52:46,902 INFO L87 Difference]: Start difference. First operand 2201 states and 2937 transitions. Second operand 7 states. [2019-10-03 01:52:47,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 01:52:47,100 INFO L93 Difference]: Finished difference Result 2269 states and 3031 transitions. [2019-10-03 01:52:47,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 01:52:47,101 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2019-10-03 01:52:47,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 01:52:47,114 INFO L225 Difference]: With dead ends: 2269 [2019-10-03 01:52:47,115 INFO L226 Difference]: Without dead ends: 2269 [2019-10-03 01:52:47,116 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-03 01:52:47,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2269 states. [2019-10-03 01:52:47,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2269 to 2227. [2019-10-03 01:52:47,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2227 states. [2019-10-03 01:52:47,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2227 states to 2227 states and 2973 transitions. [2019-10-03 01:52:47,202 INFO L78 Accepts]: Start accepts. Automaton has 2227 states and 2973 transitions. Word has length 46 [2019-10-03 01:52:47,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 01:52:47,202 INFO L475 AbstractCegarLoop]: Abstraction has 2227 states and 2973 transitions. [2019-10-03 01:52:47,203 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-03 01:52:47,203 INFO L276 IsEmpty]: Start isEmpty. Operand 2227 states and 2973 transitions. [2019-10-03 01:52:47,204 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-03 01:52:47,204 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 01:52:47,204 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 01:52:47,204 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 01:52:47,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 01:52:47,205 INFO L82 PathProgramCache]: Analyzing trace with hash -635831459, now seen corresponding path program 1 times [2019-10-03 01:52:47,205 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 01:52:47,217 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:52:47,218 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 01:52:47,218 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:52:47,218 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 01:52:47,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 01:52:48,178 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:52:48,178 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 01:52:48,178 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 01:52:48,179 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 01:52:48,179 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 01:52:48,179 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 01:52:48,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 01:52:48,180 INFO L87 Difference]: Start difference. First operand 2227 states and 2973 transitions. Second operand 3 states. [2019-10-03 01:52:48,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 01:52:48,212 INFO L93 Difference]: Finished difference Result 2226 states and 2971 transitions. [2019-10-03 01:52:48,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 01:52:48,213 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-10-03 01:52:48,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 01:52:48,229 INFO L225 Difference]: With dead ends: 2226 [2019-10-03 01:52:48,230 INFO L226 Difference]: Without dead ends: 2226 [2019-10-03 01:52:48,230 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:52:48,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2226 states. [2019-10-03 01:52:48,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2226 to 2226. [2019-10-03 01:52:48,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2226 states. [2019-10-03 01:52:48,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2226 states to 2226 states and 2971 transitions. [2019-10-03 01:52:48,329 INFO L78 Accepts]: Start accepts. Automaton has 2226 states and 2971 transitions. Word has length 46 [2019-10-03 01:52:48,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 01:52:48,332 INFO L475 AbstractCegarLoop]: Abstraction has 2226 states and 2971 transitions. [2019-10-03 01:52:48,332 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 01:52:48,332 INFO L276 IsEmpty]: Start isEmpty. Operand 2226 states and 2971 transitions. [2019-10-03 01:52:48,334 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-03 01:52:48,334 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 01:52:48,334 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 01:52:48,334 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 01:52:48,334 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 01:52:48,335 INFO L82 PathProgramCache]: Analyzing trace with hash 1763713296, now seen corresponding path program 1 times [2019-10-03 01:52:48,335 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 01:52:48,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:52:48,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 01:52:48,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:52:48,346 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 01:52:48,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 01:52:49,166 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:52:49,166 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 01:52:49,166 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 01:52:49,166 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 01:52:49,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 01:52:49,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 01:52:49,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 01:52:49,168 INFO L87 Difference]: Start difference. First operand 2226 states and 2971 transitions. Second operand 3 states. [2019-10-03 01:52:49,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 01:52:49,197 INFO L93 Difference]: Finished difference Result 2225 states and 2969 transitions. [2019-10-03 01:52:49,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 01:52:49,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-03 01:52:49,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 01:52:49,211 INFO L225 Difference]: With dead ends: 2225 [2019-10-03 01:52:49,212 INFO L226 Difference]: Without dead ends: 2225 [2019-10-03 01:52:49,213 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:52:49,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2225 states. [2019-10-03 01:52:49,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2225 to 2225. [2019-10-03 01:52:49,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2225 states. [2019-10-03 01:52:49,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2225 states to 2225 states and 2969 transitions. [2019-10-03 01:52:49,285 INFO L78 Accepts]: Start accepts. Automaton has 2225 states and 2969 transitions. Word has length 47 [2019-10-03 01:52:49,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 01:52:49,286 INFO L475 AbstractCegarLoop]: Abstraction has 2225 states and 2969 transitions. [2019-10-03 01:52:49,286 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 01:52:49,286 INFO L276 IsEmpty]: Start isEmpty. Operand 2225 states and 2969 transitions. [2019-10-03 01:52:49,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-03 01:52:49,288 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 01:52:49,288 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 01:52:49,289 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 01:52:49,289 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 01:52:49,289 INFO L82 PathProgramCache]: Analyzing trace with hash -1159805760, now seen corresponding path program 1 times [2019-10-03 01:52:49,290 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 01:52:49,299 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:52:49,300 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 01:52:49,300 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:52:49,300 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 01:52:49,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 01:52:50,403 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:52:50,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 01:52:50,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 01:52:50,405 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 01:52:50,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 01:52:50,406 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 01:52:50,406 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 01:52:50,406 INFO L87 Difference]: Start difference. First operand 2225 states and 2969 transitions. Second operand 3 states. [2019-10-03 01:52:50,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 01:52:50,481 INFO L93 Difference]: Finished difference Result 3958 states and 5303 transitions. [2019-10-03 01:52:50,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 01:52:50,481 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-10-03 01:52:50,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 01:52:50,506 INFO L225 Difference]: With dead ends: 3958 [2019-10-03 01:52:50,506 INFO L226 Difference]: Without dead ends: 3937 [2019-10-03 01:52:50,507 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:52:50,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3937 states. [2019-10-03 01:52:50,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3937 to 3928. [2019-10-03 01:52:50,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3928 states. [2019-10-03 01:52:50,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3928 states to 3928 states and 5271 transitions. [2019-10-03 01:52:50,654 INFO L78 Accepts]: Start accepts. Automaton has 3928 states and 5271 transitions. Word has length 48 [2019-10-03 01:52:50,656 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 01:52:50,656 INFO L475 AbstractCegarLoop]: Abstraction has 3928 states and 5271 transitions. [2019-10-03 01:52:50,656 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 01:52:50,656 INFO L276 IsEmpty]: Start isEmpty. Operand 3928 states and 5271 transitions. [2019-10-03 01:52:50,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-03 01:52:50,658 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 01:52:50,658 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] [2019-10-03 01:52:50,659 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 01:52:50,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 01:52:50,659 INFO L82 PathProgramCache]: Analyzing trace with hash 490215631, now seen corresponding path program 1 times [2019-10-03 01:52:50,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 01:52:50,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:52:50,669 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 01:52:50,669 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:52:50,670 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 01:52:51,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 01:52:51,471 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:52:51,472 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 01:52:51,472 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 01:52:51,472 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 01:52:51,473 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 01:52:51,473 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 01:52:51,473 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 01:52:51,473 INFO L87 Difference]: Start difference. First operand 3928 states and 5271 transitions. Second operand 3 states. [2019-10-03 01:53:08,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 01:53:08,464 INFO L93 Difference]: Finished difference Result 5744 states and 7706 transitions. [2019-10-03 01:53:08,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 01:53:08,465 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-10-03 01:53:08,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 01:53:08,500 INFO L225 Difference]: With dead ends: 5744 [2019-10-03 01:53:08,501 INFO L226 Difference]: Without dead ends: 5744 [2019-10-03 01:53:08,501 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:53:08,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5744 states. [2019-10-03 01:53:08,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5744 to 5718. [2019-10-03 01:53:08,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5718 states. [2019-10-03 01:53:08,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5718 states to 5718 states and 7681 transitions. [2019-10-03 01:53:08,686 INFO L78 Accepts]: Start accepts. Automaton has 5718 states and 7681 transitions. Word has length 79 [2019-10-03 01:53:08,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 01:53:08,687 INFO L475 AbstractCegarLoop]: Abstraction has 5718 states and 7681 transitions. [2019-10-03 01:53:08,687 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 01:53:08,687 INFO L276 IsEmpty]: Start isEmpty. Operand 5718 states and 7681 transitions. [2019-10-03 01:53:08,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2019-10-03 01:53:08,692 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 01:53:08,692 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 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] [2019-10-03 01:53:08,692 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 01:53:08,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 01:53:08,693 INFO L82 PathProgramCache]: Analyzing trace with hash -1180031389, now seen corresponding path program 1 times [2019-10-03 01:53:08,693 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 01:53:08,703 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:53:08,703 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 01:53:08,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:53:08,704 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 01:53:09,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 01:53:09,531 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 01:53:09,532 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 01:53:09,532 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 01:53:09,532 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 01:53:09,534 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 01:53:09,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 01:53:09,535 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 01:53:09,535 INFO L87 Difference]: Start difference. First operand 5718 states and 7681 transitions. Second operand 3 states. [2019-10-03 01:53:22,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 01:53:22,916 INFO L93 Difference]: Finished difference Result 7534 states and 10116 transitions. [2019-10-03 01:53:22,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 01:53:22,917 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 105 [2019-10-03 01:53:22,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 01:53:22,971 INFO L225 Difference]: With dead ends: 7534 [2019-10-03 01:53:22,972 INFO L226 Difference]: Without dead ends: 7534 [2019-10-03 01:53:22,972 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:53:22,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7534 states. [2019-10-03 01:53:23,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7534 to 7508. [2019-10-03 01:53:23,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7508 states. [2019-10-03 01:53:23,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7508 states to 7508 states and 10091 transitions. [2019-10-03 01:53:23,253 INFO L78 Accepts]: Start accepts. Automaton has 7508 states and 10091 transitions. Word has length 105 [2019-10-03 01:53:23,253 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 01:53:23,254 INFO L475 AbstractCegarLoop]: Abstraction has 7508 states and 10091 transitions. [2019-10-03 01:53:23,254 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 01:53:23,254 INFO L276 IsEmpty]: Start isEmpty. Operand 7508 states and 10091 transitions. [2019-10-03 01:53:23,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-03 01:53:23,266 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 01:53:23,266 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, 1, 1, 1, 1, 1, 1, 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:53:23,267 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 01:53:23,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 01:53:23,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1765664735, now seen corresponding path program 1 times [2019-10-03 01:53:23,267 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 01:53:23,280 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:53:23,281 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 01:53:23,281 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:53:23,281 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 01:53:23,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 01:53:24,132 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-03 01:53:24,133 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 01:53:24,134 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 01:53:24,134 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 01:53:24,134 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 01:53:24,135 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 01:53:24,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 01:53:24,135 INFO L87 Difference]: Start difference. First operand 7508 states and 10091 transitions. Second operand 3 states. [2019-10-03 01:53:36,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 01:53:36,103 INFO L93 Difference]: Finished difference Result 9661 states and 12985 transitions. [2019-10-03 01:53:36,103 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 01:53:36,104 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-10-03 01:53:36,104 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 01:53:36,141 INFO L225 Difference]: With dead ends: 9661 [2019-10-03 01:53:36,141 INFO L226 Difference]: Without dead ends: 9661 [2019-10-03 01:53:36,142 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:53:36,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9661 states. [2019-10-03 01:53:36,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9661 to 9570. [2019-10-03 01:53:36,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9570 states. [2019-10-03 01:53:36,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9570 states to 9570 states and 12885 transitions. [2019-10-03 01:53:36,354 INFO L78 Accepts]: Start accepts. Automaton has 9570 states and 12885 transitions. Word has length 127 [2019-10-03 01:53:36,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 01:53:36,355 INFO L475 AbstractCegarLoop]: Abstraction has 9570 states and 12885 transitions. [2019-10-03 01:53:36,355 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 01:53:36,355 INFO L276 IsEmpty]: Start isEmpty. Operand 9570 states and 12885 transitions. [2019-10-03 01:53:36,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-03 01:53:36,361 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 01:53:36,361 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 01:53:36,362 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 01:53:36,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 01:53:36,362 INFO L82 PathProgramCache]: Analyzing trace with hash -1946543832, now seen corresponding path program 1 times [2019-10-03 01:53:36,362 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 01:53:36,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:53:36,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 01:53:36,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:53:36,371 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 01:53:37,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 01:53:38,178 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-03 01:53:38,179 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 01:53:38,179 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 01:53:38,179 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 01:53:38,180 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 01:53:38,180 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 01:53:38,180 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-03 01:53:38,180 INFO L87 Difference]: Start difference. First operand 9570 states and 12885 transitions. Second operand 5 states. [2019-10-03 01:53:54,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 01:53:54,487 INFO L93 Difference]: Finished difference Result 13063 states and 17999 transitions. [2019-10-03 01:53:54,487 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-03 01:53:54,487 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 139 [2019-10-03 01:53:54,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 01:53:54,546 INFO L225 Difference]: With dead ends: 13063 [2019-10-03 01:53:54,546 INFO L226 Difference]: Without dead ends: 13063 [2019-10-03 01:53:54,548 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-03 01:53:54,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13063 states. [2019-10-03 01:53:54,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13063 to 11860. [2019-10-03 01:53:54,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11860 states. [2019-10-03 01:53:54,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11860 states to 11860 states and 16121 transitions. [2019-10-03 01:53:54,852 INFO L78 Accepts]: Start accepts. Automaton has 11860 states and 16121 transitions. Word has length 139 [2019-10-03 01:53:54,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 01:53:54,852 INFO L475 AbstractCegarLoop]: Abstraction has 11860 states and 16121 transitions. [2019-10-03 01:53:54,852 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 01:53:54,852 INFO L276 IsEmpty]: Start isEmpty. Operand 11860 states and 16121 transitions. [2019-10-03 01:53:54,859 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-03 01:53:54,860 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 01:53:54,860 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 01:53:54,860 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 01:53:54,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 01:53:54,861 INFO L82 PathProgramCache]: Analyzing trace with hash 1067032448, now seen corresponding path program 1 times [2019-10-03 01:53:54,861 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 01:53:54,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:53:54,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 01:53:54,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:53:54,869 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 01:53:55,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 01:53:55,783 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-03 01:53:55,783 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 01:53:55,783 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 01:53:55,783 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 01:53:55,784 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 01:53:55,784 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 01:53:55,784 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 01:53:55,784 INFO L87 Difference]: Start difference. First operand 11860 states and 16121 transitions. Second operand 3 states. [2019-10-03 01:54:10,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 01:54:10,451 INFO L93 Difference]: Finished difference Result 14102 states and 19142 transitions. [2019-10-03 01:54:10,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 01:54:10,452 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-10-03 01:54:10,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 01:54:10,496 INFO L225 Difference]: With dead ends: 14102 [2019-10-03 01:54:10,496 INFO L226 Difference]: Without dead ends: 14102 [2019-10-03 01:54:10,498 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:54:10,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14102 states. [2019-10-03 01:54:10,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14102 to 14076. [2019-10-03 01:54:10,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14076 states. [2019-10-03 01:54:10,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14076 states to 14076 states and 19117 transitions. [2019-10-03 01:54:10,771 INFO L78 Accepts]: Start accepts. Automaton has 14076 states and 19117 transitions. Word has length 141 [2019-10-03 01:54:10,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 01:54:10,772 INFO L475 AbstractCegarLoop]: Abstraction has 14076 states and 19117 transitions. [2019-10-03 01:54:10,772 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 01:54:10,772 INFO L276 IsEmpty]: Start isEmpty. Operand 14076 states and 19117 transitions. [2019-10-03 01:54:10,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-03 01:54:10,781 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 01:54:10,781 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 01:54:10,782 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 01:54:10,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 01:54:10,782 INFO L82 PathProgramCache]: Analyzing trace with hash -828554506, now seen corresponding path program 1 times [2019-10-03 01:54:10,782 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 01:54:10,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:54:10,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 01:54:10,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:54:10,791 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 01:54:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 01:54:11,584 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-03 01:54:11,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 01:54:11,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 01:54:11,585 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 01:54:11,585 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 01:54:11,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 01:54:11,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 01:54:11,587 INFO L87 Difference]: Start difference. First operand 14076 states and 19117 transitions. Second operand 3 states. [2019-10-03 01:54:30,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 01:54:30,012 INFO L93 Difference]: Finished difference Result 16318 states and 22138 transitions. [2019-10-03 01:54:30,013 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 01:54:30,013 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-10-03 01:54:30,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 01:54:30,058 INFO L225 Difference]: With dead ends: 16318 [2019-10-03 01:54:30,058 INFO L226 Difference]: Without dead ends: 16318 [2019-10-03 01:54:30,059 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:54:30,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16318 states. [2019-10-03 01:54:30,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16318 to 16292. [2019-10-03 01:54:30,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16292 states. [2019-10-03 01:54:30,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16292 states to 16292 states and 22113 transitions. [2019-10-03 01:54:30,540 INFO L78 Accepts]: Start accepts. Automaton has 16292 states and 22113 transitions. Word has length 140 [2019-10-03 01:54:30,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 01:54:30,541 INFO L475 AbstractCegarLoop]: Abstraction has 16292 states and 22113 transitions. [2019-10-03 01:54:30,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 01:54:30,541 INFO L276 IsEmpty]: Start isEmpty. Operand 16292 states and 22113 transitions. [2019-10-03 01:54:30,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-03 01:54:30,547 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 01:54:30,547 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 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] [2019-10-03 01:54:30,548 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 01:54:30,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 01:54:30,549 INFO L82 PathProgramCache]: Analyzing trace with hash 279441033, now seen corresponding path program 1 times [2019-10-03 01:54:30,549 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 01:54:30,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:54:30,557 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 01:54:30,557 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:54:30,557 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 01:54:30,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 01:54:31,369 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-03 01:54:31,369 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 01:54:31,370 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 01:54:31,370 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 01:54:31,370 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 01:54:31,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 01:54:31,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 01:54:31,371 INFO L87 Difference]: Start difference. First operand 16292 states and 22113 transitions. Second operand 3 states. [2019-10-03 01:54:48,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 01:54:48,808 INFO L93 Difference]: Finished difference Result 18534 states and 25134 transitions. [2019-10-03 01:54:48,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 01:54:48,809 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2019-10-03 01:54:48,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 01:54:48,860 INFO L225 Difference]: With dead ends: 18534 [2019-10-03 01:54:48,861 INFO L226 Difference]: Without dead ends: 18534 [2019-10-03 01:54:48,861 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:54:48,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18534 states. [2019-10-03 01:54:49,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18534 to 18508. [2019-10-03 01:54:49,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18508 states. [2019-10-03 01:54:49,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18508 states to 18508 states and 25109 transitions. [2019-10-03 01:54:49,244 INFO L78 Accepts]: Start accepts. Automaton has 18508 states and 25109 transitions. Word has length 142 [2019-10-03 01:54:49,245 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 01:54:49,245 INFO L475 AbstractCegarLoop]: Abstraction has 18508 states and 25109 transitions. [2019-10-03 01:54:49,245 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 01:54:49,245 INFO L276 IsEmpty]: Start isEmpty. Operand 18508 states and 25109 transitions. [2019-10-03 01:54:49,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-03 01:54:49,255 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 01:54:49,256 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 01:54:49,256 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 01:54:49,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 01:54:49,256 INFO L82 PathProgramCache]: Analyzing trace with hash -1333297293, now seen corresponding path program 1 times [2019-10-03 01:54:49,257 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 01:54:49,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:54:49,264 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 01:54:49,264 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:54:49,265 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 01:54:49,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 01:54:50,077 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-03 01:54:50,078 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 01:54:50,078 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 01:54:50,078 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 01:54:50,079 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 01:54:50,079 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 01:54:50,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 01:54:50,079 INFO L87 Difference]: Start difference. First operand 18508 states and 25109 transitions. Second operand 5 states. [2019-10-03 01:55:03,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 01:55:03,075 INFO L93 Difference]: Finished difference Result 18508 states and 25105 transitions. [2019-10-03 01:55:03,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 01:55:03,075 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2019-10-03 01:55:03,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 01:55:03,126 INFO L225 Difference]: With dead ends: 18508 [2019-10-03 01:55:03,126 INFO L226 Difference]: Without dead ends: 18508 [2019-10-03 01:55:03,127 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-03 01:55:03,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18508 states. [2019-10-03 01:55:03,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18508 to 18508. [2019-10-03 01:55:03,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18508 states. [2019-10-03 01:55:03,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18508 states to 18508 states and 25105 transitions. [2019-10-03 01:55:03,464 INFO L78 Accepts]: Start accepts. Automaton has 18508 states and 25105 transitions. Word has length 143 [2019-10-03 01:55:03,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 01:55:03,464 INFO L475 AbstractCegarLoop]: Abstraction has 18508 states and 25105 transitions. [2019-10-03 01:55:03,465 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 01:55:03,465 INFO L276 IsEmpty]: Start isEmpty. Operand 18508 states and 25105 transitions. [2019-10-03 01:55:03,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-03 01:55:03,475 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 01:55:03,476 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 01:55:03,476 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 01:55:03,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 01:55:03,477 INFO L82 PathProgramCache]: Analyzing trace with hash 1965405986, now seen corresponding path program 1 times [2019-10-03 01:55:03,477 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 01:55:03,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:55:03,487 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 01:55:03,487 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:55:03,487 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 01:55:03,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 01:55:04,665 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:55:04,666 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 01:55:04,666 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 01:55:04,666 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 01:55:04,667 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 01:55:04,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 01:55:04,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 01:55:04,667 INFO L87 Difference]: Start difference. First operand 18508 states and 25105 transitions. Second operand 5 states. [2019-10-03 01:55:17,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 01:55:17,024 INFO L93 Difference]: Finished difference Result 18508 states and 25101 transitions. [2019-10-03 01:55:17,025 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 01:55:17,025 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2019-10-03 01:55:17,025 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 01:55:17,084 INFO L225 Difference]: With dead ends: 18508 [2019-10-03 01:55:17,085 INFO L226 Difference]: Without dead ends: 18508 [2019-10-03 01:55:17,085 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-03 01:55:17,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18508 states. [2019-10-03 01:55:17,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18508 to 18508. [2019-10-03 01:55:17,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18508 states. [2019-10-03 01:55:17,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18508 states to 18508 states and 25101 transitions. [2019-10-03 01:55:17,443 INFO L78 Accepts]: Start accepts. Automaton has 18508 states and 25101 transitions. Word has length 143 [2019-10-03 01:55:17,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 01:55:17,443 INFO L475 AbstractCegarLoop]: Abstraction has 18508 states and 25101 transitions. [2019-10-03 01:55:17,443 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 01:55:17,444 INFO L276 IsEmpty]: Start isEmpty. Operand 18508 states and 25101 transitions. [2019-10-03 01:55:17,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-03 01:55:17,450 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 01:55:17,450 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 01:55:17,451 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 01:55:17,451 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 01:55:17,451 INFO L82 PathProgramCache]: Analyzing trace with hash -1321420634, now seen corresponding path program 1 times [2019-10-03 01:55:17,451 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 01:55:17,460 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:55:17,460 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 01:55:17,461 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:55:17,461 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 01:55:17,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 01:55:18,276 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:55:18,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 01:55:18,279 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 01:55:18,279 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 01:55:18,279 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 01:55:18,281 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 01:55:18,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 01:55:18,281 INFO L87 Difference]: Start difference. First operand 18508 states and 25101 transitions. Second operand 5 states. [2019-10-03 01:55:33,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 01:55:33,009 INFO L93 Difference]: Finished difference Result 18508 states and 25097 transitions. [2019-10-03 01:55:33,009 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 01:55:33,009 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2019-10-03 01:55:33,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 01:55:33,060 INFO L225 Difference]: With dead ends: 18508 [2019-10-03 01:55:33,060 INFO L226 Difference]: Without dead ends: 18508 [2019-10-03 01:55:33,061 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-03 01:55:33,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18508 states. [2019-10-03 01:55:33,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18508 to 18508. [2019-10-03 01:55:33,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18508 states. [2019-10-03 01:55:33,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18508 states to 18508 states and 25097 transitions. [2019-10-03 01:55:33,362 INFO L78 Accepts]: Start accepts. Automaton has 18508 states and 25097 transitions. Word has length 141 [2019-10-03 01:55:33,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 01:55:33,363 INFO L475 AbstractCegarLoop]: Abstraction has 18508 states and 25097 transitions. [2019-10-03 01:55:33,363 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 01:55:33,363 INFO L276 IsEmpty]: Start isEmpty. Operand 18508 states and 25097 transitions. [2019-10-03 01:55:33,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-03 01:55:33,376 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 01:55:33,376 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, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 01:55:33,377 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 01:55:33,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 01:55:33,377 INFO L82 PathProgramCache]: Analyzing trace with hash -479595860, now seen corresponding path program 1 times [2019-10-03 01:55:33,377 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 01:55:33,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:55:33,384 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 01:55:33,384 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:55:33,384 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 01:55:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 01:55:34,545 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:55:34,545 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 01:55:34,545 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-03 01:55:34,545 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 01:55:34,546 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-03 01:55:34,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-03 01:55:34,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-03 01:55:34,547 INFO L87 Difference]: Start difference. First operand 18508 states and 25097 transitions. Second operand 10 states. [2019-10-03 01:55:55,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 01:55:55,036 INFO L93 Difference]: Finished difference Result 19379 states and 26175 transitions. [2019-10-03 01:55:55,036 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-03 01:55:55,036 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 149 [2019-10-03 01:55:55,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 01:55:55,102 INFO L225 Difference]: With dead ends: 19379 [2019-10-03 01:55:55,102 INFO L226 Difference]: Without dead ends: 19251 [2019-10-03 01:55:55,102 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-10-03 01:55:55,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19251 states. [2019-10-03 01:55:55,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19251 to 18606. [2019-10-03 01:55:55,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18606 states. [2019-10-03 01:55:55,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18606 states to 18606 states and 25147 transitions. [2019-10-03 01:55:55,470 INFO L78 Accepts]: Start accepts. Automaton has 18606 states and 25147 transitions. Word has length 149 [2019-10-03 01:55:55,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 01:55:55,471 INFO L475 AbstractCegarLoop]: Abstraction has 18606 states and 25147 transitions. [2019-10-03 01:55:55,471 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-03 01:55:55,471 INFO L276 IsEmpty]: Start isEmpty. Operand 18606 states and 25147 transitions. [2019-10-03 01:55:55,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2019-10-03 01:55:55,477 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 01:55:55,478 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 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:55:55,478 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 01:55:55,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 01:55:55,479 INFO L82 PathProgramCache]: Analyzing trace with hash -442131084, now seen corresponding path program 1 times [2019-10-03 01:55:55,479 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 01:55:55,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:55:55,489 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 01:55:55,489 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:55:55,489 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 01:55:55,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 01:55:56,350 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-03 01:55:56,351 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 01:55:56,351 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 01:55:56,351 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 01:55:56,352 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 01:55:56,352 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 01:55:56,352 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 01:55:56,352 INFO L87 Difference]: Start difference. First operand 18606 states and 25147 transitions. Second operand 5 states. [2019-10-03 01:55:56,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 01:55:56,514 INFO L93 Difference]: Finished difference Result 18638 states and 25131 transitions. [2019-10-03 01:55:56,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 01:55:56,515 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 176 [2019-10-03 01:55:56,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 01:55:56,571 INFO L225 Difference]: With dead ends: 18638 [2019-10-03 01:55:56,571 INFO L226 Difference]: Without dead ends: 18638 [2019-10-03 01:55:56,572 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:55:56,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18638 states. [2019-10-03 01:55:56,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18638 to 18558. [2019-10-03 01:55:56,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18558 states. [2019-10-03 01:55:56,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18558 states to 18558 states and 25035 transitions. [2019-10-03 01:55:56,911 INFO L78 Accepts]: Start accepts. Automaton has 18558 states and 25035 transitions. Word has length 176 [2019-10-03 01:55:56,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 01:55:56,912 INFO L475 AbstractCegarLoop]: Abstraction has 18558 states and 25035 transitions. [2019-10-03 01:55:56,912 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 01:55:56,912 INFO L276 IsEmpty]: Start isEmpty. Operand 18558 states and 25035 transitions. [2019-10-03 01:55:56,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-03 01:55:56,919 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 01:55:56,920 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-03 01:55:56,920 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 01:55:56,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 01:55:56,921 INFO L82 PathProgramCache]: Analyzing trace with hash 720967364, now seen corresponding path program 1 times [2019-10-03 01:55:56,921 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 01:55:56,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:55:56,929 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 01:55:56,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:55:56,930 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 01:55:57,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 01:55:57,637 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:55:57,637 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 01:55:57,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-03 01:55:57,637 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 01:55:57,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-03 01:55:57,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-03 01:55:57,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-03 01:55:57,639 INFO L87 Difference]: Start difference. First operand 18558 states and 25035 transitions. Second operand 5 states. [2019-10-03 01:55:57,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 01:55:57,762 INFO L93 Difference]: Finished difference Result 18750 states and 25259 transitions. [2019-10-03 01:55:57,763 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-03 01:55:57,763 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 195 [2019-10-03 01:55:57,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 01:55:57,816 INFO L225 Difference]: With dead ends: 18750 [2019-10-03 01:55:57,816 INFO L226 Difference]: Without dead ends: 18750 [2019-10-03 01:55:57,816 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:55:57,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18750 states. [2019-10-03 01:55:58,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18750 to 18654. [2019-10-03 01:55:58,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18654 states. [2019-10-03 01:55:58,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18654 states to 18654 states and 25131 transitions. [2019-10-03 01:55:58,143 INFO L78 Accepts]: Start accepts. Automaton has 18654 states and 25131 transitions. Word has length 195 [2019-10-03 01:55:58,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 01:55:58,144 INFO L475 AbstractCegarLoop]: Abstraction has 18654 states and 25131 transitions. [2019-10-03 01:55:58,144 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-03 01:55:58,144 INFO L276 IsEmpty]: Start isEmpty. Operand 18654 states and 25131 transitions. [2019-10-03 01:55:58,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2019-10-03 01:55:58,153 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 01:55:58,153 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 01:55:58,153 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 01:55:58,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 01:55:58,154 INFO L82 PathProgramCache]: Analyzing trace with hash -1495408093, now seen corresponding path program 1 times [2019-10-03 01:55:58,154 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 01:55:58,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:55:58,165 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 01:55:58,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:55:58,165 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 01:55:58,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 01:55:59,191 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:55:59,191 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 01:55:59,192 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-03 01:55:59,192 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 01:55:59,192 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-03 01:55:59,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-03 01:55:59,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-03 01:55:59,193 INFO L87 Difference]: Start difference. First operand 18654 states and 25131 transitions. Second operand 4 states. [2019-10-03 01:56:22,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 01:56:22,011 INFO L93 Difference]: Finished difference Result 36580 states and 49116 transitions. [2019-10-03 01:56:22,011 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-03 01:56:22,011 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 196 [2019-10-03 01:56:22,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 01:56:22,111 INFO L225 Difference]: With dead ends: 36580 [2019-10-03 01:56:22,112 INFO L226 Difference]: Without dead ends: 36580 [2019-10-03 01:56:22,112 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:56:22,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36580 states. [2019-10-03 01:56:22,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36580 to 36540. [2019-10-03 01:56:22,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36540 states. [2019-10-03 01:56:22,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36540 states to 36540 states and 49077 transitions. [2019-10-03 01:56:22,762 INFO L78 Accepts]: Start accepts. Automaton has 36540 states and 49077 transitions. Word has length 196 [2019-10-03 01:56:22,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 01:56:22,764 INFO L475 AbstractCegarLoop]: Abstraction has 36540 states and 49077 transitions. [2019-10-03 01:56:22,765 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-03 01:56:22,765 INFO L276 IsEmpty]: Start isEmpty. Operand 36540 states and 49077 transitions. [2019-10-03 01:56:22,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2019-10-03 01:56:22,779 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 01:56:22,780 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-03 01:56:22,780 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 01:56:22,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 01:56:22,780 INFO L82 PathProgramCache]: Analyzing trace with hash 164540116, now seen corresponding path program 1 times [2019-10-03 01:56:22,780 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 01:56:22,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:56:22,789 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 01:56:22,789 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:56:22,790 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 01:56:23,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 01:56:23,461 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-03 01:56:23,462 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 01:56:23,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-03 01:56:23,462 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 01:56:23,462 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-03 01:56:23,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-03 01:56:23,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-03 01:56:23,463 INFO L87 Difference]: Start difference. First operand 36540 states and 49077 transitions. Second operand 3 states. [2019-10-03 01:56:53,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 01:56:53,810 INFO L93 Difference]: Finished difference Result 22645 states and 29507 transitions. [2019-10-03 01:56:53,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-03 01:56:53,811 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 217 [2019-10-03 01:56:53,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 01:56:53,877 INFO L225 Difference]: With dead ends: 22645 [2019-10-03 01:56:53,877 INFO L226 Difference]: Without dead ends: 22645 [2019-10-03 01:56:53,878 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:56:53,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22645 states. [2019-10-03 01:56:54,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22645 to 16165. [2019-10-03 01:56:54,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16165 states. [2019-10-03 01:56:54,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16165 states to 16165 states and 22062 transitions. [2019-10-03 01:56:54,325 INFO L78 Accepts]: Start accepts. Automaton has 16165 states and 22062 transitions. Word has length 217 [2019-10-03 01:56:54,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 01:56:54,328 INFO L475 AbstractCegarLoop]: Abstraction has 16165 states and 22062 transitions. [2019-10-03 01:56:54,328 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-03 01:56:54,328 INFO L276 IsEmpty]: Start isEmpty. Operand 16165 states and 22062 transitions. [2019-10-03 01:56:54,339 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 213 [2019-10-03 01:56:54,339 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 01:56:54,340 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:56:54,340 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 01:56:54,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 01:56:54,341 INFO L82 PathProgramCache]: Analyzing trace with hash 979341635, now seen corresponding path program 1 times [2019-10-03 01:56:54,341 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 01:56:54,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:56:54,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 01:56:54,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:56:54,351 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 01:56:55,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 01:56:55,940 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-03 01:56:55,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-03 01:56:55,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-03 01:56:55,941 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 01:56:55,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-03 01:56:55,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-03 01:56:55,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-03 01:56:55,943 INFO L87 Difference]: Start difference. First operand 16165 states and 22062 transitions. Second operand 8 states. [2019-10-03 01:57:14,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 01:57:14,807 INFO L93 Difference]: Finished difference Result 16192 states and 22081 transitions. [2019-10-03 01:57:14,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-03 01:57:14,811 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 212 [2019-10-03 01:57:14,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 01:57:14,847 INFO L225 Difference]: With dead ends: 16192 [2019-10-03 01:57:14,847 INFO L226 Difference]: Without dead ends: 16132 [2019-10-03 01:57:14,847 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:57:14,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16132 states. [2019-10-03 01:57:15,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16132 to 16059. [2019-10-03 01:57:15,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16059 states. [2019-10-03 01:57:15,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16059 states to 16059 states and 21936 transitions. [2019-10-03 01:57:15,181 INFO L78 Accepts]: Start accepts. Automaton has 16059 states and 21936 transitions. Word has length 212 [2019-10-03 01:57:15,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 01:57:15,181 INFO L475 AbstractCegarLoop]: Abstraction has 16059 states and 21936 transitions. [2019-10-03 01:57:15,182 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-03 01:57:15,182 INFO L276 IsEmpty]: Start isEmpty. Operand 16059 states and 21936 transitions. [2019-10-03 01:57:15,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 207 [2019-10-03 01:57:15,189 INFO L403 BasicCegarLoop]: Found error trace [2019-10-03 01:57:15,189 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, 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:57:15,190 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-03 01:57:15,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 01:57:15,190 INFO L82 PathProgramCache]: Analyzing trace with hash -1622953061, now seen corresponding path program 1 times [2019-10-03 01:57:15,190 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-03 01:57:15,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:57:15,198 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-03 01:57:15,198 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-03 01:57:15,198 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-03 01:57:15,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-03 01:57:16,242 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2019-10-03 01:57:16,243 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-03 01:57:16,243 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-03 01:57:16,244 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 207 with the following transitions: [2019-10-03 01:57:16,247 INFO L207 CegarAbsIntRunner]: [23], [24], [50], [53], [96], [97], [146], [148], [149], [152], [155], [159], [161], [165], [169], [171], [175], [179], [182], [190], [192], [194], [199], [201], [204], [209], [212], [216], [219], [222], [226], [227], [233], [234], [235], [236], [432], [434], [435], [436], [438], [440], [441], [460], [461], [485], [629], [635], [637], [638], [639], [641], [643], [644], [663], [665], [666], [686], [687], [697], [698], [752], [754], [755], [758], [760], [762], [834], [837], [840], [843], [846], [848], [852], [855], [858], [860], [865], [868], [891], [894], [897], [916], [935], [954], [973], [976], [979], [981], [984], [992], [1011], [1030], [1049], [1068], [1087], [1106], [1125], [1128], [1131], [1133], [1136], [1636], [1638], [1642], [1653], [1656], [1659], [1687], [1688], [1721], [1722], [1829], [1834], [1835], [1854], [1856], [1857], [1896], [1903], [1907], [1913], [1914], [2020], [2021], [2022], [2023], [2048], [2049], [2050], [2051], [2052], [2053], [2054], [2055], [2108], [2109], [2110], [2111], [2112], [2113], [2150], [2151], [2152], [2153], [2156], [2157], [2180], [2181], [2182], [2183], [2192], [2193], [2194], [2195], [2196], [2197], [2208], [2209], [2224], [2225], [2244], [2324], [2325], [2328], [2329], [2394], [2395], [2396], [2397], [2404], [2405], [2422], [2434], [2435], [2436] [2019-10-03 01:57:16,342 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-03 01:57:16,342 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-03 01:57:17,093 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-03 01:57:17,095 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 1068 root evaluator evaluations with a maximum evaluation depth of 0. Performed 1068 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 2128 variables. [2019-10-03 01:57:17,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-03 01:57:17,099 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-03 01:57:17,214 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-03 01:57:17,214 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-03 01:57:17,220 INFO L420 sIntCurrentIteration]: We unified 205 AI predicates to 205 [2019-10-03 01:57:17,220 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-03 01:57:17,222 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-03 01:57:17,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 4 [2019-10-03 01:57:17,223 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-03 01:57:17,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-03 01:57:17,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-03 01:57:17,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-03 01:57:17,224 INFO L87 Difference]: Start difference. First operand 16059 states and 21936 transitions. Second operand 2 states. [2019-10-03 01:57:17,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-03 01:57:17,226 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-03 01:57:17,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-03 01:57:17,227 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 206 [2019-10-03 01:57:17,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-03 01:57:17,227 INFO L225 Difference]: With dead ends: 2 [2019-10-03 01:57:17,227 INFO L226 Difference]: Without dead ends: 0 [2019-10-03 01:57:17,229 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 205 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:57:17,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-03 01:57:17,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-03 01:57:17,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-03 01:57:17,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-03 01:57:17,230 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 206 [2019-10-03 01:57:17,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-03 01:57:17,230 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-03 01:57:17,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-03 01:57:17,230 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-03 01:57:17,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-03 01:57:17,238 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.10 01:57:17 BoogieIcfgContainer [2019-10-03 01:57:17,238 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-03 01:57:17,248 INFO L168 Benchmark]: Toolchain (without parser) took 455242.34 ms. Allocated memory was 137.9 MB in the beginning and 1.9 GB in the end (delta: 1.8 GB). Free memory was 78.2 MB in the beginning and 136.3 MB in the end (delta: -58.0 MB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-10-03 01:57:17,248 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 137.9 MB. Free memory was 104.0 MB in the beginning and 103.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-10-03 01:57:17,251 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2403.29 ms. Allocated memory was 137.9 MB in the beginning and 266.3 MB in the end (delta: 128.5 MB). Free memory was 77.8 MB in the beginning and 143.5 MB in the end (delta: -65.7 MB). Peak memory consumption was 111.0 MB. Max. memory is 7.1 GB. [2019-10-03 01:57:17,252 INFO L168 Benchmark]: Boogie Preprocessor took 545.80 ms. Allocated memory is still 266.3 MB. Free memory was 143.5 MB in the beginning and 95.3 MB in the end (delta: 48.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 7.1 GB. [2019-10-03 01:57:17,260 INFO L168 Benchmark]: RCFGBuilder took 59098.66 ms. Allocated memory was 266.3 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 95.3 MB in the beginning and 413.7 MB in the end (delta: -318.5 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-10-03 01:57:17,261 INFO L168 Benchmark]: TraceAbstraction took 393185.16 ms. Allocated memory was 1.3 GB in the beginning and 1.9 GB in the end (delta: 583.5 MB). Free memory was 413.7 MB in the beginning and 136.3 MB in the end (delta: 277.5 MB). Peak memory consumption was 861.0 MB. Max. memory is 7.1 GB. [2019-10-03 01:57:17,268 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.24 ms. Allocated memory is still 137.9 MB. Free memory was 104.0 MB in the beginning and 103.7 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2403.29 ms. Allocated memory was 137.9 MB in the beginning and 266.3 MB in the end (delta: 128.5 MB). Free memory was 77.8 MB in the beginning and 143.5 MB in the end (delta: -65.7 MB). Peak memory consumption was 111.0 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 545.80 ms. Allocated memory is still 266.3 MB. Free memory was 143.5 MB in the beginning and 95.3 MB in the end (delta: 48.3 MB). Peak memory consumption was 48.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 59098.66 ms. Allocated memory was 266.3 MB in the beginning and 1.3 GB in the end (delta: 1.1 GB). Free memory was 95.3 MB in the beginning and 413.7 MB in the end (delta: -318.5 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * TraceAbstraction took 393185.16 ms. Allocated memory was 1.3 GB in the beginning and 1.9 GB in the end (delta: 583.5 MB). Free memory was 413.7 MB in the beginning and 136.3 MB in the end (delta: 277.5 MB). Peak memory consumption was 861.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 5062]: 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 140 procedures, 1083 locations, 1 error locations. SAFE Result, 393.1s OverallTime, 23 OverallIterations, 4 TraceHistogramMax, 361.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 26449 SDtfs, 15735 SDslu, 41621 SDs, 0 SdLazy, 1538 SolverSat, 255 SolverUnsat, 11 SolverUnknown, 0 SolverNotchecked, 346.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 317 GetRequests, 254 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 2.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=36540occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.8s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 2.3024390243902437 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 6.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 8921 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 2.2s SsaConstructionTime, 8.9s SatisfiabilityAnalysisTime, 12.2s InterpolantComputationTime, 2907 NumberOfCodeBlocks, 2907 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 2884 ConstructedInterpolants, 0 QuantifiedInterpolants, 525334 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 22 PerfectInterpolantSequences, 543/564 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! [MP z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forcibly destroying the process Received shutdown request...