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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru3.ko-entry_point.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-673a906-m [2019-10-02 09:03:47,133 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-02 09:03:47,135 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-02 09:03:47,151 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-02 09:03:47,152 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-02 09:03:47,153 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-02 09:03:47,155 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-02 09:03:47,160 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-02 09:03:47,161 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-02 09:03:47,166 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-02 09:03:47,167 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-02 09:03:47,168 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-02 09:03:47,169 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-02 09:03:47,169 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-02 09:03:47,170 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-02 09:03:47,171 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-02 09:03:47,172 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-02 09:03:47,173 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-02 09:03:47,174 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-02 09:03:47,176 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-02 09:03:47,178 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-02 09:03:47,179 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-02 09:03:47,179 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-02 09:03:47,180 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-02 09:03:47,182 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-02 09:03:47,183 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-02 09:03:47,183 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-02 09:03:47,184 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-02 09:03:47,184 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-02 09:03:47,185 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-02 09:03:47,185 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-02 09:03:47,186 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-02 09:03:47,186 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-02 09:03:47,187 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-02 09:03:47,188 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-02 09:03:47,188 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-02 09:03:47,189 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-02 09:03:47,189 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-02 09:03:47,189 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-02 09:03:47,190 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-02 09:03:47,191 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-02 09:03:47,192 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-02 09:03:47,206 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-02 09:03:47,206 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-02 09:03:47,207 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-02 09:03:47,207 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-02 09:03:47,208 INFO L138 SettingsManager]: * Use SBE=true [2019-10-02 09:03:47,208 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-02 09:03:47,208 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-02 09:03:47,208 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-02 09:03:47,208 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-02 09:03:47,209 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-02 09:03:47,209 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-02 09:03:47,209 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-02 09:03:47,209 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-02 09:03:47,209 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-02 09:03:47,209 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-02 09:03:47,210 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-02 09:03:47,210 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-02 09:03:47,210 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-02 09:03:47,210 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-02 09:03:47,210 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-02 09:03:47,211 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-02 09:03:47,211 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-02 09:03:47,211 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-02 09:03:47,211 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-02 09:03:47,211 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-02 09:03:47,212 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-02 09:03:47,212 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-02 09:03:47,212 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-02 09:03:47,212 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-10-02 09:03:47,241 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-02 09:03:47,253 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-02 09:03:47,257 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-02 09:03:47,258 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-02 09:03:47,259 INFO L275 PluginConnector]: CDTParser initialized [2019-10-02 09:03:47,259 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru3.ko-entry_point.cil.out.i [2019-10-02 09:03:47,329 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03f6a7b55/5dd57b60fafd46039994b4561574530b/FLAG58ca3cb93 [2019-10-02 09:03:48,121 INFO L306 CDTParser]: Found 1 translation units. [2019-10-02 09:03:48,122 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru3.ko-entry_point.cil.out.i [2019-10-02 09:03:48,164 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03f6a7b55/5dd57b60fafd46039994b4561574530b/FLAG58ca3cb93 [2019-10-02 09:03:48,189 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/03f6a7b55/5dd57b60fafd46039994b4561574530b [2019-10-02 09:03:48,201 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-02 09:03:48,202 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-02 09:03:48,203 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-02 09:03:48,203 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-02 09:03:48,207 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-02 09:03:48,208 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 09:03:48" (1/1) ... [2019-10-02 09:03:48,211 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27396f35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:03:48, skipping insertion in model container [2019-10-02 09:03:48,211 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.10 09:03:48" (1/1) ... [2019-10-02 09:03:48,218 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-02 09:03:48,348 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-02 09:03:49,756 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 09:03:49,873 INFO L188 MainTranslator]: Completed pre-run [2019-10-02 09:03:50,200 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-02 09:03:50,531 INFO L192 MainTranslator]: Completed translation [2019-10-02 09:03:50,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:03:50 WrapperNode [2019-10-02 09:03:50,532 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-02 09:03:50,533 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-02 09:03:50,533 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-02 09:03:50,533 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-02 09:03:50,548 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:03:50" (1/1) ... [2019-10-02 09:03:50,548 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:03:50" (1/1) ... [2019-10-02 09:03:50,681 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:03:50" (1/1) ... [2019-10-02 09:03:50,682 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:03:50" (1/1) ... [2019-10-02 09:03:50,886 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:03:50" (1/1) ... [2019-10-02 09:03:50,913 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:03:50" (1/1) ... [2019-10-02 09:03:50,959 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:03:50" (1/1) ... [2019-10-02 09:03:51,024 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-02 09:03:51,025 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-02 09:03:51,025 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-02 09:03:51,025 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-02 09:03:51,027 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:03:50" (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 09:03:51,115 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-02 09:03:51,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-02 09:03:51,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2019-10-02 09:03:51,116 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~int [2019-10-02 09:03:51,118 INFO L138 BoogieDeclarations]: Found implementation of procedure slow_down_io [2019-10-02 09:03:51,118 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-10-02 09:03:51,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_zalloc [2019-10-02 09:03:51,119 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_init_zalloc [2019-10-02 09:03:51,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_memset [2019-10-02 09:03:51,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int [2019-10-02 09:03:51,121 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ptr [2019-10-02 09:03:51,122 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_ulong [2019-10-02 09:03:51,124 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-10-02 09:03:51,125 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-10-02 09:03:51,126 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2019-10-02 09:03:51,126 INFO L138 BoogieDeclarations]: Found implementation of procedure inb [2019-10-02 09:03:51,129 INFO L138 BoogieDeclarations]: Found implementation of procedure inb_p [2019-10-02 09:03:51,129 INFO L138 BoogieDeclarations]: Found implementation of procedure devm_kzalloc [2019-10-02 09:03:51,129 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2019-10-02 09:03:51,130 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2019-10-02 09:03:51,130 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2019-10-02 09:03:51,130 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_set_drvdata [2019-10-02 09:03:51,130 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_wait_while_busy [2019-10-02 09:03:51,130 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_wait_for_read [2019-10-02 09:03:51,130 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_synchronize [2019-10-02 09:03:51,131 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_read [2019-10-02 09:03:51,131 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_read_increment_offset [2019-10-02 09:03:51,131 INFO L138 BoogieDeclarations]: Found implementation of procedure show_value [2019-10-02 09:03:51,131 INFO L138 BoogieDeclarations]: Found implementation of procedure show_alarm [2019-10-02 09:03:51,131 INFO L138 BoogieDeclarations]: Found implementation of procedure show_mask [2019-10-02 09:03:51,131 INFO L138 BoogieDeclarations]: Found implementation of procedure show_label [2019-10-02 09:03:51,132 INFO L138 BoogieDeclarations]: Found implementation of procedure show_name [2019-10-02 09:03:51,132 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_probe [2019-10-02 09:03:51,132 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_remove [2019-10-02 09:03:51,132 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_update_device [2019-10-02 09:03:51,132 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_suspend [2019-10-02 09:03:51,132 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_resume [2019-10-02 09:03:51,133 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_dmi_detect [2019-10-02 09:03:51,133 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_detect [2019-10-02 09:03:51,133 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_init [2019-10-02 09:03:51,133 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_exit [2019-10-02 09:03:51,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_platform_probe_1 [2019-10-02 09:03:51,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_dev_pm_ops_2 [2019-10-02 09:03:51,133 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_platform_driver_init_1 [2019-10-02 09:03:51,134 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-02 09:03:51,134 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2019-10-02 09:03:51,134 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2019-10-02 09:03:51,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_5 [2019-10-02 09:03:51,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_6 [2019-10-02 09:03:51,134 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_7 [2019-10-02 09:03:51,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_8 [2019-10-02 09:03:51,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_9 [2019-10-02 09:03:51,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_10 [2019-10-02 09:03:51,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_11 [2019-10-02 09:03:51,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_12 [2019-10-02 09:03:51,135 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_13 [2019-10-02 09:03:51,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv___platform_driver_register_14 [2019-10-02 09:03:51,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_platform_driver_unregister_15 [2019-10-02 09:03:51,136 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_platform_driver_unregister_16 [2019-10-02 09:03:51,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-10-02 09:03:51,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_undef_int_negative [2019-10-02 09:03:51,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err [2019-10-02 09:03:51,137 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_err_ptr [2019-10-02 09:03:51,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_ptr_err [2019-10-02 09:03:51,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_err_or_null [2019-10-02 09:03:51,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_lock [2019-10-02 09:03:51,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_lock [2019-10-02 09:03:51,138 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_lock [2019-10-02 09:03:51,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_lock [2019-10-02 09:03:51,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_lock [2019-10-02 09:03:51,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_lock [2019-10-02 09:03:51,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_lock [2019-10-02 09:03:51,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_lock [2019-10-02 09:03:51,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_trylock_device_lock [2019-10-02 09:03:51,140 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_for_reset_lock [2019-10-02 09:03:51,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_unlock_device_lock [2019-10-02 09:03:51,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_mutex_of_device [2019-10-02 09:03:51,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_mutex_of_device [2019-10-02 09:03:51,141 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mutex_of_device [2019-10-02 09:03:51,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_mutex_of_device [2019-10-02 09:03:51,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_mutex_of_device [2019-10-02 09:03:51,142 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_mutex_of_device [2019-10-02 09:03:51,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mutex_of_device [2019-10-02 09:03:51,143 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_mutex_of_device [2019-10-02 09:03:51,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_trylock_device_mutex_of_device [2019-10-02 09:03:51,144 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_for_reset_mutex_of_device [2019-10-02 09:03:51,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_unlock_device_mutex_of_device [2019-10-02 09:03:51,145 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_update_lock_of_abituguru3_data [2019-10-02 09:03:51,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_update_lock_of_abituguru3_data [2019-10-02 09:03:51,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_update_lock_of_abituguru3_data [2019-10-02 09:03:51,146 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_update_lock_of_abituguru3_data [2019-10-02 09:03:51,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_update_lock_of_abituguru3_data [2019-10-02 09:03:51,147 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_update_lock_of_abituguru3_data [2019-10-02 09:03:51,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_update_lock_of_abituguru3_data [2019-10-02 09:03:51,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_update_lock_of_abituguru3_data [2019-10-02 09:03:51,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_trylock_device_update_lock_of_abituguru3_data [2019-10-02 09:03:51,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_lock_device_for_reset_update_lock_of_abituguru3_data [2019-10-02 09:03:51,148 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_usb_unlock_device_update_lock_of_abituguru3_data [2019-10-02 09:03:51,149 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-10-02 09:03:51,149 INFO L138 BoogieDeclarations]: Found implementation of procedure __dynamic_pr_debug [2019-10-02 09:03:51,149 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2019-10-02 09:03:51,149 INFO L138 BoogieDeclarations]: Found implementation of procedure __platform_driver_register [2019-10-02 09:03:51,150 INFO L138 BoogieDeclarations]: Found implementation of procedure device_create_file [2019-10-02 09:03:51,150 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2019-10-02 09:03:51,150 INFO L138 BoogieDeclarations]: Found implementation of procedure devm_kmalloc [2019-10-02 09:03:51,150 INFO L138 BoogieDeclarations]: Found implementation of procedure dmi_get_system_info [2019-10-02 09:03:51,150 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_register [2019-10-02 09:03:51,151 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_unregister [2019-10-02 09:03:51,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_complete_2 [2019-10-02 09:03:51,151 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_freeze_late_2 [2019-10-02 09:03:51,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_freeze_noirq_2 [2019-10-02 09:03:51,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-10-02 09:03:51,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_poweroff_late_2 [2019-10-02 09:03:51,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_poweroff_noirq_2 [2019-10-02 09:03:51,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_prepare_2 [2019-10-02 09:03:51,153 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_restore_early_2 [2019-10-02 09:03:51,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_restore_noirq_2 [2019-10-02 09:03:51,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_resume_early_2 [2019-10-02 09:03:51,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_resume_noirq_2 [2019-10-02 09:03:51,154 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_suspend_late_2 [2019-10-02 09:03:51,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_suspend_noirq_2 [2019-10-02 09:03:51,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_thaw_early_2 [2019-10-02 09:03:51,155 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_thaw_noirq_2 [2019-10-02 09:03:51,156 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2019-10-02 09:03:51,157 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2019-10-02 09:03:51,157 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_trylock [2019-10-02 09:03:51,157 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2019-10-02 09:03:51,157 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_device_add [2019-10-02 09:03:51,158 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_device_add_resources [2019-10-02 09:03:51,158 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_device_alloc [2019-10-02 09:03:51,158 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_device_put [2019-10-02 09:03:51,159 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_device_unregister [2019-10-02 09:03:51,159 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_driver_unregister [2019-10-02 09:03:51,159 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_resource [2019-10-02 09:03:51,159 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-10-02 09:03:51,159 INFO L138 BoogieDeclarations]: Found implementation of procedure strncasecmp [2019-10-02 09:03:51,159 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-10-02 09:03:51,160 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-10-02 09:03:51,160 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.C_memset [2019-10-02 09:03:51,161 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-10-02 09:03:51,164 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-02 09:03:51,165 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-02 09:03:51,165 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-10-02 09:03:51,167 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-10-02 09:03:51,176 INFO L130 BoogieDeclarations]: Found specification of procedure __dynamic_pr_debug [2019-10-02 09:03:51,177 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2019-10-02 09:03:51,177 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2019-10-02 09:03:51,177 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err [2019-10-02 09:03:51,177 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_ptr_err [2019-10-02 09:03:51,177 INFO L130 BoogieDeclarations]: Found specification of procedure memset [2019-10-02 09:03:51,178 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2019-10-02 09:03:51,178 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2019-10-02 09:03:51,178 INFO L130 BoogieDeclarations]: Found specification of procedure strncasecmp [2019-10-02 09:03:51,178 INFO L130 BoogieDeclarations]: Found specification of procedure strcspn [2019-10-02 09:03:51,178 INFO L130 BoogieDeclarations]: Found specification of procedure slow_down_io [2019-10-02 09:03:51,179 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2019-10-02 09:03:51,179 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-02 09:03:51,179 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2019-10-02 09:03:51,181 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2019-10-02 09:03:51,181 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2019-10-02 09:03:51,182 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_trylock [2019-10-02 09:03:51,182 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_8 [2019-10-02 09:03:51,182 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2019-10-02 09:03:51,182 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_6 [2019-10-02 09:03:51,182 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_9 [2019-10-02 09:03:51,183 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_11 [2019-10-02 09:03:51,183 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_13 [2019-10-02 09:03:51,183 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-02 09:03:51,183 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2019-10-02 09:03:51,183 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-02 09:03:51,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_ulong [2019-10-02 09:03:51,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-10-02 09:03:51,184 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-02 09:03:51,184 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-10-02 09:03:51,184 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-02 09:03:51,185 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_zalloc [2019-10-02 09:03:51,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-10-02 09:03:51,185 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_init_zalloc [2019-10-02 09:03:51,185 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_memset [2019-10-02 09:03:51,185 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.C_memset [2019-10-02 09:03:51,186 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int [2019-10-02 09:03:51,186 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ptr [2019-10-02 09:03:51,186 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_ulong [2019-10-02 09:03:51,186 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-10-02 09:03:51,186 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2019-10-02 09:03:51,186 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_5 [2019-10-02 09:03:51,187 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_7 [2019-10-02 09:03:51,187 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_10 [2019-10-02 09:03:51,187 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_12 [2019-10-02 09:03:51,187 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_lock [2019-10-02 09:03:51,187 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_lock [2019-10-02 09:03:51,187 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mutex_of_device [2019-10-02 09:03:51,188 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_mutex_of_device [2019-10-02 09:03:51,188 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mutex_of_device [2019-10-02 09:03:51,188 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_update_lock_of_abituguru3_data [2019-10-02 09:03:51,188 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_update_lock_of_abituguru3_data [2019-10-02 09:03:51,188 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2019-10-02 09:03:51,188 INFO L130 BoogieDeclarations]: Found specification of procedure inb [2019-10-02 09:03:51,188 INFO L130 BoogieDeclarations]: Found specification of procedure inb_p [2019-10-02 09:03:51,189 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_platform_probe_1 [2019-10-02 09:03:51,189 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_dev_pm_ops_2 [2019-10-02 09:03:51,189 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_platform_driver_init_1 [2019-10-02 09:03:51,189 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2019-10-02 09:03:51,190 INFO L130 BoogieDeclarations]: Found specification of procedure device_create_file [2019-10-02 09:03:51,190 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2019-10-02 09:03:51,190 INFO L130 BoogieDeclarations]: Found specification of procedure devm_kmalloc [2019-10-02 09:03:51,190 INFO L130 BoogieDeclarations]: Found specification of procedure devm_kzalloc [2019-10-02 09:03:51,191 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2019-10-02 09:03:51,191 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2019-10-02 09:03:51,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-02 09:03:51,191 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_unregister [2019-10-02 09:03:51,192 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_resource [2019-10-02 09:03:51,192 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_alloc [2019-10-02 09:03:51,192 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_add_resources [2019-10-02 09:03:51,192 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_add [2019-10-02 09:03:51,193 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_put [2019-10-02 09:03:51,193 INFO L130 BoogieDeclarations]: Found specification of procedure __platform_driver_register [2019-10-02 09:03:51,193 INFO L130 BoogieDeclarations]: Found specification of procedure ldv___platform_driver_register_14 [2019-10-02 09:03:51,193 INFO L130 BoogieDeclarations]: Found specification of procedure platform_driver_unregister [2019-10-02 09:03:51,194 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_platform_driver_unregister_15 [2019-10-02 09:03:51,194 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_platform_driver_unregister_16 [2019-10-02 09:03:51,194 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2019-10-02 09:03:51,194 INFO L130 BoogieDeclarations]: Found specification of procedure platform_set_drvdata [2019-10-02 09:03:51,195 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_register [2019-10-02 09:03:51,195 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_unregister [2019-10-02 09:03:51,195 INFO L130 BoogieDeclarations]: Found specification of procedure dmi_get_system_info [2019-10-02 09:03:51,195 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_wait_while_busy [2019-10-02 09:03:51,196 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-02 09:03:51,196 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_wait_for_read [2019-10-02 09:03:51,196 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_synchronize [2019-10-02 09:03:51,196 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-02 09:03:51,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-02 09:03:51,197 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_read [2019-10-02 09:03:51,197 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_read_increment_offset [2019-10-02 09:03:51,197 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_update_device [2019-10-02 09:03:51,198 INFO L130 BoogieDeclarations]: Found specification of procedure show_value [2019-10-02 09:03:51,198 INFO L130 BoogieDeclarations]: Found specification of procedure show_alarm [2019-10-02 09:03:51,198 INFO L130 BoogieDeclarations]: Found specification of procedure show_mask [2019-10-02 09:03:51,198 INFO L130 BoogieDeclarations]: Found specification of procedure show_label [2019-10-02 09:03:51,199 INFO L130 BoogieDeclarations]: Found specification of procedure show_name [2019-10-02 09:03:51,199 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_probe [2019-10-02 09:03:51,199 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_remove [2019-10-02 09:03:51,199 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_suspend [2019-10-02 09:03:51,199 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_resume [2019-10-02 09:03:51,200 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_dmi_detect [2019-10-02 09:03:51,200 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_detect [2019-10-02 09:03:51,200 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_init [2019-10-02 09:03:51,200 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_exit [2019-10-02 09:03:51,201 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_suspend_late_2 [2019-10-02 09:03:51,201 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_restore_noirq_2 [2019-10-02 09:03:51,201 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_freeze_late_2 [2019-10-02 09:03:51,201 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_complete_2 [2019-10-02 09:03:51,202 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-10-02 09:03:51,202 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_thaw_early_2 [2019-10-02 09:03:51,202 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_poweroff_noirq_2 [2019-10-02 09:03:51,202 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_resume_noirq_2 [2019-10-02 09:03:51,203 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_resume_early_2 [2019-10-02 09:03:51,203 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_prepare_2 [2019-10-02 09:03:51,203 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-10-02 09:03:51,203 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_restore_early_2 [2019-10-02 09:03:51,204 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_suspend_noirq_2 [2019-10-02 09:03:51,204 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_poweroff_late_2 [2019-10-02 09:03:51,204 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_thaw_noirq_2 [2019-10-02 09:03:51,204 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_freeze_noirq_2 [2019-10-02 09:03:51,205 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~int [2019-10-02 09:03:51,205 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-02 09:03:51,206 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-10-02 09:03:51,210 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_undef_int_negative [2019-10-02 09:03:51,210 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_err_ptr [2019-10-02 09:03:51,210 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_err_or_null [2019-10-02 09:03:51,210 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_lock [2019-10-02 09:03:51,211 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_lock [2019-10-02 09:03:51,214 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_lock [2019-10-02 09:03:51,214 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_lock [2019-10-02 09:03:51,214 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_lock [2019-10-02 09:03:51,214 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_lock [2019-10-02 09:03:51,214 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_trylock_device_lock [2019-10-02 09:03:51,215 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_for_reset_lock [2019-10-02 09:03:51,215 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_unlock_device_lock [2019-10-02 09:03:51,215 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_mutex_of_device [2019-10-02 09:03:51,215 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_mutex_of_device [2019-10-02 09:03:51,215 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_mutex_of_device [2019-10-02 09:03:51,215 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_mutex_of_device [2019-10-02 09:03:51,216 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_mutex_of_device [2019-10-02 09:03:51,216 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_trylock_device_mutex_of_device [2019-10-02 09:03:51,216 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_for_reset_mutex_of_device [2019-10-02 09:03:51,216 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_unlock_device_mutex_of_device [2019-10-02 09:03:51,217 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_update_lock_of_abituguru3_data [2019-10-02 09:03:51,217 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_update_lock_of_abituguru3_data [2019-10-02 09:03:51,217 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_update_lock_of_abituguru3_data [2019-10-02 09:03:51,217 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_update_lock_of_abituguru3_data [2019-10-02 09:03:51,217 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_update_lock_of_abituguru3_data [2019-10-02 09:03:51,217 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_update_lock_of_abituguru3_data [2019-10-02 09:03:51,218 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_trylock_device_update_lock_of_abituguru3_data [2019-10-02 09:03:51,218 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_lock_device_for_reset_update_lock_of_abituguru3_data [2019-10-02 09:03:51,218 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_usb_unlock_device_update_lock_of_abituguru3_data [2019-10-02 09:03:51,218 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-10-02 09:03:51,218 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-02 09:03:51,218 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-10-02 09:03:51,218 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-02 09:03:51,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-02 09:03:51,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-02 09:03:51,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-02 09:03:52,588 INFO L683 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-10-02 09:04:49,676 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-02 09:04:49,676 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-10-02 09:04:49,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 09:04:49 BoogieIcfgContainer [2019-10-02 09:04:49,679 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-02 09:04:49,680 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-02 09:04:49,680 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-02 09:04:49,683 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-02 09:04:49,683 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.10 09:03:48" (1/3) ... [2019-10-02 09:04:49,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d2eec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 09:04:49, skipping insertion in model container [2019-10-02 09:04:49,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.10 09:03:50" (2/3) ... [2019-10-02 09:04:49,685 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@47d2eec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.10 09:04:49, skipping insertion in model container [2019-10-02 09:04:49,685 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.10 09:04:49" (3/3) ... [2019-10-02 09:04:49,688 INFO L109 eAbstractionObserver]: Analyzing ICFG linux-4.2-rc1.tar.xz-32_7a-drivers--hwmon--abituguru3.ko-entry_point.cil.out.i [2019-10-02 09:04:49,699 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-02 09:04:49,710 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-02 09:04:49,727 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-02 09:04:49,768 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-10-02 09:04:49,769 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-10-02 09:04:49,769 INFO L378 AbstractCegarLoop]: Hoare is true [2019-10-02 09:04:49,770 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-02 09:04:49,770 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-02 09:04:49,770 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-02 09:04:49,770 INFO L382 AbstractCegarLoop]: Difference is false [2019-10-02 09:04:49,770 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-02 09:04:49,770 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-02 09:04:49,816 INFO L276 IsEmpty]: Start isEmpty. Operand 939 states. [2019-10-02 09:04:49,832 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-02 09:04:49,833 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:04:49,834 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:04:49,837 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:04:49,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:04:49,843 INFO L82 PathProgramCache]: Analyzing trace with hash -992060968, now seen corresponding path program 1 times [2019-10-02 09:04:49,845 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:04:49,845 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:04:49,948 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:04:49,948 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:04:49,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:04:51,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:04:52,071 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 09:04:52,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:04:52,074 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:04:52,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:04:52,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:04:52,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:04:52,100 INFO L87 Difference]: Start difference. First operand 939 states. Second operand 3 states. [2019-10-02 09:05:02,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:05:02,088 INFO L93 Difference]: Finished difference Result 2010 states and 2703 transitions. [2019-10-02 09:05:02,088 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:05:02,090 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 32 [2019-10-02 09:05:02,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:05:02,122 INFO L225 Difference]: With dead ends: 2010 [2019-10-02 09:05:02,122 INFO L226 Difference]: Without dead ends: 1261 [2019-10-02 09:05:02,133 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 09:05:02,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1261 states. [2019-10-02 09:05:02,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1261 to 1249. [2019-10-02 09:05:02,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1249 states. [2019-10-02 09:05:02,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1249 states to 1249 states and 1651 transitions. [2019-10-02 09:05:02,296 INFO L78 Accepts]: Start accepts. Automaton has 1249 states and 1651 transitions. Word has length 32 [2019-10-02 09:05:02,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:05:02,297 INFO L475 AbstractCegarLoop]: Abstraction has 1249 states and 1651 transitions. [2019-10-02 09:05:02,297 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:05:02,297 INFO L276 IsEmpty]: Start isEmpty. Operand 1249 states and 1651 transitions. [2019-10-02 09:05:02,306 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-10-02 09:05:02,306 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:05:02,306 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:05:02,306 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:05:02,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:05:02,307 INFO L82 PathProgramCache]: Analyzing trace with hash 1818753620, now seen corresponding path program 1 times [2019-10-02 09:05:02,307 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:05:02,307 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:05:02,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:05:02,325 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:05:02,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:05:02,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:05:03,335 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 09:05:03,336 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:05:03,336 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:05:03,337 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:05:03,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:05:03,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:05:03,338 INFO L87 Difference]: Start difference. First operand 1249 states and 1651 transitions. Second operand 3 states. [2019-10-02 09:05:18,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:05:18,355 INFO L93 Difference]: Finished difference Result 3457 states and 4597 transitions. [2019-10-02 09:05:18,355 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:05:18,356 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 37 [2019-10-02 09:05:18,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:05:18,371 INFO L225 Difference]: With dead ends: 3457 [2019-10-02 09:05:18,372 INFO L226 Difference]: Without dead ends: 2218 [2019-10-02 09:05:18,378 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 09:05:18,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2218 states. [2019-10-02 09:05:18,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2218 to 2198. [2019-10-02 09:05:18,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2198 states. [2019-10-02 09:05:18,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2198 states to 2198 states and 2931 transitions. [2019-10-02 09:05:18,484 INFO L78 Accepts]: Start accepts. Automaton has 2198 states and 2931 transitions. Word has length 37 [2019-10-02 09:05:18,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:05:18,484 INFO L475 AbstractCegarLoop]: Abstraction has 2198 states and 2931 transitions. [2019-10-02 09:05:18,484 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:05:18,484 INFO L276 IsEmpty]: Start isEmpty. Operand 2198 states and 2931 transitions. [2019-10-02 09:05:18,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-02 09:05:18,486 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:05:18,486 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 09:05:18,486 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:05:18,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:05:18,487 INFO L82 PathProgramCache]: Analyzing trace with hash 346959247, now seen corresponding path program 1 times [2019-10-02 09:05:18,487 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:05:18,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:05:18,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:05:18,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:05:18,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:05:18,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:05:20,841 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 09:05:20,841 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:05:20,842 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-02 09:05:20,842 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 09:05:20,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 09:05:20,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-02 09:05:20,843 INFO L87 Difference]: Start difference. First operand 2198 states and 2931 transitions. Second operand 7 states. [2019-10-02 09:05:21,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:05:21,033 INFO L93 Difference]: Finished difference Result 4454 states and 5952 transitions. [2019-10-02 09:05:21,033 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 09:05:21,033 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 46 [2019-10-02 09:05:21,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:05:21,047 INFO L225 Difference]: With dead ends: 4454 [2019-10-02 09:05:21,048 INFO L226 Difference]: Without dead ends: 2266 [2019-10-02 09:05:21,056 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-02 09:05:21,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2266 states. [2019-10-02 09:05:21,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2266 to 2224. [2019-10-02 09:05:21,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2224 states. [2019-10-02 09:05:21,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2224 states to 2224 states and 2967 transitions. [2019-10-02 09:05:21,160 INFO L78 Accepts]: Start accepts. Automaton has 2224 states and 2967 transitions. Word has length 46 [2019-10-02 09:05:21,161 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:05:21,161 INFO L475 AbstractCegarLoop]: Abstraction has 2224 states and 2967 transitions. [2019-10-02 09:05:21,161 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 09:05:21,161 INFO L276 IsEmpty]: Start isEmpty. Operand 2224 states and 2967 transitions. [2019-10-02 09:05:21,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-02 09:05:21,164 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:05:21,165 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 09:05:21,165 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:05:21,165 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:05:21,165 INFO L82 PathProgramCache]: Analyzing trace with hash 487507857, now seen corresponding path program 1 times [2019-10-02 09:05:21,165 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:05:21,165 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:05:21,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:05:21,191 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:05:21,191 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:05:21,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:05:22,111 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 09:05:22,111 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:05:22,112 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:05:22,112 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:05:22,113 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:05:22,113 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:05:22,113 INFO L87 Difference]: Start difference. First operand 2224 states and 2967 transitions. Second operand 3 states. [2019-10-02 09:05:22,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:05:22,178 INFO L93 Difference]: Finished difference Result 2226 states and 2968 transitions. [2019-10-02 09:05:22,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:05:22,179 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2019-10-02 09:05:22,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:05:22,197 INFO L225 Difference]: With dead ends: 2226 [2019-10-02 09:05:22,198 INFO L226 Difference]: Without dead ends: 2223 [2019-10-02 09:05:22,199 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 09:05:22,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2223 states. [2019-10-02 09:05:22,300 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2223 to 2223. [2019-10-02 09:05:22,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2223 states. [2019-10-02 09:05:22,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2223 states to 2223 states and 2965 transitions. [2019-10-02 09:05:22,317 INFO L78 Accepts]: Start accepts. Automaton has 2223 states and 2965 transitions. Word has length 46 [2019-10-02 09:05:22,318 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:05:22,318 INFO L475 AbstractCegarLoop]: Abstraction has 2223 states and 2965 transitions. [2019-10-02 09:05:22,318 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:05:22,318 INFO L276 IsEmpty]: Start isEmpty. Operand 2223 states and 2965 transitions. [2019-10-02 09:05:22,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2019-10-02 09:05:22,319 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:05:22,319 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:05:22,320 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:05:22,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:05:22,320 INFO L82 PathProgramCache]: Analyzing trace with hash -2067473578, now seen corresponding path program 1 times [2019-10-02 09:05:22,320 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:05:22,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:05:22,334 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:05:22,334 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:05:22,335 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:05:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:05:23,190 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 09:05:23,193 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:05:23,193 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:05:23,194 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:05:23,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:05:23,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:05:23,195 INFO L87 Difference]: Start difference. First operand 2223 states and 2965 transitions. Second operand 3 states. [2019-10-02 09:05:23,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:05:23,279 INFO L93 Difference]: Finished difference Result 2225 states and 2966 transitions. [2019-10-02 09:05:23,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:05:23,280 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 47 [2019-10-02 09:05:23,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:05:23,296 INFO L225 Difference]: With dead ends: 2225 [2019-10-02 09:05:23,296 INFO L226 Difference]: Without dead ends: 2222 [2019-10-02 09:05:23,298 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 09:05:23,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2222 states. [2019-10-02 09:05:23,389 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2222 to 2222. [2019-10-02 09:05:23,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2222 states. [2019-10-02 09:05:23,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2222 states to 2222 states and 2963 transitions. [2019-10-02 09:05:23,399 INFO L78 Accepts]: Start accepts. Automaton has 2222 states and 2963 transitions. Word has length 47 [2019-10-02 09:05:23,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:05:23,400 INFO L475 AbstractCegarLoop]: Abstraction has 2222 states and 2963 transitions. [2019-10-02 09:05:23,401 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:05:23,401 INFO L276 IsEmpty]: Start isEmpty. Operand 2222 states and 2963 transitions. [2019-10-02 09:05:23,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-10-02 09:05:23,403 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:05:23,403 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:05:23,403 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:05:23,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:05:23,404 INFO L82 PathProgramCache]: Analyzing trace with hash 332485428, now seen corresponding path program 1 times [2019-10-02 09:05:23,404 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:05:23,404 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:05:23,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:05:23,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:05:23,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:05:23,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:05:24,251 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 09:05:24,251 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:05:24,252 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:05:24,252 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:05:24,252 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:05:24,252 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:05:24,253 INFO L87 Difference]: Start difference. First operand 2222 states and 2963 transitions. Second operand 3 states. [2019-10-02 09:05:24,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:05:24,413 INFO L93 Difference]: Finished difference Result 6164 states and 8261 transitions. [2019-10-02 09:05:24,413 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:05:24,414 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-10-02 09:05:24,414 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:05:24,445 INFO L225 Difference]: With dead ends: 6164 [2019-10-02 09:05:24,445 INFO L226 Difference]: Without dead ends: 3931 [2019-10-02 09:05:24,460 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:05:24,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3931 states. [2019-10-02 09:05:24,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3931 to 3922. [2019-10-02 09:05:24,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3922 states. [2019-10-02 09:05:24,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3922 states to 3922 states and 5259 transitions. [2019-10-02 09:05:24,670 INFO L78 Accepts]: Start accepts. Automaton has 3922 states and 5259 transitions. Word has length 48 [2019-10-02 09:05:24,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:05:24,670 INFO L475 AbstractCegarLoop]: Abstraction has 3922 states and 5259 transitions. [2019-10-02 09:05:24,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:05:24,671 INFO L276 IsEmpty]: Start isEmpty. Operand 3922 states and 5259 transitions. [2019-10-02 09:05:24,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2019-10-02 09:05:24,674 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:05:24,674 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:05:24,674 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:05:24,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:05:24,675 INFO L82 PathProgramCache]: Analyzing trace with hash 675112832, now seen corresponding path program 1 times [2019-10-02 09:05:24,675 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:05:24,675 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:05:24,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:05:24,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:05:24,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:05:25,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:05:25,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-02 09:05:25,503 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:05:25,503 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:05:25,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:05:25,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:05:25,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:05:25,505 INFO L87 Difference]: Start difference. First operand 3922 states and 5259 transitions. Second operand 3 states. [2019-10-02 09:05:41,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:05:41,943 INFO L93 Difference]: Finished difference Result 9648 states and 13023 transitions. [2019-10-02 09:05:41,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:05:41,943 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 79 [2019-10-02 09:05:41,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:05:41,979 INFO L225 Difference]: With dead ends: 9648 [2019-10-02 09:05:41,979 INFO L226 Difference]: Without dead ends: 5736 [2019-10-02 09:05:41,995 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 09:05:42,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5736 states. [2019-10-02 09:05:42,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5736 to 5710. [2019-10-02 09:05:42,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5710 states. [2019-10-02 09:05:42,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5710 states to 5710 states and 7665 transitions. [2019-10-02 09:05:42,235 INFO L78 Accepts]: Start accepts. Automaton has 5710 states and 7665 transitions. Word has length 79 [2019-10-02 09:05:42,235 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:05:42,235 INFO L475 AbstractCegarLoop]: Abstraction has 5710 states and 7665 transitions. [2019-10-02 09:05:42,236 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:05:42,236 INFO L276 IsEmpty]: Start isEmpty. Operand 5710 states and 7665 transitions. [2019-10-02 09:05:42,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2019-10-02 09:05:42,241 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:05:42,241 INFO L411 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:05:42,241 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:05:42,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:05:42,241 INFO L82 PathProgramCache]: Analyzing trace with hash -676613204, now seen corresponding path program 1 times [2019-10-02 09:05:42,242 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:05:42,242 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:05:42,255 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:05:42,255 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:05:42,256 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:05:42,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:05:43,049 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 09:05:43,049 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:05:43,050 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:05:43,051 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:05:43,051 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:05:43,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:05:43,052 INFO L87 Difference]: Start difference. First operand 5710 states and 7665 transitions. Second operand 3 states. [2019-10-02 09:05:58,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:05:58,914 INFO L93 Difference]: Finished difference Result 13224 states and 17835 transitions. [2019-10-02 09:05:58,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:05:58,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 104 [2019-10-02 09:05:58,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:05:58,964 INFO L225 Difference]: With dead ends: 13224 [2019-10-02 09:05:58,965 INFO L226 Difference]: Without dead ends: 7524 [2019-10-02 09:05:58,987 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 09:05:58,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7524 states. [2019-10-02 09:05:59,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7524 to 7498. [2019-10-02 09:05:59,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7498 states. [2019-10-02 09:05:59,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7498 states to 7498 states and 10071 transitions. [2019-10-02 09:05:59,316 INFO L78 Accepts]: Start accepts. Automaton has 7498 states and 10071 transitions. Word has length 104 [2019-10-02 09:05:59,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:05:59,316 INFO L475 AbstractCegarLoop]: Abstraction has 7498 states and 10071 transitions. [2019-10-02 09:05:59,317 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:05:59,317 INFO L276 IsEmpty]: Start isEmpty. Operand 7498 states and 10071 transitions. [2019-10-02 09:05:59,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2019-10-02 09:05:59,326 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:05:59,326 INFO L411 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:05:59,327 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:05:59,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:05:59,327 INFO L82 PathProgramCache]: Analyzing trace with hash -1151662503, now seen corresponding path program 1 times [2019-10-02 09:05:59,327 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:05:59,327 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:05:59,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:05:59,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:05:59,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:05:59,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:06:00,062 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-02 09:06:00,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:06:00,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:06:00,063 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:06:00,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:06:00,065 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:06:00,065 INFO L87 Difference]: Start difference. First operand 7498 states and 10071 transitions. Second operand 3 states. [2019-10-02 09:06:13,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:06:13,521 INFO L93 Difference]: Finished difference Result 17137 states and 23038 transitions. [2019-10-02 09:06:13,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:06:13,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 127 [2019-10-02 09:06:13,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:06:13,572 INFO L225 Difference]: With dead ends: 17137 [2019-10-02 09:06:13,572 INFO L226 Difference]: Without dead ends: 9649 [2019-10-02 09:06:13,600 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 09:06:13,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9649 states. [2019-10-02 09:06:13,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9649 to 9558. [2019-10-02 09:06:13,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9558 states. [2019-10-02 09:06:13,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9558 states to 9558 states and 12861 transitions. [2019-10-02 09:06:13,917 INFO L78 Accepts]: Start accepts. Automaton has 9558 states and 12861 transitions. Word has length 127 [2019-10-02 09:06:13,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:06:13,919 INFO L475 AbstractCegarLoop]: Abstraction has 9558 states and 12861 transitions. [2019-10-02 09:06:13,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:06:13,919 INFO L276 IsEmpty]: Start isEmpty. Operand 9558 states and 12861 transitions. [2019-10-02 09:06:13,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-02 09:06:13,924 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:06:13,925 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:06:13,925 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:06:13,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:06:13,925 INFO L82 PathProgramCache]: Analyzing trace with hash 1704330842, now seen corresponding path program 1 times [2019-10-02 09:06:13,926 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:06:13,926 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:06:13,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:06:13,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:06:13,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:06:14,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:06:14,966 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 09:06:14,967 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:06:14,967 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:06:14,968 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:06:14,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:06:14,968 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:06:14,969 INFO L87 Difference]: Start difference. First operand 9558 states and 12861 transitions. Second operand 3 states. [2019-10-02 09:06:31,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:06:31,690 INFO L93 Difference]: Finished difference Result 21346 states and 28897 transitions. [2019-10-02 09:06:31,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:06:31,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 141 [2019-10-02 09:06:31,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:06:31,750 INFO L225 Difference]: With dead ends: 21346 [2019-10-02 09:06:31,751 INFO L226 Difference]: Without dead ends: 11798 [2019-10-02 09:06:31,782 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 09:06:31,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11798 states. [2019-10-02 09:06:32,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11798 to 11772. [2019-10-02 09:06:32,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11772 states. [2019-10-02 09:06:32,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11772 states to 11772 states and 15853 transitions. [2019-10-02 09:06:32,153 INFO L78 Accepts]: Start accepts. Automaton has 11772 states and 15853 transitions. Word has length 141 [2019-10-02 09:06:32,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:06:32,154 INFO L475 AbstractCegarLoop]: Abstraction has 11772 states and 15853 transitions. [2019-10-02 09:06:32,154 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:06:32,154 INFO L276 IsEmpty]: Start isEmpty. Operand 11772 states and 15853 transitions. [2019-10-02 09:06:32,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-02 09:06:32,161 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:06:32,162 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:06:32,162 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:06:32,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:06:32,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1224842183, now seen corresponding path program 1 times [2019-10-02 09:06:32,162 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:06:32,163 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:06:32,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:06:32,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:06:32,171 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:06:32,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:06:32,947 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 09:06:32,948 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:06:32,948 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:06:32,949 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:06:32,949 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:06:32,949 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:06:32,950 INFO L87 Difference]: Start difference. First operand 11772 states and 15853 transitions. Second operand 3 states. [2019-10-02 09:06:49,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:06:49,367 INFO L93 Difference]: Finished difference Result 25774 states and 34881 transitions. [2019-10-02 09:06:49,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:06:49,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 139 [2019-10-02 09:06:49,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:06:49,416 INFO L225 Difference]: With dead ends: 25774 [2019-10-02 09:06:49,416 INFO L226 Difference]: Without dead ends: 14012 [2019-10-02 09:06:49,442 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 09:06:49,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14012 states. [2019-10-02 09:06:49,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14012 to 13986. [2019-10-02 09:06:49,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13986 states. [2019-10-02 09:06:49,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13986 states to 13986 states and 18845 transitions. [2019-10-02 09:06:49,846 INFO L78 Accepts]: Start accepts. Automaton has 13986 states and 18845 transitions. Word has length 139 [2019-10-02 09:06:49,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:06:49,847 INFO L475 AbstractCegarLoop]: Abstraction has 13986 states and 18845 transitions. [2019-10-02 09:06:49,847 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:06:49,847 INFO L276 IsEmpty]: Start isEmpty. Operand 13986 states and 18845 transitions. [2019-10-02 09:06:49,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-02 09:06:49,853 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:06:49,853 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:06:49,853 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:06:49,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:06:49,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1999485367, now seen corresponding path program 1 times [2019-10-02 09:06:49,854 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:06:49,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:06:49,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:06:49,862 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:06:49,862 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:06:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:06:51,790 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 09:06:51,791 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:06:51,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:06:51,792 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:06:51,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:06:51,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:06:51,792 INFO L87 Difference]: Start difference. First operand 13986 states and 18845 transitions. Second operand 3 states. [2019-10-02 09:07:08,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:07:08,354 INFO L93 Difference]: Finished difference Result 30202 states and 40865 transitions. [2019-10-02 09:07:08,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:07:08,354 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-10-02 09:07:08,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:07:08,414 INFO L225 Difference]: With dead ends: 30202 [2019-10-02 09:07:08,414 INFO L226 Difference]: Without dead ends: 16226 [2019-10-02 09:07:08,442 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 09:07:08,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16226 states. [2019-10-02 09:07:08,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16226 to 16200. [2019-10-02 09:07:08,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16200 states. [2019-10-02 09:07:08,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16200 states to 16200 states and 21837 transitions. [2019-10-02 09:07:08,910 INFO L78 Accepts]: Start accepts. Automaton has 16200 states and 21837 transitions. Word has length 140 [2019-10-02 09:07:08,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:07:08,911 INFO L475 AbstractCegarLoop]: Abstraction has 16200 states and 21837 transitions. [2019-10-02 09:07:08,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:07:08,911 INFO L276 IsEmpty]: Start isEmpty. Operand 16200 states and 21837 transitions. [2019-10-02 09:07:08,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-02 09:07:08,922 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:07:08,923 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:07:08,923 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:07:08,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:07:08,924 INFO L82 PathProgramCache]: Analyzing trace with hash -823807323, now seen corresponding path program 1 times [2019-10-02 09:07:08,924 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:07:08,924 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:07:08,934 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:07:08,934 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:07:08,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:07:09,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:07:09,757 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 31 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-10-02 09:07:09,758 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:07:09,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 09:07:09,759 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 09:07:09,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 09:07:09,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 09:07:09,766 INFO L87 Difference]: Start difference. First operand 16200 states and 21837 transitions. Second operand 5 states. [2019-10-02 09:07:22,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:07:22,744 INFO L93 Difference]: Finished difference Result 32390 states and 43664 transitions. [2019-10-02 09:07:22,744 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 09:07:22,744 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 142 [2019-10-02 09:07:22,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:07:22,800 INFO L225 Difference]: With dead ends: 32390 [2019-10-02 09:07:22,800 INFO L226 Difference]: Without dead ends: 16200 [2019-10-02 09:07:22,829 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 09:07:22,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16200 states. [2019-10-02 09:07:23,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16200 to 16200. [2019-10-02 09:07:23,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16200 states. [2019-10-02 09:07:23,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16200 states to 16200 states and 21833 transitions. [2019-10-02 09:07:23,538 INFO L78 Accepts]: Start accepts. Automaton has 16200 states and 21833 transitions. Word has length 142 [2019-10-02 09:07:23,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:07:23,539 INFO L475 AbstractCegarLoop]: Abstraction has 16200 states and 21833 transitions. [2019-10-02 09:07:23,539 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 09:07:23,539 INFO L276 IsEmpty]: Start isEmpty. Operand 16200 states and 21833 transitions. [2019-10-02 09:07:23,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-02 09:07:23,545 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:07:23,545 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:07:23,545 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:07:23,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:07:23,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1984318858, now seen corresponding path program 1 times [2019-10-02 09:07:23,546 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:07:23,546 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:07:23,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:07:23,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:07:23,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:07:23,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:07:24,324 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2019-10-02 09:07:24,324 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:07:24,324 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 09:07:24,325 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 09:07:24,325 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 09:07:24,325 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 09:07:24,326 INFO L87 Difference]: Start difference. First operand 16200 states and 21833 transitions. Second operand 5 states. [2019-10-02 09:07:37,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:07:37,466 INFO L93 Difference]: Finished difference Result 32390 states and 43656 transitions. [2019-10-02 09:07:37,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 09:07:37,466 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 143 [2019-10-02 09:07:37,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:07:37,525 INFO L225 Difference]: With dead ends: 32390 [2019-10-02 09:07:37,525 INFO L226 Difference]: Without dead ends: 16200 [2019-10-02 09:07:37,556 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 09:07:37,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16200 states. [2019-10-02 09:07:37,989 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16200 to 16200. [2019-10-02 09:07:37,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16200 states. [2019-10-02 09:07:38,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16200 states to 16200 states and 21829 transitions. [2019-10-02 09:07:38,042 INFO L78 Accepts]: Start accepts. Automaton has 16200 states and 21829 transitions. Word has length 143 [2019-10-02 09:07:38,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:07:38,043 INFO L475 AbstractCegarLoop]: Abstraction has 16200 states and 21829 transitions. [2019-10-02 09:07:38,043 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 09:07:38,043 INFO L276 IsEmpty]: Start isEmpty. Operand 16200 states and 21829 transitions. [2019-10-02 09:07:38,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-02 09:07:38,053 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:07:38,054 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:07:38,054 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:07:38,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:07:38,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1052343048, now seen corresponding path program 1 times [2019-10-02 09:07:38,054 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:07:38,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:07:38,063 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:07:38,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:07:38,064 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:07:38,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:07:38,828 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-10-02 09:07:38,829 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:07:38,829 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 09:07:38,829 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 09:07:38,829 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 09:07:38,830 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 09:07:38,830 INFO L87 Difference]: Start difference. First operand 16200 states and 21829 transitions. Second operand 5 states. [2019-10-02 09:07:51,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:07:51,751 INFO L93 Difference]: Finished difference Result 32390 states and 43648 transitions. [2019-10-02 09:07:51,752 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 09:07:51,752 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 142 [2019-10-02 09:07:51,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:07:51,798 INFO L225 Difference]: With dead ends: 32390 [2019-10-02 09:07:51,798 INFO L226 Difference]: Without dead ends: 16200 [2019-10-02 09:07:51,826 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 09:07:51,840 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16200 states. [2019-10-02 09:07:52,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16200 to 16200. [2019-10-02 09:07:52,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16200 states. [2019-10-02 09:07:52,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16200 states to 16200 states and 21825 transitions. [2019-10-02 09:07:52,262 INFO L78 Accepts]: Start accepts. Automaton has 16200 states and 21825 transitions. Word has length 142 [2019-10-02 09:07:52,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:07:52,262 INFO L475 AbstractCegarLoop]: Abstraction has 16200 states and 21825 transitions. [2019-10-02 09:07:52,263 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 09:07:52,263 INFO L276 IsEmpty]: Start isEmpty. Operand 16200 states and 21825 transitions. [2019-10-02 09:07:52,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-02 09:07:52,274 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:07:52,274 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-10-02 09:07:52,274 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:07:52,274 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:07:52,275 INFO L82 PathProgramCache]: Analyzing trace with hash 935552104, now seen corresponding path program 1 times [2019-10-02 09:07:52,275 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:07:52,275 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:07:52,282 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:07:52,283 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:07:52,283 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:07:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:07:53,452 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2019-10-02 09:07:53,453 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:07:53,453 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-02 09:07:53,453 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-02 09:07:53,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-02 09:07:53,454 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-02 09:07:53,454 INFO L87 Difference]: Start difference. First operand 16200 states and 21825 transitions. Second operand 10 states. [2019-10-02 09:08:10,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:08:10,391 INFO L93 Difference]: Finished difference Result 33153 states and 44696 transitions. [2019-10-02 09:08:10,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-02 09:08:10,392 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 146 [2019-10-02 09:08:10,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:08:10,444 INFO L225 Difference]: With dead ends: 33153 [2019-10-02 09:08:10,444 INFO L226 Difference]: Without dead ends: 16851 [2019-10-02 09:08:10,474 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2019-10-02 09:08:10,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16851 states. [2019-10-02 09:08:11,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16851 to 16286. [2019-10-02 09:08:11,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16286 states. [2019-10-02 09:08:11,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16286 states to 16286 states and 21869 transitions. [2019-10-02 09:08:11,167 INFO L78 Accepts]: Start accepts. Automaton has 16286 states and 21869 transitions. Word has length 146 [2019-10-02 09:08:11,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:08:11,168 INFO L475 AbstractCegarLoop]: Abstraction has 16286 states and 21869 transitions. [2019-10-02 09:08:11,168 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-02 09:08:11,168 INFO L276 IsEmpty]: Start isEmpty. Operand 16286 states and 21869 transitions. [2019-10-02 09:08:11,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 175 [2019-10-02 09:08:11,173 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:08:11,174 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:08:11,174 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:08:11,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:08:11,174 INFO L82 PathProgramCache]: Analyzing trace with hash 138716089, now seen corresponding path program 1 times [2019-10-02 09:08:11,175 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:08:11,175 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:08:11,182 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:08:11,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:08:11,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:08:11,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:08:11,855 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-02 09:08:11,856 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:08:11,856 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 09:08:11,856 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 09:08:11,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 09:08:11,857 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 09:08:11,857 INFO L87 Difference]: Start difference. First operand 16286 states and 21869 transitions. Second operand 5 states. [2019-10-02 09:08:12,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:08:12,161 INFO L93 Difference]: Finished difference Result 32590 states and 43826 transitions. [2019-10-02 09:08:12,162 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 09:08:12,162 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 174 [2019-10-02 09:08:12,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:08:12,217 INFO L225 Difference]: With dead ends: 32590 [2019-10-02 09:08:12,217 INFO L226 Difference]: Without dead ends: 16314 [2019-10-02 09:08:12,250 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 09:08:12,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16314 states. [2019-10-02 09:08:12,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16314 to 16244. [2019-10-02 09:08:12,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16244 states. [2019-10-02 09:08:12,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16244 states to 16244 states and 21771 transitions. [2019-10-02 09:08:12,778 INFO L78 Accepts]: Start accepts. Automaton has 16244 states and 21771 transitions. Word has length 174 [2019-10-02 09:08:12,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:08:12,781 INFO L475 AbstractCegarLoop]: Abstraction has 16244 states and 21771 transitions. [2019-10-02 09:08:12,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 09:08:12,781 INFO L276 IsEmpty]: Start isEmpty. Operand 16244 states and 21771 transitions. [2019-10-02 09:08:12,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 193 [2019-10-02 09:08:12,788 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:08:12,788 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:08:12,788 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:08:12,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:08:12,788 INFO L82 PathProgramCache]: Analyzing trace with hash 54992202, now seen corresponding path program 1 times [2019-10-02 09:08:12,789 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:08:12,789 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:08:12,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:08:12,797 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:08:12,797 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:08:13,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:08:13,439 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-02 09:08:13,439 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:08:13,439 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 09:08:13,439 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 09:08:13,440 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 09:08:13,440 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 09:08:13,440 INFO L87 Difference]: Start difference. First operand 16244 states and 21771 transitions. Second operand 5 states. [2019-10-02 09:08:13,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:08:13,926 INFO L93 Difference]: Finished difference Result 32646 states and 43784 transitions. [2019-10-02 09:08:13,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 09:08:13,927 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 192 [2019-10-02 09:08:13,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:08:13,955 INFO L225 Difference]: With dead ends: 32646 [2019-10-02 09:08:13,955 INFO L226 Difference]: Without dead ends: 16412 [2019-10-02 09:08:13,972 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 09:08:13,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16412 states. [2019-10-02 09:08:14,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16412 to 16328. [2019-10-02 09:08:14,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16328 states. [2019-10-02 09:08:14,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16328 states to 16328 states and 21855 transitions. [2019-10-02 09:08:14,344 INFO L78 Accepts]: Start accepts. Automaton has 16328 states and 21855 transitions. Word has length 192 [2019-10-02 09:08:14,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:08:14,345 INFO L475 AbstractCegarLoop]: Abstraction has 16328 states and 21855 transitions. [2019-10-02 09:08:14,345 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 09:08:14,345 INFO L276 IsEmpty]: Start isEmpty. Operand 16328 states and 21855 transitions. [2019-10-02 09:08:14,350 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-10-02 09:08:14,350 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:08:14,351 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:08:14,351 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:08:14,351 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:08:14,351 INFO L82 PathProgramCache]: Analyzing trace with hash -1568721954, now seen corresponding path program 1 times [2019-10-02 09:08:14,352 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:08:14,352 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:08:14,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:08:14,359 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:08:14,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:08:14,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:08:14,974 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-02 09:08:14,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:08:14,975 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-02 09:08:14,975 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 09:08:14,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 09:08:14,976 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 09:08:14,976 INFO L87 Difference]: Start difference. First operand 16328 states and 21855 transitions. Second operand 4 states. [2019-10-02 09:08:33,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:08:33,160 INFO L93 Difference]: Finished difference Result 32422 states and 43476 transitions. [2019-10-02 09:08:33,161 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:08:33,161 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 195 [2019-10-02 09:08:33,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:08:33,194 INFO L225 Difference]: With dead ends: 32422 [2019-10-02 09:08:33,194 INFO L226 Difference]: Without dead ends: 16104 [2019-10-02 09:08:33,218 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 09:08:33,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16104 states. [2019-10-02 09:08:33,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16104 to 16104. [2019-10-02 09:08:33,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16104 states. [2019-10-02 09:08:33,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16104 states to 16104 states and 21435 transitions. [2019-10-02 09:08:33,603 INFO L78 Accepts]: Start accepts. Automaton has 16104 states and 21435 transitions. Word has length 195 [2019-10-02 09:08:33,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:08:33,603 INFO L475 AbstractCegarLoop]: Abstraction has 16104 states and 21435 transitions. [2019-10-02 09:08:33,603 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 09:08:33,603 INFO L276 IsEmpty]: Start isEmpty. Operand 16104 states and 21435 transitions. [2019-10-02 09:08:33,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2019-10-02 09:08:33,609 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:08:33,609 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:08:33,610 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:08:33,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:08:33,610 INFO L82 PathProgramCache]: Analyzing trace with hash 354298403, now seen corresponding path program 1 times [2019-10-02 09:08:33,610 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:08:33,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:08:33,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:08:33,618 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:08:33,618 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:08:34,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:08:34,851 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 41 trivial. 0 not checked. [2019-10-02 09:08:34,851 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:08:34,851 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 09:08:34,852 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 09:08:34,852 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 09:08:34,852 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 09:08:34,852 INFO L87 Difference]: Start difference. First operand 16104 states and 21435 transitions. Second operand 8 states. [2019-10-02 09:08:51,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:08:51,521 INFO L93 Difference]: Finished difference Result 32317 states and 43048 transitions. [2019-10-02 09:08:51,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-02 09:08:51,522 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 213 [2019-10-02 09:08:51,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:08:51,561 INFO L225 Difference]: With dead ends: 32317 [2019-10-02 09:08:51,561 INFO L226 Difference]: Without dead ends: 16020 [2019-10-02 09:08:51,595 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 09:08:51,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16020 states. [2019-10-02 09:08:51,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16020 to 15957. [2019-10-02 09:08:51,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15957 states. [2019-10-02 09:08:52,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15957 states to 15957 states and 21211 transitions. [2019-10-02 09:08:52,041 INFO L78 Accepts]: Start accepts. Automaton has 15957 states and 21211 transitions. Word has length 213 [2019-10-02 09:08:52,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:08:52,042 INFO L475 AbstractCegarLoop]: Abstraction has 15957 states and 21211 transitions. [2019-10-02 09:08:52,042 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 09:08:52,042 INFO L276 IsEmpty]: Start isEmpty. Operand 15957 states and 21211 transitions. [2019-10-02 09:08:52,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-10-02 09:08:52,048 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:08:52,049 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:08:52,049 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:08:52,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:08:52,050 INFO L82 PathProgramCache]: Analyzing trace with hash 1927529426, now seen corresponding path program 1 times [2019-10-02 09:08:52,050 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:08:52,050 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:08:52,059 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:08:52,060 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:08:52,060 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:08:52,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:08:52,830 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2019-10-02 09:08:52,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:08:52,830 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-02 09:08:52,831 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 09:08:52,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 09:08:52,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-02 09:08:52,831 INFO L87 Difference]: Start difference. First operand 15957 states and 21211 transitions. Second operand 6 states. [2019-10-02 09:09:09,767 WARN L191 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-10-02 09:09:10,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:09:10,141 INFO L93 Difference]: Finished difference Result 35275 states and 46214 transitions. [2019-10-02 09:09:10,142 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 09:09:10,142 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 203 [2019-10-02 09:09:10,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:09:10,181 INFO L225 Difference]: With dead ends: 35275 [2019-10-02 09:09:10,181 INFO L226 Difference]: Without dead ends: 19020 [2019-10-02 09:09:10,203 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2019-10-02 09:09:10,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19020 states. [2019-10-02 09:09:10,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19020 to 18695. [2019-10-02 09:09:10,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18695 states. [2019-10-02 09:09:10,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18695 states to 18695 states and 24262 transitions. [2019-10-02 09:09:10,928 INFO L78 Accepts]: Start accepts. Automaton has 18695 states and 24262 transitions. Word has length 203 [2019-10-02 09:09:10,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:09:10,929 INFO L475 AbstractCegarLoop]: Abstraction has 18695 states and 24262 transitions. [2019-10-02 09:09:10,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 09:09:10,929 INFO L276 IsEmpty]: Start isEmpty. Operand 18695 states and 24262 transitions. [2019-10-02 09:09:10,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-10-02 09:09:10,935 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:09:10,935 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:09:10,935 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:09:10,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:09:10,936 INFO L82 PathProgramCache]: Analyzing trace with hash -964405430, now seen corresponding path program 1 times [2019-10-02 09:09:10,936 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:09:10,936 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:09:10,945 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:09:10,945 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:09:10,946 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:09:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:09:11,943 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-02 09:09:11,943 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 09:09:11,943 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 09:09:12,262 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:09:28,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2019-10-02 09:09:29,169 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-10-02 09:09:29,170 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-10-02 09:09:29,170 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-02 09:09:29,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-02 09:09:29,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-02 09:09:29,171 INFO L87 Difference]: Start difference. First operand 18695 states and 24262 transitions. Second operand 4 states. [2019-10-02 09:09:48,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:09:48,549 INFO L93 Difference]: Finished difference Result 39961 states and 51861 transitions. [2019-10-02 09:09:48,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-02 09:09:48,552 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 226 [2019-10-02 09:09:48,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:09:48,661 INFO L225 Difference]: With dead ends: 39961 [2019-10-02 09:09:48,661 INFO L226 Difference]: Without dead ends: 39937 [2019-10-02 09:09:48,677 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 09:09:48,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39937 states. [2019-10-02 09:09:49,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39937 to 39864. [2019-10-02 09:09:49,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39864 states. [2019-10-02 09:09:49,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39864 states to 39864 states and 51753 transitions. [2019-10-02 09:09:49,901 INFO L78 Accepts]: Start accepts. Automaton has 39864 states and 51753 transitions. Word has length 226 [2019-10-02 09:09:49,902 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:09:49,902 INFO L475 AbstractCegarLoop]: Abstraction has 39864 states and 51753 transitions. [2019-10-02 09:09:49,902 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-02 09:09:49,902 INFO L276 IsEmpty]: Start isEmpty. Operand 39864 states and 51753 transitions. [2019-10-02 09:09:49,910 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-02 09:09:49,910 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:09:49,910 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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 09:09:49,910 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:09:49,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:09:49,911 INFO L82 PathProgramCache]: Analyzing trace with hash 571440882, now seen corresponding path program 1 times [2019-10-02 09:09:49,911 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:09:49,911 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:09:49,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:09:49,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:09:49,919 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:09:50,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:09:50,539 INFO L134 CoverageAnalysis]: Checked inductivity of 37 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-02 09:09:50,540 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:09:50,540 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 09:09:50,541 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 09:09:50,541 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 09:09:50,541 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 09:09:50,542 INFO L87 Difference]: Start difference. First operand 39864 states and 51753 transitions. Second operand 5 states. [2019-10-02 09:10:03,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:10:03,983 INFO L93 Difference]: Finished difference Result 59546 states and 77302 transitions. [2019-10-02 09:10:03,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 09:10:03,983 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 238 [2019-10-02 09:10:03,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:10:04,027 INFO L225 Difference]: With dead ends: 59546 [2019-10-02 09:10:04,027 INFO L226 Difference]: Without dead ends: 19835 [2019-10-02 09:10:04,070 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 09:10:04,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19835 states. [2019-10-02 09:10:04,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19835 to 14749. [2019-10-02 09:10:04,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14749 states. [2019-10-02 09:10:04,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14749 states to 14749 states and 19962 transitions. [2019-10-02 09:10:04,810 INFO L78 Accepts]: Start accepts. Automaton has 14749 states and 19962 transitions. Word has length 238 [2019-10-02 09:10:04,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:10:04,811 INFO L475 AbstractCegarLoop]: Abstraction has 14749 states and 19962 transitions. [2019-10-02 09:10:04,811 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 09:10:04,811 INFO L276 IsEmpty]: Start isEmpty. Operand 14749 states and 19962 transitions. [2019-10-02 09:10:04,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 236 [2019-10-02 09:10:04,817 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:10:04,817 INFO L411 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:10:04,818 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:10:04,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:10:04,818 INFO L82 PathProgramCache]: Analyzing trace with hash -2131885439, now seen corresponding path program 1 times [2019-10-02 09:10:04,818 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:10:04,818 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:10:04,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:10:04,826 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:10:04,826 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:10:05,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:10:05,471 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 17 proven. 6 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-10-02 09:10:05,472 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 09:10:05,472 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 09:10:05,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:10:22,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2019-10-02 09:10:23,185 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-10-02 09:10:23,186 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-10-02 09:10:23,189 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-02 09:10:23,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-02 09:10:23,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-10-02 09:10:23,189 INFO L87 Difference]: Start difference. First operand 14749 states and 19962 transitions. Second operand 6 states. [2019-10-02 09:10:43,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:10:43,612 INFO L93 Difference]: Finished difference Result 28477 states and 38781 transitions. [2019-10-02 09:10:43,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-02 09:10:43,612 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 235 [2019-10-02 09:10:43,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:10:43,639 INFO L225 Difference]: With dead ends: 28477 [2019-10-02 09:10:43,640 INFO L226 Difference]: Without dead ends: 13688 [2019-10-02 09:10:43,665 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-02 09:10:43,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13688 states. [2019-10-02 09:10:43,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13688 to 13567. [2019-10-02 09:10:43,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13567 states. [2019-10-02 09:10:43,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13567 states to 13567 states and 18495 transitions. [2019-10-02 09:10:43,979 INFO L78 Accepts]: Start accepts. Automaton has 13567 states and 18495 transitions. Word has length 235 [2019-10-02 09:10:43,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:10:43,979 INFO L475 AbstractCegarLoop]: Abstraction has 13567 states and 18495 transitions. [2019-10-02 09:10:43,979 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-02 09:10:43,980 INFO L276 IsEmpty]: Start isEmpty. Operand 13567 states and 18495 transitions. [2019-10-02 09:10:43,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 238 [2019-10-02 09:10:43,985 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:10:43,985 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:10:43,985 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:10:43,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:10:43,985 INFO L82 PathProgramCache]: Analyzing trace with hash 1028793322, now seen corresponding path program 1 times [2019-10-02 09:10:43,986 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:10:43,986 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:10:43,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:10:43,991 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:10:43,991 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:10:44,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:10:44,670 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-02 09:10:44,671 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:10:44,671 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 09:10:44,671 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 09:10:44,671 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 09:10:44,672 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 09:10:44,672 INFO L87 Difference]: Start difference. First operand 13567 states and 18495 transitions. Second operand 5 states. [2019-10-02 09:10:58,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:10:58,510 INFO L93 Difference]: Finished difference Result 29804 states and 41052 transitions. [2019-10-02 09:10:58,511 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 09:10:58,511 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 237 [2019-10-02 09:10:58,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:10:58,546 INFO L225 Difference]: With dead ends: 29804 [2019-10-02 09:10:58,546 INFO L226 Difference]: Without dead ends: 17011 [2019-10-02 09:10:58,564 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-02 09:10:58,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17011 states. [2019-10-02 09:10:59,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17011 to 15387. [2019-10-02 09:10:59,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15387 states. [2019-10-02 09:10:59,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15387 states to 15387 states and 21126 transitions. [2019-10-02 09:10:59,226 INFO L78 Accepts]: Start accepts. Automaton has 15387 states and 21126 transitions. Word has length 237 [2019-10-02 09:10:59,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:10:59,227 INFO L475 AbstractCegarLoop]: Abstraction has 15387 states and 21126 transitions. [2019-10-02 09:10:59,227 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 09:10:59,227 INFO L276 IsEmpty]: Start isEmpty. Operand 15387 states and 21126 transitions. [2019-10-02 09:10:59,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 239 [2019-10-02 09:10:59,232 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:10:59,232 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:10:59,232 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:10:59,233 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:10:59,233 INFO L82 PathProgramCache]: Analyzing trace with hash -740993298, now seen corresponding path program 1 times [2019-10-02 09:10:59,233 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:10:59,233 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:10:59,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:10:59,241 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:10:59,241 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:10:59,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:10:59,856 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-02 09:10:59,857 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:10:59,857 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:10:59,857 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:10:59,858 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:10:59,858 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:10:59,858 INFO L87 Difference]: Start difference. First operand 15387 states and 21126 transitions. Second operand 3 states. [2019-10-02 09:11:17,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:11:17,226 INFO L93 Difference]: Finished difference Result 31772 states and 43820 transitions. [2019-10-02 09:11:17,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:11:17,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 238 [2019-10-02 09:11:17,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:11:17,261 INFO L225 Difference]: With dead ends: 31772 [2019-10-02 09:11:17,262 INFO L226 Difference]: Without dead ends: 17159 [2019-10-02 09:11:17,283 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 09:11:17,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17159 states. [2019-10-02 09:11:17,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17159 to 17133. [2019-10-02 09:11:17,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17133 states. [2019-10-02 09:11:17,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17133 states to 17133 states and 23520 transitions. [2019-10-02 09:11:17,674 INFO L78 Accepts]: Start accepts. Automaton has 17133 states and 23520 transitions. Word has length 238 [2019-10-02 09:11:17,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:11:17,675 INFO L475 AbstractCegarLoop]: Abstraction has 17133 states and 23520 transitions. [2019-10-02 09:11:17,675 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:11:17,675 INFO L276 IsEmpty]: Start isEmpty. Operand 17133 states and 23520 transitions. [2019-10-02 09:11:17,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-10-02 09:11:17,680 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:11:17,680 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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 09:11:17,681 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:11:17,681 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:11:17,681 INFO L82 PathProgramCache]: Analyzing trace with hash -466203578, now seen corresponding path program 1 times [2019-10-02 09:11:17,681 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:11:17,681 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:11:17,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:11:17,688 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:11:17,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:11:17,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:11:18,338 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-02 09:11:18,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:11:18,339 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:11:18,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:11:18,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:11:18,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:11:18,340 INFO L87 Difference]: Start difference. First operand 17133 states and 23520 transitions. Second operand 3 states. [2019-10-02 09:11:18,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:11:18,860 INFO L93 Difference]: Finished difference Result 34117 states and 46972 transitions. [2019-10-02 09:11:18,861 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:11:18,861 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-10-02 09:11:18,861 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:11:18,897 INFO L225 Difference]: With dead ends: 34117 [2019-10-02 09:11:18,897 INFO L226 Difference]: Without dead ends: 17152 [2019-10-02 09:11:18,921 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 09:11:18,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17152 states. [2019-10-02 09:11:19,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17152 to 17152. [2019-10-02 09:11:19,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17152 states. [2019-10-02 09:11:19,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17152 states to 17152 states and 23539 transitions. [2019-10-02 09:11:19,588 INFO L78 Accepts]: Start accepts. Automaton has 17152 states and 23539 transitions. Word has length 252 [2019-10-02 09:11:19,589 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:11:19,589 INFO L475 AbstractCegarLoop]: Abstraction has 17152 states and 23539 transitions. [2019-10-02 09:11:19,589 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:11:19,589 INFO L276 IsEmpty]: Start isEmpty. Operand 17152 states and 23539 transitions. [2019-10-02 09:11:19,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-10-02 09:11:19,595 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:11:19,595 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 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 09:11:19,595 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:11:19,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:11:19,595 INFO L82 PathProgramCache]: Analyzing trace with hash 213854792, now seen corresponding path program 1 times [2019-10-02 09:11:19,596 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:11:19,596 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:11:19,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:11:19,602 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:11:19,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:11:19,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:11:20,228 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2019-10-02 09:11:20,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:11:20,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:11:20,229 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:11:20,229 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:11:20,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:11:20,230 INFO L87 Difference]: Start difference. First operand 17152 states and 23539 transitions. Second operand 3 states. [2019-10-02 09:11:38,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:11:38,080 INFO L93 Difference]: Finished difference Result 33531 states and 46070 transitions. [2019-10-02 09:11:38,081 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:11:38,081 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 252 [2019-10-02 09:11:38,081 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:11:38,112 INFO L225 Difference]: With dead ends: 33531 [2019-10-02 09:11:38,112 INFO L226 Difference]: Without dead ends: 16368 [2019-10-02 09:11:38,135 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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 09:11:38,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16368 states. [2019-10-02 09:11:38,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16368 to 16237. [2019-10-02 09:11:38,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16237 states. [2019-10-02 09:11:38,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16237 states to 16237 states and 22227 transitions. [2019-10-02 09:11:38,511 INFO L78 Accepts]: Start accepts. Automaton has 16237 states and 22227 transitions. Word has length 252 [2019-10-02 09:11:38,512 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:11:38,512 INFO L475 AbstractCegarLoop]: Abstraction has 16237 states and 22227 transitions. [2019-10-02 09:11:38,512 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:11:38,512 INFO L276 IsEmpty]: Start isEmpty. Operand 16237 states and 22227 transitions. [2019-10-02 09:11:38,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-10-02 09:11:38,519 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:11:38,520 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:11:38,520 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:11:38,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:11:38,520 INFO L82 PathProgramCache]: Analyzing trace with hash 243788128, now seen corresponding path program 1 times [2019-10-02 09:11:38,520 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:11:38,521 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:11:38,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:11:38,528 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:11:38,528 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:11:38,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:11:39,065 INFO L134 CoverageAnalysis]: Checked inductivity of 109 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 69 trivial. 0 not checked. [2019-10-02 09:11:39,065 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:11:39,065 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:11:39,066 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:11:39,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:11:39,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:11:39,066 INFO L87 Difference]: Start difference. First operand 16237 states and 22227 transitions. Second operand 3 states. [2019-10-02 09:11:56,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:11:56,203 INFO L93 Difference]: Finished difference Result 33466 states and 46003 transitions. [2019-10-02 09:11:56,203 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:11:56,203 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2019-10-02 09:11:56,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:11:56,248 INFO L225 Difference]: With dead ends: 33466 [2019-10-02 09:11:56,249 INFO L226 Difference]: Without dead ends: 18004 [2019-10-02 09:11:56,273 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 09:11:56,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18004 states. [2019-10-02 09:11:56,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18004 to 17973. [2019-10-02 09:11:56,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17973 states. [2019-10-02 09:11:56,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17973 states to 17973 states and 24599 transitions. [2019-10-02 09:11:56,708 INFO L78 Accepts]: Start accepts. Automaton has 17973 states and 24599 transitions. Word has length 245 [2019-10-02 09:11:56,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:11:56,709 INFO L475 AbstractCegarLoop]: Abstraction has 17973 states and 24599 transitions. [2019-10-02 09:11:56,709 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:11:56,709 INFO L276 IsEmpty]: Start isEmpty. Operand 17973 states and 24599 transitions. [2019-10-02 09:11:56,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 248 [2019-10-02 09:11:56,715 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:11:56,715 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:11:56,715 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:11:56,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:11:56,716 INFO L82 PathProgramCache]: Analyzing trace with hash 778163821, now seen corresponding path program 1 times [2019-10-02 09:11:56,716 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:11:56,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:11:56,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:11:56,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:11:56,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:11:56,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:11:57,259 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2019-10-02 09:11:57,260 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:11:57,260 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:11:57,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:11:57,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:11:57,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:11:57,261 INFO L87 Difference]: Start difference. First operand 17973 states and 24599 transitions. Second operand 3 states. [2019-10-02 09:12:14,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:12:14,395 INFO L93 Difference]: Finished difference Result 36938 states and 50747 transitions. [2019-10-02 09:12:14,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:12:14,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 247 [2019-10-02 09:12:14,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:12:14,433 INFO L225 Difference]: With dead ends: 36938 [2019-10-02 09:12:14,433 INFO L226 Difference]: Without dead ends: 19740 [2019-10-02 09:12:14,456 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 09:12:14,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19740 states. [2019-10-02 09:12:14,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19740 to 19709. [2019-10-02 09:12:14,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19709 states. [2019-10-02 09:12:14,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19709 states to 19709 states and 26971 transitions. [2019-10-02 09:12:14,898 INFO L78 Accepts]: Start accepts. Automaton has 19709 states and 26971 transitions. Word has length 247 [2019-10-02 09:12:14,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:12:14,898 INFO L475 AbstractCegarLoop]: Abstraction has 19709 states and 26971 transitions. [2019-10-02 09:12:14,898 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:12:14,898 INFO L276 IsEmpty]: Start isEmpty. Operand 19709 states and 26971 transitions. [2019-10-02 09:12:14,905 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 247 [2019-10-02 09:12:14,905 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:12:14,905 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:12:14,906 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:12:14,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:12:14,906 INFO L82 PathProgramCache]: Analyzing trace with hash -609597769, now seen corresponding path program 1 times [2019-10-02 09:12:14,906 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:12:14,906 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:12:14,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:12:14,912 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:12:14,912 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:12:15,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:12:15,916 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-10-02 09:12:15,916 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:12:15,916 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:12:15,917 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:12:15,917 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:12:15,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:12:15,918 INFO L87 Difference]: Start difference. First operand 19709 states and 26971 transitions. Second operand 3 states. [2019-10-02 09:12:32,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:12:32,952 INFO L93 Difference]: Finished difference Result 40410 states and 55491 transitions. [2019-10-02 09:12:32,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:12:32,952 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 246 [2019-10-02 09:12:32,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:12:33,008 INFO L225 Difference]: With dead ends: 40410 [2019-10-02 09:12:33,009 INFO L226 Difference]: Without dead ends: 21476 [2019-10-02 09:12:33,041 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 09:12:33,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21476 states. [2019-10-02 09:12:33,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21476 to 21445. [2019-10-02 09:12:33,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21445 states. [2019-10-02 09:12:33,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21445 states to 21445 states and 29343 transitions. [2019-10-02 09:12:33,524 INFO L78 Accepts]: Start accepts. Automaton has 21445 states and 29343 transitions. Word has length 246 [2019-10-02 09:12:33,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:12:33,525 INFO L475 AbstractCegarLoop]: Abstraction has 21445 states and 29343 transitions. [2019-10-02 09:12:33,525 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:12:33,525 INFO L276 IsEmpty]: Start isEmpty. Operand 21445 states and 29343 transitions. [2019-10-02 09:12:33,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 249 [2019-10-02 09:12:33,530 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:12:33,530 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 09:12:33,530 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:12:33,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:12:33,531 INFO L82 PathProgramCache]: Analyzing trace with hash 186563834, now seen corresponding path program 1 times [2019-10-02 09:12:33,531 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:12:33,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:12:33,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:12:33,536 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:12:33,536 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:12:33,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:12:34,057 INFO L134 CoverageAnalysis]: Checked inductivity of 105 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2019-10-02 09:12:34,058 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:12:34,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:12:34,058 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:12:34,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:12:34,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:12:34,059 INFO L87 Difference]: Start difference. First operand 21445 states and 29343 transitions. Second operand 3 states. [2019-10-02 09:12:51,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:12:51,500 INFO L93 Difference]: Finished difference Result 43882 states and 60235 transitions. [2019-10-02 09:12:51,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:12:51,501 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 248 [2019-10-02 09:12:51,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:12:51,546 INFO L225 Difference]: With dead ends: 43882 [2019-10-02 09:12:51,546 INFO L226 Difference]: Without dead ends: 23212 [2019-10-02 09:12:51,574 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 09:12:51,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23212 states. [2019-10-02 09:12:52,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23212 to 23181. [2019-10-02 09:12:52,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23181 states. [2019-10-02 09:12:52,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23181 states to 23181 states and 31715 transitions. [2019-10-02 09:12:52,399 INFO L78 Accepts]: Start accepts. Automaton has 23181 states and 31715 transitions. Word has length 248 [2019-10-02 09:12:52,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:12:52,400 INFO L475 AbstractCegarLoop]: Abstraction has 23181 states and 31715 transitions. [2019-10-02 09:12:52,400 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:12:52,400 INFO L276 IsEmpty]: Start isEmpty. Operand 23181 states and 31715 transitions. [2019-10-02 09:12:52,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 252 [2019-10-02 09:12:52,405 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:12:52,406 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 09:12:52,406 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:12:52,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:12:52,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1808655858, now seen corresponding path program 1 times [2019-10-02 09:12:52,406 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:12:52,406 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:12:52,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:12:52,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:12:52,412 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:12:52,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:12:52,973 INFO L134 CoverageAnalysis]: Checked inductivity of 107 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2019-10-02 09:12:52,974 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:12:52,974 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:12:52,974 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:12:52,975 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:12:52,975 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:12:52,975 INFO L87 Difference]: Start difference. First operand 23181 states and 31715 transitions. Second operand 3 states. [2019-10-02 09:13:10,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:13:10,727 INFO L93 Difference]: Finished difference Result 47354 states and 64979 transitions. [2019-10-02 09:13:10,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:13:10,727 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 251 [2019-10-02 09:13:10,728 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:13:10,778 INFO L225 Difference]: With dead ends: 47354 [2019-10-02 09:13:10,778 INFO L226 Difference]: Without dead ends: 24948 [2019-10-02 09:13:10,809 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 09:13:10,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24948 states. [2019-10-02 09:13:11,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24948 to 24917. [2019-10-02 09:13:11,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24917 states. [2019-10-02 09:13:11,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24917 states to 24917 states and 34087 transitions. [2019-10-02 09:13:11,373 INFO L78 Accepts]: Start accepts. Automaton has 24917 states and 34087 transitions. Word has length 251 [2019-10-02 09:13:11,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:13:11,374 INFO L475 AbstractCegarLoop]: Abstraction has 24917 states and 34087 transitions. [2019-10-02 09:13:11,374 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:13:11,374 INFO L276 IsEmpty]: Start isEmpty. Operand 24917 states and 34087 transitions. [2019-10-02 09:13:11,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 256 [2019-10-02 09:13:11,379 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:13:11,380 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:13:11,380 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:13:11,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:13:11,380 INFO L82 PathProgramCache]: Analyzing trace with hash 940234186, now seen corresponding path program 1 times [2019-10-02 09:13:11,380 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:13:11,380 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:13:11,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:13:11,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:13:11,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:13:11,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:13:12,290 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 09:13:12,291 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:13:12,291 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:13:12,291 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:13:12,292 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:13:12,292 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:13:12,292 INFO L87 Difference]: Start difference. First operand 24917 states and 34087 transitions. Second operand 3 states. [2019-10-02 09:13:30,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:13:30,258 INFO L93 Difference]: Finished difference Result 55077 states and 75395 transitions. [2019-10-02 09:13:30,259 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:13:30,259 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 255 [2019-10-02 09:13:30,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:13:30,317 INFO L225 Difference]: With dead ends: 55077 [2019-10-02 09:13:30,318 INFO L226 Difference]: Without dead ends: 30328 [2019-10-02 09:13:30,351 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 09:13:30,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30328 states. [2019-10-02 09:13:30,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30328 to 30300. [2019-10-02 09:13:30,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30300 states. [2019-10-02 09:13:31,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30300 states to 30300 states and 41295 transitions. [2019-10-02 09:13:31,035 INFO L78 Accepts]: Start accepts. Automaton has 30300 states and 41295 transitions. Word has length 255 [2019-10-02 09:13:31,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:13:31,036 INFO L475 AbstractCegarLoop]: Abstraction has 30300 states and 41295 transitions. [2019-10-02 09:13:31,036 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:13:31,036 INFO L276 IsEmpty]: Start isEmpty. Operand 30300 states and 41295 transitions. [2019-10-02 09:13:31,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 257 [2019-10-02 09:13:31,044 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:13:31,045 INFO L411 BasicCegarLoop]: trace histogram [5, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:13:31,045 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:13:31,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:13:31,045 INFO L82 PathProgramCache]: Analyzing trace with hash -2061472726, now seen corresponding path program 1 times [2019-10-02 09:13:31,045 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:13:31,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:13:31,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:13:31,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:13:31,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:13:31,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:13:31,714 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 17 proven. 2 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2019-10-02 09:13:31,715 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 09:13:31,715 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 09:13:32,041 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:13:48,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:13:48,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 18185 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-02 09:13:48,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-02 09:13:48,802 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-02 09:13:48,962 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-10-02 09:13:48,963 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [6] total 7 [2019-10-02 09:13:48,964 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-02 09:13:48,964 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-02 09:13:48,964 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-10-02 09:13:48,964 INFO L87 Difference]: Start difference. First operand 30300 states and 41295 transitions. Second operand 7 states. [2019-10-02 09:14:08,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:14:08,907 INFO L93 Difference]: Finished difference Result 80089 states and 109296 transitions. [2019-10-02 09:14:08,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 09:14:08,907 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 256 [2019-10-02 09:14:08,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:14:09,017 INFO L225 Difference]: With dead ends: 80089 [2019-10-02 09:14:09,017 INFO L226 Difference]: Without dead ends: 49957 [2019-10-02 09:14:09,062 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 262 GetRequests, 257 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=26, Unknown=0, NotChecked=0, Total=42 [2019-10-02 09:14:09,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49957 states. [2019-10-02 09:14:10,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49957 to 49343. [2019-10-02 09:14:10,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49343 states. [2019-10-02 09:14:10,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49343 states to 49343 states and 67080 transitions. [2019-10-02 09:14:10,614 INFO L78 Accepts]: Start accepts. Automaton has 49343 states and 67080 transitions. Word has length 256 [2019-10-02 09:14:10,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:14:10,615 INFO L475 AbstractCegarLoop]: Abstraction has 49343 states and 67080 transitions. [2019-10-02 09:14:10,615 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-02 09:14:10,615 INFO L276 IsEmpty]: Start isEmpty. Operand 49343 states and 67080 transitions. [2019-10-02 09:14:10,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 261 [2019-10-02 09:14:10,624 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:14:10,624 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 09:14:10,624 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:14:10,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:14:10,625 INFO L82 PathProgramCache]: Analyzing trace with hash -921075334, now seen corresponding path program 1 times [2019-10-02 09:14:10,625 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:14:10,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:14:10,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:14:10,633 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:14:10,633 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:14:10,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:14:11,228 INFO L134 CoverageAnalysis]: Checked inductivity of 148 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2019-10-02 09:14:11,228 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:14:11,228 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:14:11,228 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:14:11,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:14:11,229 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:14:11,229 INFO L87 Difference]: Start difference. First operand 49343 states and 67080 transitions. Second operand 3 states. [2019-10-02 09:14:30,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:14:30,307 INFO L93 Difference]: Finished difference Result 101636 states and 138455 transitions. [2019-10-02 09:14:30,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:14:30,308 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 260 [2019-10-02 09:14:30,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:14:30,429 INFO L225 Difference]: With dead ends: 101636 [2019-10-02 09:14:30,429 INFO L226 Difference]: Without dead ends: 53040 [2019-10-02 09:14:30,485 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 09:14:30,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53040 states. [2019-10-02 09:14:31,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53040 to 52745. [2019-10-02 09:14:31,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52745 states. [2019-10-02 09:14:31,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52745 states to 52745 states and 71634 transitions. [2019-10-02 09:14:31,728 INFO L78 Accepts]: Start accepts. Automaton has 52745 states and 71634 transitions. Word has length 260 [2019-10-02 09:14:31,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:14:31,729 INFO L475 AbstractCegarLoop]: Abstraction has 52745 states and 71634 transitions. [2019-10-02 09:14:31,729 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:14:31,729 INFO L276 IsEmpty]: Start isEmpty. Operand 52745 states and 71634 transitions. [2019-10-02 09:14:31,736 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 269 [2019-10-02 09:14:31,736 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:14:31,737 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 09:14:31,737 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:14:31,737 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:14:31,737 INFO L82 PathProgramCache]: Analyzing trace with hash -428776258, now seen corresponding path program 1 times [2019-10-02 09:14:31,737 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:14:31,737 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:14:31,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:14:31,743 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:14:31,743 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:14:31,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:14:32,833 INFO L134 CoverageAnalysis]: Checked inductivity of 161 backedges. 49 proven. 0 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-10-02 09:14:32,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:14:32,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:14:32,834 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:14:32,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:14:32,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:14:32,835 INFO L87 Difference]: Start difference. First operand 52745 states and 71634 transitions. Second operand 3 states. [2019-10-02 09:14:51,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:14:51,218 INFO L93 Difference]: Finished difference Result 108294 states and 147405 transitions. [2019-10-02 09:14:51,218 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:14:51,218 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 268 [2019-10-02 09:14:51,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:14:51,345 INFO L225 Difference]: With dead ends: 108294 [2019-10-02 09:14:51,345 INFO L226 Difference]: Without dead ends: 56296 [2019-10-02 09:14:51,416 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 09:14:51,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56296 states. [2019-10-02 09:14:53,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56296 to 55989. [2019-10-02 09:14:53,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55989 states. [2019-10-02 09:14:53,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55989 states to 55989 states and 76018 transitions. [2019-10-02 09:14:53,254 INFO L78 Accepts]: Start accepts. Automaton has 55989 states and 76018 transitions. Word has length 268 [2019-10-02 09:14:53,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:14:53,255 INFO L475 AbstractCegarLoop]: Abstraction has 55989 states and 76018 transitions. [2019-10-02 09:14:53,255 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:14:53,255 INFO L276 IsEmpty]: Start isEmpty. Operand 55989 states and 76018 transitions. [2019-10-02 09:14:53,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 270 [2019-10-02 09:14:53,263 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:14:53,264 INFO L411 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 09:14:53,264 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:14:53,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:14:53,264 INFO L82 PathProgramCache]: Analyzing trace with hash 286725828, now seen corresponding path program 1 times [2019-10-02 09:14:53,264 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:14:53,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:14:53,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:14:53,272 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:14:53,272 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:14:53,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:14:53,878 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 46 proven. 20 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2019-10-02 09:14:53,878 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 09:14:53,879 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 09:14:54,206 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:15:11,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2019-10-02 09:15:11,633 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-10-02 09:15:11,633 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-10-02 09:15:11,634 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 09:15:11,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 09:15:11,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 09:15:11,635 INFO L87 Difference]: Start difference. First operand 55989 states and 76018 transitions. Second operand 5 states. [2019-10-02 09:15:27,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:15:27,049 INFO L93 Difference]: Finished difference Result 117110 states and 159485 transitions. [2019-10-02 09:15:27,050 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 09:15:27,050 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 269 [2019-10-02 09:15:27,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:15:27,161 INFO L225 Difference]: With dead ends: 117110 [2019-10-02 09:15:27,161 INFO L226 Difference]: Without dead ends: 61868 [2019-10-02 09:15:27,217 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-02 09:15:27,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61868 states. [2019-10-02 09:15:28,506 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61868 to 55989. [2019-10-02 09:15:28,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55989 states. [2019-10-02 09:15:28,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55989 states to 55989 states and 75922 transitions. [2019-10-02 09:15:28,637 INFO L78 Accepts]: Start accepts. Automaton has 55989 states and 75922 transitions. Word has length 269 [2019-10-02 09:15:28,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:15:28,637 INFO L475 AbstractCegarLoop]: Abstraction has 55989 states and 75922 transitions. [2019-10-02 09:15:28,637 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 09:15:28,638 INFO L276 IsEmpty]: Start isEmpty. Operand 55989 states and 75922 transitions. [2019-10-02 09:15:28,653 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-10-02 09:15:28,653 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:15:28,654 INFO L411 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:15:28,654 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:15:28,654 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:15:28,654 INFO L82 PathProgramCache]: Analyzing trace with hash -39496218, now seen corresponding path program 1 times [2019-10-02 09:15:28,654 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:15:28,655 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:15:28,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:15:28,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:15:28,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:15:28,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:15:29,834 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-10-02 09:15:29,834 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:15:29,834 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:15:29,835 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:15:29,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:15:29,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:15:29,835 INFO L87 Difference]: Start difference. First operand 55989 states and 75922 transitions. Second operand 3 states. [2019-10-02 09:15:47,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:15:47,517 INFO L93 Difference]: Finished difference Result 73372 states and 99525 transitions. [2019-10-02 09:15:47,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:15:47,518 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 289 [2019-10-02 09:15:47,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:15:47,578 INFO L225 Difference]: With dead ends: 73372 [2019-10-02 09:15:47,578 INFO L226 Difference]: Without dead ends: 28999 [2019-10-02 09:15:47,630 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 09:15:47,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28999 states. [2019-10-02 09:15:48,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28999 to 28149. [2019-10-02 09:15:48,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28149 states. [2019-10-02 09:15:48,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28149 states to 28149 states and 37982 transitions. [2019-10-02 09:15:48,360 INFO L78 Accepts]: Start accepts. Automaton has 28149 states and 37982 transitions. Word has length 289 [2019-10-02 09:15:48,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:15:48,361 INFO L475 AbstractCegarLoop]: Abstraction has 28149 states and 37982 transitions. [2019-10-02 09:15:48,361 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:15:48,361 INFO L276 IsEmpty]: Start isEmpty. Operand 28149 states and 37982 transitions. [2019-10-02 09:15:48,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-10-02 09:15:48,368 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:15:48,368 INFO L411 BasicCegarLoop]: trace histogram [6, 4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:15:48,369 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:15:48,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:15:48,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1033673528, now seen corresponding path program 1 times [2019-10-02 09:15:48,369 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:15:48,369 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:15:48,377 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:15:48,377 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:15:48,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:15:49,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:15:49,744 INFO L134 CoverageAnalysis]: Checked inductivity of 81 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2019-10-02 09:15:49,744 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:15:49,744 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 09:15:49,745 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 09:15:49,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 09:15:49,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 09:15:49,745 INFO L87 Difference]: Start difference. First operand 28149 states and 37982 transitions. Second operand 5 states. [2019-10-02 09:16:09,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:16:09,750 INFO L93 Difference]: Finished difference Result 67449 states and 90963 transitions. [2019-10-02 09:16:09,750 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 09:16:09,750 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 289 [2019-10-02 09:16:09,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:16:09,882 INFO L225 Difference]: With dead ends: 67449 [2019-10-02 09:16:09,882 INFO L226 Difference]: Without dead ends: 50916 [2019-10-02 09:16:09,921 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 09:16:09,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50916 states. [2019-10-02 09:16:11,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50916 to 28401. [2019-10-02 09:16:11,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28401 states. [2019-10-02 09:16:11,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28401 states to 28401 states and 38234 transitions. [2019-10-02 09:16:11,268 INFO L78 Accepts]: Start accepts. Automaton has 28401 states and 38234 transitions. Word has length 289 [2019-10-02 09:16:11,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:16:11,268 INFO L475 AbstractCegarLoop]: Abstraction has 28401 states and 38234 transitions. [2019-10-02 09:16:11,268 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 09:16:11,268 INFO L276 IsEmpty]: Start isEmpty. Operand 28401 states and 38234 transitions. [2019-10-02 09:16:11,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 296 [2019-10-02 09:16:11,276 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:16:11,276 INFO L411 BasicCegarLoop]: trace histogram [5, 5, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:16:11,277 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:16:11,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:16:11,277 INFO L82 PathProgramCache]: Analyzing trace with hash -281454182, now seen corresponding path program 1 times [2019-10-02 09:16:11,277 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:16:11,277 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:16:11,285 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:16:11,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:16:11,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:16:11,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:16:12,236 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2019-10-02 09:16:12,236 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:16:12,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-02 09:16:12,237 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-02 09:16:12,237 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-02 09:16:12,238 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-02 09:16:12,238 INFO L87 Difference]: Start difference. First operand 28401 states and 38234 transitions. Second operand 8 states. [2019-10-02 09:16:15,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:16:15,691 INFO L93 Difference]: Finished difference Result 57335 states and 77643 transitions. [2019-10-02 09:16:15,691 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-10-02 09:16:15,691 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 295 [2019-10-02 09:16:15,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:16:15,758 INFO L225 Difference]: With dead ends: 57335 [2019-10-02 09:16:15,758 INFO L226 Difference]: Without dead ends: 29102 [2019-10-02 09:16:15,796 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2019-10-02 09:16:15,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29102 states. [2019-10-02 09:16:16,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29102 to 28909. [2019-10-02 09:16:16,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28909 states. [2019-10-02 09:16:16,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28909 states to 28909 states and 38832 transitions. [2019-10-02 09:16:16,652 INFO L78 Accepts]: Start accepts. Automaton has 28909 states and 38832 transitions. Word has length 295 [2019-10-02 09:16:16,652 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:16:16,652 INFO L475 AbstractCegarLoop]: Abstraction has 28909 states and 38832 transitions. [2019-10-02 09:16:16,653 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-02 09:16:16,653 INFO L276 IsEmpty]: Start isEmpty. Operand 28909 states and 38832 transitions. [2019-10-02 09:16:16,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 298 [2019-10-02 09:16:16,658 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:16:16,659 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 09:16:16,659 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:16:16,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:16:16,659 INFO L82 PathProgramCache]: Analyzing trace with hash -15799128, now seen corresponding path program 1 times [2019-10-02 09:16:16,659 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:16:16,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:16:16,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:16:16,666 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:16:16,666 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:16:16,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:16:17,266 INFO L134 CoverageAnalysis]: Checked inductivity of 203 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 157 trivial. 0 not checked. [2019-10-02 09:16:17,266 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:16:17,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-02 09:16:17,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-02 09:16:17,267 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-02 09:16:17,267 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:16:17,267 INFO L87 Difference]: Start difference. First operand 28909 states and 38832 transitions. Second operand 3 states. [2019-10-02 09:16:37,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:16:37,043 INFO L93 Difference]: Finished difference Result 58429 states and 78602 transitions. [2019-10-02 09:16:37,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-02 09:16:37,044 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 297 [2019-10-02 09:16:37,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:16:37,115 INFO L225 Difference]: With dead ends: 58429 [2019-10-02 09:16:37,116 INFO L226 Difference]: Without dead ends: 30283 [2019-10-02 09:16:37,153 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-02 09:16:37,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30283 states. [2019-10-02 09:16:38,002 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30283 to 29590. [2019-10-02 09:16:38,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29590 states. [2019-10-02 09:16:38,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29590 states to 29590 states and 39751 transitions. [2019-10-02 09:16:38,067 INFO L78 Accepts]: Start accepts. Automaton has 29590 states and 39751 transitions. Word has length 297 [2019-10-02 09:16:38,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:16:38,067 INFO L475 AbstractCegarLoop]: Abstraction has 29590 states and 39751 transitions. [2019-10-02 09:16:38,068 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-02 09:16:38,068 INFO L276 IsEmpty]: Start isEmpty. Operand 29590 states and 39751 transitions. [2019-10-02 09:16:38,073 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 294 [2019-10-02 09:16:38,073 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:16:38,074 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 5, 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, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-02 09:16:38,074 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:16:38,074 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:16:38,074 INFO L82 PathProgramCache]: Analyzing trace with hash -30717271, now seen corresponding path program 1 times [2019-10-02 09:16:38,074 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:16:38,074 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:16:38,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:16:38,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:16:38,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:16:38,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:16:39,076 INFO L134 CoverageAnalysis]: Checked inductivity of 227 backedges. 108 proven. 31 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2019-10-02 09:16:39,076 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-10-02 09:16:39,076 INFO L224 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-10-02 09:16:39,405 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:16:55,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2019-10-02 09:16:56,226 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-10-02 09:16:56,226 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-10-02 09:16:56,226 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 09:16:56,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 09:16:56,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-10-02 09:16:56,227 INFO L87 Difference]: Start difference. First operand 29590 states and 39751 transitions. Second operand 5 states. [2019-10-02 09:17:11,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:17:11,845 INFO L93 Difference]: Finished difference Result 60483 states and 81455 transitions. [2019-10-02 09:17:11,846 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-02 09:17:11,846 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 293 [2019-10-02 09:17:11,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:17:11,902 INFO L225 Difference]: With dead ends: 60483 [2019-10-02 09:17:11,903 INFO L226 Difference]: Without dead ends: 31656 [2019-10-02 09:17:11,932 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-10-02 09:17:11,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31656 states. [2019-10-02 09:17:12,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31656 to 28026. [2019-10-02 09:17:12,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28026 states. [2019-10-02 09:17:12,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28026 states to 28026 states and 37622 transitions. [2019-10-02 09:17:12,796 INFO L78 Accepts]: Start accepts. Automaton has 28026 states and 37622 transitions. Word has length 293 [2019-10-02 09:17:12,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:17:12,796 INFO L475 AbstractCegarLoop]: Abstraction has 28026 states and 37622 transitions. [2019-10-02 09:17:12,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 09:17:12,797 INFO L276 IsEmpty]: Start isEmpty. Operand 28026 states and 37622 transitions. [2019-10-02 09:17:12,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 299 [2019-10-02 09:17:12,802 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:17:12,802 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 09:17:12,802 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:17:12,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:17:12,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1238395213, now seen corresponding path program 1 times [2019-10-02 09:17:12,803 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:17:12,803 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:17:12,808 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:17:12,809 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:17:12,809 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:17:13,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:17:13,374 INFO L134 CoverageAnalysis]: Checked inductivity of 181 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 138 trivial. 0 not checked. [2019-10-02 09:17:13,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:17:13,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 09:17:13,375 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 09:17:13,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 09:17:13,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 09:17:13,376 INFO L87 Difference]: Start difference. First operand 28026 states and 37622 transitions. Second operand 5 states. [2019-10-02 09:17:27,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-02 09:17:27,457 INFO L93 Difference]: Finished difference Result 40517 states and 54531 transitions. [2019-10-02 09:17:27,457 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-02 09:17:27,457 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 298 [2019-10-02 09:17:27,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-02 09:17:27,488 INFO L225 Difference]: With dead ends: 40517 [2019-10-02 09:17:27,488 INFO L226 Difference]: Without dead ends: 17543 [2019-10-02 09:17:27,511 INFO L640 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-02 09:17:27,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17543 states. [2019-10-02 09:17:27,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17543 to 17514. [2019-10-02 09:17:27,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17514 states. [2019-10-02 09:17:28,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17514 states to 17514 states and 23516 transitions. [2019-10-02 09:17:28,028 INFO L78 Accepts]: Start accepts. Automaton has 17514 states and 23516 transitions. Word has length 298 [2019-10-02 09:17:28,029 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-02 09:17:28,029 INFO L475 AbstractCegarLoop]: Abstraction has 17514 states and 23516 transitions. [2019-10-02 09:17:28,029 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-02 09:17:28,029 INFO L276 IsEmpty]: Start isEmpty. Operand 17514 states and 23516 transitions. [2019-10-02 09:17:28,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 301 [2019-10-02 09:17:28,035 INFO L403 BasicCegarLoop]: Found error trace [2019-10-02 09:17:28,035 INFO L411 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-10-02 09:17:28,036 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-02 09:17:28,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-02 09:17:28,036 INFO L82 PathProgramCache]: Analyzing trace with hash 1815361424, now seen corresponding path program 1 times [2019-10-02 09:17:28,036 INFO L224 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-10-02 09:17:28,036 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-10-02 09:17:28,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:17:28,042 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-02 09:17:28,042 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-02 09:17:28,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-02 09:17:28,651 INFO L134 CoverageAnalysis]: Checked inductivity of 197 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 149 trivial. 0 not checked. [2019-10-02 09:17:28,651 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-02 09:17:28,651 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-02 09:17:28,651 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-02 09:17:28,652 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-02 09:17:28,652 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-02 09:17:28,652 INFO L87 Difference]: Start difference. First operand 17514 states and 23516 transitions. Second operand 5 states.