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-673a906-m [2019-10-02 23:26:59,817 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 23:26:59,820 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 23:26:59,836 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 23:26:59,837 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 23:26:59,838 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 23:26:59,840 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 23:26:59,842 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 23:26:59,844 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 23:26:59,846 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 23:26:59,847 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 23:26:59,849 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 23:26:59,849 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 23:26:59,850 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 23:26:59,852 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 23:26:59,853 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 23:26:59,855 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 23:26:59,856 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 23:26:59,858 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 23:26:59,861 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 23:26:59,863 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 23:26:59,865 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 23:26:59,866 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 23:26:59,868 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 23:26:59,871 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 23:26:59,871 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 23:26:59,871 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 23:26:59,873 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 23:26:59,873 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 23:26:59,875 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 23:26:59,875 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 23:26:59,876 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 23:26:59,877 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 23:26:59,878 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 23:26:59,880 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 23:26:59,880 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 23:26:59,881 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 23:26:59,881 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 23:26:59,882 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 23:26:59,883 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 23:26:59,884 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 23:26:59,885 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/ai/svcomp-Reach-32bit-Automizer_Default+AIv2_INT.epf [2019-10-02 23:26:59,908 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 23:26:59,909 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 23:26:59,909 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2019-10-02 23:26:59,909 INFO L138 SettingsManager]: * Log level for plugins=info [2019-10-02 23:26:59,910 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-10-02 23:26:59,911 INFO L138 SettingsManager]: * User list type=DISABLED [2019-10-02 23:26:59,911 INFO L138 SettingsManager]: * Ignore calls to and inside polymorphic procedures=false [2019-10-02 23:26:59,911 INFO L138 SettingsManager]: * Ignore calls to recursive procedures=false [2019-10-02 23:26:59,911 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2019-10-02 23:26:59,912 INFO L138 SettingsManager]: * Abstract domain=IntervalDomain [2019-10-02 23:26:59,912 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 23:26:59,913 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 23:26:59,913 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 23:26:59,913 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 23:26:59,913 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 23:26:59,914 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 23:26:59,914 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 23:26:59,914 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 23:26:59,914 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 23:26:59,914 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 23:26:59,915 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 23:26:59,915 INFO L138 SettingsManager]: * Remove goto edges from RCFG=true [2019-10-02 23:26:59,915 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 23:26:59,915 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 23:26:59,916 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 23:26:59,916 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 23:26:59,916 INFO L138 SettingsManager]: * Trace refinement strategy=TAIPAN [2019-10-02 23:26:59,916 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 23:26:59,916 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 23:26:59,917 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2019-10-02 23:26:59,952 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 23:26:59,977 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 23:26:59,983 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 23:26:59,985 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 23:26:59,986 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 23:26:59,987 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-10-02 23:27:00,068 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09bbf4f81/432044a9dc854cfa979bc613e21f442b/FLAG29b822e43 [2019-10-02 23:27:00,997 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 23:27:00,998 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-10-02 23:27:01,054 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09bbf4f81/432044a9dc854cfa979bc613e21f442b/FLAG29b822e43 [2019-10-02 23:27:01,565 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09bbf4f81/432044a9dc854cfa979bc613e21f442b [2019-10-02 23:27:01,577 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 23:27:01,579 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 23:27:01,580 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 23:27:01,580 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 23:27:01,585 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 23:27:01,586 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:27:01" (1/1) ... [2019-10-02 23:27:01,591 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14dc86bc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:27:01, skipping insertion in model container [2019-10-02 23:27:01,591 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 11:27:01" (1/1) ... [2019-10-02 23:27:01,601 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 23:27:01,699 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 23:27:03,138 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 23:27:03,239 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 23:27:03,530 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 23:27:03,756 INFO L192 MainTranslator]: Completed translation [2019-10-02 23:27:03,757 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:27:03 WrapperNode [2019-10-02 23:27:03,757 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 23:27:03,758 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 23:27:03,759 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 23:27:03,759 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 23:27:03,781 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:27:03" (1/1) ... [2019-10-02 23:27:03,784 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:27:03" (1/1) ... [2019-10-02 23:27:03,890 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:27:03" (1/1) ... [2019-10-02 23:27:03,890 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:27:03" (1/1) ... [2019-10-02 23:27:04,005 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:27:03" (1/1) ... [2019-10-02 23:27:04,032 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:27:03" (1/1) ... [2019-10-02 23:27:04,064 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:27:03" (1/1) ... [2019-10-02 23:27:04,101 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 23:27:04,102 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 23:27:04,102 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 23:27:04,103 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 23:27:04,105 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:27:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 23:27:04,216 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 23:27:04,217 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 23:27:04,217 INFO L138 BoogieDeclarations]: Found implementation of procedure clear_bit [2019-10-02 23:27:04,217 INFO L138 BoogieDeclarations]: Found implementation of procedure test_and_set_bit [2019-10-02 23:27:04,218 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2019-10-02 23:27:04,218 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2019-10-02 23:27:04,218 INFO L138 BoogieDeclarations]: Found implementation of procedure iminor [2019-10-02 23:27:04,218 INFO L138 BoogieDeclarations]: Found implementation of procedure register_chrdev [2019-10-02 23:27:04,219 INFO L138 BoogieDeclarations]: Found implementation of procedure unregister_chrdev [2019-10-02 23:27:04,219 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2019-10-02 23:27:04,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-10-02 23:27:04,221 INFO L138 BoogieDeclarations]: Found implementation of procedure __kmalloc [2019-10-02 23:27:04,222 INFO L138 BoogieDeclarations]: Found implementation of procedure kmalloc [2019-10-02 23:27:04,224 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_from_user [2019-10-02 23:27:04,225 INFO L138 BoogieDeclarations]: Found implementation of procedure copy_to_user [2019-10-02 23:27:04,229 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_init_units [2019-10-02 23:27:04,229 INFO L138 BoogieDeclarations]: Found implementation of procedure status_reg [2019-10-02 23:27:04,230 INFO L138 BoogieDeclarations]: Found implementation of procedure read_reg [2019-10-02 23:27:04,230 INFO L138 BoogieDeclarations]: Found implementation of procedure write_reg [2019-10-02 23:27:04,230 INFO L138 BoogieDeclarations]: Found implementation of procedure DRIVE [2019-10-02 23:27:04,230 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_sleep [2019-10-02 23:27:04,230 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_wait [2019-10-02 23:27:04,231 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_command [2019-10-02 23:27:04,231 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_completion [2019-10-02 23:27:04,232 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_reset [2019-10-02 23:27:04,233 INFO L138 BoogieDeclarations]: Found implementation of procedure xs [2019-10-02 23:27:04,233 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_identify [2019-10-02 23:27:04,233 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_probe [2019-10-02 23:27:04,233 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_detect [2019-10-02 23:27:04,233 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_open [2019-10-02 23:27:04,234 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_release [2019-10-02 23:27:04,234 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_write [2019-10-02 23:27:04,235 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_read [2019-10-02 23:27:04,235 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_init [2019-10-02 23:27:04,235 INFO L138 BoogieDeclarations]: Found implementation of procedure pg_exit [2019-10-02 23:27:04,235 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 23:27:04,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_1 [2019-10-02 23:27:04,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_2 [2019-10-02 23:27:04,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_3 [2019-10-02 23:27:04,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_4 [2019-10-02 23:27:04,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_5 [2019-10-02 23:27:04,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_6 [2019-10-02 23:27:04,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_7 [2019-10-02 23:27:04,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_8 [2019-10-02 23:27:04,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_9 [2019-10-02 23:27:04,237 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_register_chrdev_10 [2019-10-02 23:27:04,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_unregister_chrdev_11 [2019-10-02 23:27:04,238 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-10-02 23:27:04,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-10-02 23:27:04,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_trap [2019-10-02 23:27:04,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_cred_guard_mutex_of_signal_struct [2019-10-02 23:27:04,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_cred_guard_mutex_of_signal_struct [2019-10-02 23:27:04,239 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_cred_guard_mutex_of_signal_struct [2019-10-02 23:27:04,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_cred_guard_mutex_of_signal_struct [2019-10-02 23:27:04,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_cred_guard_mutex_of_signal_struct [2019-10-02 23:27:04,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_cred_guard_mutex_of_signal_struct [2019-10-02 23:27:04,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_cred_guard_mutex_of_signal_struct [2019-10-02 23:27:04,240 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_lock [2019-10-02 23:27:04,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_lock [2019-10-02 23:27:04,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_lock [2019-10-02 23:27:04,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_lock [2019-10-02 23:27:04,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_lock [2019-10-02 23:27:04,241 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_lock [2019-10-02 23:27:04,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_lock [2019-10-02 23:27:04,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_mutex_of_device [2019-10-02 23:27:04,242 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_mutex_of_device [2019-10-02 23:27:04,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mutex_of_device [2019-10-02 23:27:04,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_mutex_of_device [2019-10-02 23:27:04,243 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_mutex_of_device [2019-10-02 23:27:04,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_mutex_of_device [2019-10-02 23:27:04,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mutex_of_device [2019-10-02 23:27:04,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_pg_mutex [2019-10-02 23:27:04,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_pg_mutex [2019-10-02 23:27:04,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_pg_mutex [2019-10-02 23:27:04,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_pg_mutex [2019-10-02 23:27:04,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_pg_mutex [2019-10-02 23:27:04,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_pg_mutex [2019-10-02 23:27:04,246 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_pg_mutex [2019-10-02 23:27:04,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-10-02 23:27:04,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-10-02 23:27:04,247 INFO L138 BoogieDeclarations]: Found implementation of procedure __class_create [2019-10-02 23:27:04,247 INFO L138 BoogieDeclarations]: Found implementation of procedure __const_udelay [2019-10-02 23:27:04,247 INFO L138 BoogieDeclarations]: Found implementation of procedure __register_chrdev [2019-10-02 23:27:04,247 INFO L138 BoogieDeclarations]: Found implementation of procedure __unregister_chrdev [2019-10-02 23:27:04,248 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_from_user [2019-10-02 23:27:04,249 INFO L138 BoogieDeclarations]: Found implementation of procedure _copy_to_user [2019-10-02 23:27:04,251 INFO L138 BoogieDeclarations]: Found implementation of procedure class_destroy [2019-10-02 23:27:04,252 INFO L138 BoogieDeclarations]: Found implementation of procedure device_create [2019-10-02 23:27:04,252 INFO L138 BoogieDeclarations]: Found implementation of procedure device_destroy [2019-10-02 23:27:04,252 INFO L138 BoogieDeclarations]: Found implementation of procedure might_fault [2019-10-02 23:27:04,253 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2019-10-02 23:27:04,253 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_trylock [2019-10-02 23:27:04,253 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2019-10-02 23:27:04,253 INFO L138 BoogieDeclarations]: Found implementation of procedure noop_llseek [2019-10-02 23:27:04,254 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_connect [2019-10-02 23:27:04,254 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_disconnect [2019-10-02 23:27:04,254 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_init [2019-10-02 23:27:04,255 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_read_block [2019-10-02 23:27:04,255 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_read_regr [2019-10-02 23:27:04,256 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_release [2019-10-02 23:27:04,256 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_write_block [2019-10-02 23:27:04,256 INFO L138 BoogieDeclarations]: Found implementation of procedure pi_write_regr [2019-10-02 23:27:04,256 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-10-02 23:27:04,257 INFO L138 BoogieDeclarations]: Found implementation of procedure schedule_timeout_interruptible [2019-10-02 23:27:04,257 INFO L138 BoogieDeclarations]: Found implementation of procedure warn_slowpath_fmt [2019-10-02 23:27:04,257 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-10-02 23:27:04,257 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-10-02 23:27:04,258 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-10-02 23:27:04,258 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 23:27:04,258 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 23:27:04,258 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-10-02 23:27:04,258 INFO L130 BoogieDeclarations]: Found specification of procedure clear_bit [2019-10-02 23:27:04,259 INFO L130 BoogieDeclarations]: Found specification of procedure test_and_set_bit [2019-10-02 23:27:04,260 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-10-02 23:27:04,260 INFO L130 BoogieDeclarations]: Found specification of procedure might_fault [2019-10-02 23:27:04,260 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2019-10-02 23:27:04,261 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-10-02 23:27:04,261 INFO L130 BoogieDeclarations]: Found specification of procedure memcmp [2019-10-02 23:27:04,261 INFO L130 BoogieDeclarations]: Found specification of procedure warn_slowpath_fmt [2019-10-02 23:27:04,262 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2019-10-02 23:27:04,262 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2019-10-02 23:27:04,263 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_trylock [2019-10-02 23:27:04,263 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_4 [2019-10-02 23:27:04,264 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2019-10-02 23:27:04,264 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_2 [2019-10-02 23:27:04,264 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_5 [2019-10-02 23:27:04,264 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_7 [2019-10-02 23:27:04,265 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_9 [2019-10-02 23:27:04,265 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2019-10-02 23:27:04,265 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_1 [2019-10-02 23:27:04,266 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_3 [2019-10-02 23:27:04,266 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_6 [2019-10-02 23:27:04,266 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_8 [2019-10-02 23:27:04,267 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_cred_guard_mutex_of_signal_struct [2019-10-02 23:27:04,267 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_cred_guard_mutex_of_signal_struct [2019-10-02 23:27:04,267 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_lock [2019-10-02 23:27:04,267 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_lock [2019-10-02 23:27:04,268 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mutex_of_device [2019-10-02 23:27:04,269 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_mutex_of_device [2019-10-02 23:27:04,273 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mutex_of_device [2019-10-02 23:27:04,274 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_pg_mutex [2019-10-02 23:27:04,274 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_pg_mutex [2019-10-02 23:27:04,274 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 23:27:04,281 INFO L130 BoogieDeclarations]: Found specification of procedure iminor [2019-10-02 23:27:04,281 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 23:27:04,281 INFO L130 BoogieDeclarations]: Found specification of procedure __register_chrdev [2019-10-02 23:27:04,282 INFO L130 BoogieDeclarations]: Found specification of procedure __unregister_chrdev [2019-10-02 23:27:04,282 INFO L130 BoogieDeclarations]: Found specification of procedure register_chrdev [2019-10-02 23:27:04,284 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_register_chrdev_10 [2019-10-02 23:27:04,284 INFO L130 BoogieDeclarations]: Found specification of procedure unregister_chrdev [2019-10-02 23:27:04,284 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_unregister_chrdev_11 [2019-10-02 23:27:04,284 INFO L130 BoogieDeclarations]: Found specification of procedure noop_llseek [2019-10-02 23:27:04,284 INFO L130 BoogieDeclarations]: Found specification of procedure __const_udelay [2019-10-02 23:27:04,284 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-10-02 23:27:04,285 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 23:27:04,285 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 23:27:04,285 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2019-10-02 23:27:04,285 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-10-02 23:27:04,285 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 23:27:04,286 INFO L130 BoogieDeclarations]: Found specification of procedure __kmalloc [2019-10-02 23:27:04,286 INFO L130 BoogieDeclarations]: Found specification of procedure kmalloc [2019-10-02 23:27:04,286 INFO L130 BoogieDeclarations]: Found specification of procedure __class_create [2019-10-02 23:27:04,286 INFO L130 BoogieDeclarations]: Found specification of procedure class_destroy [2019-10-02 23:27:04,286 INFO L130 BoogieDeclarations]: Found specification of procedure device_create [2019-10-02 23:27:04,287 INFO L130 BoogieDeclarations]: Found specification of procedure device_destroy [2019-10-02 23:27:04,287 INFO L130 BoogieDeclarations]: Found specification of procedure schedule_timeout_interruptible [2019-10-02 23:27:04,287 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_to_user [2019-10-02 23:27:04,287 INFO L130 BoogieDeclarations]: Found specification of procedure _copy_from_user [2019-10-02 23:27:04,287 INFO L130 BoogieDeclarations]: Found specification of procedure copy_from_user [2019-10-02 23:27:04,288 INFO L130 BoogieDeclarations]: Found specification of procedure copy_to_user [2019-10-02 23:27:04,288 INFO L130 BoogieDeclarations]: Found specification of procedure pi_init [2019-10-02 23:27:04,288 INFO L130 BoogieDeclarations]: Found specification of procedure pi_release [2019-10-02 23:27:04,288 INFO L130 BoogieDeclarations]: Found specification of procedure pi_write_regr [2019-10-02 23:27:04,288 INFO L130 BoogieDeclarations]: Found specification of procedure pi_read_regr [2019-10-02 23:27:04,289 INFO L130 BoogieDeclarations]: Found specification of procedure pi_write_block [2019-10-02 23:27:04,289 INFO L130 BoogieDeclarations]: Found specification of procedure pi_read_block [2019-10-02 23:27:04,289 INFO L130 BoogieDeclarations]: Found specification of procedure pi_connect [2019-10-02 23:27:04,289 INFO L130 BoogieDeclarations]: Found specification of procedure pi_disconnect [2019-10-02 23:27:04,290 INFO L130 BoogieDeclarations]: Found specification of procedure pg_open [2019-10-02 23:27:04,290 INFO L130 BoogieDeclarations]: Found specification of procedure pg_release [2019-10-02 23:27:04,290 INFO L130 BoogieDeclarations]: Found specification of procedure pg_read [2019-10-02 23:27:04,290 INFO L130 BoogieDeclarations]: Found specification of procedure pg_write [2019-10-02 23:27:04,290 INFO L130 BoogieDeclarations]: Found specification of procedure pg_detect [2019-10-02 23:27:04,291 INFO L130 BoogieDeclarations]: Found specification of procedure pg_identify [2019-10-02 23:27:04,291 INFO L130 BoogieDeclarations]: Found specification of procedure pg_init_units [2019-10-02 23:27:04,291 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 23:27:04,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 23:27:04,291 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 23:27:04,292 INFO L130 BoogieDeclarations]: Found specification of procedure status_reg [2019-10-02 23:27:04,292 INFO L130 BoogieDeclarations]: Found specification of procedure read_reg [2019-10-02 23:27:04,292 INFO L130 BoogieDeclarations]: Found specification of procedure write_reg [2019-10-02 23:27:04,292 INFO L130 BoogieDeclarations]: Found specification of procedure DRIVE [2019-10-02 23:27:04,293 INFO L130 BoogieDeclarations]: Found specification of procedure pg_sleep [2019-10-02 23:27:04,293 INFO L130 BoogieDeclarations]: Found specification of procedure pg_wait [2019-10-02 23:27:04,293 INFO L130 BoogieDeclarations]: Found specification of procedure pg_command [2019-10-02 23:27:04,293 INFO L130 BoogieDeclarations]: Found specification of procedure pg_completion [2019-10-02 23:27:04,293 INFO L130 BoogieDeclarations]: Found specification of procedure pg_reset [2019-10-02 23:27:04,293 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 23:27:04,294 INFO L130 BoogieDeclarations]: Found specification of procedure xs [2019-10-02 23:27:04,294 INFO L130 BoogieDeclarations]: Found specification of procedure pg_probe [2019-10-02 23:27:04,294 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-10-02 23:27:04,294 INFO L130 BoogieDeclarations]: Found specification of procedure pg_init [2019-10-02 23:27:04,294 INFO L130 BoogieDeclarations]: Found specification of procedure pg_exit [2019-10-02 23:27:04,295 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-10-02 23:27:04,295 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-10-02 23:27:04,295 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 23:27:04,295 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-10-02 23:27:04,295 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_trap [2019-10-02 23:27:04,295 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_cred_guard_mutex_of_signal_struct [2019-10-02 23:27:04,296 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_cred_guard_mutex_of_signal_struct [2019-10-02 23:27:04,296 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_cred_guard_mutex_of_signal_struct [2019-10-02 23:27:04,296 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_cred_guard_mutex_of_signal_struct [2019-10-02 23:27:04,296 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_cred_guard_mutex_of_signal_struct [2019-10-02 23:27:04,296 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_lock [2019-10-02 23:27:04,297 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_lock [2019-10-02 23:27:04,297 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_lock [2019-10-02 23:27:04,297 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_lock [2019-10-02 23:27:04,297 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_lock [2019-10-02 23:27:04,297 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_mutex_of_device [2019-10-02 23:27:04,297 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_mutex_of_device [2019-10-02 23:27:04,298 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_mutex_of_device [2019-10-02 23:27:04,298 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_mutex_of_device [2019-10-02 23:27:04,298 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_pg_mutex [2019-10-02 23:27:04,298 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_pg_mutex [2019-10-02 23:27:04,298 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_pg_mutex [2019-10-02 23:27:04,299 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_pg_mutex [2019-10-02 23:27:04,299 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_pg_mutex [2019-10-02 23:27:04,299 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-10-02 23:27:04,299 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-10-02 23:27:04,299 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-02 23:27:04,300 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-02 23:27:04,300 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 23:27:04,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 23:27:04,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 23:27:04,300 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-02 23:27:04,300 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 23:27:08,852 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 23:27:08,853 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-02 23:27:08,855 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:27:08 BoogieIcfgContainer [2019-10-02 23:27:08,856 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 23:27:08,857 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 23:27:08,857 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 23:27:08,862 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 23:27:08,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 11:27:01" (1/3) ... [2019-10-02 23:27:08,864 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23f52e3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:27:08, skipping insertion in model container [2019-10-02 23:27:08,864 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 11:27:03" (2/3) ... [2019-10-02 23:27:08,865 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@23f52e3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 11:27:08, skipping insertion in model container [2019-10-02 23:27:08,865 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 11:27:08" (3/3) ... [2019-10-02 23:27:08,867 INFO L109 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--block--paride--pg.ko-main.cil.out.i [2019-10-02 23:27:08,882 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 23:27:08,896 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 23:27:08,922 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 23:27:08,962 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 23:27:08,962 INFO L378 AbstractCegarLoop]: Hoare is false [2019-10-02 23:27:08,963 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 23:27:08,963 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 23:27:08,963 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 23:27:08,963 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 23:27:08,963 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 23:27:08,963 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 23:27:09,001 INFO L276 IsEmpty]: Start isEmpty. Operand 699 states. [2019-10-02 23:27:09,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-10-02 23:27:09,019 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:27:09,020 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:27:09,024 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:27:09,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:27:09,033 INFO L82 PathProgramCache]: Analyzing trace with hash -466886759, now seen corresponding path program 1 times [2019-10-02 23:27:09,036 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:27:09,144 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:09,144 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:27:09,145 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:09,145 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:27:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:27:09,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 23:27:09,858 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:27:09,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 23:27:09,859 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:27:09,866 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 23:27:09,885 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 23:27:09,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 23:27:09,889 INFO L87 Difference]: Start difference. First operand 699 states. Second operand 4 states. [2019-10-02 23:27:11,171 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:27:11,172 INFO L93 Difference]: Finished difference Result 589 states and 754 transitions. [2019-10-02 23:27:11,173 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:27:11,175 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 31 [2019-10-02 23:27:11,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:27:11,210 INFO L225 Difference]: With dead ends: 589 [2019-10-02 23:27:11,211 INFO L226 Difference]: Without dead ends: 582 [2019-10-02 23:27:11,213 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 23:27:11,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-10-02 23:27:11,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-10-02 23:27:11,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-10-02 23:27:11,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 747 transitions. [2019-10-02 23:27:11,318 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 747 transitions. Word has length 31 [2019-10-02 23:27:11,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:27:11,319 INFO L475 AbstractCegarLoop]: Abstraction has 582 states and 747 transitions. [2019-10-02 23:27:11,319 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 23:27:11,320 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 747 transitions. [2019-10-02 23:27:11,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-10-02 23:27:11,324 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:27:11,324 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:27:11,324 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:27:11,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:27:11,325 INFO L82 PathProgramCache]: Analyzing trace with hash -503911691, now seen corresponding path program 1 times [2019-10-02 23:27:11,325 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:27:11,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:11,333 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:27:11,333 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:11,334 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:27:11,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:27:11,645 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 23:27:11,645 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:27:11,646 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:27:11,646 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:27:11,648 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:27:11,648 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:27:11,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:27:11,649 INFO L87 Difference]: Start difference. First operand 582 states and 747 transitions. Second operand 3 states. [2019-10-02 23:27:11,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:27:11,841 INFO L93 Difference]: Finished difference Result 899 states and 1159 transitions. [2019-10-02 23:27:11,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:27:11,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 34 [2019-10-02 23:27:11,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:27:11,851 INFO L225 Difference]: With dead ends: 899 [2019-10-02 23:27:11,851 INFO L226 Difference]: Without dead ends: 899 [2019-10-02 23:27:11,852 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:27:11,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 899 states. [2019-10-02 23:27:11,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 899 to 851. [2019-10-02 23:27:11,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 851 states. [2019-10-02 23:27:11,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 851 states to 851 states and 1104 transitions. [2019-10-02 23:27:11,927 INFO L78 Accepts]: Start accepts. Automaton has 851 states and 1104 transitions. Word has length 34 [2019-10-02 23:27:11,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:27:11,928 INFO L475 AbstractCegarLoop]: Abstraction has 851 states and 1104 transitions. [2019-10-02 23:27:11,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:27:11,928 INFO L276 IsEmpty]: Start isEmpty. Operand 851 states and 1104 transitions. [2019-10-02 23:27:11,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-10-02 23:27:11,931 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:27:11,932 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:27:11,932 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:27:11,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:27:11,933 INFO L82 PathProgramCache]: Analyzing trace with hash -159570386, now seen corresponding path program 1 times [2019-10-02 23:27:11,933 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:27:11,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:11,942 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:27:11,942 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:11,942 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:27:12,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:27:12,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 23:27:12,318 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:27:12,319 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:27:12,319 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:27:12,320 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:27:12,320 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:27:12,320 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:27:12,320 INFO L87 Difference]: Start difference. First operand 851 states and 1104 transitions. Second operand 3 states. [2019-10-02 23:27:12,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:27:12,372 INFO L93 Difference]: Finished difference Result 863 states and 1120 transitions. [2019-10-02 23:27:12,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:27:12,373 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 44 [2019-10-02 23:27:12,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:27:12,383 INFO L225 Difference]: With dead ends: 863 [2019-10-02 23:27:12,383 INFO L226 Difference]: Without dead ends: 863 [2019-10-02 23:27:12,384 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:27:12,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 863 states. [2019-10-02 23:27:12,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 863 to 853. [2019-10-02 23:27:12,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 853 states. [2019-10-02 23:27:12,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 853 states to 853 states and 1106 transitions. [2019-10-02 23:27:12,442 INFO L78 Accepts]: Start accepts. Automaton has 853 states and 1106 transitions. Word has length 44 [2019-10-02 23:27:12,442 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:27:12,442 INFO L475 AbstractCegarLoop]: Abstraction has 853 states and 1106 transitions. [2019-10-02 23:27:12,442 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:27:12,443 INFO L276 IsEmpty]: Start isEmpty. Operand 853 states and 1106 transitions. [2019-10-02 23:27:12,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-02 23:27:12,445 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:27:12,445 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:27:12,445 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:27:12,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:27:12,446 INFO L82 PathProgramCache]: Analyzing trace with hash -1084319382, now seen corresponding path program 1 times [2019-10-02 23:27:12,446 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:27:12,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:12,453 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:27:12,453 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:12,453 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:27:12,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:27:12,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 23:27:12,650 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:27:12,650 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:27:12,650 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:27:12,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:27:12,651 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:27:12,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:27:12,652 INFO L87 Difference]: Start difference. First operand 853 states and 1106 transitions. Second operand 3 states. [2019-10-02 23:27:13,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:27:13,161 INFO L93 Difference]: Finished difference Result 1287 states and 1666 transitions. [2019-10-02 23:27:13,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:27:13,162 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-10-02 23:27:13,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:27:13,172 INFO L225 Difference]: With dead ends: 1287 [2019-10-02 23:27:13,173 INFO L226 Difference]: Without dead ends: 1287 [2019-10-02 23:27:13,174 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:27:13,177 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2019-10-02 23:27:13,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 1283. [2019-10-02 23:27:13,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1283 states. [2019-10-02 23:27:13,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1283 states to 1283 states and 1663 transitions. [2019-10-02 23:27:13,233 INFO L78 Accepts]: Start accepts. Automaton has 1283 states and 1663 transitions. Word has length 46 [2019-10-02 23:27:13,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:27:13,234 INFO L475 AbstractCegarLoop]: Abstraction has 1283 states and 1663 transitions. [2019-10-02 23:27:13,234 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:27:13,234 INFO L276 IsEmpty]: Start isEmpty. Operand 1283 states and 1663 transitions. [2019-10-02 23:27:13,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-02 23:27:13,236 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:27:13,237 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:27:13,237 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:27:13,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:27:13,237 INFO L82 PathProgramCache]: Analyzing trace with hash 819154128, now seen corresponding path program 1 times [2019-10-02 23:27:13,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:27:13,244 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:13,244 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:27:13,245 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:13,245 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:27:13,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:27:13,463 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 23:27:13,463 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:27:13,463 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:27:13,463 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:27:13,464 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:27:13,464 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:27:13,465 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:27:13,465 INFO L87 Difference]: Start difference. First operand 1283 states and 1663 transitions. Second operand 3 states. [2019-10-02 23:27:13,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:27:13,503 INFO L93 Difference]: Finished difference Result 1313 states and 1707 transitions. [2019-10-02 23:27:13,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:27:13,503 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-10-02 23:27:13,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:27:13,514 INFO L225 Difference]: With dead ends: 1313 [2019-10-02 23:27:13,514 INFO L226 Difference]: Without dead ends: 1313 [2019-10-02 23:27:13,515 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:27:13,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1313 states. [2019-10-02 23:27:13,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1313 to 1309. [2019-10-02 23:27:13,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1309 states. [2019-10-02 23:27:13,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1309 states and 1703 transitions. [2019-10-02 23:27:13,573 INFO L78 Accepts]: Start accepts. Automaton has 1309 states and 1703 transitions. Word has length 53 [2019-10-02 23:27:13,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:27:13,573 INFO L475 AbstractCegarLoop]: Abstraction has 1309 states and 1703 transitions. [2019-10-02 23:27:13,574 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:27:13,574 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 1703 transitions. [2019-10-02 23:27:13,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-02 23:27:13,575 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:27:13,575 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:27:13,576 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:27:13,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:27:13,576 INFO L82 PathProgramCache]: Analyzing trace with hash -1968261359, now seen corresponding path program 1 times [2019-10-02 23:27:13,576 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:27:13,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:13,586 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:27:13,586 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:13,586 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:27:13,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:27:13,842 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 23:27:13,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:27:13,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:27:13,843 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:27:13,843 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:27:13,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:27:13,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:27:13,844 INFO L87 Difference]: Start difference. First operand 1309 states and 1703 transitions. Second operand 3 states. [2019-10-02 23:27:13,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:27:13,995 INFO L93 Difference]: Finished difference Result 1320 states and 1714 transitions. [2019-10-02 23:27:13,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:27:13,996 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-10-02 23:27:13,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:27:14,008 INFO L225 Difference]: With dead ends: 1320 [2019-10-02 23:27:14,008 INFO L226 Difference]: Without dead ends: 1320 [2019-10-02 23:27:14,009 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:27:14,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1320 states. [2019-10-02 23:27:14,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1320 to 1309. [2019-10-02 23:27:14,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1309 states. [2019-10-02 23:27:14,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1309 states to 1309 states and 1701 transitions. [2019-10-02 23:27:14,079 INFO L78 Accepts]: Start accepts. Automaton has 1309 states and 1701 transitions. Word has length 53 [2019-10-02 23:27:14,079 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:27:14,079 INFO L475 AbstractCegarLoop]: Abstraction has 1309 states and 1701 transitions. [2019-10-02 23:27:14,080 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:27:14,080 INFO L276 IsEmpty]: Start isEmpty. Operand 1309 states and 1701 transitions. [2019-10-02 23:27:14,081 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-10-02 23:27:14,081 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:27:14,082 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:27:14,082 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:27:14,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:27:14,083 INFO L82 PathProgramCache]: Analyzing trace with hash -1911003057, now seen corresponding path program 1 times [2019-10-02 23:27:14,083 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:27:14,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:14,090 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:27:14,090 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:14,090 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:27:14,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:27:14,312 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 23:27:14,312 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:27:14,312 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:27:14,313 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:27:14,313 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:27:14,313 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:27:14,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:27:14,314 INFO L87 Difference]: Start difference. First operand 1309 states and 1701 transitions. Second operand 3 states. [2019-10-02 23:27:14,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:27:14,692 INFO L93 Difference]: Finished difference Result 1308 states and 1699 transitions. [2019-10-02 23:27:14,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:27:14,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-10-02 23:27:14,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:27:14,702 INFO L225 Difference]: With dead ends: 1308 [2019-10-02 23:27:14,702 INFO L226 Difference]: Without dead ends: 1308 [2019-10-02 23:27:14,703 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:27:14,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1308 states. [2019-10-02 23:27:14,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1308 to 1308. [2019-10-02 23:27:14,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1308 states. [2019-10-02 23:27:14,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1308 states to 1308 states and 1699 transitions. [2019-10-02 23:27:14,800 INFO L78 Accepts]: Start accepts. Automaton has 1308 states and 1699 transitions. Word has length 53 [2019-10-02 23:27:14,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:27:14,800 INFO L475 AbstractCegarLoop]: Abstraction has 1308 states and 1699 transitions. [2019-10-02 23:27:14,800 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:27:14,801 INFO L276 IsEmpty]: Start isEmpty. Operand 1308 states and 1699 transitions. [2019-10-02 23:27:14,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-10-02 23:27:14,802 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:27:14,802 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:27:14,802 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:27:14,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:27:14,803 INFO L82 PathProgramCache]: Analyzing trace with hash 888053654, now seen corresponding path program 1 times [2019-10-02 23:27:14,803 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:27:14,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:14,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:27:14,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:14,809 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:27:14,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:27:14,998 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 23:27:14,999 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:27:15,000 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:27:15,001 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:27:15,001 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:27:15,002 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:27:15,002 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:27:15,002 INFO L87 Difference]: Start difference. First operand 1308 states and 1699 transitions. Second operand 3 states. [2019-10-02 23:27:15,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:27:15,299 INFO L93 Difference]: Finished difference Result 1307 states and 1697 transitions. [2019-10-02 23:27:15,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:27:15,300 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-10-02 23:27:15,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:27:15,311 INFO L225 Difference]: With dead ends: 1307 [2019-10-02 23:27:15,312 INFO L226 Difference]: Without dead ends: 1307 [2019-10-02 23:27:15,312 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:27:15,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1307 states. [2019-10-02 23:27:15,356 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1307 to 1307. [2019-10-02 23:27:15,356 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1307 states. [2019-10-02 23:27:15,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1307 states to 1307 states and 1697 transitions. [2019-10-02 23:27:15,365 INFO L78 Accepts]: Start accepts. Automaton has 1307 states and 1697 transitions. Word has length 54 [2019-10-02 23:27:15,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:27:15,366 INFO L475 AbstractCegarLoop]: Abstraction has 1307 states and 1697 transitions. [2019-10-02 23:27:15,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:27:15,366 INFO L276 IsEmpty]: Start isEmpty. Operand 1307 states and 1697 transitions. [2019-10-02 23:27:15,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-10-02 23:27:15,367 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:27:15,367 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:27:15,367 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:27:15,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:27:15,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1759470642, now seen corresponding path program 1 times [2019-10-02 23:27:15,368 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:27:15,374 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:15,374 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:27:15,375 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:15,375 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:27:15,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:27:15,568 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 23:27:15,568 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:27:15,568 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:27:15,569 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:27:15,569 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:27:15,569 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:27:15,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:27:15,570 INFO L87 Difference]: Start difference. First operand 1307 states and 1697 transitions. Second operand 3 states. [2019-10-02 23:27:15,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:27:15,978 INFO L93 Difference]: Finished difference Result 1306 states and 1695 transitions. [2019-10-02 23:27:15,979 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:27:15,979 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-10-02 23:27:15,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:27:15,990 INFO L225 Difference]: With dead ends: 1306 [2019-10-02 23:27:15,990 INFO L226 Difference]: Without dead ends: 1306 [2019-10-02 23:27:15,990 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:27:15,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2019-10-02 23:27:16,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 1306. [2019-10-02 23:27:16,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1306 states. [2019-10-02 23:27:16,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1306 states to 1306 states and 1695 transitions. [2019-10-02 23:27:16,039 INFO L78 Accepts]: Start accepts. Automaton has 1306 states and 1695 transitions. Word has length 55 [2019-10-02 23:27:16,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:27:16,039 INFO L475 AbstractCegarLoop]: Abstraction has 1306 states and 1695 transitions. [2019-10-02 23:27:16,039 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:27:16,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1306 states and 1695 transitions. [2019-10-02 23:27:16,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-10-02 23:27:16,041 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:27:16,041 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 23:27:16,041 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:27:16,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:27:16,041 INFO L82 PathProgramCache]: Analyzing trace with hash -1291368935, now seen corresponding path program 1 times [2019-10-02 23:27:16,042 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:27:16,047 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:16,047 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:27:16,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:16,048 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:27:16,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:27:16,278 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 23:27:16,278 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:27:16,278 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:27:16,279 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:27:16,280 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:27:16,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:27:16,281 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:27:16,281 INFO L87 Difference]: Start difference. First operand 1306 states and 1695 transitions. Second operand 3 states. [2019-10-02 23:27:16,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:27:16,573 INFO L93 Difference]: Finished difference Result 1653 states and 2135 transitions. [2019-10-02 23:27:16,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:27:16,573 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 56 [2019-10-02 23:27:16,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:27:16,585 INFO L225 Difference]: With dead ends: 1653 [2019-10-02 23:27:16,585 INFO L226 Difference]: Without dead ends: 1608 [2019-10-02 23:27:16,586 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:27:16,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1608 states. [2019-10-02 23:27:16,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1608 to 1608. [2019-10-02 23:27:16,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1608 states. [2019-10-02 23:27:16,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1608 states to 1608 states and 2083 transitions. [2019-10-02 23:27:16,652 INFO L78 Accepts]: Start accepts. Automaton has 1608 states and 2083 transitions. Word has length 56 [2019-10-02 23:27:16,653 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:27:16,653 INFO L475 AbstractCegarLoop]: Abstraction has 1608 states and 2083 transitions. [2019-10-02 23:27:16,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:27:16,653 INFO L276 IsEmpty]: Start isEmpty. Operand 1608 states and 2083 transitions. [2019-10-02 23:27:16,657 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 107 [2019-10-02 23:27:16,657 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:27:16,658 INFO L411 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-10-02 23:27:16,658 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:27:16,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:27:16,659 INFO L82 PathProgramCache]: Analyzing trace with hash -979606059, now seen corresponding path program 1 times [2019-10-02 23:27:16,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:27:16,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:16,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:27:16,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:16,666 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:27:16,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:27:16,884 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 23:27:16,885 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:27:16,885 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 23:27:16,885 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:27:16,885 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 23:27:16,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 23:27:16,886 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 23:27:16,886 INFO L87 Difference]: Start difference. First operand 1608 states and 2083 transitions. Second operand 5 states. [2019-10-02 23:27:16,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:27:16,929 INFO L93 Difference]: Finished difference Result 1622 states and 2097 transitions. [2019-10-02 23:27:16,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 23:27:16,930 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 106 [2019-10-02 23:27:16,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:27:16,941 INFO L225 Difference]: With dead ends: 1622 [2019-10-02 23:27:16,941 INFO L226 Difference]: Without dead ends: 1622 [2019-10-02 23:27:16,942 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 23:27:16,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1622 states. [2019-10-02 23:27:16,990 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1622 to 1622. [2019-10-02 23:27:16,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1622 states. [2019-10-02 23:27:16,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1622 states to 1622 states and 2097 transitions. [2019-10-02 23:27:17,000 INFO L78 Accepts]: Start accepts. Automaton has 1622 states and 2097 transitions. Word has length 106 [2019-10-02 23:27:17,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:27:17,000 INFO L475 AbstractCegarLoop]: Abstraction has 1622 states and 2097 transitions. [2019-10-02 23:27:17,000 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 23:27:17,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1622 states and 2097 transitions. [2019-10-02 23:27:17,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-02 23:27:17,004 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:27:17,004 INFO L411 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-10-02 23:27:17,005 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:27:17,005 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:27:17,005 INFO L82 PathProgramCache]: Analyzing trace with hash 1122639744, now seen corresponding path program 1 times [2019-10-02 23:27:17,005 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:27:17,012 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:17,013 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:27:17,013 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:17,013 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:27:17,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:27:17,275 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-02 23:27:17,275 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:27:17,275 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 23:27:17,276 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:27:17,276 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 23:27:17,277 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 23:27:17,277 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 23:27:17,277 INFO L87 Difference]: Start difference. First operand 1622 states and 2097 transitions. Second operand 5 states. [2019-10-02 23:27:17,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:27:17,342 INFO L93 Difference]: Finished difference Result 1640 states and 2121 transitions. [2019-10-02 23:27:17,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 23:27:17,343 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 122 [2019-10-02 23:27:17,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:27:17,360 INFO L225 Difference]: With dead ends: 1640 [2019-10-02 23:27:17,360 INFO L226 Difference]: Without dead ends: 1640 [2019-10-02 23:27:17,361 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 23:27:17,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1640 states. [2019-10-02 23:27:17,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1640 to 1630. [2019-10-02 23:27:17,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1630 states. [2019-10-02 23:27:17,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1630 states to 1630 states and 2109 transitions. [2019-10-02 23:27:17,494 INFO L78 Accepts]: Start accepts. Automaton has 1630 states and 2109 transitions. Word has length 122 [2019-10-02 23:27:17,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:27:17,494 INFO L475 AbstractCegarLoop]: Abstraction has 1630 states and 2109 transitions. [2019-10-02 23:27:17,494 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 23:27:17,494 INFO L276 IsEmpty]: Start isEmpty. Operand 1630 states and 2109 transitions. [2019-10-02 23:27:17,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 134 [2019-10-02 23:27:17,498 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:27:17,498 INFO L411 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-10-02 23:27:17,499 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:27:17,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:27:17,499 INFO L82 PathProgramCache]: Analyzing trace with hash -489656520, now seen corresponding path program 1 times [2019-10-02 23:27:17,500 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:27:17,505 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:17,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:27:17,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:17,506 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:27:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:27:17,809 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-10-02 23:27:17,810 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:27:17,810 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 23:27:17,810 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:27:17,811 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 23:27:17,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 23:27:17,813 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 23:27:17,813 INFO L87 Difference]: Start difference. First operand 1630 states and 2109 transitions. Second operand 5 states. [2019-10-02 23:27:17,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:27:17,905 INFO L93 Difference]: Finished difference Result 1698 states and 2207 transitions. [2019-10-02 23:27:17,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 23:27:17,906 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 133 [2019-10-02 23:27:17,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:27:17,922 INFO L225 Difference]: With dead ends: 1698 [2019-10-02 23:27:17,922 INFO L226 Difference]: Without dead ends: 1698 [2019-10-02 23:27:17,924 INFO L640 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-10-02 23:27:17,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1698 states. [2019-10-02 23:27:17,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1698 to 1638. [2019-10-02 23:27:17,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1638 states. [2019-10-02 23:27:17,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1638 states to 1638 states and 2117 transitions. [2019-10-02 23:27:17,991 INFO L78 Accepts]: Start accepts. Automaton has 1638 states and 2117 transitions. Word has length 133 [2019-10-02 23:27:17,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:27:17,991 INFO L475 AbstractCegarLoop]: Abstraction has 1638 states and 2117 transitions. [2019-10-02 23:27:17,991 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 23:27:17,991 INFO L276 IsEmpty]: Start isEmpty. Operand 1638 states and 2117 transitions. [2019-10-02 23:27:18,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 234 [2019-10-02 23:27:18,002 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:27:18,003 INFO L411 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, 1, 1] [2019-10-02 23:27:18,003 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:27:18,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:27:18,004 INFO L82 PathProgramCache]: Analyzing trace with hash 1433135490, now seen corresponding path program 1 times [2019-10-02 23:27:18,004 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:27:18,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:18,011 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:27:18,011 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:18,011 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:27:18,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:27:18,347 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2019-10-02 23:27:18,347 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:27:18,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 23:27:18,348 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:27:18,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 23:27:18,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 23:27:18,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 23:27:18,350 INFO L87 Difference]: Start difference. First operand 1638 states and 2117 transitions. Second operand 4 states. [2019-10-02 23:27:18,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:27:18,408 INFO L93 Difference]: Finished difference Result 1753 states and 2285 transitions. [2019-10-02 23:27:18,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 23:27:18,409 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 233 [2019-10-02 23:27:18,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:27:18,421 INFO L225 Difference]: With dead ends: 1753 [2019-10-02 23:27:18,421 INFO L226 Difference]: Without dead ends: 1753 [2019-10-02 23:27:18,422 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 23:27:18,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1753 states. [2019-10-02 23:27:18,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1753 to 1648. [2019-10-02 23:27:18,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1648 states. [2019-10-02 23:27:18,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 2127 transitions. [2019-10-02 23:27:18,485 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 2127 transitions. Word has length 233 [2019-10-02 23:27:18,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:27:18,486 INFO L475 AbstractCegarLoop]: Abstraction has 1648 states and 2127 transitions. [2019-10-02 23:27:18,486 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 23:27:18,486 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 2127 transitions. [2019-10-02 23:27:18,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 245 [2019-10-02 23:27:18,494 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:27:18,495 INFO L411 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-10-02 23:27:18,495 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:27:18,495 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:27:18,496 INFO L82 PathProgramCache]: Analyzing trace with hash -1121070588, now seen corresponding path program 1 times [2019-10-02 23:27:18,496 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:27:18,502 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:18,503 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:27:18,503 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:18,503 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:27:18,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:27:18,822 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-02 23:27:18,822 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:27:18,823 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 23:27:18,823 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:27:18,824 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 23:27:18,824 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 23:27:18,824 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:27:18,825 INFO L87 Difference]: Start difference. First operand 1648 states and 2127 transitions. Second operand 3 states. [2019-10-02 23:27:18,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:27:18,888 INFO L93 Difference]: Finished difference Result 1673 states and 2157 transitions. [2019-10-02 23:27:18,888 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 23:27:18,889 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 244 [2019-10-02 23:27:18,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:27:18,902 INFO L225 Difference]: With dead ends: 1673 [2019-10-02 23:27:18,902 INFO L226 Difference]: Without dead ends: 1673 [2019-10-02 23:27:18,905 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 23:27:18,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1673 states. [2019-10-02 23:27:18,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1673 to 1658. [2019-10-02 23:27:18,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1658 states. [2019-10-02 23:27:18,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1658 states to 1658 states and 2137 transitions. [2019-10-02 23:27:18,998 INFO L78 Accepts]: Start accepts. Automaton has 1658 states and 2137 transitions. Word has length 244 [2019-10-02 23:27:18,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:27:18,999 INFO L475 AbstractCegarLoop]: Abstraction has 1658 states and 2137 transitions. [2019-10-02 23:27:18,999 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 23:27:18,999 INFO L276 IsEmpty]: Start isEmpty. Operand 1658 states and 2137 transitions. [2019-10-02 23:27:19,006 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 254 [2019-10-02 23:27:19,007 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:27:19,007 INFO L411 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-10-02 23:27:19,008 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:27:19,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:27:19,008 INFO L82 PathProgramCache]: Analyzing trace with hash 741430911, now seen corresponding path program 1 times [2019-10-02 23:27:19,009 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:27:19,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:19,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:27:19,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:19,016 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:27:19,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:27:19,396 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-02 23:27:19,398 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:27:19,399 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 23:27:19,399 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:27:19,399 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 23:27:19,400 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 23:27:19,400 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 23:27:19,400 INFO L87 Difference]: Start difference. First operand 1658 states and 2137 transitions. Second operand 6 states. [2019-10-02 23:27:19,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:27:19,502 INFO L93 Difference]: Finished difference Result 1723 states and 2224 transitions. [2019-10-02 23:27:19,503 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 23:27:19,503 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 253 [2019-10-02 23:27:19,503 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:27:19,514 INFO L225 Difference]: With dead ends: 1723 [2019-10-02 23:27:19,515 INFO L226 Difference]: Without dead ends: 1723 [2019-10-02 23:27:19,515 INFO L640 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-10-02 23:27:19,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1723 states. [2019-10-02 23:27:19,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1723 to 1699. [2019-10-02 23:27:19,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1699 states. [2019-10-02 23:27:19,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1699 states to 1699 states and 2193 transitions. [2019-10-02 23:27:19,577 INFO L78 Accepts]: Start accepts. Automaton has 1699 states and 2193 transitions. Word has length 253 [2019-10-02 23:27:19,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:27:19,578 INFO L475 AbstractCegarLoop]: Abstraction has 1699 states and 2193 transitions. [2019-10-02 23:27:19,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 23:27:19,579 INFO L276 IsEmpty]: Start isEmpty. Operand 1699 states and 2193 transitions. [2019-10-02 23:27:19,585 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-10-02 23:27:19,585 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:27:19,586 INFO L411 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, 1, 1] [2019-10-02 23:27:19,586 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:27:19,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:27:19,587 INFO L82 PathProgramCache]: Analyzing trace with hash 38044421, now seen corresponding path program 1 times [2019-10-02 23:27:19,587 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:27:19,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:19,594 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:27:19,594 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:19,595 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:27:19,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:27:19,925 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-02 23:27:19,926 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:27:19,926 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 23:27:19,926 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:27:19,927 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 23:27:19,927 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 23:27:19,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 23:27:19,928 INFO L87 Difference]: Start difference. First operand 1699 states and 2193 transitions. Second operand 6 states. [2019-10-02 23:27:20,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:27:20,044 INFO L93 Difference]: Finished difference Result 1737 states and 2244 transitions. [2019-10-02 23:27:20,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 23:27:20,044 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 255 [2019-10-02 23:27:20,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:27:20,058 INFO L225 Difference]: With dead ends: 1737 [2019-10-02 23:27:20,059 INFO L226 Difference]: Without dead ends: 1737 [2019-10-02 23:27:20,059 INFO L640 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-10-02 23:27:20,063 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1737 states. [2019-10-02 23:27:20,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1737 to 1703. [2019-10-02 23:27:20,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1703 states. [2019-10-02 23:27:20,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1703 states to 1703 states and 2197 transitions. [2019-10-02 23:27:20,118 INFO L78 Accepts]: Start accepts. Automaton has 1703 states and 2197 transitions. Word has length 255 [2019-10-02 23:27:20,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:27:20,119 INFO L475 AbstractCegarLoop]: Abstraction has 1703 states and 2197 transitions. [2019-10-02 23:27:20,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 23:27:20,119 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 2197 transitions. [2019-10-02 23:27:20,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-10-02 23:27:20,125 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:27:20,126 INFO L411 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, 1, 1] [2019-10-02 23:27:20,126 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:27:20,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:27:20,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1749825401, now seen corresponding path program 1 times [2019-10-02 23:27:20,127 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:27:20,134 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:20,134 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:27:20,135 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:20,135 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:27:20,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:27:20,513 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 49 trivial. 0 not checked. [2019-10-02 23:27:20,513 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:27:20,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 23:27:20,514 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:27:20,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 23:27:20,516 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 23:27:20,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 23:27:20,516 INFO L87 Difference]: Start difference. First operand 1703 states and 2197 transitions. Second operand 5 states. [2019-10-02 23:27:20,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:27:20,618 INFO L93 Difference]: Finished difference Result 1748 states and 2263 transitions. [2019-10-02 23:27:20,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 23:27:20,619 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 255 [2019-10-02 23:27:20,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:27:20,632 INFO L225 Difference]: With dead ends: 1748 [2019-10-02 23:27:20,632 INFO L226 Difference]: Without dead ends: 1748 [2019-10-02 23:27:20,632 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 23:27:20,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1748 states. [2019-10-02 23:27:20,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1748 to 1723. [2019-10-02 23:27:20,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1723 states. [2019-10-02 23:27:20,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1723 states to 1723 states and 2232 transitions. [2019-10-02 23:27:20,687 INFO L78 Accepts]: Start accepts. Automaton has 1723 states and 2232 transitions. Word has length 255 [2019-10-02 23:27:20,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:27:20,688 INFO L475 AbstractCegarLoop]: Abstraction has 1723 states and 2232 transitions. [2019-10-02 23:27:20,688 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 23:27:20,688 INFO L276 IsEmpty]: Start isEmpty. Operand 1723 states and 2232 transitions. [2019-10-02 23:27:20,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-10-02 23:27:20,695 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:27:20,695 INFO L411 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-10-02 23:27:20,695 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:27:20,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:27:20,696 INFO L82 PathProgramCache]: Analyzing trace with hash -1274515421, now seen corresponding path program 1 times [2019-10-02 23:27:20,696 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:27:20,701 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:20,702 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:27:20,702 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:20,702 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:27:20,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:27:21,104 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-10-02 23:27:21,105 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:27:21,105 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 23:27:21,105 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:27:21,106 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 23:27:21,106 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 23:27:21,107 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 23:27:21,107 INFO L87 Difference]: Start difference. First operand 1723 states and 2232 transitions. Second operand 10 states. [2019-10-02 23:27:21,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:27:21,214 INFO L93 Difference]: Finished difference Result 1772 states and 2288 transitions. [2019-10-02 23:27:21,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 23:27:21,214 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 286 [2019-10-02 23:27:21,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:27:21,242 INFO L225 Difference]: With dead ends: 1772 [2019-10-02 23:27:21,242 INFO L226 Difference]: Without dead ends: 1772 [2019-10-02 23:27:21,243 INFO L640 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-10-02 23:27:21,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1772 states. [2019-10-02 23:27:21,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1772 to 1733. [2019-10-02 23:27:21,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1733 states. [2019-10-02 23:27:21,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2243 transitions. [2019-10-02 23:27:21,302 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2243 transitions. Word has length 286 [2019-10-02 23:27:21,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:27:21,303 INFO L475 AbstractCegarLoop]: Abstraction has 1733 states and 2243 transitions. [2019-10-02 23:27:21,303 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 23:27:21,303 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2243 transitions. [2019-10-02 23:27:21,318 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-10-02 23:27:21,319 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:27:21,320 INFO L411 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-10-02 23:27:21,320 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:27:21,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:27:21,321 INFO L82 PathProgramCache]: Analyzing trace with hash -362663679, now seen corresponding path program 1 times [2019-10-02 23:27:21,321 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:27:21,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:21,335 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:27:21,336 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:21,336 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:27:21,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:27:22,023 INFO L134 CoverageAnalysis]: Checked inductivity of 117 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2019-10-02 23:27:22,024 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:27:22,024 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 23:27:22,024 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:27:22,026 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 23:27:22,026 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 23:27:22,027 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 23:27:22,027 INFO L87 Difference]: Start difference. First operand 1733 states and 2243 transitions. Second operand 10 states. [2019-10-02 23:27:22,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:27:22,155 INFO L93 Difference]: Finished difference Result 1782 states and 2302 transitions. [2019-10-02 23:27:22,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 23:27:22,156 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 288 [2019-10-02 23:27:22,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:27:22,168 INFO L225 Difference]: With dead ends: 1782 [2019-10-02 23:27:22,169 INFO L226 Difference]: Without dead ends: 1782 [2019-10-02 23:27:22,169 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 23:27:22,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1782 states. [2019-10-02 23:27:22,221 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1782 to 1735. [2019-10-02 23:27:22,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2019-10-02 23:27:22,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2245 transitions. [2019-10-02 23:27:22,229 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2245 transitions. Word has length 288 [2019-10-02 23:27:22,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:27:22,231 INFO L475 AbstractCegarLoop]: Abstraction has 1735 states and 2245 transitions. [2019-10-02 23:27:22,231 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 23:27:22,231 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2245 transitions. [2019-10-02 23:27:22,238 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-10-02 23:27:22,239 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:27:22,239 INFO L411 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-10-02 23:27:22,239 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:27:22,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:27:22,240 INFO L82 PathProgramCache]: Analyzing trace with hash 625458459, now seen corresponding path program 1 times [2019-10-02 23:27:22,240 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:27:22,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:22,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:27:22,246 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:22,246 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:27:22,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:27:22,823 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-02 23:27:22,824 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:27:22,824 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 23:27:22,824 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:27:22,825 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 23:27:22,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 23:27:22,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 23:27:22,825 INFO L87 Difference]: Start difference. First operand 1735 states and 2245 transitions. Second operand 10 states. [2019-10-02 23:27:22,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:27:22,968 INFO L93 Difference]: Finished difference Result 1832 states and 2386 transitions. [2019-10-02 23:27:22,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 23:27:22,969 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 297 [2019-10-02 23:27:22,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:27:22,979 INFO L225 Difference]: With dead ends: 1832 [2019-10-02 23:27:22,980 INFO L226 Difference]: Without dead ends: 1832 [2019-10-02 23:27:22,980 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-02 23:27:22,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1832 states. [2019-10-02 23:27:23,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1832 to 1735. [2019-10-02 23:27:23,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2019-10-02 23:27:23,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2245 transitions. [2019-10-02 23:27:23,039 INFO L78 Accepts]: Start accepts. Automaton has 1735 states and 2245 transitions. Word has length 297 [2019-10-02 23:27:23,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:27:23,040 INFO L475 AbstractCegarLoop]: Abstraction has 1735 states and 2245 transitions. [2019-10-02 23:27:23,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 23:27:23,040 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2245 transitions. [2019-10-02 23:27:23,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 300 [2019-10-02 23:27:23,054 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:27:23,055 INFO L411 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-10-02 23:27:23,055 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:27:23,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:27:23,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1004757881, now seen corresponding path program 1 times [2019-10-02 23:27:23,056 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:27:23,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:23,065 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:27:23,065 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:23,065 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:27:23,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:27:23,604 INFO L134 CoverageAnalysis]: Checked inductivity of 121 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-10-02 23:27:23,605 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 23:27:23,605 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 23:27:23,606 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:27:23,607 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 23:27:23,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 23:27:23,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 23:27:23,608 INFO L87 Difference]: Start difference. First operand 1735 states and 2245 transitions. Second operand 10 states. [2019-10-02 23:27:23,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:27:23,775 INFO L93 Difference]: Finished difference Result 1844 states and 2398 transitions. [2019-10-02 23:27:23,776 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-10-02 23:27:23,776 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 299 [2019-10-02 23:27:23,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:27:23,790 INFO L225 Difference]: With dead ends: 1844 [2019-10-02 23:27:23,791 INFO L226 Difference]: Without dead ends: 1844 [2019-10-02 23:27:23,792 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-02 23:27:23,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1844 states. [2019-10-02 23:27:23,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1844 to 1731. [2019-10-02 23:27:23,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1731 states. [2019-10-02 23:27:23,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1731 states to 1731 states and 2237 transitions. [2019-10-02 23:27:23,869 INFO L78 Accepts]: Start accepts. Automaton has 1731 states and 2237 transitions. Word has length 299 [2019-10-02 23:27:23,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:27:23,870 INFO L475 AbstractCegarLoop]: Abstraction has 1731 states and 2237 transitions. [2019-10-02 23:27:23,870 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 23:27:23,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1731 states and 2237 transitions. [2019-10-02 23:27:23,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 330 [2019-10-02 23:27:23,878 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 23:27:23,878 INFO L411 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] [2019-10-02 23:27:23,879 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 23:27:23,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:27:23,879 INFO L82 PathProgramCache]: Analyzing trace with hash -562159944, now seen corresponding path program 1 times [2019-10-02 23:27:23,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2019-10-02 23:27:23,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:23,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 23:27:23,887 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 23:27:23,887 INFO L289 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2019-10-02 23:27:24,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 23:27:24,326 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2019-10-02 23:27:24,326 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 23:27:24,327 INFO L193 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2019-10-02 23:27:24,329 INFO L205 CegarAbsIntRunner]: Running AI on error trace of length 330 with the following transitions: [2019-10-02 23:27:24,335 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], [1177], [1179], [1182], [1184], [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], [1697], [1698], [1699], [1700], [1707], [1708], [1709], [1710], [1711], [1712], [1713], [1714], [1727], [1728], [1751], [1752], [1753] [2019-10-02 23:27:24,449 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-02 23:27:24,450 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-02 23:27:24,650 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-02 23:27:24,652 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-10-02 23:27:24,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 23:27:24,659 INFO L403 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-02 23:27:24,861 INFO L219 lantSequenceWeakener]: Could never weaken! [2019-10-02 23:27:24,862 INFO L418 sIntCurrentIteration]: Unifying AI predicates [2019-10-02 23:27:24,871 INFO L420 sIntCurrentIteration]: We unified 328 AI predicates to 328 [2019-10-02 23:27:24,871 INFO L429 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-02 23:27:24,872 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 23:27:24,873 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [8] total 8 [2019-10-02 23:27:24,873 INFO L257 anRefinementStrategy]: Using the first perfect interpolant sequence [2019-10-02 23:27:24,874 INFO L454 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-02 23:27:24,874 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-02 23:27:24,875 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 23:27:24,875 INFO L87 Difference]: Start difference. First operand 1731 states and 2237 transitions. Second operand 2 states. [2019-10-02 23:27:24,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 23:27:24,876 INFO L93 Difference]: Finished difference Result 2 states and 1 transitions. [2019-10-02 23:27:24,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-02 23:27:24,876 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 329 [2019-10-02 23:27:24,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 23:27:24,877 INFO L225 Difference]: With dead ends: 2 [2019-10-02 23:27:24,877 INFO L226 Difference]: Without dead ends: 0 [2019-10-02 23:27:24,877 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 328 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-02 23:27:24,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-02 23:27:24,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-02 23:27:24,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-02 23:27:24,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-02 23:27:24,879 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 329 [2019-10-02 23:27:24,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 23:27:24,879 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-02 23:27:24,879 INFO L476 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-02 23:27:24,879 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-02 23:27:24,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-02 23:27:24,887 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.10 11:27:24 BoogieIcfgContainer [2019-10-02 23:27:24,887 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-02 23:27:24,891 INFO L168 Benchmark]: Toolchain (without parser) took 23310.67 ms. Allocated memory was 136.8 MB in the beginning and 754.5 MB in the end (delta: 617.6 MB). Free memory was 79.2 MB in the beginning and 74.9 MB in the end (delta: 4.3 MB). Peak memory consumption was 621.9 MB. Max. memory is 7.1 GB. [2019-10-02 23:27:24,892 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 136.8 MB. Free memory was 103.4 MB in the beginning and 103.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-10-02 23:27:24,893 INFO L168 Benchmark]: CACSL2BoogieTranslator took 2177.91 ms. Allocated memory was 136.8 MB in the beginning and 211.8 MB in the end (delta: 75.0 MB). Free memory was 79.0 MB in the beginning and 116.7 MB in the end (delta: -37.7 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. [2019-10-02 23:27:24,894 INFO L168 Benchmark]: Boogie Preprocessor took 342.94 ms. Allocated memory is still 211.8 MB. Free memory was 116.7 MB in the beginning and 101.6 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. [2019-10-02 23:27:24,896 INFO L168 Benchmark]: RCFGBuilder took 4754.14 ms. Allocated memory was 211.8 MB in the beginning and 395.8 MB in the end (delta: 184.0 MB). Free memory was 101.6 MB in the beginning and 306.0 MB in the end (delta: -204.4 MB). Peak memory consumption was 108.2 MB. Max. memory is 7.1 GB. [2019-10-02 23:27:24,897 INFO L168 Benchmark]: TraceAbstraction took 16029.82 ms. Allocated memory was 395.8 MB in the beginning and 754.5 MB in the end (delta: 358.6 MB). Free memory was 306.0 MB in the beginning and 74.9 MB in the end (delta: 231.1 MB). Peak memory consumption was 589.7 MB. Max. memory is 7.1 GB. [2019-10-02 23:27:24,907 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.27 ms. Allocated memory is still 136.8 MB. Free memory was 103.4 MB in the beginning and 103.2 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 2177.91 ms. Allocated memory was 136.8 MB in the beginning and 211.8 MB in the end (delta: 75.0 MB). Free memory was 79.0 MB in the beginning and 116.7 MB in the end (delta: -37.7 MB). Peak memory consumption was 49.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 342.94 ms. Allocated memory is still 211.8 MB. Free memory was 116.7 MB in the beginning and 101.6 MB in the end (delta: 15.1 MB). Peak memory consumption was 15.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 4754.14 ms. Allocated memory was 211.8 MB in the beginning and 395.8 MB in the end (delta: 184.0 MB). Free memory was 101.6 MB in the beginning and 306.0 MB in the end (delta: -204.4 MB). Peak memory consumption was 108.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 16029.82 ms. Allocated memory was 395.8 MB in the beginning and 754.5 MB in the end (delta: 358.6 MB). Free memory was 306.0 MB in the beginning and 74.9 MB in the end (delta: 231.1 MB). Peak memory consumption was 589.7 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, 15.9s OverallTime, 23 OverallIterations, 8 TraceHistogramMax, 5.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 16686 SDtfs, 5562 SDslu, 42397 SDs, 0 SdLazy, 652 SolverSat, 30 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 448 GetRequests, 376 SyntacticMatches, 0 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.7s 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.3s AbstIntTime, 1 AbstIntIterations, 1 AbstIntStrong, 1.0 AbsIntWeakeningRatio, 2.4786585365853657 AbsIntAvgWeakeningVarsNumRemoved, 0.0 AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 23 MinimizatonAttempts, 646 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.5s SsaConstructionTime, 2.3s SatisfiabilityAnalysisTime, 4.4s InterpolantComputationTime, 3579 NumberOfCodeBlocks, 3579 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 3556 ConstructedInterpolants, 0 QuantifiedInterpolants, 906260 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 23 InterpolantComputations, 22 PerfectInterpolantSequences, 926/928 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...