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-consumption/32_7a_cilled_linux-3.8-rc1-drivers--hwmon--abituguru3.ko-main.cil.out.i -------------------------------------------------------------------------------- This is Ultimate 0.1.24-112bae1 [2019-09-08 15:26:38,072 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-09-08 15:26:38,074 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-09-08 15:26:38,087 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-09-08 15:26:38,087 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-09-08 15:26:38,088 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-09-08 15:26:38,089 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-09-08 15:26:38,102 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-09-08 15:26:38,103 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-09-08 15:26:38,104 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-09-08 15:26:38,108 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-09-08 15:26:38,109 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-09-08 15:26:38,109 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-09-08 15:26:38,112 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-09-08 15:26:38,115 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-09-08 15:26:38,117 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-09-08 15:26:38,118 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-09-08 15:26:38,123 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-09-08 15:26:38,126 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-09-08 15:26:38,131 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-09-08 15:26:38,134 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-09-08 15:26:38,136 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-09-08 15:26:38,140 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-09-08 15:26:38,141 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-09-08 15:26:38,143 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-09-08 15:26:38,143 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-09-08 15:26:38,143 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-09-08 15:26:38,146 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-09-08 15:26:38,147 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-09-08 15:26:38,149 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-09-08 15:26:38,149 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-09-08 15:26:38,151 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-09-08 15:26:38,152 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-09-08 15:26:38,153 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-09-08 15:26:38,156 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-09-08 15:26:38,156 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-09-08 15:26:38,157 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-09-08 15:26:38,157 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-09-08 15:26:38,157 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-09-08 15:26:38,158 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-09-08 15:26:38,158 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-09-08 15:26:38,159 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-09-08 15:26:38,180 INFO L113 SettingsManager]: Loading preferences was successful [2019-09-08 15:26:38,180 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-09-08 15:26:38,183 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-09-08 15:26:38,183 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-09-08 15:26:38,183 INFO L138 SettingsManager]: * Use SBE=true [2019-09-08 15:26:38,184 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-09-08 15:26:38,184 INFO L138 SettingsManager]: * sizeof long=4 [2019-09-08 15:26:38,184 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-09-08 15:26:38,184 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-09-08 15:26:38,184 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-09-08 15:26:38,186 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-09-08 15:26:38,186 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-09-08 15:26:38,186 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-09-08 15:26:38,187 INFO L138 SettingsManager]: * sizeof long double=12 [2019-09-08 15:26:38,187 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-09-08 15:26:38,187 INFO L138 SettingsManager]: * Use constant arrays=true [2019-09-08 15:26:38,187 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-09-08 15:26:38,187 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-09-08 15:26:38,188 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-09-08 15:26:38,188 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-09-08 15:26:38,188 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-09-08 15:26:38,188 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 15:26:38,189 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-09-08 15:26:38,189 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-09-08 15:26:38,189 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-09-08 15:26:38,189 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-09-08 15:26:38,190 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-09-08 15:26:38,190 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-09-08 15:26:38,190 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-09-08 15:26:38,232 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-09-08 15:26:38,250 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-09-08 15:26:38,254 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-09-08 15:26:38,258 INFO L271 PluginConnector]: Initializing CDTParser... [2019-09-08 15:26:38,258 INFO L275 PluginConnector]: CDTParser initialized [2019-09-08 15:26:38,259 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--hwmon--abituguru3.ko-main.cil.out.i [2019-09-08 15:26:38,319 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a72d5b0e/74aaf7122f6a47578db84e6888c4661f/FLAGba4e0ac8e [2019-09-08 15:26:39,053 INFO L306 CDTParser]: Found 1 translation units. [2019-09-08 15:26:39,054 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/ldv-consumption/32_7a_cilled_linux-3.8-rc1-drivers--hwmon--abituguru3.ko-main.cil.out.i [2019-09-08 15:26:39,098 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a72d5b0e/74aaf7122f6a47578db84e6888c4661f/FLAGba4e0ac8e [2019-09-08 15:26:39,155 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a72d5b0e/74aaf7122f6a47578db84e6888c4661f [2019-09-08 15:26:39,165 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-09-08 15:26:39,167 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-09-08 15:26:39,168 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-09-08 15:26:39,169 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-09-08 15:26:39,172 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-09-08 15:26:39,173 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:26:39" (1/1) ... [2019-09-08 15:26:39,176 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@613073af and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:26:39, skipping insertion in model container [2019-09-08 15:26:39,177 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.09 03:26:39" (1/1) ... [2019-09-08 15:26:39,184 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-09-08 15:26:39,282 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-09-08 15:26:40,360 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 15:26:40,461 INFO L188 MainTranslator]: Completed pre-run [2019-09-08 15:26:40,749 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-09-08 15:26:41,040 INFO L192 MainTranslator]: Completed translation [2019-09-08 15:26:41,041 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:26:41 WrapperNode [2019-09-08 15:26:41,042 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-09-08 15:26:41,043 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-09-08 15:26:41,043 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-09-08 15:26:41,044 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-09-08 15:26:41,061 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:26:41" (1/1) ... [2019-09-08 15:26:41,061 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:26:41" (1/1) ... [2019-09-08 15:26:41,203 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:26:41" (1/1) ... [2019-09-08 15:26:41,204 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:26:41" (1/1) ... [2019-09-08 15:26:41,444 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:26:41" (1/1) ... [2019-09-08 15:26:41,481 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:26:41" (1/1) ... [2019-09-08 15:26:41,537 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:26:41" (1/1) ... [2019-09-08 15:26:41,575 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-09-08 15:26:41,575 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-09-08 15:26:41,575 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-09-08 15:26:41,576 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-09-08 15:26:41,578 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:26:41" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-09-08 15:26:41,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-09-08 15:26:41,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-09-08 15:26:41,659 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~~TO~VOID [2019-09-08 15:26:41,660 INFO L138 BoogieDeclarations]: Found implementation of procedure slow_down_io [2019-09-08 15:26:41,661 INFO L138 BoogieDeclarations]: Found implementation of procedure PTR_ERR [2019-09-08 15:26:41,661 INFO L138 BoogieDeclarations]: Found implementation of procedure IS_ERR [2019-09-08 15:26:41,661 INFO L138 BoogieDeclarations]: Found implementation of procedure outb [2019-09-08 15:26:41,662 INFO L138 BoogieDeclarations]: Found implementation of procedure inb [2019-09-08 15:26:41,662 INFO L138 BoogieDeclarations]: Found implementation of procedure inb_p [2019-09-08 15:26:41,662 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_drvdata [2019-09-08 15:26:41,662 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_set_drvdata [2019-09-08 15:26:41,663 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_wait_while_busy [2019-09-08 15:26:41,663 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_wait_for_read [2019-09-08 15:26:41,664 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_synchronize [2019-09-08 15:26:41,665 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_read [2019-09-08 15:26:41,665 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_read_increment_offset [2019-09-08 15:26:41,667 INFO L138 BoogieDeclarations]: Found implementation of procedure show_value [2019-09-08 15:26:41,667 INFO L138 BoogieDeclarations]: Found implementation of procedure show_alarm [2019-09-08 15:26:41,667 INFO L138 BoogieDeclarations]: Found implementation of procedure show_mask [2019-09-08 15:26:41,668 INFO L138 BoogieDeclarations]: Found implementation of procedure show_label [2019-09-08 15:26:41,668 INFO L138 BoogieDeclarations]: Found implementation of procedure show_name [2019-09-08 15:26:41,668 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_probe [2019-09-08 15:26:41,668 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_remove [2019-09-08 15:26:41,669 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_update_device [2019-09-08 15:26:41,669 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_suspend [2019-09-08 15:26:41,669 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_resume [2019-09-08 15:26:41,669 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_dmi_detect [2019-09-08 15:26:41,669 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_detect [2019-09-08 15:26:41,669 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_init [2019-09-08 15:26:41,669 INFO L138 BoogieDeclarations]: Found implementation of procedure abituguru3_exit [2019-09-08 15:26:41,670 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-09-08 15:26:41,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_1 [2019-09-08 15:26:41,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_2 [2019-09-08 15:26:41,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_3 [2019-09-08 15:26:41,670 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_4 [2019-09-08 15:26:41,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_5 [2019-09-08 15:26:41,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_6 [2019-09-08 15:26:41,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_7 [2019-09-08 15:26:41,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_8 [2019-09-08 15:26:41,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_9 [2019-09-08 15:26:41,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_platform_driver_register_10 [2019-09-08 15:26:41,671 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_platform_driver_unregister_11 [2019-09-08 15:26:41,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_platform_driver_unregister_12 [2019-09-08 15:26:41,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-09-08 15:26:41,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_expect [2019-09-08 15:26:41,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv__builtin_trap [2019-09-08 15:26:41,672 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_lock [2019-09-08 15:26:41,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_lock [2019-09-08 15:26:41,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_lock [2019-09-08 15:26:41,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_lock [2019-09-08 15:26:41,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_lock [2019-09-08 15:26:41,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_lock [2019-09-08 15:26:41,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_lock [2019-09-08 15:26:41,673 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_mutex_of_device [2019-09-08 15:26:41,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_mutex_of_device [2019-09-08 15:26:41,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_mutex_of_device [2019-09-08 15:26:41,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_mutex_of_device [2019-09-08 15:26:41,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_mutex_of_device [2019-09-08 15:26:41,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_mutex_of_device [2019-09-08 15:26:41,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_mutex_of_device [2019-09-08 15:26:41,674 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_interruptible_update_lock_of_abituguru3_data [2019-09-08 15:26:41,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_killable_update_lock_of_abituguru3_data [2019-09-08 15:26:41,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_lock_update_lock_of_abituguru3_data [2019-09-08 15:26:41,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_trylock_update_lock_of_abituguru3_data [2019-09-08 15:26:41,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_atomic_dec_and_mutex_lock_update_lock_of_abituguru3_data [2019-09-08 15:26:41,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_is_locked_update_lock_of_abituguru3_data [2019-09-08 15:26:41,675 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_mutex_unlock_update_lock_of_abituguru3_data [2019-09-08 15:26:41,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_initialize [2019-09-08 15:26:41,676 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_check_final_state [2019-09-08 15:26:41,676 INFO L138 BoogieDeclarations]: Found implementation of procedure __mutex_init [2019-09-08 15:26:41,676 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2019-09-08 15:26:41,677 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2019-09-08 15:26:41,677 INFO L138 BoogieDeclarations]: Found implementation of procedure device_create_file [2019-09-08 15:26:41,677 INFO L138 BoogieDeclarations]: Found implementation of procedure device_remove_file [2019-09-08 15:26:41,678 INFO L138 BoogieDeclarations]: Found implementation of procedure devm_kzalloc [2019-09-08 15:26:41,678 INFO L138 BoogieDeclarations]: Found implementation of procedure dmi_get_system_info [2019-09-08 15:26:41,678 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_register [2019-09-08 15:26:41,678 INFO L138 BoogieDeclarations]: Found implementation of procedure hwmon_device_unregister [2019-09-08 15:26:41,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_abituguru3_pm_complete_2 [2019-09-08 15:26:41,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_abituguru3_pm_freeze_late_2 [2019-09-08 15:26:41,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_abituguru3_pm_freeze_noirq_2 [2019-09-08 15:26:41,679 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_abituguru3_pm_poweroff_late_2 [2019-09-08 15:26:41,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_abituguru3_pm_poweroff_noirq_2 [2019-09-08 15:26:41,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_abituguru3_pm_prepare_2 [2019-09-08 15:26:41,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_abituguru3_pm_restore_early_2 [2019-09-08 15:26:41,680 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_abituguru3_pm_restore_noirq_2 [2019-09-08 15:26:41,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_abituguru3_pm_resume_early_2 [2019-09-08 15:26:41,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_abituguru3_pm_resume_noirq_2 [2019-09-08 15:26:41,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_abituguru3_pm_suspend_late_2 [2019-09-08 15:26:41,682 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_abituguru3_pm_suspend_noirq_2 [2019-09-08 15:26:41,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_abituguru3_pm_thaw_early_2 [2019-09-08 15:26:41,683 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_abituguru3_pm_thaw_noirq_2 [2019-09-08 15:26:41,683 INFO L138 BoogieDeclarations]: Found implementation of procedure msleep [2019-09-08 15:26:41,684 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_lock [2019-09-08 15:26:41,684 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_trylock [2019-09-08 15:26:41,684 INFO L138 BoogieDeclarations]: Found implementation of procedure mutex_unlock [2019-09-08 15:26:41,684 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_device_add [2019-09-08 15:26:41,684 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_device_add_resources [2019-09-08 15:26:41,685 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_device_alloc [2019-09-08 15:26:41,685 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_device_put [2019-09-08 15:26:41,685 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_device_unregister [2019-09-08 15:26:41,685 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_driver_register [2019-09-08 15:26:41,685 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_driver_unregister [2019-09-08 15:26:41,685 INFO L138 BoogieDeclarations]: Found implementation of procedure platform_get_resource [2019-09-08 15:26:41,685 INFO L138 BoogieDeclarations]: Found implementation of procedure printk [2019-09-08 15:26:41,686 INFO L138 BoogieDeclarations]: Found implementation of procedure strncasecmp [2019-09-08 15:26:41,686 INFO L138 BoogieDeclarations]: Found implementation of procedure external_alloc [2019-09-08 15:26:41,686 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-09-08 15:26:41,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-09-08 15:26:41,687 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-09-08 15:26:41,687 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_expect [2019-09-08 15:26:41,687 INFO L130 BoogieDeclarations]: Found specification of procedure printk [2019-09-08 15:26:41,687 INFO L130 BoogieDeclarations]: Found specification of procedure sprintf [2019-09-08 15:26:41,688 INFO L130 BoogieDeclarations]: Found specification of procedure snprintf [2019-09-08 15:26:41,688 INFO L130 BoogieDeclarations]: Found specification of procedure strlen [2019-09-08 15:26:41,688 INFO L130 BoogieDeclarations]: Found specification of procedure strcmp [2019-09-08 15:26:41,688 INFO L130 BoogieDeclarations]: Found specification of procedure strncasecmp [2019-09-08 15:26:41,689 INFO L130 BoogieDeclarations]: Found specification of procedure strcspn [2019-09-08 15:26:41,689 INFO L130 BoogieDeclarations]: Found specification of procedure slow_down_io [2019-09-08 15:26:41,689 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~~TO~VOID [2019-09-08 15:26:41,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-09-08 15:26:41,690 INFO L130 BoogieDeclarations]: Found specification of procedure PTR_ERR [2019-09-08 15:26:41,690 INFO L130 BoogieDeclarations]: Found specification of procedure IS_ERR [2019-09-08 15:26:41,690 INFO L130 BoogieDeclarations]: Found specification of procedure __mutex_init [2019-09-08 15:26:41,691 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_trylock [2019-09-08 15:26:41,691 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_4 [2019-09-08 15:26:41,691 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_unlock [2019-09-08 15:26:41,691 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_2 [2019-09-08 15:26:41,691 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_5 [2019-09-08 15:26:41,692 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_7 [2019-09-08 15:26:41,692 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_9 [2019-09-08 15:26:41,692 INFO L130 BoogieDeclarations]: Found specification of procedure mutex_lock [2019-09-08 15:26:41,693 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_1 [2019-09-08 15:26:41,693 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_3 [2019-09-08 15:26:41,693 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_6 [2019-09-08 15:26:41,693 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_8 [2019-09-08 15:26:41,693 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_lock [2019-09-08 15:26:41,693 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_lock [2019-09-08 15:26:41,694 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_mutex_of_device [2019-09-08 15:26:41,694 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_mutex_of_device [2019-09-08 15:26:41,697 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_mutex_of_device [2019-09-08 15:26:41,698 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_update_lock_of_abituguru3_data [2019-09-08 15:26:41,698 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_unlock_update_lock_of_abituguru3_data [2019-09-08 15:26:41,699 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-09-08 15:26:41,705 INFO L130 BoogieDeclarations]: Found specification of procedure outb [2019-09-08 15:26:41,705 INFO L130 BoogieDeclarations]: Found specification of procedure inb [2019-09-08 15:26:41,705 INFO L130 BoogieDeclarations]: Found specification of procedure inb_p [2019-09-08 15:26:41,705 INFO L130 BoogieDeclarations]: Found specification of procedure msleep [2019-09-08 15:26:41,705 INFO L130 BoogieDeclarations]: Found specification of procedure device_create_file [2019-09-08 15:26:41,705 INFO L130 BoogieDeclarations]: Found specification of procedure device_remove_file [2019-09-08 15:26:41,706 INFO L130 BoogieDeclarations]: Found specification of procedure devm_kzalloc [2019-09-08 15:26:41,706 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2019-09-08 15:26:41,706 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2019-09-08 15:26:41,706 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_unregister [2019-09-08 15:26:41,706 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_resource [2019-09-08 15:26:41,706 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_alloc [2019-09-08 15:26:41,706 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_add_resources [2019-09-08 15:26:41,707 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_add [2019-09-08 15:26:41,707 INFO L130 BoogieDeclarations]: Found specification of procedure platform_device_put [2019-09-08 15:26:41,707 INFO L130 BoogieDeclarations]: Found specification of procedure platform_driver_register [2019-09-08 15:26:41,707 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_platform_driver_register_10 [2019-09-08 15:26:41,707 INFO L130 BoogieDeclarations]: Found specification of procedure platform_driver_unregister [2019-09-08 15:26:41,707 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_platform_driver_unregister_11 [2019-09-08 15:26:41,707 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_platform_driver_unregister_12 [2019-09-08 15:26:41,708 INFO L130 BoogieDeclarations]: Found specification of procedure platform_get_drvdata [2019-09-08 15:26:41,708 INFO L130 BoogieDeclarations]: Found specification of procedure platform_set_drvdata [2019-09-08 15:26:41,708 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_register [2019-09-08 15:26:41,708 INFO L130 BoogieDeclarations]: Found specification of procedure hwmon_device_unregister [2019-09-08 15:26:41,708 INFO L130 BoogieDeclarations]: Found specification of procedure dmi_get_system_info [2019-09-08 15:26:41,708 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_wait_while_busy [2019-09-08 15:26:41,708 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-09-08 15:26:41,708 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_wait_for_read [2019-09-08 15:26:41,709 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_synchronize [2019-09-08 15:26:41,709 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_read [2019-09-08 15:26:41,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-09-08 15:26:41,709 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_read_increment_offset [2019-09-08 15:26:41,709 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_update_device [2019-09-08 15:26:41,709 INFO L130 BoogieDeclarations]: Found specification of procedure show_value [2019-09-08 15:26:41,709 INFO L130 BoogieDeclarations]: Found specification of procedure show_alarm [2019-09-08 15:26:41,710 INFO L130 BoogieDeclarations]: Found specification of procedure show_mask [2019-09-08 15:26:41,710 INFO L130 BoogieDeclarations]: Found specification of procedure show_label [2019-09-08 15:26:41,710 INFO L130 BoogieDeclarations]: Found specification of procedure show_name [2019-09-08 15:26:41,710 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_probe [2019-09-08 15:26:41,710 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-09-08 15:26:41,710 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-09-08 15:26:41,710 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_remove [2019-09-08 15:26:41,711 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_suspend [2019-09-08 15:26:41,711 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_resume [2019-09-08 15:26:41,711 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_dmi_detect [2019-09-08 15:26:41,711 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_detect [2019-09-08 15:26:41,711 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_init [2019-09-08 15:26:41,711 INFO L130 BoogieDeclarations]: Found specification of procedure abituguru3_exit [2019-09-08 15:26:41,711 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_abituguru3_pm_resume_noirq_2 [2019-09-08 15:26:41,711 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_abituguru3_pm_poweroff_noirq_2 [2019-09-08 15:26:41,712 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_abituguru3_pm_freeze_noirq_2 [2019-09-08 15:26:41,712 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_abituguru3_pm_complete_2 [2019-09-08 15:26:41,712 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_abituguru3_pm_freeze_late_2 [2019-09-08 15:26:41,712 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_abituguru3_pm_suspend_late_2 [2019-09-08 15:26:41,712 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_abituguru3_pm_resume_early_2 [2019-09-08 15:26:41,712 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_abituguru3_pm_suspend_noirq_2 [2019-09-08 15:26:41,712 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_abituguru3_pm_thaw_early_2 [2019-09-08 15:26:41,712 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_check_final_state [2019-09-08 15:26:41,713 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_abituguru3_pm_poweroff_late_2 [2019-09-08 15:26:41,713 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_abituguru3_pm_thaw_noirq_2 [2019-09-08 15:26:41,713 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_initialize [2019-09-08 15:26:41,713 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_abituguru3_pm_prepare_2 [2019-09-08 15:26:41,713 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_abituguru3_pm_restore_noirq_2 [2019-09-08 15:26:41,713 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_abituguru3_pm_restore_early_2 [2019-09-08 15:26:41,713 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-09-08 15:26:41,713 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-09-08 15:26:41,714 INFO L130 BoogieDeclarations]: Found specification of procedure ldv__builtin_trap [2019-09-08 15:26:41,714 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_lock [2019-09-08 15:26:41,714 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_lock [2019-09-08 15:26:41,714 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_lock [2019-09-08 15:26:41,714 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_lock [2019-09-08 15:26:41,714 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_lock [2019-09-08 15:26:41,714 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_mutex_of_device [2019-09-08 15:26:41,715 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_mutex_of_device [2019-09-08 15:26:41,715 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_mutex_of_device [2019-09-08 15:26:41,715 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_mutex_of_device [2019-09-08 15:26:41,715 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_interruptible_update_lock_of_abituguru3_data [2019-09-08 15:26:41,715 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_lock_killable_update_lock_of_abituguru3_data [2019-09-08 15:26:41,715 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_trylock_update_lock_of_abituguru3_data [2019-09-08 15:26:41,715 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_atomic_dec_and_mutex_lock_update_lock_of_abituguru3_data [2019-09-08 15:26:41,715 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_mutex_is_locked_update_lock_of_abituguru3_data [2019-09-08 15:26:41,716 INFO L130 BoogieDeclarations]: Found specification of procedure external_alloc [2019-09-08 15:26:41,716 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_pointer [2019-09-08 15:26:41,716 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-09-08 15:26:41,716 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-09-08 15:26:41,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-09-08 15:26:41,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-09-08 15:26:41,716 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-09-08 15:26:41,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-09-08 15:27:28,884 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-09-08 15:27:28,884 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-09-08 15:27:28,886 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:27:28 BoogieIcfgContainer [2019-09-08 15:27:28,886 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-09-08 15:27:28,887 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-09-08 15:27:28,887 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-09-08 15:27:28,891 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-09-08 15:27:28,891 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.09 03:26:39" (1/3) ... [2019-09-08 15:27:28,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6692ddc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:27:28, skipping insertion in model container [2019-09-08 15:27:28,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.09 03:26:41" (2/3) ... [2019-09-08 15:27:28,892 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6692ddc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.09 03:27:28, skipping insertion in model container [2019-09-08 15:27:28,892 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.09 03:27:28" (3/3) ... [2019-09-08 15:27:28,894 INFO L109 eAbstractionObserver]: Analyzing ICFG 32_7a_cilled_linux-3.8-rc1-drivers--hwmon--abituguru3.ko-main.cil.out.i [2019-09-08 15:27:28,904 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-09-08 15:27:28,915 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-09-08 15:27:28,932 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-09-08 15:27:28,977 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-09-08 15:27:28,977 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-09-08 15:27:28,977 INFO L378 AbstractCegarLoop]: Hoare is true [2019-09-08 15:27:28,978 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-09-08 15:27:28,978 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-09-08 15:27:28,978 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-09-08 15:27:28,978 INFO L382 AbstractCegarLoop]: Difference is false [2019-09-08 15:27:28,978 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-09-08 15:27:28,978 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-09-08 15:27:29,025 INFO L276 IsEmpty]: Start isEmpty. Operand 777 states. [2019-09-08 15:27:29,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-09-08 15:27:29,041 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:27:29,042 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 15:27:29,046 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:27:29,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:27:29,052 INFO L82 PathProgramCache]: Analyzing trace with hash 607430032, now seen corresponding path program 1 times [2019-09-08 15:27:29,054 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:27:29,055 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:27:29,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:27:29,133 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:27:29,133 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:27:30,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:27:32,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-09-08 15:27:32,337 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:27:32,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 15:27:32,344 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 15:27:32,356 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 15:27:32,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:27:32,358 INFO L87 Difference]: Start difference. First operand 777 states. Second operand 3 states. [2019-09-08 15:27:41,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:27:41,811 INFO L93 Difference]: Finished difference Result 1838 states and 2454 transitions. [2019-09-08 15:27:41,811 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 15:27:41,814 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-09-08 15:27:41,814 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:27:41,857 INFO L225 Difference]: With dead ends: 1838 [2019-09-08 15:27:41,857 INFO L226 Difference]: Without dead ends: 1158 [2019-09-08 15:27:41,872 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:27:41,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1158 states. [2019-09-08 15:27:42,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1158 to 1146. [2019-09-08 15:27:42,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1146 states. [2019-09-08 15:27:42,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1146 states to 1146 states and 1504 transitions. [2019-09-08 15:27:42,059 INFO L78 Accepts]: Start accepts. Automaton has 1146 states and 1504 transitions. Word has length 41 [2019-09-08 15:27:42,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:27:42,059 INFO L475 AbstractCegarLoop]: Abstraction has 1146 states and 1504 transitions. [2019-09-08 15:27:42,059 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 15:27:42,059 INFO L276 IsEmpty]: Start isEmpty. Operand 1146 states and 1504 transitions. [2019-09-08 15:27:42,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2019-09-08 15:27:42,062 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:27:42,062 INFO L399 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] [2019-09-08 15:27:42,063 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:27:42,063 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:27:42,063 INFO L82 PathProgramCache]: Analyzing trace with hash 966365340, now seen corresponding path program 1 times [2019-09-08 15:27:42,064 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:27:42,064 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:27:42,066 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:27:42,066 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:27:42,067 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:27:42,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:27:43,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 15:27:43,116 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:27:43,116 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 15:27:43,117 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 15:27:43,117 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 15:27:43,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:27:43,118 INFO L87 Difference]: Start difference. First operand 1146 states and 1504 transitions. Second operand 3 states. [2019-09-08 15:27:55,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:27:55,854 INFO L93 Difference]: Finished difference Result 3175 states and 4190 transitions. [2019-09-08 15:27:55,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 15:27:55,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 38 [2019-09-08 15:27:55,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:27:55,870 INFO L225 Difference]: With dead ends: 3175 [2019-09-08 15:27:55,871 INFO L226 Difference]: Without dead ends: 2040 [2019-09-08 15:27:55,877 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:27:55,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2040 states. [2019-09-08 15:27:55,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2040 to 2020. [2019-09-08 15:27:55,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2020 states. [2019-09-08 15:27:55,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2020 states to 2020 states and 2672 transitions. [2019-09-08 15:27:55,980 INFO L78 Accepts]: Start accepts. Automaton has 2020 states and 2672 transitions. Word has length 38 [2019-09-08 15:27:55,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:27:55,980 INFO L475 AbstractCegarLoop]: Abstraction has 2020 states and 2672 transitions. [2019-09-08 15:27:55,980 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 15:27:55,981 INFO L276 IsEmpty]: Start isEmpty. Operand 2020 states and 2672 transitions. [2019-09-08 15:27:55,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-08 15:27:55,983 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:27:55,983 INFO L399 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-09-08 15:27:55,984 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:27:55,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:27:55,984 INFO L82 PathProgramCache]: Analyzing trace with hash 98737886, now seen corresponding path program 1 times [2019-09-08 15:27:55,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:27:55,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:27:55,986 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:27:55,987 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:27:55,987 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:27:56,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:27:57,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 15:27:57,113 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:27:57,114 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 15:27:57,114 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 15:27:57,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 15:27:57,116 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 15:27:57,116 INFO L87 Difference]: Start difference. First operand 2020 states and 2672 transitions. Second operand 7 states. [2019-09-08 15:27:57,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:27:57,333 INFO L93 Difference]: Finished difference Result 4103 states and 5439 transitions. [2019-09-08 15:27:57,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-09-08 15:27:57,334 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-09-08 15:27:57,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:27:57,346 INFO L225 Difference]: With dead ends: 4103 [2019-09-08 15:27:57,346 INFO L226 Difference]: Without dead ends: 2094 [2019-09-08 15:27:57,354 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 15:27:57,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2094 states. [2019-09-08 15:27:57,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2094 to 2046. [2019-09-08 15:27:57,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2046 states. [2019-09-08 15:27:57,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 2046 states and 2708 transitions. [2019-09-08 15:27:57,444 INFO L78 Accepts]: Start accepts. Automaton has 2046 states and 2708 transitions. Word has length 48 [2019-09-08 15:27:57,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:27:57,444 INFO L475 AbstractCegarLoop]: Abstraction has 2046 states and 2708 transitions. [2019-09-08 15:27:57,444 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 15:27:57,444 INFO L276 IsEmpty]: Start isEmpty. Operand 2046 states and 2708 transitions. [2019-09-08 15:27:57,447 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-08 15:27:57,447 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:27:57,447 INFO L399 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-09-08 15:27:57,447 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:27:57,447 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:27:57,448 INFO L82 PathProgramCache]: Analyzing trace with hash 160777500, now seen corresponding path program 1 times [2019-09-08 15:27:57,448 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:27:57,448 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:27:57,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:27:57,450 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:27:57,450 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:27:57,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:27:58,385 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 15:27:58,385 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:27:58,386 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 15:27:58,386 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 15:27:58,387 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 15:27:58,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:27:58,388 INFO L87 Difference]: Start difference. First operand 2046 states and 2708 transitions. Second operand 3 states. [2019-09-08 15:28:09,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:28:09,565 INFO L93 Difference]: Finished difference Result 2064 states and 2728 transitions. [2019-09-08 15:28:09,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 15:28:09,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-09-08 15:28:09,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:28:09,591 INFO L225 Difference]: With dead ends: 2064 [2019-09-08 15:28:09,592 INFO L226 Difference]: Without dead ends: 2055 [2019-09-08 15:28:09,594 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:28:09,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2055 states. [2019-09-08 15:28:09,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2055 to 2046. [2019-09-08 15:28:09,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2046 states. [2019-09-08 15:28:09,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 2046 states and 2707 transitions. [2019-09-08 15:28:09,713 INFO L78 Accepts]: Start accepts. Automaton has 2046 states and 2707 transitions. Word has length 48 [2019-09-08 15:28:09,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:28:09,719 INFO L475 AbstractCegarLoop]: Abstraction has 2046 states and 2707 transitions. [2019-09-08 15:28:09,719 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 15:28:09,720 INFO L276 IsEmpty]: Start isEmpty. Operand 2046 states and 2707 transitions. [2019-09-08 15:28:09,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-09-08 15:28:09,721 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:28:09,721 INFO L399 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-09-08 15:28:09,722 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:28:09,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:28:09,722 INFO L82 PathProgramCache]: Analyzing trace with hash 218035802, now seen corresponding path program 1 times [2019-09-08 15:28:09,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:28:09,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:28:09,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:28:09,726 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:28:09,726 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:28:10,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:28:10,892 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 15:28:10,892 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:28:10,893 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 15:28:10,893 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 15:28:10,893 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 15:28:10,894 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:28:10,895 INFO L87 Difference]: Start difference. First operand 2046 states and 2707 transitions. Second operand 3 states. [2019-09-08 15:28:26,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:28:26,232 INFO L93 Difference]: Finished difference Result 2048 states and 2708 transitions. [2019-09-08 15:28:26,232 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 15:28:26,232 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2019-09-08 15:28:26,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:28:26,248 INFO L225 Difference]: With dead ends: 2048 [2019-09-08 15:28:26,248 INFO L226 Difference]: Without dead ends: 2045 [2019-09-08 15:28:26,250 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:28:26,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2045 states. [2019-09-08 15:28:26,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2045 to 2045. [2019-09-08 15:28:26,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2045 states. [2019-09-08 15:28:26,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2045 states to 2045 states and 2705 transitions. [2019-09-08 15:28:26,343 INFO L78 Accepts]: Start accepts. Automaton has 2045 states and 2705 transitions. Word has length 48 [2019-09-08 15:28:26,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:28:26,344 INFO L475 AbstractCegarLoop]: Abstraction has 2045 states and 2705 transitions. [2019-09-08 15:28:26,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 15:28:26,344 INFO L276 IsEmpty]: Start isEmpty. Operand 2045 states and 2705 transitions. [2019-09-08 15:28:26,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-09-08 15:28:26,347 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:28:26,347 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 15:28:26,347 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:28:26,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:28:26,348 INFO L82 PathProgramCache]: Analyzing trace with hash -1831202699, now seen corresponding path program 1 times [2019-09-08 15:28:26,348 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:28:26,348 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:28:26,350 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:28:26,351 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:28:26,351 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:28:26,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:28:27,240 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 15:28:27,240 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:28:27,240 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 15:28:27,241 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 15:28:27,242 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 15:28:27,242 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:28:27,243 INFO L87 Difference]: Start difference. First operand 2045 states and 2705 transitions. Second operand 3 states. [2019-09-08 15:28:41,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:28:41,770 INFO L93 Difference]: Finished difference Result 2047 states and 2706 transitions. [2019-09-08 15:28:41,770 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 15:28:41,770 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-09-08 15:28:41,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:28:41,783 INFO L225 Difference]: With dead ends: 2047 [2019-09-08 15:28:41,783 INFO L226 Difference]: Without dead ends: 2044 [2019-09-08 15:28:41,785 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:28:41,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2044 states. [2019-09-08 15:28:41,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2044 to 2044. [2019-09-08 15:28:41,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2044 states. [2019-09-08 15:28:41,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2044 states to 2044 states and 2703 transitions. [2019-09-08 15:28:41,887 INFO L78 Accepts]: Start accepts. Automaton has 2044 states and 2703 transitions. Word has length 49 [2019-09-08 15:28:41,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:28:41,888 INFO L475 AbstractCegarLoop]: Abstraction has 2044 states and 2703 transitions. [2019-09-08 15:28:41,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 15:28:41,888 INFO L276 IsEmpty]: Start isEmpty. Operand 2044 states and 2703 transitions. [2019-09-08 15:28:41,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-09-08 15:28:41,889 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:28:41,889 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 15:28:41,890 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:28:41,890 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:28:41,890 INFO L82 PathProgramCache]: Analyzing trace with hash -933081923, now seen corresponding path program 1 times [2019-09-08 15:28:41,890 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:28:41,890 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:28:41,892 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:28:41,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:28:41,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:28:42,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:28:42,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-09-08 15:28:42,763 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:28:42,764 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 15:28:42,764 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 15:28:42,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 15:28:42,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:28:42,765 INFO L87 Difference]: Start difference. First operand 2044 states and 2703 transitions. Second operand 3 states. [2019-09-08 15:28:58,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:28:58,289 INFO L93 Difference]: Finished difference Result 5628 states and 7479 transitions. [2019-09-08 15:28:58,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 15:28:58,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-09-08 15:28:58,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:28:58,314 INFO L225 Difference]: With dead ends: 5628 [2019-09-08 15:28:58,315 INFO L226 Difference]: Without dead ends: 3574 [2019-09-08 15:28:58,325 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:28:58,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3574 states. [2019-09-08 15:28:58,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3574 to 3565. [2019-09-08 15:28:58,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3565 states. [2019-09-08 15:28:58,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3565 states to 3565 states and 4738 transitions. [2019-09-08 15:28:58,510 INFO L78 Accepts]: Start accepts. Automaton has 3565 states and 4738 transitions. Word has length 50 [2019-09-08 15:28:58,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:28:58,511 INFO L475 AbstractCegarLoop]: Abstraction has 3565 states and 4738 transitions. [2019-09-08 15:28:58,511 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 15:28:58,511 INFO L276 IsEmpty]: Start isEmpty. Operand 3565 states and 4738 transitions. [2019-09-08 15:28:58,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2019-09-08 15:28:58,515 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:28:58,515 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 15:28:58,515 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:28:58,516 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:28:58,516 INFO L82 PathProgramCache]: Analyzing trace with hash 2092356603, now seen corresponding path program 1 times [2019-09-08 15:28:58,516 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:28:58,516 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:28:58,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:28:58,518 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:28:58,518 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:28:58,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:28:59,365 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-09-08 15:28:59,365 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:28:59,365 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 15:28:59,366 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 15:28:59,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 15:28:59,367 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:28:59,367 INFO L87 Difference]: Start difference. First operand 3565 states and 4738 transitions. Second operand 3 states. [2019-09-08 15:29:14,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:29:14,268 INFO L93 Difference]: Finished difference Result 8767 states and 11734 transitions. [2019-09-08 15:29:14,269 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 15:29:14,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 71 [2019-09-08 15:29:14,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:29:14,301 INFO L225 Difference]: With dead ends: 8767 [2019-09-08 15:29:14,301 INFO L226 Difference]: Without dead ends: 5213 [2019-09-08 15:29:14,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:29:14,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5213 states. [2019-09-08 15:29:14,572 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5213 to 5187. [2019-09-08 15:29:14,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5187 states. [2019-09-08 15:29:14,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5187 states to 5187 states and 6898 transitions. [2019-09-08 15:29:14,599 INFO L78 Accepts]: Start accepts. Automaton has 5187 states and 6898 transitions. Word has length 71 [2019-09-08 15:29:14,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:29:14,600 INFO L475 AbstractCegarLoop]: Abstraction has 5187 states and 6898 transitions. [2019-09-08 15:29:14,600 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 15:29:14,600 INFO L276 IsEmpty]: Start isEmpty. Operand 5187 states and 6898 transitions. [2019-09-08 15:29:14,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-09-08 15:29:14,607 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:29:14,607 INFO L399 BasicCegarLoop]: trace histogram [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] [2019-09-08 15:29:14,607 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:29:14,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:29:14,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1970757722, now seen corresponding path program 1 times [2019-09-08 15:29:14,608 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:29:14,608 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:29:14,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:29:14,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:29:14,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:29:15,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:29:15,724 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-09-08 15:29:15,724 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:29:15,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 15:29:15,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 15:29:15,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 15:29:15,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:29:15,726 INFO L87 Difference]: Start difference. First operand 5187 states and 6898 transitions. Second operand 3 states. [2019-09-08 15:29:30,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:29:30,785 INFO L93 Difference]: Finished difference Result 12011 states and 16054 transitions. [2019-09-08 15:29:30,786 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 15:29:30,786 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 95 [2019-09-08 15:29:30,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:29:30,836 INFO L225 Difference]: With dead ends: 12011 [2019-09-08 15:29:30,837 INFO L226 Difference]: Without dead ends: 6835 [2019-09-08 15:29:30,855 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:29:30,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6835 states. [2019-09-08 15:29:31,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6835 to 6809. [2019-09-08 15:29:31,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6809 states. [2019-09-08 15:29:31,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6809 states to 6809 states and 9058 transitions. [2019-09-08 15:29:31,119 INFO L78 Accepts]: Start accepts. Automaton has 6809 states and 9058 transitions. Word has length 95 [2019-09-08 15:29:31,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:29:31,121 INFO L475 AbstractCegarLoop]: Abstraction has 6809 states and 9058 transitions. [2019-09-08 15:29:31,121 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 15:29:31,121 INFO L276 IsEmpty]: Start isEmpty. Operand 6809 states and 9058 transitions. [2019-09-08 15:29:31,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 131 [2019-09-08 15:29:31,132 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:29:31,132 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 15:29:31,133 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:29:31,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:29:31,133 INFO L82 PathProgramCache]: Analyzing trace with hash 1060927206, now seen corresponding path program 1 times [2019-09-08 15:29:31,133 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:29:31,133 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:29:31,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:29:31,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:29:31,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:29:31,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:29:31,899 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-09-08 15:29:31,899 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:29:31,899 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 15:29:31,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 15:29:31,900 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 15:29:31,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:29:31,900 INFO L87 Difference]: Start difference. First operand 6809 states and 9058 transitions. Second operand 3 states. [2019-09-08 15:29:43,600 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:29:43,600 INFO L93 Difference]: Finished difference Result 15736 states and 21029 transitions. [2019-09-08 15:29:43,601 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 15:29:43,601 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 130 [2019-09-08 15:29:43,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:29:43,647 INFO L225 Difference]: With dead ends: 15736 [2019-09-08 15:29:43,647 INFO L226 Difference]: Without dead ends: 8938 [2019-09-08 15:29:43,672 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:29:43,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8938 states. [2019-09-08 15:29:43,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8938 to 8855. [2019-09-08 15:29:43,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8855 states. [2019-09-08 15:29:44,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8855 states to 8855 states and 11874 transitions. [2019-09-08 15:29:44,008 INFO L78 Accepts]: Start accepts. Automaton has 8855 states and 11874 transitions. Word has length 130 [2019-09-08 15:29:44,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:29:44,009 INFO L475 AbstractCegarLoop]: Abstraction has 8855 states and 11874 transitions. [2019-09-08 15:29:44,009 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 15:29:44,009 INFO L276 IsEmpty]: Start isEmpty. Operand 8855 states and 11874 transitions. [2019-09-08 15:29:44,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-09-08 15:29:44,017 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:29:44,018 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 15:29:44,018 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:29:44,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:29:44,019 INFO L82 PathProgramCache]: Analyzing trace with hash 652446897, now seen corresponding path program 1 times [2019-09-08 15:29:44,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:29:44,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:29:44,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:29:44,023 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:29:44,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:29:44,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:29:45,017 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 15:29:45,018 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:29:45,018 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 15:29:45,018 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 15:29:45,019 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 15:29:45,019 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-09-08 15:29:45,019 INFO L87 Difference]: Start difference. First operand 8855 states and 11874 transitions. Second operand 5 states. [2019-09-08 15:29:57,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:29:57,265 INFO L93 Difference]: Finished difference Result 20922 states and 28536 transitions. [2019-09-08 15:29:57,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 15:29:57,266 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 135 [2019-09-08 15:29:57,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:29:57,322 INFO L225 Difference]: With dead ends: 20922 [2019-09-08 15:29:57,323 INFO L226 Difference]: Without dead ends: 12078 [2019-09-08 15:29:57,348 INFO L628 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-09-08 15:29:57,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12078 states. [2019-09-08 15:29:57,702 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12078 to 10985. [2019-09-08 15:29:57,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10985 states. [2019-09-08 15:29:57,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10985 states to 10985 states and 14880 transitions. [2019-09-08 15:29:57,734 INFO L78 Accepts]: Start accepts. Automaton has 10985 states and 14880 transitions. Word has length 135 [2019-09-08 15:29:57,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:29:57,735 INFO L475 AbstractCegarLoop]: Abstraction has 10985 states and 14880 transitions. [2019-09-08 15:29:57,735 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 15:29:57,735 INFO L276 IsEmpty]: Start isEmpty. Operand 10985 states and 14880 transitions. [2019-09-08 15:29:57,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 15:29:57,746 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:29:57,746 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 15:29:57,746 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:29:57,746 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:29:57,747 INFO L82 PathProgramCache]: Analyzing trace with hash 1687382209, now seen corresponding path program 1 times [2019-09-08 15:29:57,747 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:29:57,747 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:29:57,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:29:57,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:29:57,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:29:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:29:58,519 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-08 15:29:58,519 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:29:58,519 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 15:29:58,520 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 15:29:58,520 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 15:29:58,521 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:29:58,521 INFO L87 Difference]: Start difference. First operand 10985 states and 14880 transitions. Second operand 3 states. [2019-09-08 15:30:14,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:30:14,737 INFO L93 Difference]: Finished difference Result 24027 states and 32684 transitions. [2019-09-08 15:30:14,737 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 15:30:14,737 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 137 [2019-09-08 15:30:14,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:30:14,802 INFO L225 Difference]: With dead ends: 24027 [2019-09-08 15:30:14,802 INFO L226 Difference]: Without dead ends: 13053 [2019-09-08 15:30:14,835 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:30:14,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13053 states. [2019-09-08 15:30:15,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13053 to 13027. [2019-09-08 15:30:15,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13027 states. [2019-09-08 15:30:15,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13027 states to 13027 states and 17630 transitions. [2019-09-08 15:30:15,310 INFO L78 Accepts]: Start accepts. Automaton has 13027 states and 17630 transitions. Word has length 137 [2019-09-08 15:30:15,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:30:15,311 INFO L475 AbstractCegarLoop]: Abstraction has 13027 states and 17630 transitions. [2019-09-08 15:30:15,311 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 15:30:15,311 INFO L276 IsEmpty]: Start isEmpty. Operand 13027 states and 17630 transitions. [2019-09-08 15:30:15,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 15:30:15,320 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:30:15,320 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 15:30:15,320 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:30:15,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:30:15,321 INFO L82 PathProgramCache]: Analyzing trace with hash -226042026, now seen corresponding path program 1 times [2019-09-08 15:30:15,321 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:30:15,321 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:30:15,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:30:15,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:30:15,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:30:15,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:30:16,095 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 15:30:17,175 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:30:17,175 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 15:30:17,176 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 15:30:17,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 15:30:17,176 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:30:17,176 INFO L87 Difference]: Start difference. First operand 13027 states and 17630 transitions. Second operand 3 states. [2019-09-08 15:30:31,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:30:31,359 INFO L93 Difference]: Finished difference Result 28111 states and 38184 transitions. [2019-09-08 15:30:31,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 15:30:31,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 140 [2019-09-08 15:30:31,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:30:31,421 INFO L225 Difference]: With dead ends: 28111 [2019-09-08 15:30:31,421 INFO L226 Difference]: Without dead ends: 15095 [2019-09-08 15:30:31,447 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:30:31,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15095 states. [2019-09-08 15:30:31,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15095 to 15069. [2019-09-08 15:30:31,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15069 states. [2019-09-08 15:30:31,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15069 states to 15069 states and 20380 transitions. [2019-09-08 15:30:31,993 INFO L78 Accepts]: Start accepts. Automaton has 15069 states and 20380 transitions. Word has length 140 [2019-09-08 15:30:31,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:30:31,994 INFO L475 AbstractCegarLoop]: Abstraction has 15069 states and 20380 transitions. [2019-09-08 15:30:31,994 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 15:30:31,994 INFO L276 IsEmpty]: Start isEmpty. Operand 15069 states and 20380 transitions. [2019-09-08 15:30:32,018 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-09-08 15:30:32,018 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:30:32,018 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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-09-08 15:30:32,019 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:30:32,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:30:32,019 INFO L82 PathProgramCache]: Analyzing trace with hash 1539440769, now seen corresponding path program 1 times [2019-09-08 15:30:32,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:30:32,019 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:30:32,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:30:32,021 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:30:32,021 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:30:32,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:30:32,844 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 24 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 15:30:32,844 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:30:32,844 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 15:30:32,845 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 15:30:32,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 15:30:32,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:30:32,845 INFO L87 Difference]: Start difference. First operand 15069 states and 20380 transitions. Second operand 3 states. [2019-09-08 15:30:48,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:30:48,296 INFO L93 Difference]: Finished difference Result 32195 states and 43684 transitions. [2019-09-08 15:30:48,296 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 15:30:48,296 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 142 [2019-09-08 15:30:48,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:30:48,360 INFO L225 Difference]: With dead ends: 32195 [2019-09-08 15:30:48,361 INFO L226 Difference]: Without dead ends: 17137 [2019-09-08 15:30:48,393 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:30:48,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17137 states. [2019-09-08 15:30:49,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17137 to 17111. [2019-09-08 15:30:49,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17111 states. [2019-09-08 15:30:49,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17111 states to 17111 states and 23130 transitions. [2019-09-08 15:30:49,234 INFO L78 Accepts]: Start accepts. Automaton has 17111 states and 23130 transitions. Word has length 142 [2019-09-08 15:30:49,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:30:49,234 INFO L475 AbstractCegarLoop]: Abstraction has 17111 states and 23130 transitions. [2019-09-08 15:30:49,235 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 15:30:49,235 INFO L276 IsEmpty]: Start isEmpty. Operand 17111 states and 23130 transitions. [2019-09-08 15:30:49,243 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-09-08 15:30:49,243 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:30:49,244 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 15:30:49,244 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:30:49,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:30:49,245 INFO L82 PathProgramCache]: Analyzing trace with hash 553717706, now seen corresponding path program 1 times [2019-09-08 15:30:49,245 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:30:49,245 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:30:49,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:30:49,247 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:30:49,247 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:30:49,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:30:50,117 INFO L134 CoverageAnalysis]: Checked inductivity of 63 backedges. 33 proven. 0 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-09-08 15:30:50,117 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:30:50,117 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 15:30:50,118 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 15:30:50,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 15:30:50,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 15:30:50,119 INFO L87 Difference]: Start difference. First operand 17111 states and 23130 transitions. Second operand 5 states. [2019-09-08 15:31:01,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:31:01,598 INFO L93 Difference]: Finished difference Result 34211 states and 46249 transitions. [2019-09-08 15:31:01,598 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 15:31:01,599 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 141 [2019-09-08 15:31:01,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:31:01,662 INFO L225 Difference]: With dead ends: 34211 [2019-09-08 15:31:01,663 INFO L226 Difference]: Without dead ends: 17111 [2019-09-08 15:31:01,697 INFO L628 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-09-08 15:31:01,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17111 states. [2019-09-08 15:31:02,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17111 to 17111. [2019-09-08 15:31:02,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17111 states. [2019-09-08 15:31:02,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17111 states to 17111 states and 23126 transitions. [2019-09-08 15:31:02,259 INFO L78 Accepts]: Start accepts. Automaton has 17111 states and 23126 transitions. Word has length 141 [2019-09-08 15:31:02,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:31:02,259 INFO L475 AbstractCegarLoop]: Abstraction has 17111 states and 23126 transitions. [2019-09-08 15:31:02,260 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 15:31:02,260 INFO L276 IsEmpty]: Start isEmpty. Operand 17111 states and 23126 transitions. [2019-09-08 15:31:02,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-09-08 15:31:02,268 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:31:02,268 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 15:31:02,269 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:31:02,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:31:02,269 INFO L82 PathProgramCache]: Analyzing trace with hash 764482216, now seen corresponding path program 1 times [2019-09-08 15:31:02,269 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:31:02,269 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:31:02,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:31:02,271 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:31:02,271 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:31:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:31:02,940 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-08 15:31:02,941 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:31:02,941 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 15:31:02,942 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 15:31:02,942 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 15:31:02,942 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 15:31:02,942 INFO L87 Difference]: Start difference. First operand 17111 states and 23126 transitions. Second operand 5 states. [2019-09-08 15:31:15,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:31:15,001 INFO L93 Difference]: Finished difference Result 34211 states and 46241 transitions. [2019-09-08 15:31:15,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 15:31:15,002 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 140 [2019-09-08 15:31:15,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:31:15,059 INFO L225 Difference]: With dead ends: 34211 [2019-09-08 15:31:15,060 INFO L226 Difference]: Without dead ends: 17111 [2019-09-08 15:31:15,092 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-09-08 15:31:15,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17111 states. [2019-09-08 15:31:15,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17111 to 17111. [2019-09-08 15:31:15,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17111 states. [2019-09-08 15:31:15,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17111 states to 17111 states and 23122 transitions. [2019-09-08 15:31:15,673 INFO L78 Accepts]: Start accepts. Automaton has 17111 states and 23122 transitions. Word has length 140 [2019-09-08 15:31:15,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:31:15,674 INFO L475 AbstractCegarLoop]: Abstraction has 17111 states and 23122 transitions. [2019-09-08 15:31:15,674 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 15:31:15,674 INFO L276 IsEmpty]: Start isEmpty. Operand 17111 states and 23122 transitions. [2019-09-08 15:31:15,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-09-08 15:31:15,683 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:31:15,683 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 15:31:15,684 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:31:15,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:31:15,684 INFO L82 PathProgramCache]: Analyzing trace with hash -74080604, now seen corresponding path program 1 times [2019-09-08 15:31:15,684 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:31:15,684 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:31:15,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:31:15,686 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:31:15,686 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:31:16,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:31:16,360 INFO L134 CoverageAnalysis]: Checked inductivity of 57 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-09-08 15:31:16,360 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:31:16,361 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 15:31:16,361 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 15:31:16,361 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 15:31:16,362 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 15:31:16,362 INFO L87 Difference]: Start difference. First operand 17111 states and 23122 transitions. Second operand 5 states. [2019-09-08 15:31:28,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:31:28,380 INFO L93 Difference]: Finished difference Result 34211 states and 46233 transitions. [2019-09-08 15:31:28,380 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 15:31:28,381 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 137 [2019-09-08 15:31:28,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:31:28,441 INFO L225 Difference]: With dead ends: 34211 [2019-09-08 15:31:28,442 INFO L226 Difference]: Without dead ends: 17111 [2019-09-08 15:31:28,475 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-09-08 15:31:28,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17111 states. [2019-09-08 15:31:29,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17111 to 17111. [2019-09-08 15:31:29,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17111 states. [2019-09-08 15:31:29,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17111 states to 17111 states and 23118 transitions. [2019-09-08 15:31:29,175 INFO L78 Accepts]: Start accepts. Automaton has 17111 states and 23118 transitions. Word has length 137 [2019-09-08 15:31:29,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:31:29,176 INFO L475 AbstractCegarLoop]: Abstraction has 17111 states and 23118 transitions. [2019-09-08 15:31:29,176 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 15:31:29,176 INFO L276 IsEmpty]: Start isEmpty. Operand 17111 states and 23118 transitions. [2019-09-08 15:31:29,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-09-08 15:31:29,184 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:31:29,184 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 15:31:29,184 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:31:29,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:31:29,185 INFO L82 PathProgramCache]: Analyzing trace with hash 1095695836, now seen corresponding path program 1 times [2019-09-08 15:31:29,185 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:31:29,185 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:31:29,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:31:29,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:31:29,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:31:29,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:31:29,878 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2019-09-08 15:31:29,878 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:31:29,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 15:31:29,879 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 15:31:29,879 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 15:31:29,879 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 15:31:29,880 INFO L87 Difference]: Start difference. First operand 17111 states and 23118 transitions. Second operand 5 states. [2019-09-08 15:31:45,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:31:45,345 INFO L93 Difference]: Finished difference Result 34378 states and 46439 transitions. [2019-09-08 15:31:45,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 15:31:45,346 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 138 [2019-09-08 15:31:45,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:31:45,413 INFO L225 Difference]: With dead ends: 34378 [2019-09-08 15:31:45,413 INFO L226 Difference]: Without dead ends: 17198 [2019-09-08 15:31:45,444 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 15:31:45,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17198 states. [2019-09-08 15:31:45,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17198 to 17146. [2019-09-08 15:31:45,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17146 states. [2019-09-08 15:31:45,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17146 states to 17146 states and 23137 transitions. [2019-09-08 15:31:45,928 INFO L78 Accepts]: Start accepts. Automaton has 17146 states and 23137 transitions. Word has length 138 [2019-09-08 15:31:45,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:31:45,929 INFO L475 AbstractCegarLoop]: Abstraction has 17146 states and 23137 transitions. [2019-09-08 15:31:45,929 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 15:31:45,929 INFO L276 IsEmpty]: Start isEmpty. Operand 17146 states and 23137 transitions. [2019-09-08 15:31:45,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-09-08 15:31:45,938 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:31:45,939 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 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] [2019-09-08 15:31:45,939 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:31:45,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:31:45,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1555485911, now seen corresponding path program 1 times [2019-09-08 15:31:45,939 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:31:45,939 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:31:45,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:31:45,941 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:31:45,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:31:46,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:31:47,013 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2019-09-08 15:31:47,013 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:31:47,014 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-09-08 15:31:47,015 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 15:31:47,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 15:31:47,016 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-09-08 15:31:47,016 INFO L87 Difference]: Start difference. First operand 17146 states and 23137 transitions. Second operand 6 states. [2019-09-08 15:32:01,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:32:01,646 INFO L93 Difference]: Finished difference Result 27885 states and 37370 transitions. [2019-09-08 15:32:01,646 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 15:32:01,646 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 152 [2019-09-08 15:32:01,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:32:01,685 INFO L225 Difference]: With dead ends: 27885 [2019-09-08 15:32:01,685 INFO L226 Difference]: Without dead ends: 10550 [2019-09-08 15:32:01,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-09-08 15:32:01,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10550 states. [2019-09-08 15:32:01,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10550 to 7251. [2019-09-08 15:32:01,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7251 states. [2019-09-08 15:32:02,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7251 states to 7251 states and 9921 transitions. [2019-09-08 15:32:02,011 INFO L78 Accepts]: Start accepts. Automaton has 7251 states and 9921 transitions. Word has length 152 [2019-09-08 15:32:02,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:32:02,012 INFO L475 AbstractCegarLoop]: Abstraction has 7251 states and 9921 transitions. [2019-09-08 15:32:02,012 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 15:32:02,012 INFO L276 IsEmpty]: Start isEmpty. Operand 7251 states and 9921 transitions. [2019-09-08 15:32:02,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2019-09-08 15:32:02,017 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:32:02,017 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 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] [2019-09-08 15:32:02,017 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:32:02,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:32:02,018 INFO L82 PathProgramCache]: Analyzing trace with hash 1561788944, now seen corresponding path program 1 times [2019-09-08 15:32:02,018 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:32:02,018 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:32:02,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:32:02,020 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:32:02,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:32:02,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:32:02,862 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-09-08 15:32:02,863 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:32:02,863 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-09-08 15:32:02,864 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-09-08 15:32:02,865 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-09-08 15:32:02,865 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-09-08 15:32:02,865 INFO L87 Difference]: Start difference. First operand 7251 states and 9921 transitions. Second operand 7 states. [2019-09-08 15:32:03,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:32:03,131 INFO L93 Difference]: Finished difference Result 14582 states and 19951 transitions. [2019-09-08 15:32:03,132 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 15:32:03,132 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 175 [2019-09-08 15:32:03,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:32:03,155 INFO L225 Difference]: With dead ends: 14582 [2019-09-08 15:32:03,156 INFO L226 Difference]: Without dead ends: 7351 [2019-09-08 15:32:03,169 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-09-08 15:32:03,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7351 states. [2019-09-08 15:32:03,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7351 to 7259. [2019-09-08 15:32:03,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7259 states. [2019-09-08 15:32:03,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7259 states to 7259 states and 9923 transitions. [2019-09-08 15:32:03,418 INFO L78 Accepts]: Start accepts. Automaton has 7259 states and 9923 transitions. Word has length 175 [2019-09-08 15:32:03,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:32:03,418 INFO L475 AbstractCegarLoop]: Abstraction has 7259 states and 9923 transitions. [2019-09-08 15:32:03,419 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-09-08 15:32:03,419 INFO L276 IsEmpty]: Start isEmpty. Operand 7259 states and 9923 transitions. [2019-09-08 15:32:03,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2019-09-08 15:32:03,424 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:32:03,424 INFO L399 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 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] [2019-09-08 15:32:03,425 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:32:03,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:32:03,425 INFO L82 PathProgramCache]: Analyzing trace with hash 105817372, now seen corresponding path program 1 times [2019-09-08 15:32:03,425 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:32:03,425 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:32:03,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:32:03,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:32:03,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:32:03,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:32:04,282 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-09-08 15:32:04,283 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 15:32:04,283 INFO L223 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) [2019-09-08 15:32:04,312 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 15:32:17,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:32:17,882 INFO L256 TraceCheckSpWp]: Trace formula consists of 17184 conjuncts, 3 conjunts are in the unsatisfiable core [2019-09-08 15:32:17,937 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 15:32:18,093 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2019-09-08 15:32:18,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 15:32:18,256 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [4] total 5 [2019-09-08 15:32:18,260 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 15:32:18,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 15:32:18,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 15:32:18,261 INFO L87 Difference]: Start difference. First operand 7259 states and 9923 transitions. Second operand 5 states. [2019-09-08 15:32:35,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:32:35,693 INFO L93 Difference]: Finished difference Result 22505 states and 30729 transitions. [2019-09-08 15:32:35,693 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 15:32:35,694 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 203 [2019-09-08 15:32:35,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:32:35,796 INFO L225 Difference]: With dead ends: 22505 [2019-09-08 15:32:35,796 INFO L226 Difference]: Without dead ends: 22481 [2019-09-08 15:32:35,805 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-09-08 15:32:35,832 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22481 states. [2019-09-08 15:32:36,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22481 to 22374. [2019-09-08 15:32:36,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22374 states. [2019-09-08 15:32:36,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22374 states to 22374 states and 30586 transitions. [2019-09-08 15:32:36,983 INFO L78 Accepts]: Start accepts. Automaton has 22374 states and 30586 transitions. Word has length 203 [2019-09-08 15:32:36,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:32:36,984 INFO L475 AbstractCegarLoop]: Abstraction has 22374 states and 30586 transitions. [2019-09-08 15:32:36,984 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 15:32:36,984 INFO L276 IsEmpty]: Start isEmpty. Operand 22374 states and 30586 transitions. [2019-09-08 15:32:36,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 215 [2019-09-08 15:32:36,999 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:32:36,999 INFO L399 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 15:32:37,000 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:32:37,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:32:37,000 INFO L82 PathProgramCache]: Analyzing trace with hash -488667532, now seen corresponding path program 1 times [2019-09-08 15:32:37,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:32:37,000 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:32:37,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:32:37,002 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:32:37,003 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:32:37,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:32:37,894 INFO L134 CoverageAnalysis]: Checked inductivity of 92 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 75 trivial. 0 not checked. [2019-09-08 15:32:37,895 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:32:37,895 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 15:32:37,895 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 15:32:37,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 15:32:37,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:32:37,896 INFO L87 Difference]: Start difference. First operand 22374 states and 30586 transitions. Second operand 3 states. [2019-09-08 15:32:55,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:32:55,973 INFO L93 Difference]: Finished difference Result 43500 states and 59658 transitions. [2019-09-08 15:32:55,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 15:32:55,973 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 214 [2019-09-08 15:32:55,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:32:56,038 INFO L225 Difference]: With dead ends: 43500 [2019-09-08 15:32:56,038 INFO L226 Difference]: Without dead ends: 21092 [2019-09-08 15:32:56,094 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:32:56,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21092 states. [2019-09-08 15:32:57,104 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21092 to 20949. [2019-09-08 15:32:57,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20949 states. [2019-09-08 15:32:57,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20949 states to 20949 states and 28601 transitions. [2019-09-08 15:32:57,146 INFO L78 Accepts]: Start accepts. Automaton has 20949 states and 28601 transitions. Word has length 214 [2019-09-08 15:32:57,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:32:57,147 INFO L475 AbstractCegarLoop]: Abstraction has 20949 states and 28601 transitions. [2019-09-08 15:32:57,147 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 15:32:57,147 INFO L276 IsEmpty]: Start isEmpty. Operand 20949 states and 28601 transitions. [2019-09-08 15:32:57,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-09-08 15:32:57,155 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:32:57,155 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 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] [2019-09-08 15:32:57,156 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:32:57,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:32:57,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1635014853, now seen corresponding path program 1 times [2019-09-08 15:32:57,156 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:32:57,156 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:32:57,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:32:57,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:32:57,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:32:57,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:32:58,036 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2019-09-08 15:32:58,037 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:32:58,037 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 15:32:58,038 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 15:32:58,039 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 15:32:58,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:32:58,040 INFO L87 Difference]: Start difference. First operand 20949 states and 28601 transitions. Second operand 3 states. [2019-09-08 15:33:14,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:33:14,077 INFO L93 Difference]: Finished difference Result 41207 states and 56303 transitions. [2019-09-08 15:33:14,077 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 15:33:14,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2019-09-08 15:33:14,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:33:14,144 INFO L225 Difference]: With dead ends: 41207 [2019-09-08 15:33:14,144 INFO L226 Difference]: Without dead ends: 19878 [2019-09-08 15:33:14,202 INFO L628 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-09-08 15:33:14,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19878 states. [2019-09-08 15:33:14,958 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19878 to 19626. [2019-09-08 15:33:14,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19626 states. [2019-09-08 15:33:15,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19626 states to 19626 states and 26732 transitions. [2019-09-08 15:33:15,033 INFO L78 Accepts]: Start accepts. Automaton has 19626 states and 26732 transitions. Word has length 227 [2019-09-08 15:33:15,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:33:15,037 INFO L475 AbstractCegarLoop]: Abstraction has 19626 states and 26732 transitions. [2019-09-08 15:33:15,037 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 15:33:15,037 INFO L276 IsEmpty]: Start isEmpty. Operand 19626 states and 26732 transitions. [2019-09-08 15:33:15,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 224 [2019-09-08 15:33:15,046 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:33:15,046 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 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] [2019-09-08 15:33:15,047 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:33:15,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:33:15,047 INFO L82 PathProgramCache]: Analyzing trace with hash 985704708, now seen corresponding path program 1 times [2019-09-08 15:33:15,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:33:15,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:33:15,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:33:15,049 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:33:15,049 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:33:15,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:33:16,161 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 38 proven. 0 refuted. 0 times theorem prover too weak. 81 trivial. 0 not checked. [2019-09-08 15:33:16,161 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:33:16,161 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 15:33:16,162 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 15:33:16,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 15:33:16,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:33:16,167 INFO L87 Difference]: Start difference. First operand 19626 states and 26732 transitions. Second operand 3 states. [2019-09-08 15:33:32,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:33:32,018 INFO L93 Difference]: Finished difference Result 40985 states and 56082 transitions. [2019-09-08 15:33:32,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 15:33:32,019 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 223 [2019-09-08 15:33:32,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:33:32,086 INFO L225 Difference]: With dead ends: 40985 [2019-09-08 15:33:32,086 INFO L226 Difference]: Without dead ends: 22052 [2019-09-08 15:33:32,123 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:33:32,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22052 states. [2019-09-08 15:33:32,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22052 to 22021. [2019-09-08 15:33:32,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22021 states. [2019-09-08 15:33:32,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22021 states to 22021 states and 29986 transitions. [2019-09-08 15:33:32,925 INFO L78 Accepts]: Start accepts. Automaton has 22021 states and 29986 transitions. Word has length 223 [2019-09-08 15:33:32,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:33:32,926 INFO L475 AbstractCegarLoop]: Abstraction has 22021 states and 29986 transitions. [2019-09-08 15:33:32,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 15:33:32,926 INFO L276 IsEmpty]: Start isEmpty. Operand 22021 states and 29986 transitions. [2019-09-08 15:33:32,935 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 228 [2019-09-08 15:33:32,935 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:33:32,936 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 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, 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] [2019-09-08 15:33:32,936 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:33:32,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:33:32,937 INFO L82 PathProgramCache]: Analyzing trace with hash 549858581, now seen corresponding path program 1 times [2019-09-08 15:33:32,937 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:33:32,937 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:33:32,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:33:32,939 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:33:32,939 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:33:33,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:33:33,702 INFO L134 CoverageAnalysis]: Checked inductivity of 124 backedges. 40 proven. 0 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2019-09-08 15:33:33,702 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:33:33,702 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 15:33:33,703 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 15:33:33,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 15:33:33,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:33:33,704 INFO L87 Difference]: Start difference. First operand 22021 states and 29986 transitions. Second operand 3 states. [2019-09-08 15:33:49,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:33:49,851 INFO L93 Difference]: Finished difference Result 45775 states and 62590 transitions. [2019-09-08 15:33:49,851 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 15:33:49,852 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 227 [2019-09-08 15:33:49,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:33:49,910 INFO L225 Difference]: With dead ends: 45775 [2019-09-08 15:33:49,910 INFO L226 Difference]: Without dead ends: 24447 [2019-09-08 15:33:49,941 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:33:49,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24447 states. [2019-09-08 15:33:50,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24447 to 24416. [2019-09-08 15:33:50,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24416 states. [2019-09-08 15:33:50,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24416 states to 24416 states and 33240 transitions. [2019-09-08 15:33:50,598 INFO L78 Accepts]: Start accepts. Automaton has 24416 states and 33240 transitions. Word has length 227 [2019-09-08 15:33:50,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:33:50,599 INFO L475 AbstractCegarLoop]: Abstraction has 24416 states and 33240 transitions. [2019-09-08 15:33:50,599 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 15:33:50,599 INFO L276 IsEmpty]: Start isEmpty. Operand 24416 states and 33240 transitions. [2019-09-08 15:33:50,608 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 229 [2019-09-08 15:33:50,608 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:33:50,609 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 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] [2019-09-08 15:33:50,609 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:33:50,609 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:33:50,609 INFO L82 PathProgramCache]: Analyzing trace with hash -1529303101, now seen corresponding path program 1 times [2019-09-08 15:33:50,609 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:33:50,610 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:33:50,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:33:50,611 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:33:50,611 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:33:50,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:33:51,338 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 85 trivial. 0 not checked. [2019-09-08 15:33:51,338 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:33:51,338 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 15:33:51,339 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 15:33:51,339 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 15:33:51,339 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:33:51,339 INFO L87 Difference]: Start difference. First operand 24416 states and 33240 transitions. Second operand 3 states. [2019-09-08 15:34:07,974 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:34:07,974 INFO L93 Difference]: Finished difference Result 50565 states and 69098 transitions. [2019-09-08 15:34:07,974 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 15:34:07,974 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 228 [2019-09-08 15:34:07,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:34:08,048 INFO L225 Difference]: With dead ends: 50565 [2019-09-08 15:34:08,049 INFO L226 Difference]: Without dead ends: 26842 [2019-09-08 15:34:08,081 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:34:08,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26842 states. [2019-09-08 15:34:08,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26842 to 26811. [2019-09-08 15:34:08,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26811 states. [2019-09-08 15:34:08,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26811 states to 26811 states and 36494 transitions. [2019-09-08 15:34:08,723 INFO L78 Accepts]: Start accepts. Automaton has 26811 states and 36494 transitions. Word has length 228 [2019-09-08 15:34:08,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:34:08,723 INFO L475 AbstractCegarLoop]: Abstraction has 26811 states and 36494 transitions. [2019-09-08 15:34:08,723 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 15:34:08,724 INFO L276 IsEmpty]: Start isEmpty. Operand 26811 states and 36494 transitions. [2019-09-08 15:34:08,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-08 15:34:08,731 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:34:08,732 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 4, 4, 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] [2019-09-08 15:34:08,732 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:34:08,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:34:08,732 INFO L82 PathProgramCache]: Analyzing trace with hash -563770592, now seen corresponding path program 1 times [2019-09-08 15:34:08,732 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:34:08,732 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:34:08,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:34:08,734 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:34:08,734 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:34:08,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:34:09,328 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-09-08 15:34:09,329 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:34:09,329 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 15:34:09,330 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 15:34:09,330 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 15:34:09,330 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:34:09,330 INFO L87 Difference]: Start difference. First operand 26811 states and 36494 transitions. Second operand 3 states. [2019-09-08 15:34:26,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:34:26,789 INFO L93 Difference]: Finished difference Result 55355 states and 75606 transitions. [2019-09-08 15:34:26,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 15:34:26,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2019-09-08 15:34:26,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:34:26,844 INFO L225 Difference]: With dead ends: 55355 [2019-09-08 15:34:26,845 INFO L226 Difference]: Without dead ends: 29237 [2019-09-08 15:34:26,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:34:26,895 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29237 states. [2019-09-08 15:34:27,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29237 to 29206. [2019-09-08 15:34:27,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29206 states. [2019-09-08 15:34:27,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29206 states to 29206 states and 39748 transitions. [2019-09-08 15:34:27,544 INFO L78 Accepts]: Start accepts. Automaton has 29206 states and 39748 transitions. Word has length 230 [2019-09-08 15:34:27,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:34:27,545 INFO L475 AbstractCegarLoop]: Abstraction has 29206 states and 39748 transitions. [2019-09-08 15:34:27,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 15:34:27,545 INFO L276 IsEmpty]: Start isEmpty. Operand 29206 states and 39748 transitions. [2019-09-08 15:34:27,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 231 [2019-09-08 15:34:27,557 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:34:27,557 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 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, 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] [2019-09-08 15:34:27,557 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:34:27,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:34:27,558 INFO L82 PathProgramCache]: Analyzing trace with hash 1037507831, now seen corresponding path program 1 times [2019-09-08 15:34:27,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:34:27,558 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:34:27,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:34:27,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:34:27,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:34:27,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:34:28,184 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 37 proven. 0 refuted. 0 times theorem prover too weak. 83 trivial. 0 not checked. [2019-09-08 15:34:28,185 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:34:28,185 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 15:34:28,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 15:34:28,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 15:34:28,186 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:34:28,186 INFO L87 Difference]: Start difference. First operand 29206 states and 39748 transitions. Second operand 3 states. [2019-09-08 15:34:44,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:34:44,734 INFO L93 Difference]: Finished difference Result 60145 states and 82114 transitions. [2019-09-08 15:34:44,735 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 15:34:44,735 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 230 [2019-09-08 15:34:44,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:34:44,809 INFO L225 Difference]: With dead ends: 60145 [2019-09-08 15:34:44,809 INFO L226 Difference]: Without dead ends: 31632 [2019-09-08 15:34:44,853 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:34:44,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31632 states. [2019-09-08 15:34:45,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31632 to 31601. [2019-09-08 15:34:45,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31601 states. [2019-09-08 15:34:45,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31601 states to 31601 states and 43002 transitions. [2019-09-08 15:34:45,939 INFO L78 Accepts]: Start accepts. Automaton has 31601 states and 43002 transitions. Word has length 230 [2019-09-08 15:34:45,940 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:34:45,940 INFO L475 AbstractCegarLoop]: Abstraction has 31601 states and 43002 transitions. [2019-09-08 15:34:45,940 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 15:34:45,940 INFO L276 IsEmpty]: Start isEmpty. Operand 31601 states and 43002 transitions. [2019-09-08 15:34:45,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 235 [2019-09-08 15:34:45,947 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:34:45,948 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 15:34:45,948 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:34:45,948 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:34:45,948 INFO L82 PathProgramCache]: Analyzing trace with hash 1646771063, now seen corresponding path program 1 times [2019-09-08 15:34:45,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:34:45,949 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:34:45,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:34:45,950 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:34:45,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:34:46,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:34:46,528 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 35 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-09-08 15:34:46,529 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:34:46,529 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 15:34:46,529 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 15:34:46,529 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 15:34:46,530 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:34:46,530 INFO L87 Difference]: Start difference. First operand 31601 states and 43002 transitions. Second operand 3 states. [2019-09-08 15:35:02,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:35:02,396 INFO L93 Difference]: Finished difference Result 64935 states and 88622 transitions. [2019-09-08 15:35:02,396 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 15:35:02,396 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 234 [2019-09-08 15:35:02,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:35:02,480 INFO L225 Difference]: With dead ends: 64935 [2019-09-08 15:35:02,480 INFO L226 Difference]: Without dead ends: 34027 [2019-09-08 15:35:02,527 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:35:02,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34027 states. [2019-09-08 15:35:03,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34027 to 33996. [2019-09-08 15:35:03,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33996 states. [2019-09-08 15:35:03,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33996 states to 33996 states and 46256 transitions. [2019-09-08 15:35:03,732 INFO L78 Accepts]: Start accepts. Automaton has 33996 states and 46256 transitions. Word has length 234 [2019-09-08 15:35:03,733 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:35:03,733 INFO L475 AbstractCegarLoop]: Abstraction has 33996 states and 46256 transitions. [2019-09-08 15:35:03,733 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 15:35:03,733 INFO L276 IsEmpty]: Start isEmpty. Operand 33996 states and 46256 transitions. [2019-09-08 15:35:03,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 246 [2019-09-08 15:35:03,741 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:35:03,741 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 15:35:03,742 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:35:03,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:35:03,742 INFO L82 PathProgramCache]: Analyzing trace with hash -270423060, now seen corresponding path program 1 times [2019-09-08 15:35:03,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:35:03,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:35:03,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:35:03,744 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:35:03,744 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:35:03,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:35:04,377 INFO L134 CoverageAnalysis]: Checked inductivity of 173 backedges. 53 proven. 0 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2019-09-08 15:35:04,377 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:35:04,377 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 15:35:04,378 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 15:35:04,378 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 15:35:04,378 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:35:04,378 INFO L87 Difference]: Start difference. First operand 33996 states and 46256 transitions. Second operand 3 states. [2019-09-08 15:35:22,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:35:22,154 INFO L93 Difference]: Finished difference Result 69868 states and 95279 transitions. [2019-09-08 15:35:22,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 15:35:22,154 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 245 [2019-09-08 15:35:22,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:35:22,242 INFO L225 Difference]: With dead ends: 69868 [2019-09-08 15:35:22,242 INFO L226 Difference]: Without dead ends: 36565 [2019-09-08 15:35:22,286 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:35:22,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36565 states. [2019-09-08 15:35:23,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36565 to 36013. [2019-09-08 15:35:23,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36013 states. [2019-09-08 15:35:23,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36013 states to 36013 states and 48906 transitions. [2019-09-08 15:35:23,451 INFO L78 Accepts]: Start accepts. Automaton has 36013 states and 48906 transitions. Word has length 245 [2019-09-08 15:35:23,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:35:23,452 INFO L475 AbstractCegarLoop]: Abstraction has 36013 states and 48906 transitions. [2019-09-08 15:35:23,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 15:35:23,452 INFO L276 IsEmpty]: Start isEmpty. Operand 36013 states and 48906 transitions. [2019-09-08 15:35:23,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 251 [2019-09-08 15:35:23,461 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:35:23,461 INFO L399 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 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] [2019-09-08 15:35:23,461 INFO L418 AbstractCegarLoop]: === Iteration 31 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:35:23,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:35:23,462 INFO L82 PathProgramCache]: Analyzing trace with hash 666451453, now seen corresponding path program 1 times [2019-09-08 15:35:23,462 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:35:23,462 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:35:23,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:35:23,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:35:23,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:35:23,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:35:24,028 INFO L134 CoverageAnalysis]: Checked inductivity of 75 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2019-09-08 15:35:24,028 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:35:24,029 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 15:35:24,029 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 15:35:24,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 15:35:24,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:35:24,030 INFO L87 Difference]: Start difference. First operand 36013 states and 48906 transitions. Second operand 3 states. [2019-09-08 15:35:40,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:35:40,109 INFO L93 Difference]: Finished difference Result 75100 states and 102062 transitions. [2019-09-08 15:35:40,109 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 15:35:40,110 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 250 [2019-09-08 15:35:40,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:35:40,188 INFO L225 Difference]: With dead ends: 75100 [2019-09-08 15:35:40,188 INFO L226 Difference]: Without dead ends: 39242 [2019-09-08 15:35:40,233 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:35:40,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39242 states. [2019-09-08 15:35:41,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39242 to 39122. [2019-09-08 15:35:41,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39122 states. [2019-09-08 15:35:41,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39122 states to 39122 states and 52946 transitions. [2019-09-08 15:35:41,559 INFO L78 Accepts]: Start accepts. Automaton has 39122 states and 52946 transitions. Word has length 250 [2019-09-08 15:35:41,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:35:41,560 INFO L475 AbstractCegarLoop]: Abstraction has 39122 states and 52946 transitions. [2019-09-08 15:35:41,560 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 15:35:41,560 INFO L276 IsEmpty]: Start isEmpty. Operand 39122 states and 52946 transitions. [2019-09-08 15:35:41,567 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 253 [2019-09-08 15:35:41,567 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:35:41,568 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 15:35:41,568 INFO L418 AbstractCegarLoop]: === Iteration 32 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:35:41,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:35:41,568 INFO L82 PathProgramCache]: Analyzing trace with hash -581444337, now seen corresponding path program 1 times [2019-09-08 15:35:41,568 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:35:41,569 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:35:41,569 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:35:41,570 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:35:41,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:35:41,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:35:42,169 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 60 proven. 11 refuted. 0 times theorem prover too weak. 106 trivial. 0 not checked. [2019-09-08 15:35:42,170 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 15:35:42,170 INFO L223 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-09-08 15:35:42,185 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:35:56,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:35:57,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 17329 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 15:35:57,297 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 15:35:57,359 INFO L134 CoverageAnalysis]: Checked inductivity of 177 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-09-08 15:35:57,480 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 15:35:57,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-09-08 15:35:57,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 15:35:57,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 15:35:57,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 15:35:57,481 INFO L87 Difference]: Start difference. First operand 39122 states and 52946 transitions. Second operand 6 states. [2019-09-08 15:36:15,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:36:15,934 INFO L93 Difference]: Finished difference Result 84925 states and 116114 transitions. [2019-09-08 15:36:15,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 15:36:15,935 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 252 [2019-09-08 15:36:15,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:36:16,045 INFO L225 Difference]: With dead ends: 84925 [2019-09-08 15:36:16,045 INFO L226 Difference]: Without dead ends: 46469 [2019-09-08 15:36:16,107 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 266 GetRequests, 258 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-09-08 15:36:16,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46469 states. [2019-09-08 15:36:17,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46469 to 41677. [2019-09-08 15:36:17,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41677 states. [2019-09-08 15:36:17,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41677 states to 41677 states and 56356 transitions. [2019-09-08 15:36:17,701 INFO L78 Accepts]: Start accepts. Automaton has 41677 states and 56356 transitions. Word has length 252 [2019-09-08 15:36:17,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:36:17,702 INFO L475 AbstractCegarLoop]: Abstraction has 41677 states and 56356 transitions. [2019-09-08 15:36:17,702 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 15:36:17,702 INFO L276 IsEmpty]: Start isEmpty. Operand 41677 states and 56356 transitions. [2019-09-08 15:36:17,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 273 [2019-09-08 15:36:17,714 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:36:17,715 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 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] [2019-09-08 15:36:17,715 INFO L418 AbstractCegarLoop]: === Iteration 33 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:36:17,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:36:17,715 INFO L82 PathProgramCache]: Analyzing trace with hash -740394155, now seen corresponding path program 1 times [2019-09-08 15:36:17,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:36:17,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:36:17,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:36:17,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:36:17,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:36:18,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:36:18,446 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 87 trivial. 0 not checked. [2019-09-08 15:36:18,446 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:36:18,447 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 15:36:18,447 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 15:36:18,447 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 15:36:18,448 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:36:18,448 INFO L87 Difference]: Start difference. First operand 41677 states and 56356 transitions. Second operand 3 states. [2019-09-08 15:36:19,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:36:19,226 INFO L93 Difference]: Finished difference Result 83060 states and 112469 transitions. [2019-09-08 15:36:19,226 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 15:36:19,226 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 272 [2019-09-08 15:36:19,227 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:36:19,321 INFO L225 Difference]: With dead ends: 83060 [2019-09-08 15:36:19,321 INFO L226 Difference]: Without dead ends: 42049 [2019-09-08 15:36:19,376 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:36:19,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42049 states. [2019-09-08 15:36:20,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42049 to 41739. [2019-09-08 15:36:20,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41739 states. [2019-09-08 15:36:20,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41739 states to 41739 states and 56418 transitions. [2019-09-08 15:36:20,849 INFO L78 Accepts]: Start accepts. Automaton has 41739 states and 56418 transitions. Word has length 272 [2019-09-08 15:36:20,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:36:20,850 INFO L475 AbstractCegarLoop]: Abstraction has 41739 states and 56418 transitions. [2019-09-08 15:36:20,850 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 15:36:20,850 INFO L276 IsEmpty]: Start isEmpty. Operand 41739 states and 56418 transitions. [2019-09-08 15:36:20,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 277 [2019-09-08 15:36:20,863 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:36:20,864 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 4, 3, 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] [2019-09-08 15:36:20,864 INFO L418 AbstractCegarLoop]: === Iteration 34 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:36:20,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:36:20,865 INFO L82 PathProgramCache]: Analyzing trace with hash -1615564771, now seen corresponding path program 1 times [2019-09-08 15:36:20,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:36:20,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:36:20,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:36:20,867 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:36:20,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:36:21,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:36:21,643 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 94 trivial. 0 not checked. [2019-09-08 15:36:21,644 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:36:21,644 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 15:36:21,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 15:36:21,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 15:36:21,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 15:36:21,645 INFO L87 Difference]: Start difference. First operand 41739 states and 56418 transitions. Second operand 5 states. [2019-09-08 15:36:22,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:36:22,488 INFO L93 Difference]: Finished difference Result 83988 states and 114781 transitions. [2019-09-08 15:36:22,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 15:36:22,489 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 276 [2019-09-08 15:36:22,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:36:22,627 INFO L225 Difference]: With dead ends: 83988 [2019-09-08 15:36:22,627 INFO L226 Difference]: Without dead ends: 42404 [2019-09-08 15:36:22,706 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 15:36:22,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42404 states. [2019-09-08 15:36:24,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42404 to 42119. [2019-09-08 15:36:24,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42119 states. [2019-09-08 15:36:24,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42119 states to 42119 states and 57463 transitions. [2019-09-08 15:36:24,257 INFO L78 Accepts]: Start accepts. Automaton has 42119 states and 57463 transitions. Word has length 276 [2019-09-08 15:36:24,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:36:24,258 INFO L475 AbstractCegarLoop]: Abstraction has 42119 states and 57463 transitions. [2019-09-08 15:36:24,258 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 15:36:24,258 INFO L276 IsEmpty]: Start isEmpty. Operand 42119 states and 57463 transitions. [2019-09-08 15:36:24,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 279 [2019-09-08 15:36:24,271 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:36:24,272 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 4, 3, 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] [2019-09-08 15:36:24,272 INFO L418 AbstractCegarLoop]: === Iteration 35 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:36:24,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:36:24,272 INFO L82 PathProgramCache]: Analyzing trace with hash -340969279, now seen corresponding path program 1 times [2019-09-08 15:36:24,272 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:36:24,272 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:36:24,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:36:24,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:36:24,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:36:24,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:36:25,054 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 95 trivial. 0 not checked. [2019-09-08 15:36:25,055 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:36:25,055 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-09-08 15:36:25,055 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-09-08 15:36:25,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-09-08 15:36:25,056 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 15:36:25,056 INFO L87 Difference]: Start difference. First operand 42119 states and 57463 transitions. Second operand 4 states. [2019-09-08 15:36:26,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:36:26,366 INFO L93 Difference]: Finished difference Result 85793 states and 120481 transitions. [2019-09-08 15:36:26,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-09-08 15:36:26,367 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 278 [2019-09-08 15:36:26,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:36:26,463 INFO L225 Difference]: With dead ends: 85793 [2019-09-08 15:36:26,463 INFO L226 Difference]: Without dead ends: 43829 [2019-09-08 15:36:26,525 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-09-08 15:36:26,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43829 states. [2019-09-08 15:36:27,460 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43829 to 42784. [2019-09-08 15:36:27,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42784 states. [2019-09-08 15:36:27,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42784 states to 42784 states and 58318 transitions. [2019-09-08 15:36:27,557 INFO L78 Accepts]: Start accepts. Automaton has 42784 states and 58318 transitions. Word has length 278 [2019-09-08 15:36:27,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:36:27,558 INFO L475 AbstractCegarLoop]: Abstraction has 42784 states and 58318 transitions. [2019-09-08 15:36:27,558 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-09-08 15:36:27,558 INFO L276 IsEmpty]: Start isEmpty. Operand 42784 states and 58318 transitions. [2019-09-08 15:36:27,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-09-08 15:36:27,570 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:36:27,571 INFO L399 BasicCegarLoop]: trace histogram [6, 6, 6, 4, 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] [2019-09-08 15:36:27,571 INFO L418 AbstractCegarLoop]: === Iteration 36 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:36:27,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:36:27,571 INFO L82 PathProgramCache]: Analyzing trace with hash 1223661893, now seen corresponding path program 1 times [2019-09-08 15:36:27,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:36:27,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:36:27,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:36:27,573 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:36:27,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:36:27,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:36:28,269 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 79 trivial. 0 not checked. [2019-09-08 15:36:28,270 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:36:28,270 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 15:36:28,270 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 15:36:28,270 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 15:36:28,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 15:36:28,271 INFO L87 Difference]: Start difference. First operand 42784 states and 58318 transitions. Second operand 5 states. [2019-09-08 15:36:45,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:36:45,594 INFO L93 Difference]: Finished difference Result 116720 states and 158693 transitions. [2019-09-08 15:36:45,595 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-09-08 15:36:45,595 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 277 [2019-09-08 15:36:45,595 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:36:45,777 INFO L225 Difference]: With dead ends: 116720 [2019-09-08 15:36:45,777 INFO L226 Difference]: Without dead ends: 74624 [2019-09-08 15:36:45,846 INFO L628 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-09-08 15:36:45,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74624 states. [2019-09-08 15:36:47,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74624 to 43160. [2019-09-08 15:36:47,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43160 states. [2019-09-08 15:36:47,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43160 states to 43160 states and 58694 transitions. [2019-09-08 15:36:47,752 INFO L78 Accepts]: Start accepts. Automaton has 43160 states and 58694 transitions. Word has length 277 [2019-09-08 15:36:47,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:36:47,752 INFO L475 AbstractCegarLoop]: Abstraction has 43160 states and 58694 transitions. [2019-09-08 15:36:47,753 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 15:36:47,753 INFO L276 IsEmpty]: Start isEmpty. Operand 43160 states and 58694 transitions. [2019-09-08 15:36:47,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 278 [2019-09-08 15:36:47,759 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:36:47,759 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 15:36:47,759 INFO L418 AbstractCegarLoop]: === Iteration 37 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:36:47,760 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:36:47,760 INFO L82 PathProgramCache]: Analyzing trace with hash 930742998, now seen corresponding path program 1 times [2019-09-08 15:36:47,760 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:36:47,760 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:36:47,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:36:47,761 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:36:47,761 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:36:47,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:36:48,446 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 112 proven. 31 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-09-08 15:36:48,447 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 15:36:48,447 INFO L223 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-09-08 15:36:48,466 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:37:03,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:37:04,301 INFO L256 TraceCheckSpWp]: Trace formula consists of 17391 conjuncts, 2 conjunts are in the unsatisfiable core [2019-09-08 15:37:04,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 15:37:04,399 INFO L134 CoverageAnalysis]: Checked inductivity of 246 backedges. 143 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-09-08 15:37:04,543 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-09-08 15:37:04,543 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 6 [2019-09-08 15:37:04,543 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 15:37:04,544 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 15:37:04,544 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 15:37:04,544 INFO L87 Difference]: Start difference. First operand 43160 states and 58694 transitions. Second operand 6 states. [2019-09-08 15:37:21,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:37:21,321 INFO L93 Difference]: Finished difference Result 74492 states and 102244 transitions. [2019-09-08 15:37:21,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-09-08 15:37:21,321 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 277 [2019-09-08 15:37:21,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:37:21,397 INFO L225 Difference]: With dead ends: 74492 [2019-09-08 15:37:21,397 INFO L226 Difference]: Without dead ends: 32024 [2019-09-08 15:37:21,470 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 291 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2019-09-08 15:37:21,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32024 states. [2019-09-08 15:37:22,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32024 to 28307. [2019-09-08 15:37:22,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28307 states. [2019-09-08 15:37:22,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28307 states to 28307 states and 38364 transitions. [2019-09-08 15:37:22,780 INFO L78 Accepts]: Start accepts. Automaton has 28307 states and 38364 transitions. Word has length 277 [2019-09-08 15:37:22,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:37:22,781 INFO L475 AbstractCegarLoop]: Abstraction has 28307 states and 38364 transitions. [2019-09-08 15:37:22,781 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 15:37:22,781 INFO L276 IsEmpty]: Start isEmpty. Operand 28307 states and 38364 transitions. [2019-09-08 15:37:22,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 303 [2019-09-08 15:37:22,789 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:37:22,789 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 4, 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, 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] [2019-09-08 15:37:22,789 INFO L418 AbstractCegarLoop]: === Iteration 38 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:37:22,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:37:22,789 INFO L82 PathProgramCache]: Analyzing trace with hash 347128710, now seen corresponding path program 1 times [2019-09-08 15:37:22,789 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:37:22,790 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:37:22,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:37:22,791 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:37:22,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:37:23,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:37:23,372 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2019-09-08 15:37:23,373 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 15:37:23,373 INFO L223 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-09-08 15:37:23,385 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:37:36,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:37:36,762 INFO L256 TraceCheckSpWp]: Trace formula consists of 17635 conjuncts, 4 conjunts are in the unsatisfiable core [2019-09-08 15:37:36,780 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 15:37:36,839 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 25 proven. 6 refuted. 0 times theorem prover too weak. 89 trivial. 0 not checked. [2019-09-08 15:37:37,009 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 15:37:37,009 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2019-09-08 15:37:37,013 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 15:37:37,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 15:37:37,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 15:37:37,014 INFO L87 Difference]: Start difference. First operand 28307 states and 38364 transitions. Second operand 5 states. [2019-09-08 15:37:38,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:37:38,386 INFO L93 Difference]: Finished difference Result 57824 states and 81034 transitions. [2019-09-08 15:37:38,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 15:37:38,386 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 302 [2019-09-08 15:37:38,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:37:38,460 INFO L225 Difference]: With dead ends: 57824 [2019-09-08 15:37:38,460 INFO L226 Difference]: Without dead ends: 29672 [2019-09-08 15:37:38,503 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 306 GetRequests, 303 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-09-08 15:37:38,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29672 states. [2019-09-08 15:37:39,250 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29672 to 28762. [2019-09-08 15:37:39,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28762 states. [2019-09-08 15:37:39,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28762 states to 28762 states and 38949 transitions. [2019-09-08 15:37:39,315 INFO L78 Accepts]: Start accepts. Automaton has 28762 states and 38949 transitions. Word has length 302 [2019-09-08 15:37:39,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:37:39,315 INFO L475 AbstractCegarLoop]: Abstraction has 28762 states and 38949 transitions. [2019-09-08 15:37:39,315 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 15:37:39,315 INFO L276 IsEmpty]: Start isEmpty. Operand 28762 states and 38949 transitions. [2019-09-08 15:37:39,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 311 [2019-09-08 15:37:39,322 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:37:39,322 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 4, 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, 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] [2019-09-08 15:37:39,322 INFO L418 AbstractCegarLoop]: === Iteration 39 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:37:39,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:37:39,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1836791126, now seen corresponding path program 1 times [2019-09-08 15:37:39,322 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:37:39,322 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:37:39,323 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:37:39,323 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:37:39,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:37:39,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:37:39,990 INFO L134 CoverageAnalysis]: Checked inductivity of 122 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 118 trivial. 0 not checked. [2019-09-08 15:37:39,990 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:37:39,991 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 15:37:39,991 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 15:37:39,991 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 15:37:39,992 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 15:37:39,992 INFO L87 Difference]: Start difference. First operand 28762 states and 38949 transitions. Second operand 5 states. [2019-09-08 15:37:41,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:37:41,043 INFO L93 Difference]: Finished difference Result 57694 states and 78499 transitions. [2019-09-08 15:37:41,044 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 15:37:41,044 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 310 [2019-09-08 15:37:41,044 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:37:41,108 INFO L225 Difference]: With dead ends: 57694 [2019-09-08 15:37:41,109 INFO L226 Difference]: Without dead ends: 29087 [2019-09-08 15:37:41,148 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 15:37:41,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29087 states. [2019-09-08 15:37:41,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29087 to 28892. [2019-09-08 15:37:41,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28892 states. [2019-09-08 15:37:41,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28892 states to 28892 states and 39079 transitions. [2019-09-08 15:37:41,928 INFO L78 Accepts]: Start accepts. Automaton has 28892 states and 39079 transitions. Word has length 310 [2019-09-08 15:37:41,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:37:41,928 INFO L475 AbstractCegarLoop]: Abstraction has 28892 states and 39079 transitions. [2019-09-08 15:37:41,928 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 15:37:41,928 INFO L276 IsEmpty]: Start isEmpty. Operand 28892 states and 39079 transitions. [2019-09-08 15:37:41,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 286 [2019-09-08 15:37:41,934 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:37:41,934 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 15:37:41,935 INFO L418 AbstractCegarLoop]: === Iteration 40 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:37:41,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:37:41,935 INFO L82 PathProgramCache]: Analyzing trace with hash 242568510, now seen corresponding path program 1 times [2019-09-08 15:37:41,935 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:37:41,935 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:37:41,936 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:37:41,936 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:37:41,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:37:42,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:37:42,497 INFO L134 CoverageAnalysis]: Checked inductivity of 237 backedges. 46 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2019-09-08 15:37:42,497 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:37:42,497 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 15:37:42,498 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 15:37:42,498 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 15:37:42,498 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:37:42,498 INFO L87 Difference]: Start difference. First operand 28892 states and 39079 transitions. Second operand 3 states. [2019-09-08 15:37:58,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:37:58,623 INFO L93 Difference]: Finished difference Result 59057 states and 79942 transitions. [2019-09-08 15:37:58,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 15:37:58,624 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 285 [2019-09-08 15:37:58,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:37:58,702 INFO L225 Difference]: With dead ends: 59057 [2019-09-08 15:37:58,702 INFO L226 Difference]: Without dead ends: 30875 [2019-09-08 15:37:58,738 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:37:58,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30875 states. [2019-09-08 15:37:59,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30875 to 30874. [2019-09-08 15:37:59,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30874 states. [2019-09-08 15:37:59,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30874 states to 30874 states and 41770 transitions. [2019-09-08 15:37:59,578 INFO L78 Accepts]: Start accepts. Automaton has 30874 states and 41770 transitions. Word has length 285 [2019-09-08 15:37:59,578 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:37:59,578 INFO L475 AbstractCegarLoop]: Abstraction has 30874 states and 41770 transitions. [2019-09-08 15:37:59,578 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 15:37:59,578 INFO L276 IsEmpty]: Start isEmpty. Operand 30874 states and 41770 transitions. [2019-09-08 15:37:59,584 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 287 [2019-09-08 15:37:59,585 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:37:59,585 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 15:37:59,585 INFO L418 AbstractCegarLoop]: === Iteration 41 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:37:59,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:37:59,586 INFO L82 PathProgramCache]: Analyzing trace with hash 1364968530, now seen corresponding path program 1 times [2019-09-08 15:37:59,586 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:37:59,586 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:37:59,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:37:59,587 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:37:59,587 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:37:59,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:38:00,164 INFO L134 CoverageAnalysis]: Checked inductivity of 215 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 172 trivial. 0 not checked. [2019-09-08 15:38:00,164 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:38:00,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 15:38:00,165 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 15:38:00,165 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 15:38:00,165 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 15:38:00,165 INFO L87 Difference]: Start difference. First operand 30874 states and 41770 transitions. Second operand 5 states. [2019-09-08 15:38:12,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:38:12,659 INFO L93 Difference]: Finished difference Result 58112 states and 78629 transitions. [2019-09-08 15:38:12,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 15:38:12,659 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 286 [2019-09-08 15:38:12,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:38:12,722 INFO L225 Difference]: With dead ends: 58112 [2019-09-08 15:38:12,722 INFO L226 Difference]: Without dead ends: 27948 [2019-09-08 15:38:12,760 INFO L628 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-09-08 15:38:12,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27948 states. [2019-09-08 15:38:13,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27948 to 27948. [2019-09-08 15:38:13,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27948 states. [2019-09-08 15:38:13,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27948 states to 27948 states and 37781 transitions. [2019-09-08 15:38:13,544 INFO L78 Accepts]: Start accepts. Automaton has 27948 states and 37781 transitions. Word has length 286 [2019-09-08 15:38:13,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:38:13,545 INFO L475 AbstractCegarLoop]: Abstraction has 27948 states and 37781 transitions. [2019-09-08 15:38:13,545 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 15:38:13,545 INFO L276 IsEmpty]: Start isEmpty. Operand 27948 states and 37781 transitions. [2019-09-08 15:38:13,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-09-08 15:38:13,551 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:38:13,551 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 15:38:13,551 INFO L418 AbstractCegarLoop]: === Iteration 42 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:38:13,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:38:13,552 INFO L82 PathProgramCache]: Analyzing trace with hash -1549890624, now seen corresponding path program 1 times [2019-09-08 15:38:13,552 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:38:13,552 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:38:13,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:38:13,553 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:38:13,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:38:13,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:38:14,107 INFO L134 CoverageAnalysis]: Checked inductivity of 194 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2019-09-08 15:38:14,107 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:38:14,107 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 15:38:14,107 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 15:38:14,108 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 15:38:14,108 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:38:14,108 INFO L87 Difference]: Start difference. First operand 27948 states and 37781 transitions. Second operand 3 states. [2019-09-08 15:38:31,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:38:31,793 INFO L93 Difference]: Finished difference Result 55348 states and 74857 transitions. [2019-09-08 15:38:31,794 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 15:38:31,794 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 282 [2019-09-08 15:38:31,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:38:31,865 INFO L225 Difference]: With dead ends: 55348 [2019-09-08 15:38:31,865 INFO L226 Difference]: Without dead ends: 28110 [2019-09-08 15:38:31,905 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:38:31,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28110 states. [2019-09-08 15:38:32,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28110 to 28005. [2019-09-08 15:38:32,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28005 states. [2019-09-08 15:38:32,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28005 states to 28005 states and 37831 transitions. [2019-09-08 15:38:32,718 INFO L78 Accepts]: Start accepts. Automaton has 28005 states and 37831 transitions. Word has length 282 [2019-09-08 15:38:32,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:38:32,718 INFO L475 AbstractCegarLoop]: Abstraction has 28005 states and 37831 transitions. [2019-09-08 15:38:32,718 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 15:38:32,719 INFO L276 IsEmpty]: Start isEmpty. Operand 28005 states and 37831 transitions. [2019-09-08 15:38:32,725 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 290 [2019-09-08 15:38:32,726 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:38:32,726 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 3, 3, 3, 3, 3, 3, 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] [2019-09-08 15:38:32,726 INFO L418 AbstractCegarLoop]: === Iteration 43 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:38:32,726 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:38:32,727 INFO L82 PathProgramCache]: Analyzing trace with hash 1455699742, now seen corresponding path program 1 times [2019-09-08 15:38:32,727 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:38:32,727 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:38:32,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:38:32,728 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:38:32,728 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:38:32,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:38:33,367 INFO L134 CoverageAnalysis]: Checked inductivity of 258 backedges. 67 proven. 0 refuted. 0 times theorem prover too weak. 191 trivial. 0 not checked. [2019-09-08 15:38:33,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:38:33,368 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 15:38:33,368 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 15:38:33,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 15:38:33,369 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 15:38:33,369 INFO L87 Difference]: Start difference. First operand 28005 states and 37831 transitions. Second operand 5 states. [2019-09-08 15:38:47,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:38:47,934 INFO L93 Difference]: Finished difference Result 28507 states and 38506 transitions. [2019-09-08 15:38:47,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 15:38:47,935 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 289 [2019-09-08 15:38:47,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:38:47,990 INFO L225 Difference]: With dead ends: 28507 [2019-09-08 15:38:47,991 INFO L226 Difference]: Without dead ends: 26546 [2019-09-08 15:38:48,002 INFO L628 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-09-08 15:38:48,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26546 states. [2019-09-08 15:38:48,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26546 to 26546. [2019-09-08 15:38:48,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26546 states. [2019-09-08 15:38:48,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26546 states to 26546 states and 35853 transitions. [2019-09-08 15:38:48,785 INFO L78 Accepts]: Start accepts. Automaton has 26546 states and 35853 transitions. Word has length 289 [2019-09-08 15:38:48,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:38:48,785 INFO L475 AbstractCegarLoop]: Abstraction has 26546 states and 35853 transitions. [2019-09-08 15:38:48,785 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 15:38:48,785 INFO L276 IsEmpty]: Start isEmpty. Operand 26546 states and 35853 transitions. [2019-09-08 15:38:48,791 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 289 [2019-09-08 15:38:48,792 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:38:48,792 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 4, 4, 3, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 15:38:48,792 INFO L418 AbstractCegarLoop]: === Iteration 44 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:38:48,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:38:48,792 INFO L82 PathProgramCache]: Analyzing trace with hash -159135797, now seen corresponding path program 1 times [2019-09-08 15:38:48,793 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:38:48,793 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:38:48,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:38:48,794 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:38:48,794 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:38:49,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:38:49,404 INFO L134 CoverageAnalysis]: Checked inductivity of 231 backedges. 48 proven. 0 refuted. 0 times theorem prover too weak. 183 trivial. 0 not checked. [2019-09-08 15:38:49,404 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:38:49,404 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 15:38:49,405 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 15:38:49,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 15:38:49,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 15:38:49,405 INFO L87 Difference]: Start difference. First operand 26546 states and 35853 transitions. Second operand 5 states. [2019-09-08 15:39:02,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:39:02,432 INFO L93 Difference]: Finished difference Result 27031 states and 36511 transitions. [2019-09-08 15:39:02,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 15:39:02,433 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 288 [2019-09-08 15:39:02,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:39:02,494 INFO L225 Difference]: With dead ends: 27031 [2019-09-08 15:39:02,494 INFO L226 Difference]: Without dead ends: 25070 [2019-09-08 15:39:02,509 INFO L628 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-09-08 15:39:02,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25070 states. [2019-09-08 15:39:03,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25070 to 25070. [2019-09-08 15:39:03,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25070 states. [2019-09-08 15:39:03,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25070 states to 25070 states and 33858 transitions. [2019-09-08 15:39:03,546 INFO L78 Accepts]: Start accepts. Automaton has 25070 states and 33858 transitions. Word has length 288 [2019-09-08 15:39:03,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:39:03,546 INFO L475 AbstractCegarLoop]: Abstraction has 25070 states and 33858 transitions. [2019-09-08 15:39:03,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 15:39:03,546 INFO L276 IsEmpty]: Start isEmpty. Operand 25070 states and 33858 transitions. [2019-09-08 15:39:03,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 283 [2019-09-08 15:39:03,553 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:39:03,553 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 15:39:03,553 INFO L418 AbstractCegarLoop]: === Iteration 45 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:39:03,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:39:03,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1379990913, now seen corresponding path program 1 times [2019-09-08 15:39:03,554 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:39:03,554 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:39:03,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:39:03,555 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:39:03,555 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:39:03,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:39:04,266 INFO L134 CoverageAnalysis]: Checked inductivity of 187 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 103 trivial. 0 not checked. [2019-09-08 15:39:04,267 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:39:04,267 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-09-08 15:39:04,267 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-09-08 15:39:04,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-09-08 15:39:04,268 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:39:04,268 INFO L87 Difference]: Start difference. First operand 25070 states and 33858 transitions. Second operand 3 states. [2019-09-08 15:39:21,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:39:21,461 INFO L93 Difference]: Finished difference Result 46599 states and 62914 transitions. [2019-09-08 15:39:21,461 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-09-08 15:39:21,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 282 [2019-09-08 15:39:21,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:39:21,518 INFO L225 Difference]: With dead ends: 46599 [2019-09-08 15:39:21,518 INFO L226 Difference]: Without dead ends: 21171 [2019-09-08 15:39:21,558 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-09-08 15:39:21,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21171 states. [2019-09-08 15:39:22,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21171 to 20030. [2019-09-08 15:39:22,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20030 states. [2019-09-08 15:39:22,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20030 states to 20030 states and 26910 transitions. [2019-09-08 15:39:22,502 INFO L78 Accepts]: Start accepts. Automaton has 20030 states and 26910 transitions. Word has length 282 [2019-09-08 15:39:22,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:39:22,503 INFO L475 AbstractCegarLoop]: Abstraction has 20030 states and 26910 transitions. [2019-09-08 15:39:22,503 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-09-08 15:39:22,503 INFO L276 IsEmpty]: Start isEmpty. Operand 20030 states and 26910 transitions. [2019-09-08 15:39:22,509 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 327 [2019-09-08 15:39:22,509 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:39:22,509 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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] [2019-09-08 15:39:22,510 INFO L418 AbstractCegarLoop]: === Iteration 46 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:39:22,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:39:22,510 INFO L82 PathProgramCache]: Analyzing trace with hash 2140287373, now seen corresponding path program 2 times [2019-09-08 15:39:22,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:39:22,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:39:22,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:39:22,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:39:22,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:39:22,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:39:23,194 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 2 proven. 19 refuted. 0 times theorem prover too weak. 146 trivial. 0 not checked. [2019-09-08 15:39:23,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 15:39:23,195 INFO L223 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-09-08 15:39:23,209 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2019-09-08 15:39:39,209 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-09-08 15:39:39,209 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-09-08 15:39:39,632 INFO L256 TraceCheckSpWp]: Trace formula consists of 17688 conjuncts, 5 conjunts are in the unsatisfiable core [2019-09-08 15:39:39,650 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-09-08 15:39:39,715 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 25 proven. 19 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2019-09-08 15:39:39,899 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-09-08 15:39:39,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 6 [2019-09-08 15:39:39,901 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-09-08 15:39:39,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-09-08 15:39:39,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 15:39:39,901 INFO L87 Difference]: Start difference. First operand 20030 states and 26910 transitions. Second operand 6 states. [2019-09-08 15:39:40,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:39:40,839 INFO L93 Difference]: Finished difference Result 41153 states and 57684 transitions. [2019-09-08 15:39:40,845 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-09-08 15:39:40,845 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 326 [2019-09-08 15:39:40,846 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:39:40,908 INFO L225 Difference]: With dead ends: 41153 [2019-09-08 15:39:40,908 INFO L226 Difference]: Without dead ends: 21278 [2019-09-08 15:39:40,947 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 327 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2019-09-08 15:39:40,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21278 states. [2019-09-08 15:39:41,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21278 to 20394. [2019-09-08 15:39:41,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20394 states. [2019-09-08 15:39:41,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20394 states to 20394 states and 27378 transitions. [2019-09-08 15:39:41,649 INFO L78 Accepts]: Start accepts. Automaton has 20394 states and 27378 transitions. Word has length 326 [2019-09-08 15:39:41,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:39:41,649 INFO L475 AbstractCegarLoop]: Abstraction has 20394 states and 27378 transitions. [2019-09-08 15:39:41,650 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-09-08 15:39:41,650 INFO L276 IsEmpty]: Start isEmpty. Operand 20394 states and 27378 transitions. [2019-09-08 15:39:41,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 343 [2019-09-08 15:39:41,658 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:39:41,658 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 15:39:41,658 INFO L418 AbstractCegarLoop]: === Iteration 47 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:39:41,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:39:41,659 INFO L82 PathProgramCache]: Analyzing trace with hash 1999234158, now seen corresponding path program 1 times [2019-09-08 15:39:41,659 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:39:41,659 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:39:41,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:39:41,660 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2019-09-08 15:39:41,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:39:41,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:39:42,322 INFO L134 CoverageAnalysis]: Checked inductivity of 174 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2019-09-08 15:39:42,322 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-09-08 15:39:42,322 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-09-08 15:39:42,323 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-09-08 15:39:42,323 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-09-08 15:39:42,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-09-08 15:39:42,324 INFO L87 Difference]: Start difference. First operand 20394 states and 27378 transitions. Second operand 5 states. [2019-09-08 15:39:43,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-09-08 15:39:43,234 INFO L93 Difference]: Finished difference Result 40893 states and 55136 transitions. [2019-09-08 15:39:43,235 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-09-08 15:39:43,235 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 342 [2019-09-08 15:39:43,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-09-08 15:39:43,283 INFO L225 Difference]: With dead ends: 40893 [2019-09-08 15:39:43,283 INFO L226 Difference]: Without dead ends: 20654 [2019-09-08 15:39:43,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-09-08 15:39:43,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20654 states. [2019-09-08 15:39:43,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20654 to 20498. [2019-09-08 15:39:43,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20498 states. [2019-09-08 15:39:43,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20498 states to 20498 states and 27482 transitions. [2019-09-08 15:39:43,969 INFO L78 Accepts]: Start accepts. Automaton has 20498 states and 27482 transitions. Word has length 342 [2019-09-08 15:39:43,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-09-08 15:39:43,970 INFO L475 AbstractCegarLoop]: Abstraction has 20498 states and 27482 transitions. [2019-09-08 15:39:43,970 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-09-08 15:39:43,970 INFO L276 IsEmpty]: Start isEmpty. Operand 20498 states and 27482 transitions. [2019-09-08 15:39:43,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 384 [2019-09-08 15:39:43,977 INFO L391 BasicCegarLoop]: Found error trace [2019-09-08 15:39:43,978 INFO L399 BasicCegarLoop]: trace histogram [7, 7, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-09-08 15:39:43,978 INFO L418 AbstractCegarLoop]: === Iteration 48 === [ldv_errorErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-09-08 15:39:43,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-09-08 15:39:43,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1411337979, now seen corresponding path program 1 times [2019-09-08 15:39:43,979 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-09-08 15:39:43,979 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-09-08 15:39:43,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:39:43,980 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-09-08 15:39:43,980 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-09-08 15:39:44,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-09-08 15:39:44,646 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 20 proven. 39 refuted. 0 times theorem prover too weak. 266 trivial. 0 not checked. [2019-09-08 15:39:44,646 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2019-09-08 15:39:44,646 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2019-09-08 15:39:44,659 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY