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-consumption/32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pg.ko-main.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-fea9116 [2019-09-20 13:43:07,068 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-20 13:43:07,070 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-20 13:43:07,083 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-20 13:43:07,084 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-20 13:43:07,085 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-20 13:43:07,086 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-20 13:43:07,088 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-20 13:43:07,090 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-20 13:43:07,091 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-20 13:43:07,092 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-20 13:43:07,093 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-20 13:43:07,094 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-20 13:43:07,095 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-20 13:43:07,096 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-20 13:43:07,097 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-20 13:43:07,098 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-20 13:43:07,099 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-20 13:43:07,100 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-20 13:43:07,102 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-20 13:43:07,104 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-20 13:43:07,105 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-20 13:43:07,106 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-20 13:43:07,106 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-20 13:43:07,109 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-20 13:43:07,109 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-20 13:43:07,109 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-20 13:43:07,110 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-20 13:43:07,111 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-20 13:43:07,112 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-20 13:43:07,112 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-20 13:43:07,113 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-20 13:43:07,114 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-20 13:43:07,114 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-20 13:43:07,115 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-20 13:43:07,115 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-20 13:43:07,116 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-20 13:43:07,116 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-20 13:43:07,116 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-20 13:43:07,117 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-20 13:43:07,118 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-20 13:43:07,119 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-09-20 13:43:07,135 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-20 13:43:07,135 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-20 13:43:07,136 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-09-20 13:43:07,136 INFO L138 SettingsManager]: * Log level for plugins=info [2019-09-20 13:43:07,137 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-09-20 13:43:07,137 INFO L138 SettingsManager]: * User list type=DISABLED [2019-09-20 13:43:07,137 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-09-20 13:43:07,138 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-09-20 13:43:07,138 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-09-20 13:43:07,138 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-09-20 13:43:07,139 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-20 13:43:07,139 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-20 13:43:07,139 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-20 13:43:07,139 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-20 13:43:07,140 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-20 13:43:07,140 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-20 13:43:07,140 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-20 13:43:07,140 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-20 13:43:07,140 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-20 13:43:07,141 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-20 13:43:07,141 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-20 13:43:07,141 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-09-20 13:43:07,141 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-20 13:43:07,141 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:43:07,142 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-20 13:43:07,142 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-20 13:43:07,142 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-09-20 13:43:07,142 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-20 13:43:07,143 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-20 13:43:07,143 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-09-20 13:43:07,179 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-20 13:43:07,193 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-20 13:43:07,197 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-20 13:43:07,198 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-20 13:43:07,199 INFO L275 PluginConnector]: CDTParser initialized [2019-09-20 13:43:07,200 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pg.ko-main.cil.out.i [2019-09-20 13:43:07,268 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edf7b08b9/e3f2cc08e1db44b5a0c0cb305d13ea10/FLAG77da24f6b [2019-09-20 13:43:08,081 INFO L306 CDTParser]: Found 1 translation units. [2019-09-20 13:43:08,082 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pg.ko-main.cil.out.i [2019-09-20 13:43:08,123 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edf7b08b9/e3f2cc08e1db44b5a0c0cb305d13ea10/FLAG77da24f6b [2019-09-20 13:43:08,637 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/edf7b08b9/e3f2cc08e1db44b5a0c0cb305d13ea10 [2019-09-20 13:43:08,648 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-20 13:43:08,650 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-20 13:43:08,651 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-20 13:43:08,651 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-20 13:43:08,655 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-20 13:43:08,656 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:43:08" (1/1) ... [2019-09-20 13:43:08,660 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a4b2c22 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:43:08, skipping insertion in model container [2019-09-20 13:43:08,660 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.09 01:43:08" (1/1) ... [2019-09-20 13:43:08,668 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-20 13:43:08,780 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-20 13:43:10,064 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:43:10,119 INFO L188 MainTranslator]: Completed pre-run [2019-09-20 13:43:10,367 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-20 13:43:10,527 INFO L192 MainTranslator]: Completed translation [2019-09-20 13:43:10,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:43:10 WrapperNode [2019-09-20 13:43:10,528 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-20 13:43:10,529 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-20 13:43:10,529 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-20 13:43:10,530 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-20 13:43:10,549 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:43:10" (1/1) ... [2019-09-20 13:43:10,550 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:43:10" (1/1) ... [2019-09-20 13:43:10,609 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:43:10" (1/1) ... [2019-09-20 13:43:10,610 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:43:10" (1/1) ... [2019-09-20 13:43:10,704 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:43:10" (1/1) ... [2019-09-20 13:43:10,737 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:43:10" (1/1) ... [2019-09-20 13:43:10,779 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:43:10" (1/1) ... [2019-09-20 13:43:10,805 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-20 13:43:10,806 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-20 13:43:10,806 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-20 13:43:10,806 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-20 13:43:10,808 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:43:10" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-20 13:43:10,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-20 13:43:10,891 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-20 13:43:10,891 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2019-09-20 13:43:10,891 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2019-09-20 13:43:10,891 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2019-09-20 13:43:10,892 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2019-09-20 13:43:10,892 INFO L138 BoogieDeclarations]: Found implementation of procedure iminor [2019-09-20 13:43:10,892 INFO L138 BoogieDeclarations]: Found implementation of procedure register_chrdev [2019-09-20 13:43:10,892 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_chrdev [2019-09-20 13:43:10,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2019-09-20 13:43:10,893 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-09-20 13:43:10,893 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2019-09-20 13:43:10,893 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2019-09-20 13:43:10,893 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2019-09-20 13:43:10,894 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2019-09-20 13:43:10,894 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_init_units [2019-09-20 13:43:10,894 INFO L138 BoogieDeclarations]: Found implementation of procedure status_reg [2019-09-20 13:43:10,894 INFO L138 BoogieDeclarations]: Found implementation of procedure read_reg [2019-09-20 13:43:10,895 INFO L138 BoogieDeclarations]: Found implementation of procedure write_reg [2019-09-20 13:43:10,895 INFO L138 BoogieDeclarations]: Found implementation of procedure DRIVE [2019-09-20 13:43:10,895 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_sleep [2019-09-20 13:43:10,895 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_wait [2019-09-20 13:43:10,896 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_command [2019-09-20 13:43:10,896 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_completion [2019-09-20 13:43:10,896 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_reset [2019-09-20 13:43:10,896 INFO L138 BoogieDeclarations]: Found implementation of procedure xs [2019-09-20 13:43:10,896 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_identify [2019-09-20 13:43:10,897 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_probe [2019-09-20 13:43:10,897 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_detect [2019-09-20 13:43:10,897 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_open [2019-09-20 13:43:10,897 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_release [2019-09-20 13:43:10,897 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_write [2019-09-20 13:43:10,898 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_read [2019-09-20 13:43:10,898 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_init [2019-09-20 13:43:10,898 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_exit [2019-09-20 13:43:10,898 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-20 13:43:10,898 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_1 [2019-09-20 13:43:10,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_2 [2019-09-20 13:43:10,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_3 [2019-09-20 13:43:10,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_4 [2019-09-20 13:43:10,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_5 [2019-09-20 13:43:10,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_6 [2019-09-20 13:43:10,899 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_7 [2019-09-20 13:43:10,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_8 [2019-09-20 13:43:10,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_9 [2019-09-20 13:43:10,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_register_chrdev_10 [2019-09-20 13:43:10,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_unregister_chrdev_11 [2019-09-20 13:43:10,900 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-09-20 13:43:10,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-09-20 13:43:10,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_trap [2019-09-20 13:43:10,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_cred_guard_mutex_of_signal_struct [2019-09-20 13:43:10,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_cred_guard_mutex_of_signal_struct [2019-09-20 13:43:10,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_cred_guard_mutex_of_signal_struct [2019-09-20 13:43:10,901 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_cred_guard_mutex_of_signal_struct [2019-09-20 13:43:10,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_cred_guard_mutex_of_signal_struct [2019-09-20 13:43:10,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_cred_guard_mutex_of_signal_struct [2019-09-20 13:43:10,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_cred_guard_mutex_of_signal_struct [2019-09-20 13:43:10,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_lock [2019-09-20 13:43:10,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_lock [2019-09-20 13:43:10,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_lock [2019-09-20 13:43:10,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_lock [2019-09-20 13:43:10,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_lock [2019-09-20 13:43:10,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_lock [2019-09-20 13:43:10,903 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_lock [2019-09-20 13:43:10,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_mutex_of_device [2019-09-20 13:43:10,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_mutex_of_device [2019-09-20 13:43:10,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mutex_of_device [2019-09-20 13:43:10,904 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_mutex_of_device [2019-09-20 13:43:10,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_mutex_of_device [2019-09-20 13:43:10,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_mutex_of_device [2019-09-20 13:43:10,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mutex_of_device [2019-09-20 13:43:10,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_pg_mutex [2019-09-20 13:43:10,905 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_pg_mutex [2019-09-20 13:43:10,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_pg_mutex [2019-09-20 13:43:10,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_pg_mutex [2019-09-20 13:43:10,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_pg_mutex [2019-09-20 13:43:10,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_pg_mutex [2019-09-20 13:43:10,906 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_pg_mutex [2019-09-20 13:43:10,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-09-20 13:43:10,907 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-09-20 13:43:10,907 INFO L138 BoogieDeclarations]: Found implementation of procedure __class_create [2019-09-20 13:43:10,907 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2019-09-20 13:43:10,908 INFO L138 BoogieDeclarations]: Found implementation of procedure __register_chrdev [2019-09-20 13:43:10,908 INFO L138 BoogieDeclarations]: Found implementation of procedure __unregister_chrdev [2019-09-20 13:43:10,908 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2019-09-20 13:43:10,908 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2019-09-20 13:43:10,908 INFO L138 BoogieDeclarations]: Found implementation of procedure class_destroy [2019-09-20 13:43:10,909 INFO L138 BoogieDeclarations]: Found implementation of procedure device_create [2019-09-20 13:43:10,909 INFO L138 BoogieDeclarations]: Found implementation of procedure device_destroy [2019-09-20 13:43:10,909 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2019-09-20 13:43:10,909 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2019-09-20 13:43:10,909 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_trylock [2019-09-20 13:43:10,909 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2019-09-20 13:43:10,910 INFO L138 BoogieDeclarations]: Found implementation of procedure noop_llseek [2019-09-20 13:43:10,910 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_connect [2019-09-20 13:43:10,910 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_disconnect [2019-09-20 13:43:10,910 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_init [2019-09-20 13:43:10,910 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_read_block [2019-09-20 13:43:10,911 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_read_regr [2019-09-20 13:43:10,911 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_release [2019-09-20 13:43:10,911 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_write_block [2019-09-20 13:43:10,911 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_write_regr [2019-09-20 13:43:10,911 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-09-20 13:43:10,912 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_timeout_interruptible [2019-09-20 13:43:10,912 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_fmt [2019-09-20 13:43:10,912 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-09-20 13:43:10,912 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-09-20 13:43:10,913 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-09-20 13:43:10,913 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-20 13:43:10,913 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-20 13:43:10,913 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-09-20 13:43:10,913 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2019-09-20 13:43:10,913 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2019-09-20 13:43:10,914 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-09-20 13:43:10,914 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2019-09-20 13:43:10,914 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2019-09-20 13:43:10,914 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-09-20 13:43:10,914 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2019-09-20 13:43:10,915 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_fmt [2019-09-20 13:43:10,915 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2019-09-20 13:43:10,915 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2019-09-20 13:43:10,915 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_trylock [2019-09-20 13:43:10,915 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_4 [2019-09-20 13:43:10,915 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2019-09-20 13:43:10,916 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_2 [2019-09-20 13:43:10,916 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_5 [2019-09-20 13:43:10,916 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_7 [2019-09-20 13:43:10,916 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_9 [2019-09-20 13:43:10,916 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2019-09-20 13:43:10,917 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_1 [2019-09-20 13:43:10,917 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_3 [2019-09-20 13:43:10,917 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_6 [2019-09-20 13:43:10,917 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_8 [2019-09-20 13:43:10,917 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_cred_guard_mutex_of_signal_struct [2019-09-20 13:43:10,918 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_cred_guard_mutex_of_signal_struct [2019-09-20 13:43:10,918 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_lock [2019-09-20 13:43:10,918 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_lock [2019-09-20 13:43:10,918 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mutex_of_device [2019-09-20 13:43:10,918 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_mutex_of_device [2019-09-20 13:43:10,918 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mutex_of_device [2019-09-20 13:43:10,919 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_pg_mutex [2019-09-20 13:43:10,919 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_pg_mutex [2019-09-20 13:43:10,919 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-20 13:43:10,919 INFO L130 BoogieDeclarations]: Found specification of procedure iminor [2019-09-20 13:43:10,919 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-20 13:43:10,919 INFO L130 BoogieDeclarations]: Found specification of procedure __register_chrdev [2019-09-20 13:43:10,920 INFO L130 BoogieDeclarations]: Found specification of procedure __unregister_chrdev [2019-09-20 13:43:10,920 INFO L130 BoogieDeclarations]: Found specification of procedure register_chrdev [2019-09-20 13:43:10,920 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_register_chrdev_10 [2019-09-20 13:43:10,920 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_chrdev [2019-09-20 13:43:10,920 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_unregister_chrdev_11 [2019-09-20 13:43:10,921 INFO L130 BoogieDeclarations]: Found specification of procedure noop_llseek [2019-09-20 13:43:10,921 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2019-09-20 13:43:10,921 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-09-20 13:43:10,921 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-09-20 13:43:10,921 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-09-20 13:43:10,922 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2019-09-20 13:43:10,922 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-09-20 13:43:10,922 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-09-20 13:43:10,922 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2019-09-20 13:43:10,922 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2019-09-20 13:43:10,922 INFO L130 BoogieDeclarations]: Found specification of procedure __class_create [2019-09-20 13:43:10,922 INFO L130 BoogieDeclarations]: Found specification of procedure class_destroy [2019-09-20 13:43:10,923 INFO L130 BoogieDeclarations]: Found specification of procedure device_create [2019-09-20 13:43:10,923 INFO L130 BoogieDeclarations]: Found specification of procedure device_destroy [2019-09-20 13:43:10,923 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_timeout_interruptible [2019-09-20 13:43:10,923 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2019-09-20 13:43:10,923 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2019-09-20 13:43:10,923 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2019-09-20 13:43:10,924 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2019-09-20 13:43:10,924 INFO L130 BoogieDeclarations]: Found specification of procedure pi_init [2019-09-20 13:43:10,924 INFO L130 BoogieDeclarations]: Found specification of procedure pi_release [2019-09-20 13:43:10,924 INFO L130 BoogieDeclarations]: Found specification of procedure pi_write_regr [2019-09-20 13:43:10,924 INFO L130 BoogieDeclarations]: Found specification of procedure pi_read_regr [2019-09-20 13:43:10,924 INFO L130 BoogieDeclarations]: Found specification of procedure pi_write_block [2019-09-20 13:43:10,925 INFO L130 BoogieDeclarations]: Found specification of procedure pi_read_block [2019-09-20 13:43:10,925 INFO L130 BoogieDeclarations]: Found specification of procedure pi_connect [2019-09-20 13:43:10,925 INFO L130 BoogieDeclarations]: Found specification of procedure pi_disconnect [2019-09-20 13:43:10,925 INFO L130 BoogieDeclarations]: Found specification of procedure pg_open [2019-09-20 13:43:10,925 INFO L130 BoogieDeclarations]: Found specification of procedure pg_release [2019-09-20 13:43:10,925 INFO L130 BoogieDeclarations]: Found specification of procedure pg_read [2019-09-20 13:43:10,926 INFO L130 BoogieDeclarations]: Found specification of procedure pg_write [2019-09-20 13:43:10,926 INFO L130 BoogieDeclarations]: Found specification of procedure pg_detect [2019-09-20 13:43:10,926 INFO L130 BoogieDeclarations]: Found specification of procedure pg_identify [2019-09-20 13:43:10,926 INFO L130 BoogieDeclarations]: Found specification of procedure pg_init_units [2019-09-20 13:43:10,926 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-20 13:43:10,926 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-20 13:43:10,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-20 13:43:10,927 INFO L130 BoogieDeclarations]: Found specification of procedure status_reg [2019-09-20 13:43:10,927 INFO L130 BoogieDeclarations]: Found specification of procedure read_reg [2019-09-20 13:43:10,927 INFO L130 BoogieDeclarations]: Found specification of procedure write_reg [2019-09-20 13:43:10,927 INFO L130 BoogieDeclarations]: Found specification of procedure DRIVE [2019-09-20 13:43:10,927 INFO L130 BoogieDeclarations]: Found specification of procedure pg_sleep [2019-09-20 13:43:10,928 INFO L130 BoogieDeclarations]: Found specification of procedure pg_wait [2019-09-20 13:43:10,928 INFO L130 BoogieDeclarations]: Found specification of procedure pg_command [2019-09-20 13:43:10,928 INFO L130 BoogieDeclarations]: Found specification of procedure pg_completion [2019-09-20 13:43:10,928 INFO L130 BoogieDeclarations]: Found specification of procedure pg_reset [2019-09-20 13:43:10,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-20 13:43:10,928 INFO L130 BoogieDeclarations]: Found specification of procedure xs [2019-09-20 13:43:10,929 INFO L130 BoogieDeclarations]: Found specification of procedure pg_probe [2019-09-20 13:43:10,929 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-09-20 13:43:10,929 INFO L130 BoogieDeclarations]: Found specification of procedure pg_init [2019-09-20 13:43:10,929 INFO L130 BoogieDeclarations]: Found specification of procedure pg_exit [2019-09-20 13:43:10,929 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-09-20 13:43:10,929 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-09-20 13:43:10,930 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-20 13:43:10,930 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-09-20 13:43:10,930 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_trap [2019-09-20 13:43:10,930 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_cred_guard_mutex_of_signal_struct [2019-09-20 13:43:10,930 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_cred_guard_mutex_of_signal_struct [2019-09-20 13:43:10,931 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_cred_guard_mutex_of_signal_struct [2019-09-20 13:43:10,931 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_cred_guard_mutex_of_signal_struct [2019-09-20 13:43:10,931 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_cred_guard_mutex_of_signal_struct [2019-09-20 13:43:10,931 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_lock [2019-09-20 13:43:10,931 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_lock [2019-09-20 13:43:10,931 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_lock [2019-09-20 13:43:10,932 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_lock [2019-09-20 13:43:10,932 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_lock [2019-09-20 13:43:10,932 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_mutex_of_device [2019-09-20 13:43:10,932 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_mutex_of_device [2019-09-20 13:43:10,932 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_mutex_of_device [2019-09-20 13:43:10,933 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_mutex_of_device [2019-09-20 13:43:10,933 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_pg_mutex [2019-09-20 13:43:10,933 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_pg_mutex [2019-09-20 13:43:10,933 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_pg_mutex [2019-09-20 13:43:10,933 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_pg_mutex [2019-09-20 13:43:10,933 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_pg_mutex [2019-09-20 13:43:10,934 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-09-20 13:43:10,934 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-09-20 13:43:10,934 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-09-20 13:43:10,934 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-20 13:43:10,934 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-20 13:43:10,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-20 13:43:10,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-20 13:43:10,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-20 13:43:10,935 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-20 13:43:14,316 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-20 13:43:14,317 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-20 13:43:14,318 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:43:14 BoogieIcfgContainer [2019-09-20 13:43:14,318 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-20 13:43:14,320 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-20 13:43:14,320 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-20 13:43:14,323 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-20 13:43:14,323 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.09 01:43:08" (1/3) ... [2019-09-20 13:43:14,324 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e34f521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:43:14, skipping insertion in model container [2019-09-20 13:43:14,324 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.09 01:43:10" (2/3) ... [2019-09-20 13:43:14,325 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e34f521 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.09 01:43:14, skipping insertion in model container [2019-09-20 13:43:14,325 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.09 01:43:14" (3/3) ... [2019-09-20 13:43:14,326 INFO L109 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pg.ko-main.cil.out.i [2019-09-20 13:43:14,336 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-20 13:43:14,346 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-20 13:43:14,363 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-20 13:43:14,391 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-20 13:43:14,391 INFO L378 AbstractCegarLoop]: Hoare is false [2019-09-20 13:43:14,391 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-20 13:43:14,391 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-20 13:43:14,391 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-20 13:43:14,392 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-20 13:43:14,392 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-20 13:43:14,392 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-20 13:43:14,423 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states. [2019-09-20 13:43:14,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-09-20 13:43:14,438 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:43:14,439 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:43:14,441 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:43:14,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:43:14,448 INFO L82 PathProgramCache]: Analyzing trace with hash -466886759, now seen corresponding path program 1 times [2019-09-20 13:43:14,453 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:43:14,552 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:14,552 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:43:14,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:14,562 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:43:14,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:43:15,216 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:43:15,218 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:43:15,219 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:43:15,219 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:43:15,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:43:15,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:43:15,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:43:15,247 INFO L87 Difference]: Start difference. First operand 699 states. Second operand 4 states. [2019-09-20 13:43:16,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:43:16,274 INFO L93 Difference]: Finished difference Result 589 states and 754 transitions. [2019-09-20 13:43:16,276 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:43:16,278 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-09-20 13:43:16,278 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:43:16,301 INFO L225 Difference]: With dead ends: 589 [2019-09-20 13:43:16,302 INFO L226 Difference]: Without dead ends: 582 [2019-09-20 13:43:16,304 INFO L636 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-09-20 13:43:16,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-09-20 13:43:16,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-09-20 13:43:16,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-09-20 13:43:16,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 747 transitions. [2019-09-20 13:43:16,428 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 747 transitions. Word has length 31 [2019-09-20 13:43:16,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:43:16,430 INFO L475 AbstractCegarLoop]: Abstraction has 582 states and 747 transitions. [2019-09-20 13:43:16,430 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:43:16,431 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 747 transitions. [2019-09-20 13:43:16,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-09-20 13:43:16,441 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:43:16,441 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:43:16,441 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:43:16,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:43:16,442 INFO L82 PathProgramCache]: Analyzing trace with hash -503911691, now seen corresponding path program 1 times [2019-09-20 13:43:16,442 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:43:16,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:16,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:43:16,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:16,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:43:16,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:43:16,694 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:43:16,695 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:43:16,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:43:16,695 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:43:16,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:43:16,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:43:16,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:43:16,698 INFO L87 Difference]: Start difference. First operand 582 states and 747 transitions. Second operand 3 states. [2019-09-20 13:43:16,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:43:16,888 INFO L93 Difference]: Finished difference Result 899 states and 1159 transitions. [2019-09-20 13:43:16,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:43:16,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-09-20 13:43:16,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:43:16,899 INFO L225 Difference]: With dead ends: 899 [2019-09-20 13:43:16,899 INFO L226 Difference]: Without dead ends: 899 [2019-09-20 13:43:16,903 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:43:16,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2019-09-20 13:43:16,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 851. [2019-09-20 13:43:16,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 851 states. [2019-09-20 13:43:16,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1104 transitions. [2019-09-20 13:43:16,972 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1104 transitions. Word has length 34 [2019-09-20 13:43:16,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:43:16,972 INFO L475 AbstractCegarLoop]: Abstraction has 851 states and 1104 transitions. [2019-09-20 13:43:16,972 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:43:16,973 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1104 transitions. [2019-09-20 13:43:16,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-09-20 13:43:16,975 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:43:16,975 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:43:16,976 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:43:16,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:43:16,976 INFO L82 PathProgramCache]: Analyzing trace with hash -159570386, now seen corresponding path program 1 times [2019-09-20 13:43:16,976 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:43:16,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:16,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:43:16,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:16,990 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:43:17,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:43:17,247 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:43:17,248 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:43:17,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:43:17,248 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:43:17,248 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:43:17,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:43:17,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:43:17,249 INFO L87 Difference]: Start difference. First operand 851 states and 1104 transitions. Second operand 3 states. [2019-09-20 13:43:17,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:43:17,278 INFO L93 Difference]: Finished difference Result 863 states and 1120 transitions. [2019-09-20 13:43:17,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:43:17,279 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-09-20 13:43:17,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:43:17,285 INFO L225 Difference]: With dead ends: 863 [2019-09-20 13:43:17,285 INFO L226 Difference]: Without dead ends: 863 [2019-09-20 13:43:17,286 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:43:17,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2019-09-20 13:43:17,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 853. [2019-09-20 13:43:17,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2019-09-20 13:43:17,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1106 transitions. [2019-09-20 13:43:17,325 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1106 transitions. Word has length 44 [2019-09-20 13:43:17,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:43:17,326 INFO L475 AbstractCegarLoop]: Abstraction has 853 states and 1106 transitions. [2019-09-20 13:43:17,326 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:43:17,326 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1106 transitions. [2019-09-20 13:43:17,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-09-20 13:43:17,327 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:43:17,327 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:43:17,328 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:43:17,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:43:17,328 INFO L82 PathProgramCache]: Analyzing trace with hash -1084319382, now seen corresponding path program 1 times [2019-09-20 13:43:17,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:43:17,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:17,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:43:17,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:17,335 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:43:17,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:43:17,487 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-20 13:43:17,487 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:43:17,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:43:17,488 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:43:17,488 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:43:17,489 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:43:17,489 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:43:17,489 INFO L87 Difference]: Start difference. First operand 853 states and 1106 transitions. Second operand 3 states. [2019-09-20 13:43:17,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:43:17,858 INFO L93 Difference]: Finished difference Result 1287 states and 1666 transitions. [2019-09-20 13:43:17,859 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:43:17,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-09-20 13:43:17,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:43:17,869 INFO L225 Difference]: With dead ends: 1287 [2019-09-20 13:43:17,870 INFO L226 Difference]: Without dead ends: 1287 [2019-09-20 13:43:17,871 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:43:17,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2019-09-20 13:43:17,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1283. [2019-09-20 13:43:17,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2019-09-20 13:43:17,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1663 transitions. [2019-09-20 13:43:17,923 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1663 transitions. Word has length 46 [2019-09-20 13:43:17,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:43:17,923 INFO L475 AbstractCegarLoop]: Abstraction has 1283 states and 1663 transitions. [2019-09-20 13:43:17,924 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:43:17,924 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1663 transitions. [2019-09-20 13:43:17,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-20 13:43:17,927 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:43:17,927 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:43:17,928 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:43:17,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:43:17,928 INFO L82 PathProgramCache]: Analyzing trace with hash 819154128, now seen corresponding path program 1 times [2019-09-20 13:43:17,928 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:43:17,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:17,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:43:17,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:17,935 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:43:18,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:43:18,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:43:18,167 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:43:18,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:43:18,167 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:43:18,167 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:43:18,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:43:18,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:43:18,168 INFO L87 Difference]: Start difference. First operand 1283 states and 1663 transitions. Second operand 3 states. [2019-09-20 13:43:18,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:43:18,201 INFO L93 Difference]: Finished difference Result 1313 states and 1707 transitions. [2019-09-20 13:43:18,201 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:43:18,201 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-09-20 13:43:18,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:43:18,215 INFO L225 Difference]: With dead ends: 1313 [2019-09-20 13:43:18,215 INFO L226 Difference]: Without dead ends: 1313 [2019-09-20 13:43:18,215 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:43:18,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2019-09-20 13:43:18,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1309. [2019-09-20 13:43:18,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1309 states. [2019-09-20 13:43:18,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1309 states and 1703 transitions. [2019-09-20 13:43:18,258 INFO L78 Accepts]: Start accepts. Automaton has 1309 states and 1703 transitions. Word has length 53 [2019-09-20 13:43:18,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:43:18,258 INFO L475 AbstractCegarLoop]: Abstraction has 1309 states and 1703 transitions. [2019-09-20 13:43:18,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:43:18,258 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 1703 transitions. [2019-09-20 13:43:18,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-20 13:43:18,259 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:43:18,259 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:43:18,260 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:43:18,260 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:43:18,260 INFO L82 PathProgramCache]: Analyzing trace with hash -1968261359, now seen corresponding path program 1 times [2019-09-20 13:43:18,260 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:43:18,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:18,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:43:18,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:18,266 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:43:18,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:43:18,421 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:43:18,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:43:18,422 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:43:18,422 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:43:18,423 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:43:18,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:43:18,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:43:18,426 INFO L87 Difference]: Start difference. First operand 1309 states and 1703 transitions. Second operand 3 states. [2019-09-20 13:43:18,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:43:18,534 INFO L93 Difference]: Finished difference Result 1320 states and 1714 transitions. [2019-09-20 13:43:18,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:43:18,535 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-09-20 13:43:18,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:43:18,550 INFO L225 Difference]: With dead ends: 1320 [2019-09-20 13:43:18,550 INFO L226 Difference]: Without dead ends: 1320 [2019-09-20 13:43:18,550 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:43:18,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2019-09-20 13:43:18,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1309. [2019-09-20 13:43:18,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1309 states. [2019-09-20 13:43:18,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1309 states and 1701 transitions. [2019-09-20 13:43:18,595 INFO L78 Accepts]: Start accepts. Automaton has 1309 states and 1701 transitions. Word has length 53 [2019-09-20 13:43:18,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:43:18,596 INFO L475 AbstractCegarLoop]: Abstraction has 1309 states and 1701 transitions. [2019-09-20 13:43:18,596 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:43:18,596 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 1701 transitions. [2019-09-20 13:43:18,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-09-20 13:43:18,598 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:43:18,599 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:43:18,599 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:43:18,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:43:18,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1911003057, now seen corresponding path program 1 times [2019-09-20 13:43:18,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:43:18,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:18,605 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:43:18,605 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:18,610 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:43:18,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:43:18,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:43:18,842 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:43:18,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:43:18,842 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:43:18,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:43:18,843 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:43:18,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:43:18,844 INFO L87 Difference]: Start difference. First operand 1309 states and 1701 transitions. Second operand 3 states. [2019-09-20 13:43:19,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:43:19,065 INFO L93 Difference]: Finished difference Result 1308 states and 1699 transitions. [2019-09-20 13:43:19,066 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:43:19,066 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-09-20 13:43:19,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:43:19,074 INFO L225 Difference]: With dead ends: 1308 [2019-09-20 13:43:19,075 INFO L226 Difference]: Without dead ends: 1308 [2019-09-20 13:43:19,075 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:43:19,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2019-09-20 13:43:19,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1308. [2019-09-20 13:43:19,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1308 states. [2019-09-20 13:43:19,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 1699 transitions. [2019-09-20 13:43:19,114 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 1699 transitions. Word has length 53 [2019-09-20 13:43:19,115 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:43:19,115 INFO L475 AbstractCegarLoop]: Abstraction has 1308 states and 1699 transitions. [2019-09-20 13:43:19,115 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:43:19,115 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 1699 transitions. [2019-09-20 13:43:19,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-09-20 13:43:19,116 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:43:19,116 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:43:19,116 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:43:19,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:43:19,117 INFO L82 PathProgramCache]: Analyzing trace with hash 888053654, now seen corresponding path program 1 times [2019-09-20 13:43:19,117 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:43:19,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:19,123 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:43:19,123 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:19,123 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:43:19,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:43:19,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:43:19,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:43:19,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:43:19,267 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:43:19,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:43:19,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:43:19,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:43:19,268 INFO L87 Difference]: Start difference. First operand 1308 states and 1699 transitions. Second operand 3 states. [2019-09-20 13:43:19,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:43:19,546 INFO L93 Difference]: Finished difference Result 1307 states and 1697 transitions. [2019-09-20 13:43:19,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:43:19,546 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-09-20 13:43:19,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:43:19,554 INFO L225 Difference]: With dead ends: 1307 [2019-09-20 13:43:19,554 INFO L226 Difference]: Without dead ends: 1307 [2019-09-20 13:43:19,555 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:43:19,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1307 states. [2019-09-20 13:43:19,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1307 to 1307. [2019-09-20 13:43:19,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1307 states. [2019-09-20 13:43:19,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1307 states and 1697 transitions. [2019-09-20 13:43:19,593 INFO L78 Accepts]: Start accepts. Automaton has 1307 states and 1697 transitions. Word has length 54 [2019-09-20 13:43:19,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:43:19,593 INFO L475 AbstractCegarLoop]: Abstraction has 1307 states and 1697 transitions. [2019-09-20 13:43:19,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:43:19,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 1697 transitions. [2019-09-20 13:43:19,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-09-20 13:43:19,595 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:43:19,595 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:43:19,595 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:43:19,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:43:19,596 INFO L82 PathProgramCache]: Analyzing trace with hash 1759470642, now seen corresponding path program 1 times [2019-09-20 13:43:19,596 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:43:19,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:19,601 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:43:19,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:19,601 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:43:19,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:43:19,744 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:43:19,745 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:43:19,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:43:19,745 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:43:19,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:43:19,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:43:19,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:43:19,746 INFO L87 Difference]: Start difference. First operand 1307 states and 1697 transitions. Second operand 3 states. [2019-09-20 13:43:19,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:43:19,999 INFO L93 Difference]: Finished difference Result 1306 states and 1695 transitions. [2019-09-20 13:43:20,000 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:43:20,000 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-09-20 13:43:20,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:43:20,008 INFO L225 Difference]: With dead ends: 1306 [2019-09-20 13:43:20,009 INFO L226 Difference]: Without dead ends: 1306 [2019-09-20 13:43:20,009 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:43:20,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2019-09-20 13:43:20,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 1306. [2019-09-20 13:43:20,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1306 states. [2019-09-20 13:43:20,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 1695 transitions. [2019-09-20 13:43:20,050 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 1695 transitions. Word has length 55 [2019-09-20 13:43:20,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:43:20,051 INFO L475 AbstractCegarLoop]: Abstraction has 1306 states and 1695 transitions. [2019-09-20 13:43:20,051 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:43:20,051 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1695 transitions. [2019-09-20 13:43:20,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-09-20 13:43:20,052 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:43:20,052 INFO L407 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:43:20,052 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:43:20,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:43:20,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1291368935, now seen corresponding path program 1 times [2019-09-20 13:43:20,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:43:20,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:20,059 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:43:20,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:20,059 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:43:20,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:43:20,203 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:43:20,203 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:43:20,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:43:20,204 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:43:20,204 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:43:20,204 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:43:20,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:43:20,205 INFO L87 Difference]: Start difference. First operand 1306 states and 1695 transitions. Second operand 3 states. [2019-09-20 13:43:20,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:43:20,520 INFO L93 Difference]: Finished difference Result 1653 states and 2135 transitions. [2019-09-20 13:43:20,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:43:20,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-09-20 13:43:20,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:43:20,531 INFO L225 Difference]: With dead ends: 1653 [2019-09-20 13:43:20,531 INFO L226 Difference]: Without dead ends: 1608 [2019-09-20 13:43:20,531 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:43:20,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2019-09-20 13:43:20,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1608. [2019-09-20 13:43:20,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1608 states. [2019-09-20 13:43:20,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2083 transitions. [2019-09-20 13:43:20,592 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2083 transitions. Word has length 56 [2019-09-20 13:43:20,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:43:20,594 INFO L475 AbstractCegarLoop]: Abstraction has 1608 states and 2083 transitions. [2019-09-20 13:43:20,594 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:43:20,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2083 transitions. [2019-09-20 13:43:20,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-09-20 13:43:20,603 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:43:20,603 INFO L407 BasicCegarLoop]: trace histogram [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] [2019-09-20 13:43:20,603 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:43:20,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:43:20,604 INFO L82 PathProgramCache]: Analyzing trace with hash -979606059, now seen corresponding path program 1 times [2019-09-20 13:43:20,604 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:43:20,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:20,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:43:20,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:20,611 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:43:20,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:43:20,801 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:43:20,802 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:43:20,802 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:43:20,802 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:43:20,803 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:43:20,803 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:43:20,803 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:43:20,803 INFO L87 Difference]: Start difference. First operand 1608 states and 2083 transitions. Second operand 5 states. [2019-09-20 13:43:20,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:43:20,840 INFO L93 Difference]: Finished difference Result 1622 states and 2097 transitions. [2019-09-20 13:43:20,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:43:20,840 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-09-20 13:43:20,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:43:20,851 INFO L225 Difference]: With dead ends: 1622 [2019-09-20 13:43:20,851 INFO L226 Difference]: Without dead ends: 1622 [2019-09-20 13:43:20,852 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:43:20,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2019-09-20 13:43:20,898 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1622. [2019-09-20 13:43:20,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1622 states. [2019-09-20 13:43:20,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 2097 transitions. [2019-09-20 13:43:20,907 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 2097 transitions. Word has length 106 [2019-09-20 13:43:20,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:43:20,907 INFO L475 AbstractCegarLoop]: Abstraction has 1622 states and 2097 transitions. [2019-09-20 13:43:20,907 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:43:20,908 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 2097 transitions. [2019-09-20 13:43:20,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-09-20 13:43:20,916 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:43:20,916 INFO L407 BasicCegarLoop]: trace histogram [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] [2019-09-20 13:43:20,916 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:43:20,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:43:20,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1122639744, now seen corresponding path program 1 times [2019-09-20 13:43:20,917 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:43:20,922 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:20,922 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:43:20,923 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:20,923 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:43:21,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:43:21,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-09-20 13:43:21,226 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:43:21,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:43:21,227 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:43:21,227 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:43:21,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:43:21,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:43:21,228 INFO L87 Difference]: Start difference. First operand 1622 states and 2097 transitions. Second operand 5 states. [2019-09-20 13:43:21,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:43:21,275 INFO L93 Difference]: Finished difference Result 1640 states and 2121 transitions. [2019-09-20 13:43:21,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:43:21,276 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2019-09-20 13:43:21,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:43:21,286 INFO L225 Difference]: With dead ends: 1640 [2019-09-20 13:43:21,286 INFO L226 Difference]: Without dead ends: 1640 [2019-09-20 13:43:21,286 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:43:21,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2019-09-20 13:43:21,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1630. [2019-09-20 13:43:21,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1630 states. [2019-09-20 13:43:21,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2109 transitions. [2019-09-20 13:43:21,343 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2109 transitions. Word has length 122 [2019-09-20 13:43:21,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:43:21,344 INFO L475 AbstractCegarLoop]: Abstraction has 1630 states and 2109 transitions. [2019-09-20 13:43:21,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:43:21,344 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2109 transitions. [2019-09-20 13:43:21,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-09-20 13:43:21,348 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:43:21,348 INFO L407 BasicCegarLoop]: trace histogram [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] [2019-09-20 13:43:21,348 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:43:21,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:43:21,349 INFO L82 PathProgramCache]: Analyzing trace with hash -489656520, now seen corresponding path program 1 times [2019-09-20 13:43:21,349 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:43:21,357 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:21,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:43:21,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:21,358 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:43:21,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:43:21,584 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-09-20 13:43:21,585 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:43:21,585 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:43:21,585 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:43:21,586 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:43:21,586 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:43:21,586 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:43:21,587 INFO L87 Difference]: Start difference. First operand 1630 states and 2109 transitions. Second operand 5 states. [2019-09-20 13:43:21,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:43:21,647 INFO L93 Difference]: Finished difference Result 1698 states and 2207 transitions. [2019-09-20 13:43:21,647 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:43:21,647 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-09-20 13:43:21,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:43:21,657 INFO L225 Difference]: With dead ends: 1698 [2019-09-20 13:43:21,658 INFO L226 Difference]: Without dead ends: 1698 [2019-09-20 13:43:21,658 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:43:21,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2019-09-20 13:43:21,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 1638. [2019-09-20 13:43:21,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1638 states. [2019-09-20 13:43:21,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1638 states and 2117 transitions. [2019-09-20 13:43:21,707 INFO L78 Accepts]: Start accepts. Automaton has 1638 states and 2117 transitions. Word has length 133 [2019-09-20 13:43:21,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:43:21,707 INFO L475 AbstractCegarLoop]: Abstraction has 1638 states and 2117 transitions. [2019-09-20 13:43:21,707 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:43:21,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1638 states and 2117 transitions. [2019-09-20 13:43:21,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 232 [2019-09-20 13:43:21,713 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:43:21,713 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:43:21,714 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:43:21,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:43:21,714 INFO L82 PathProgramCache]: Analyzing trace with hash -1250998788, now seen corresponding path program 1 times [2019-09-20 13:43:21,714 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:43:21,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:21,720 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:43:21,720 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:21,720 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:43:21,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:43:21,997 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-09-20 13:43:21,998 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:43:21,998 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-20 13:43:21,998 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:43:21,999 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-20 13:43:21,999 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-20 13:43:22,000 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-09-20 13:43:22,000 INFO L87 Difference]: Start difference. First operand 1638 states and 2117 transitions. Second operand 4 states. [2019-09-20 13:43:22,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:43:22,050 INFO L93 Difference]: Finished difference Result 1753 states and 2285 transitions. [2019-09-20 13:43:22,051 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-20 13:43:22,051 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 231 [2019-09-20 13:43:22,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:43:22,062 INFO L225 Difference]: With dead ends: 1753 [2019-09-20 13:43:22,062 INFO L226 Difference]: Without dead ends: 1753 [2019-09-20 13:43:22,063 INFO L636 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-09-20 13:43:22,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1753 states. [2019-09-20 13:43:22,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1753 to 1648. [2019-09-20 13:43:22,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1648 states. [2019-09-20 13:43:22,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2127 transitions. [2019-09-20 13:43:22,116 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2127 transitions. Word has length 231 [2019-09-20 13:43:22,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:43:22,117 INFO L475 AbstractCegarLoop]: Abstraction has 1648 states and 2127 transitions. [2019-09-20 13:43:22,117 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-20 13:43:22,117 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2127 transitions. [2019-09-20 13:43:22,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-09-20 13:43:22,122 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:43:22,123 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:43:22,123 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:43:22,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:43:22,123 INFO L82 PathProgramCache]: Analyzing trace with hash -1121070588, now seen corresponding path program 1 times [2019-09-20 13:43:22,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:43:22,129 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:22,129 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:43:22,130 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:22,130 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:43:22,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:43:22,450 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-09-20 13:43:22,450 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:43:22,451 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-20 13:43:22,451 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:43:22,452 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-20 13:43:22,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-20 13:43:22,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:43:22,452 INFO L87 Difference]: Start difference. First operand 1648 states and 2127 transitions. Second operand 3 states. [2019-09-20 13:43:22,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:43:22,510 INFO L93 Difference]: Finished difference Result 1673 states and 2157 transitions. [2019-09-20 13:43:22,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-20 13:43:22,510 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2019-09-20 13:43:22,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:43:22,521 INFO L225 Difference]: With dead ends: 1673 [2019-09-20 13:43:22,522 INFO L226 Difference]: Without dead ends: 1673 [2019-09-20 13:43:22,522 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-20 13:43:22,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2019-09-20 13:43:22,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1658. [2019-09-20 13:43:22,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1658 states. [2019-09-20 13:43:22,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2137 transitions. [2019-09-20 13:43:22,571 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2137 transitions. Word has length 244 [2019-09-20 13:43:22,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:43:22,571 INFO L475 AbstractCegarLoop]: Abstraction has 1658 states and 2137 transitions. [2019-09-20 13:43:22,571 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-20 13:43:22,571 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2137 transitions. [2019-09-20 13:43:22,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-20 13:43:22,577 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:43:22,577 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:43:22,578 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:43:22,578 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:43:22,578 INFO L82 PathProgramCache]: Analyzing trace with hash 741430911, now seen corresponding path program 1 times [2019-09-20 13:43:22,578 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:43:22,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:22,584 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:43:22,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:22,584 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:43:22,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:43:22,879 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-20 13:43:22,879 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:43:22,880 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:43:22,880 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:43:22,880 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:43:22,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:43:22,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:43:22,881 INFO L87 Difference]: Start difference. First operand 1658 states and 2137 transitions. Second operand 6 states. [2019-09-20 13:43:22,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:43:22,956 INFO L93 Difference]: Finished difference Result 1723 states and 2224 transitions. [2019-09-20 13:43:22,956 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-20 13:43:22,957 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 253 [2019-09-20 13:43:22,957 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:43:22,968 INFO L225 Difference]: With dead ends: 1723 [2019-09-20 13:43:22,968 INFO L226 Difference]: Without dead ends: 1723 [2019-09-20 13:43:22,969 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-20 13:43:22,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2019-09-20 13:43:23,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 1699. [2019-09-20 13:43:23,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1699 states. [2019-09-20 13:43:23,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2193 transitions. [2019-09-20 13:43:23,023 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2193 transitions. Word has length 253 [2019-09-20 13:43:23,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:43:23,023 INFO L475 AbstractCegarLoop]: Abstraction has 1699 states and 2193 transitions. [2019-09-20 13:43:23,024 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:43:23,024 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2193 transitions. [2019-09-20 13:43:23,030 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-09-20 13:43:23,030 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:43:23,031 INFO L407 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:43:23,031 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:43:23,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:43:23,032 INFO L82 PathProgramCache]: Analyzing trace with hash -1046438911, now seen corresponding path program 1 times [2019-09-20 13:43:23,032 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:43:23,038 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:23,039 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:43:23,039 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:23,039 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:43:23,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:43:23,336 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-09-20 13:43:23,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:43:23,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-20 13:43:23,337 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:43:23,338 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-20 13:43:23,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-20 13:43:23,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:43:23,339 INFO L87 Difference]: Start difference. First operand 1699 states and 2193 transitions. Second operand 5 states. [2019-09-20 13:43:23,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:43:23,376 INFO L93 Difference]: Finished difference Result 1744 states and 2259 transitions. [2019-09-20 13:43:23,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-20 13:43:23,377 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 253 [2019-09-20 13:43:23,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:43:23,388 INFO L225 Difference]: With dead ends: 1744 [2019-09-20 13:43:23,389 INFO L226 Difference]: Without dead ends: 1744 [2019-09-20 13:43:23,390 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-20 13:43:23,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1744 states. [2019-09-20 13:43:23,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1744 to 1719. [2019-09-20 13:43:23,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1719 states. [2019-09-20 13:43:23,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1719 states to 1719 states and 2228 transitions. [2019-09-20 13:43:23,455 INFO L78 Accepts]: Start accepts. Automaton has 1719 states and 2228 transitions. Word has length 253 [2019-09-20 13:43:23,455 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:43:23,456 INFO L475 AbstractCegarLoop]: Abstraction has 1719 states and 2228 transitions. [2019-09-20 13:43:23,456 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-20 13:43:23,456 INFO L276 IsEmpty]: Start isEmpty. Operand 1719 states and 2228 transitions. [2019-09-20 13:43:23,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-09-20 13:43:23,466 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:43:23,467 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:43:23,467 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:43:23,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:43:23,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1005796931, now seen corresponding path program 1 times [2019-09-20 13:43:23,468 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:43:23,474 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:23,475 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:43:23,475 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:23,475 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:43:23,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:43:23,858 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-09-20 13:43:23,859 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:43:23,859 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-20 13:43:23,859 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:43:23,861 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-20 13:43:23,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-20 13:43:23,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-20 13:43:23,862 INFO L87 Difference]: Start difference. First operand 1719 states and 2228 transitions. Second operand 6 states. [2019-09-20 13:43:23,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:43:23,965 INFO L93 Difference]: Finished difference Result 1757 states and 2279 transitions. [2019-09-20 13:43:23,965 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-20 13:43:23,965 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 288 [2019-09-20 13:43:23,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:43:23,980 INFO L225 Difference]: With dead ends: 1757 [2019-09-20 13:43:23,981 INFO L226 Difference]: Without dead ends: 1757 [2019-09-20 13:43:23,981 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-09-20 13:43:23,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2019-09-20 13:43:24,042 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 1723. [2019-09-20 13:43:24,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1723 states. [2019-09-20 13:43:24,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2232 transitions. [2019-09-20 13:43:24,051 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2232 transitions. Word has length 288 [2019-09-20 13:43:24,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:43:24,052 INFO L475 AbstractCegarLoop]: Abstraction has 1723 states and 2232 transitions. [2019-09-20 13:43:24,052 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-20 13:43:24,052 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2232 transitions. [2019-09-20 13:43:24,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-09-20 13:43:24,062 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:43:24,063 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:43:24,063 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:43:24,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:43:24,063 INFO L82 PathProgramCache]: Analyzing trace with hash -1274515421, now seen corresponding path program 1 times [2019-09-20 13:43:24,064 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:43:24,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:24,069 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:43:24,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:24,070 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:43:24,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:43:24,591 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-09-20 13:43:24,592 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:43:24,592 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-20 13:43:24,592 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:43:24,593 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 13:43:24,594 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 13:43:24,594 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:43:24,594 INFO L87 Difference]: Start difference. First operand 1723 states and 2232 transitions. Second operand 10 states. [2019-09-20 13:43:24,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:43:24,715 INFO L93 Difference]: Finished difference Result 1772 states and 2288 transitions. [2019-09-20 13:43:24,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-20 13:43:24,715 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 286 [2019-09-20 13:43:24,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:43:24,739 INFO L225 Difference]: With dead ends: 1772 [2019-09-20 13:43:24,739 INFO L226 Difference]: Without dead ends: 1772 [2019-09-20 13:43:24,739 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:43:24,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1772 states. [2019-09-20 13:43:24,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1772 to 1733. [2019-09-20 13:43:24,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1733 states. [2019-09-20 13:43:24,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2243 transitions. [2019-09-20 13:43:24,790 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2243 transitions. Word has length 286 [2019-09-20 13:43:24,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:43:24,791 INFO L475 AbstractCegarLoop]: Abstraction has 1733 states and 2243 transitions. [2019-09-20 13:43:24,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 13:43:24,791 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2243 transitions. [2019-09-20 13:43:24,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-09-20 13:43:24,802 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:43:24,803 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:43:24,803 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:43:24,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:43:24,804 INFO L82 PathProgramCache]: Analyzing trace with hash -362663679, now seen corresponding path program 1 times [2019-09-20 13:43:24,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:43:24,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:24,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:43:24,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:24,811 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:43:24,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:43:25,236 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-09-20 13:43:25,237 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:43:25,237 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-20 13:43:25,237 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:43:25,238 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 13:43:25,238 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 13:43:25,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:43:25,239 INFO L87 Difference]: Start difference. First operand 1733 states and 2243 transitions. Second operand 10 states. [2019-09-20 13:43:25,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:43:25,331 INFO L93 Difference]: Finished difference Result 1782 states and 2302 transitions. [2019-09-20 13:43:25,331 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-20 13:43:25,331 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 288 [2019-09-20 13:43:25,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:43:25,341 INFO L225 Difference]: With dead ends: 1782 [2019-09-20 13:43:25,342 INFO L226 Difference]: Without dead ends: 1782 [2019-09-20 13:43:25,342 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:43:25,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1782 states. [2019-09-20 13:43:25,422 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1782 to 1735. [2019-09-20 13:43:25,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2019-09-20 13:43:25,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2245 transitions. [2019-09-20 13:43:25,428 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2245 transitions. Word has length 288 [2019-09-20 13:43:25,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:43:25,429 INFO L475 AbstractCegarLoop]: Abstraction has 1735 states and 2245 transitions. [2019-09-20 13:43:25,429 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 13:43:25,429 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2245 transitions. [2019-09-20 13:43:25,436 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-09-20 13:43:25,436 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:43:25,436 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:43:25,436 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:43:25,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:43:25,437 INFO L82 PathProgramCache]: Analyzing trace with hash 625458459, now seen corresponding path program 1 times [2019-09-20 13:43:25,437 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:43:25,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:25,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:43:25,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:25,442 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:43:25,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:43:25,806 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-09-20 13:43:25,807 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:43:25,807 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-20 13:43:25,807 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:43:25,808 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 13:43:25,808 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 13:43:25,808 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:43:25,808 INFO L87 Difference]: Start difference. First operand 1735 states and 2245 transitions. Second operand 10 states. [2019-09-20 13:43:25,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:43:25,921 INFO L93 Difference]: Finished difference Result 1832 states and 2386 transitions. [2019-09-20 13:43:25,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 13:43:25,922 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 297 [2019-09-20 13:43:25,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:43:25,933 INFO L225 Difference]: With dead ends: 1832 [2019-09-20 13:43:25,933 INFO L226 Difference]: Without dead ends: 1832 [2019-09-20 13:43:25,934 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:43:25,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2019-09-20 13:43:25,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 1735. [2019-09-20 13:43:25,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2019-09-20 13:43:25,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2245 transitions. [2019-09-20 13:43:25,997 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2245 transitions. Word has length 297 [2019-09-20 13:43:25,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:43:25,998 INFO L475 AbstractCegarLoop]: Abstraction has 1735 states and 2245 transitions. [2019-09-20 13:43:25,998 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 13:43:25,998 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2245 transitions. [2019-09-20 13:43:26,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-09-20 13:43:26,009 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:43:26,009 INFO L407 BasicCegarLoop]: trace histogram [6, 6, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:43:26,010 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:43:26,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:43:26,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1004757881, now seen corresponding path program 1 times [2019-09-20 13:43:26,011 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:43:26,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:26,018 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:43:26,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:26,018 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:43:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:43:26,476 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-09-20 13:43:26,477 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-20 13:43:26,477 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-09-20 13:43:26,477 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:43:26,478 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-09-20 13:43:26,478 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-09-20 13:43:26,478 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-09-20 13:43:26,478 INFO L87 Difference]: Start difference. First operand 1735 states and 2245 transitions. Second operand 10 states. [2019-09-20 13:43:26,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:43:26,580 INFO L93 Difference]: Finished difference Result 1844 states and 2398 transitions. [2019-09-20 13:43:26,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-09-20 13:43:26,581 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 299 [2019-09-20 13:43:26,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:43:26,591 INFO L225 Difference]: With dead ends: 1844 [2019-09-20 13:43:26,591 INFO L226 Difference]: Without dead ends: 1844 [2019-09-20 13:43:26,591 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-09-20 13:43:26,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2019-09-20 13:43:26,634 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1731. [2019-09-20 13:43:26,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1731 states. [2019-09-20 13:43:26,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 2237 transitions. [2019-09-20 13:43:26,641 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 2237 transitions. Word has length 299 [2019-09-20 13:43:26,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:43:26,642 INFO L475 AbstractCegarLoop]: Abstraction has 1731 states and 2237 transitions. [2019-09-20 13:43:26,642 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-09-20 13:43:26,642 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 2237 transitions. [2019-09-20 13:43:26,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 332 [2019-09-20 13:43:26,649 INFO L399 BasicCegarLoop]: Found error trace [2019-09-20 13:43:26,650 INFO L407 BasicCegarLoop]: trace histogram [8, 8, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-20 13:43:26,650 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-20 13:43:26,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:43:26,650 INFO L82 PathProgramCache]: Analyzing trace with hash -96686786, now seen corresponding path program 1 times [2019-09-20 13:43:26,650 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-09-20 13:43:26,654 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:26,655 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-20 13:43:26,655 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-20 13:43:26,655 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-09-20 13:43:26,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-20 13:43:27,187 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-09-20 13:43:27,188 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-20 13:43:27,188 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-09-20 13:43:27,189 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 332 with the following transitions: [2019-09-20 13:43:27,194 INFO L207 CegarAbsIntRunner]: [0], [2], [3], [6], [8], [9], [10], [12], [13], [14], [15], [16], [17], [18], [20], [21], [53], [54], [59], [61], [62], [183], [185], [186], [189], [191], [233], [238], [240], [242], [243], [267], [279], [284], [286], [289], [291], [293], [295], [307], [311], [315], [316], [317], [318], [325], [326], [339], [344], [349], [351], [353], [356], [360], [364], [366], [368], [369], [370], [371], [372], [375], [376], [377], [379], [381], [384], [390], [550], [553], [555], [558], [560], [563], [609], [611], [616], [618], [620], [623], [626], [647], [660], [673], [686], [689], [692], [718], [721], [724], [736], [739], [742], [744], [747], [755], [792], [793], [872], [875], [908], [911], [916], [917], [936], [938], [940], [944], [948], [951], [953], [958], [962], [965], [969], [971], [973], [978], [1000], [1002], [1004], [1005], [1006], [1011], [1014], [1019], [1021], [1024], [1041], [1076], [1077], [1078], [1079], [1080], [1082], [1086], [1088], [1092], [1100], [1102], [1103], [1140], [1141], [1147], [1148], [1149], [1155], [1158], [1161], [1164], [1166], [1169], [1172], [1188], [1213], [1214], [1221], [1223], [1225], [1228], [1231], [1270], [1272], [1273], [1298], [1299], [1437], [1438], [1439], [1440], [1441], [1442], [1443], [1444], [1451], [1452], [1475], [1476], [1477], [1478], [1491], [1492], [1493], [1494], [1505], [1506], [1507], [1508], [1509], [1510], [1511], [1512], [1517], [1519], [1520], [1521], [1522], [1523], [1524], [1535], [1569], [1570], [1571], [1572], [1583], [1584], [1595], [1599], [1600], [1615], [1616], [1617], [1618], [1633], [1634], [1635], [1636], [1637], [1638], [1639], [1640], [1641], [1642], [1645], [1646], [1647], [1648], [1649], [1650], [1651], [1652], [1653], [1654], [1655], [1656], [1667], [1668], [1669], [1670], [1689], [1693], [1694], [1695], [1696], [1707], [1708], [1709], [1710], [1711], [1712], [1713], [1714], [1727], [1728], [1751], [1752], [1753] [2019-09-20 13:43:27,270 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-09-20 13:43:27,270 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-09-20 13:43:27,430 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-09-20 13:43:27,432 INFO L272 AbstractInterpreter]: Visited 2 different actions 2 times. Never merged. Never widened. Performed 142 root evaluator evaluations with a maximum evaluation depth of 0. Performed 142 inverse root evaluator evaluations with a maximum inverse evaluation depth of 0. Never found a fixpoint. Largest state had 278 variables. [2019-09-20 13:43:27,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-20 13:43:27,439 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-09-20 13:43:27,640 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-09-20 13:43:27,640 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-09-20 13:43:27,652 INFO L420 sIntCurrentIteration]: We unified 330 AI predicates to 330 [2019-09-20 13:43:27,652 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-09-20 13:43:27,653 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-20 13:43:27,653 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 8 [2019-09-20 13:43:27,653 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-09-20 13:43:27,654 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-09-20 13:43:27,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-09-20 13:43:27,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 13:43:27,656 INFO L87 Difference]: Start difference. First operand 1731 states and 2237 transitions. Second operand 2 states. [2019-09-20 13:43:27,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-20 13:43:27,657 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-09-20 13:43:27,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-09-20 13:43:27,657 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 331 [2019-09-20 13:43:27,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-20 13:43:27,657 INFO L225 Difference]: With dead ends: 2 [2019-09-20 13:43:27,657 INFO L226 Difference]: Without dead ends: 0 [2019-09-20 13:43:27,659 INFO L636 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 330 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-09-20 13:43:27,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-09-20 13:43:27,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-09-20 13:43:27,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-09-20 13:43:27,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-09-20 13:43:27,660 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 331 [2019-09-20 13:43:27,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-20 13:43:27,660 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-09-20 13:43:27,660 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-09-20 13:43:27,660 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-09-20 13:43:27,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-09-20 13:43:27,667 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.09 01:43:27 BoogieIcfgContainer [2019-09-20 13:43:27,667 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-09-20 13:43:27,674 INFO L168 Benchmark]: Toolchain (without parser) took 19019.67 ms. Allocated memory was 137.4 MB in the beginning and 742.4 MB in the end (delta: 605.0 MB). Free memory was 79.8 MB in the beginning and 627.4 MB in the end (delta: -547.6 MB). Peak memory consumption was 57.4 MB. Max. memory is 7.1 GB. [2019-09-20 13:43:27,675 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 137.4 MB. Free memory was 104.1 MB in the beginning and 103.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-09-20 13:43:27,676 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1877.89 ms. Allocated memory was 137.4 MB in the beginning and 212.3 MB in the end (delta: 75.0 MB). Free memory was 79.6 MB in the beginning and 116.3 MB in the end (delta: -36.7 MB). Peak memory consumption was 51.5 MB. Max. memory is 7.1 GB. [2019-09-20 13:43:27,677 INFO L168 Benchmark]: Boogie Preprocessor took 276.45 ms. Allocated memory is still 212.3 MB. Free memory was 116.3 MB in the beginning and 100.8 MB in the end (delta: 15.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 7.1 GB. [2019-09-20 13:43:27,680 INFO L168 Benchmark]: RCFGBuilder took 3512.70 ms. Allocated memory was 212.3 MB in the beginning and 388.5 MB in the end (delta: 176.2 MB). Free memory was 100.8 MB in the beginning and 291.1 MB in the end (delta: -190.3 MB). Peak memory consumption was 104.8 MB. Max. memory is 7.1 GB. [2019-09-20 13:43:27,681 INFO L168 Benchmark]: TraceAbstraction took 13347.88 ms. Allocated memory was 388.5 MB in the beginning and 742.4 MB in the end (delta: 353.9 MB). Free memory was 291.1 MB in the beginning and 627.4 MB in the end (delta: -336.3 MB). Peak memory consumption was 17.6 MB. Max. memory is 7.1 GB. [2019-09-20 13:43:27,692 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 137.4 MB. Free memory was 104.1 MB in the beginning and 103.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1877.89 ms. Allocated memory was 137.4 MB in the beginning and 212.3 MB in the end (delta: 75.0 MB). Free memory was 79.6 MB in the beginning and 116.3 MB in the end (delta: -36.7 MB). Peak memory consumption was 51.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 276.45 ms. Allocated memory is still 212.3 MB. Free memory was 116.3 MB in the beginning and 100.8 MB in the end (delta: 15.5 MB). Peak memory consumption was 15.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 3512.70 ms. Allocated memory was 212.3 MB in the beginning and 388.5 MB in the end (delta: 176.2 MB). Free memory was 100.8 MB in the beginning and 291.1 MB in the end (delta: -190.3 MB). Peak memory consumption was 104.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 13347.88 ms. Allocated memory was 388.5 MB in the beginning and 742.4 MB in the end (delta: 353.9 MB). Free memory was 291.1 MB in the beginning and 627.4 MB in the end (delta: -336.3 MB). Peak memory consumption was 17.6 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 4029]: 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 108 procedures, 813 locations, 1 error locations. SAFE Result, 13.2s OverallTime, 23 OverallIterations, 8 TraceHistogramMax, 4.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 16686 SDtfs, 5562 SDslu, 42397 SDs, 0 SdLazy, 652 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 450 GetRequests, 378 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1735occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 2.466666666666667 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.2s AutomataMinimizationTime, 23 MinimizatonAttempts, 646 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.4s SsaConstructionTime, 1.9s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 3610 NumberOfCodeBlocks, 3610 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 3587 ConstructedInterpolants, 0 QuantifiedInterpolants, 924581 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 22 PerfectInterpolantSequences, 992/994 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...